From 0d28ca46dce5e065256159222a5f5990a9633c02 Mon Sep 17 00:00:00 2001 From: Oliver Markgraf Date: Thu, 3 Apr 2025 16:33:24 +0200 Subject: [PATCH 1/2] add different string benchmark sets --- .../pcp_instance_0.smt2 | 53 +++++++++++++++++ .../pcp_instance_1.smt2 | 53 +++++++++++++++++ .../pcp_instance_10.smt2 | 53 +++++++++++++++++ .../pcp_instance_100.smt2 | 53 +++++++++++++++++ .../pcp_instance_101.smt2 | 53 +++++++++++++++++ .../pcp_instance_102.smt2 | 53 +++++++++++++++++ .../pcp_instance_103.smt2 | 53 +++++++++++++++++ .../pcp_instance_104.smt2 | 53 +++++++++++++++++ .../pcp_instance_105.smt2 | 53 +++++++++++++++++ .../pcp_instance_106.smt2 | 53 +++++++++++++++++ .../pcp_instance_107.smt2 | 53 +++++++++++++++++ .../pcp_instance_108.smt2 | 53 +++++++++++++++++ .../pcp_instance_109.smt2 | 53 +++++++++++++++++ .../pcp_instance_11.smt2 | 53 +++++++++++++++++ .../pcp_instance_110.smt2 | 53 +++++++++++++++++ .../pcp_instance_111.smt2 | 53 +++++++++++++++++ .../pcp_instance_112.smt2 | 53 +++++++++++++++++ .../pcp_instance_113.smt2 | 53 +++++++++++++++++ .../pcp_instance_114.smt2 | 53 +++++++++++++++++ .../pcp_instance_115.smt2 | 53 +++++++++++++++++ .../pcp_instance_116.smt2 | 53 +++++++++++++++++ .../pcp_instance_117.smt2 | 53 +++++++++++++++++ .../pcp_instance_118.smt2 | 53 +++++++++++++++++ .../pcp_instance_119.smt2 | 53 +++++++++++++++++ .../pcp_instance_12.smt2 | 53 +++++++++++++++++ .../pcp_instance_120.smt2 | 53 +++++++++++++++++ .../pcp_instance_121.smt2 | 53 +++++++++++++++++ .../pcp_instance_122.smt2 | 53 +++++++++++++++++ .../pcp_instance_123.smt2 | 53 +++++++++++++++++ .../pcp_instance_124.smt2 | 53 +++++++++++++++++ .../pcp_instance_125.smt2 | 53 +++++++++++++++++ .../pcp_instance_126.smt2 | 53 +++++++++++++++++ .../pcp_instance_127.smt2 | 53 +++++++++++++++++ .../pcp_instance_128.smt2 | 53 +++++++++++++++++ .../pcp_instance_129.smt2 | 53 +++++++++++++++++ .../pcp_instance_13.smt2 | 53 +++++++++++++++++ .../pcp_instance_130.smt2 | 53 +++++++++++++++++ .../pcp_instance_131.smt2 | 53 +++++++++++++++++ .../pcp_instance_132.smt2 | 53 +++++++++++++++++ .../pcp_instance_133.smt2 | 53 +++++++++++++++++ .../pcp_instance_134.smt2 | 53 +++++++++++++++++ .../pcp_instance_135.smt2 | 53 +++++++++++++++++ .../pcp_instance_136.smt2 | 53 +++++++++++++++++ .../pcp_instance_137.smt2 | 53 +++++++++++++++++ .../pcp_instance_138.smt2 | 53 +++++++++++++++++ .../pcp_instance_139.smt2 | 53 +++++++++++++++++ .../pcp_instance_14.smt2 | 53 +++++++++++++++++ .../pcp_instance_140.smt2 | 53 +++++++++++++++++ .../pcp_instance_141.smt2 | 53 +++++++++++++++++ .../pcp_instance_142.smt2 | 53 +++++++++++++++++ .../pcp_instance_143.smt2 | 53 +++++++++++++++++ .../pcp_instance_144.smt2 | 53 +++++++++++++++++ .../pcp_instance_145.smt2 | 53 +++++++++++++++++ .../pcp_instance_146.smt2 | 53 +++++++++++++++++ .../pcp_instance_147.smt2 | 53 +++++++++++++++++ .../pcp_instance_148.smt2 | 53 +++++++++++++++++ .../pcp_instance_149.smt2 | 53 +++++++++++++++++ .../pcp_instance_15.smt2 | 53 +++++++++++++++++ .../pcp_instance_150.smt2 | 53 +++++++++++++++++ .../pcp_instance_151.smt2 | 53 +++++++++++++++++ .../pcp_instance_152.smt2 | 53 +++++++++++++++++ .../pcp_instance_153.smt2 | 53 +++++++++++++++++ .../pcp_instance_154.smt2 | 53 +++++++++++++++++ .../pcp_instance_155.smt2 | 53 +++++++++++++++++ .../pcp_instance_156.smt2 | 53 +++++++++++++++++ .../pcp_instance_157.smt2 | 53 +++++++++++++++++ .../pcp_instance_158.smt2 | 53 +++++++++++++++++ .../pcp_instance_159.smt2 | 53 +++++++++++++++++ .../pcp_instance_16.smt2 | 53 +++++++++++++++++ .../pcp_instance_160.smt2 | 53 +++++++++++++++++ .../pcp_instance_161.smt2 | 53 +++++++++++++++++ .../pcp_instance_162.smt2 | 53 +++++++++++++++++ .../pcp_instance_163.smt2 | 53 +++++++++++++++++ .../pcp_instance_164.smt2 | 53 +++++++++++++++++ .../pcp_instance_165.smt2 | 53 +++++++++++++++++ .../pcp_instance_166.smt2 | 53 +++++++++++++++++ .../pcp_instance_167.smt2 | 53 +++++++++++++++++ .../pcp_instance_168.smt2 | 53 +++++++++++++++++ .../pcp_instance_169.smt2 | 53 +++++++++++++++++ .../pcp_instance_17.smt2 | 53 +++++++++++++++++ .../pcp_instance_170.smt2 | 53 +++++++++++++++++ .../pcp_instance_171.smt2 | 53 +++++++++++++++++ .../pcp_instance_172.smt2 | 53 +++++++++++++++++ .../pcp_instance_173.smt2 | 53 +++++++++++++++++ .../pcp_instance_174.smt2 | 53 +++++++++++++++++ .../pcp_instance_175.smt2 | 53 +++++++++++++++++ .../pcp_instance_176.smt2 | 53 +++++++++++++++++ .../pcp_instance_177.smt2 | 53 +++++++++++++++++ .../pcp_instance_178.smt2 | 53 +++++++++++++++++ .../pcp_instance_179.smt2 | 53 +++++++++++++++++ .../pcp_instance_18.smt2 | 53 +++++++++++++++++ .../pcp_instance_180.smt2 | 53 +++++++++++++++++ .../pcp_instance_181.smt2 | 53 +++++++++++++++++ .../pcp_instance_182.smt2 | 53 +++++++++++++++++ .../pcp_instance_183.smt2 | 53 +++++++++++++++++ .../pcp_instance_184.smt2 | 53 +++++++++++++++++ .../pcp_instance_185.smt2 | 53 +++++++++++++++++ .../pcp_instance_186.smt2 | 53 +++++++++++++++++ .../pcp_instance_187.smt2 | 53 +++++++++++++++++ .../pcp_instance_188.smt2 | 53 +++++++++++++++++ .../pcp_instance_189.smt2 | 53 +++++++++++++++++ .../pcp_instance_19.smt2 | 53 +++++++++++++++++ .../pcp_instance_190.smt2 | 53 +++++++++++++++++ .../pcp_instance_191.smt2 | 53 +++++++++++++++++ .../pcp_instance_192.smt2 | 53 +++++++++++++++++ .../pcp_instance_193.smt2 | 53 +++++++++++++++++ .../pcp_instance_194.smt2 | 53 +++++++++++++++++ .../pcp_instance_195.smt2 | 53 +++++++++++++++++ .../pcp_instance_196.smt2 | 53 +++++++++++++++++ .../pcp_instance_197.smt2 | 53 +++++++++++++++++ .../pcp_instance_198.smt2 | 53 +++++++++++++++++ .../pcp_instance_199.smt2 | 53 +++++++++++++++++ .../pcp_instance_2.smt2 | 53 +++++++++++++++++ .../pcp_instance_20.smt2 | 53 +++++++++++++++++ .../pcp_instance_200.smt2 | 53 +++++++++++++++++ .../pcp_instance_201.smt2 | 53 +++++++++++++++++ .../pcp_instance_202.smt2 | 53 +++++++++++++++++ .../pcp_instance_203.smt2 | 53 +++++++++++++++++ .../pcp_instance_204.smt2 | 53 +++++++++++++++++ .../pcp_instance_205.smt2 | 53 +++++++++++++++++ .../pcp_instance_206.smt2 | 53 +++++++++++++++++ .../pcp_instance_207.smt2 | 53 +++++++++++++++++ .../pcp_instance_208.smt2 | 53 +++++++++++++++++ .../pcp_instance_209.smt2 | 53 +++++++++++++++++ .../pcp_instance_21.smt2 | 53 +++++++++++++++++ .../pcp_instance_210.smt2 | 53 +++++++++++++++++ .../pcp_instance_211.smt2 | 53 +++++++++++++++++ .../pcp_instance_212.smt2 | 53 +++++++++++++++++ .../pcp_instance_213.smt2 | 53 +++++++++++++++++ .../pcp_instance_214.smt2 | 53 +++++++++++++++++ .../pcp_instance_215.smt2 | 53 +++++++++++++++++ .../pcp_instance_216.smt2 | 53 +++++++++++++++++ .../pcp_instance_217.smt2 | 53 +++++++++++++++++ .../pcp_instance_218.smt2 | 53 +++++++++++++++++ .../pcp_instance_219.smt2 | 53 +++++++++++++++++ .../pcp_instance_22.smt2 | 53 +++++++++++++++++ .../pcp_instance_220.smt2 | 53 +++++++++++++++++ .../pcp_instance_221.smt2 | 53 +++++++++++++++++ .../pcp_instance_222.smt2 | 53 +++++++++++++++++ .../pcp_instance_223.smt2 | 53 +++++++++++++++++ .../pcp_instance_224.smt2 | 53 +++++++++++++++++ .../pcp_instance_225.smt2 | 53 +++++++++++++++++ .../pcp_instance_226.smt2 | 53 +++++++++++++++++ .../pcp_instance_227.smt2 | 53 +++++++++++++++++ .../pcp_instance_228.smt2 | 53 +++++++++++++++++ .../pcp_instance_229.smt2 | 53 +++++++++++++++++ .../pcp_instance_23.smt2 | 53 +++++++++++++++++ .../pcp_instance_230.smt2 | 53 +++++++++++++++++ .../pcp_instance_231.smt2 | 53 +++++++++++++++++ .../pcp_instance_232.smt2 | 53 +++++++++++++++++ .../pcp_instance_233.smt2 | 53 +++++++++++++++++ .../pcp_instance_234.smt2 | 53 +++++++++++++++++ .../pcp_instance_235.smt2 | 53 +++++++++++++++++ .../pcp_instance_236.smt2 | 53 +++++++++++++++++ .../pcp_instance_237.smt2 | 53 +++++++++++++++++ .../pcp_instance_238.smt2 | 53 +++++++++++++++++ .../pcp_instance_239.smt2 | 53 +++++++++++++++++ .../pcp_instance_24.smt2 | 53 +++++++++++++++++ .../pcp_instance_240.smt2 | 53 +++++++++++++++++ .../pcp_instance_241.smt2 | 53 +++++++++++++++++ .../pcp_instance_242.smt2 | 53 +++++++++++++++++ .../pcp_instance_243.smt2 | 53 +++++++++++++++++ .../pcp_instance_244.smt2 | 53 +++++++++++++++++ .../pcp_instance_245.smt2 | 53 +++++++++++++++++ .../pcp_instance_246.smt2 | 53 +++++++++++++++++ .../pcp_instance_247.smt2 | 53 +++++++++++++++++ .../pcp_instance_248.smt2 | 53 +++++++++++++++++ .../pcp_instance_249.smt2 | 53 +++++++++++++++++ .../pcp_instance_25.smt2 | 53 +++++++++++++++++ .../pcp_instance_250.smt2 | 53 +++++++++++++++++ .../pcp_instance_251.smt2 | 53 +++++++++++++++++ .../pcp_instance_252.smt2 | 53 +++++++++++++++++ .../pcp_instance_253.smt2 | 53 +++++++++++++++++ .../pcp_instance_254.smt2 | 53 +++++++++++++++++ .../pcp_instance_255.smt2 | 53 +++++++++++++++++ .../pcp_instance_256.smt2 | 53 +++++++++++++++++ .../pcp_instance_257.smt2 | 53 +++++++++++++++++ .../pcp_instance_258.smt2 | 53 +++++++++++++++++ .../pcp_instance_259.smt2 | 53 +++++++++++++++++ .../pcp_instance_26.smt2 | 53 +++++++++++++++++ .../pcp_instance_260.smt2 | 53 +++++++++++++++++ .../pcp_instance_261.smt2 | 53 +++++++++++++++++ .../pcp_instance_262.smt2 | 53 +++++++++++++++++ .../pcp_instance_263.smt2 | 53 +++++++++++++++++ .../pcp_instance_264.smt2 | 53 +++++++++++++++++ .../pcp_instance_265.smt2 | 53 +++++++++++++++++ .../pcp_instance_266.smt2 | 53 +++++++++++++++++ .../pcp_instance_267.smt2 | 53 +++++++++++++++++ .../pcp_instance_268.smt2 | 53 +++++++++++++++++ .../pcp_instance_269.smt2 | 53 +++++++++++++++++ .../pcp_instance_27.smt2 | 53 +++++++++++++++++ .../pcp_instance_270.smt2 | 53 +++++++++++++++++ .../pcp_instance_271.smt2 | 53 +++++++++++++++++ .../pcp_instance_272.smt2 | 53 +++++++++++++++++ .../pcp_instance_273.smt2 | 53 +++++++++++++++++ .../pcp_instance_274.smt2 | 53 +++++++++++++++++ .../pcp_instance_275.smt2 | 53 +++++++++++++++++ .../pcp_instance_276.smt2 | 53 +++++++++++++++++ .../pcp_instance_277.smt2 | 53 +++++++++++++++++ .../pcp_instance_278.smt2 | 53 +++++++++++++++++ .../pcp_instance_279.smt2 | 53 +++++++++++++++++ .../pcp_instance_28.smt2 | 53 +++++++++++++++++ .../pcp_instance_280.smt2 | 53 +++++++++++++++++ .../pcp_instance_281.smt2 | 53 +++++++++++++++++ .../pcp_instance_282.smt2 | 53 +++++++++++++++++ .../pcp_instance_283.smt2 | 53 +++++++++++++++++ .../pcp_instance_284.smt2 | 53 +++++++++++++++++ .../pcp_instance_285.smt2 | 53 +++++++++++++++++ .../pcp_instance_286.smt2 | 53 +++++++++++++++++ .../pcp_instance_287.smt2 | 53 +++++++++++++++++ .../pcp_instance_288.smt2 | 53 +++++++++++++++++ .../pcp_instance_289.smt2 | 53 +++++++++++++++++ .../pcp_instance_29.smt2 | 53 +++++++++++++++++ .../pcp_instance_290.smt2 | 53 +++++++++++++++++ .../pcp_instance_291.smt2 | 53 +++++++++++++++++ .../pcp_instance_292.smt2 | 53 +++++++++++++++++ .../pcp_instance_293.smt2 | 53 +++++++++++++++++ .../pcp_instance_294.smt2 | 53 +++++++++++++++++ .../pcp_instance_295.smt2 | 53 +++++++++++++++++ .../pcp_instance_296.smt2 | 53 +++++++++++++++++ .../pcp_instance_297.smt2 | 53 +++++++++++++++++ .../pcp_instance_298.smt2 | 53 +++++++++++++++++ .../pcp_instance_299.smt2 | 53 +++++++++++++++++ .../pcp_instance_3.smt2 | 53 +++++++++++++++++ .../pcp_instance_30.smt2 | 53 +++++++++++++++++ .../pcp_instance_300.smt2 | 53 +++++++++++++++++ .../pcp_instance_301.smt2 | 53 +++++++++++++++++ .../pcp_instance_302.smt2 | 53 +++++++++++++++++ .../pcp_instance_303.smt2 | 53 +++++++++++++++++ .../pcp_instance_304.smt2 | 53 +++++++++++++++++ .../pcp_instance_305.smt2 | 53 +++++++++++++++++ .../pcp_instance_306.smt2 | 53 +++++++++++++++++ .../pcp_instance_307.smt2 | 53 +++++++++++++++++ .../pcp_instance_308.smt2 | 53 +++++++++++++++++ .../pcp_instance_309.smt2 | 53 +++++++++++++++++ .../pcp_instance_31.smt2 | 53 +++++++++++++++++ .../pcp_instance_310.smt2 | 53 +++++++++++++++++ .../pcp_instance_311.smt2 | 53 +++++++++++++++++ .../pcp_instance_312.smt2 | 53 +++++++++++++++++ .../pcp_instance_313.smt2 | 53 +++++++++++++++++ .../pcp_instance_314.smt2 | 53 +++++++++++++++++ .../pcp_instance_315.smt2 | 53 +++++++++++++++++ .../pcp_instance_316.smt2 | 53 +++++++++++++++++ .../pcp_instance_317.smt2 | 53 +++++++++++++++++ .../pcp_instance_318.smt2 | 53 +++++++++++++++++ .../pcp_instance_319.smt2 | 53 +++++++++++++++++ .../pcp_instance_32.smt2 | 53 +++++++++++++++++ .../pcp_instance_320.smt2 | 53 +++++++++++++++++ .../pcp_instance_321.smt2 | 53 +++++++++++++++++ .../pcp_instance_322.smt2 | 53 +++++++++++++++++ .../pcp_instance_323.smt2 | 53 +++++++++++++++++ .../pcp_instance_324.smt2 | 53 +++++++++++++++++ .../pcp_instance_325.smt2 | 53 +++++++++++++++++ .../pcp_instance_326.smt2 | 53 +++++++++++++++++ .../pcp_instance_327.smt2 | 53 +++++++++++++++++ .../pcp_instance_328.smt2 | 53 +++++++++++++++++ .../pcp_instance_329.smt2 | 53 +++++++++++++++++ .../pcp_instance_33.smt2 | 53 +++++++++++++++++ .../pcp_instance_330.smt2 | 53 +++++++++++++++++ .../pcp_instance_331.smt2 | 53 +++++++++++++++++ .../pcp_instance_332.smt2 | 53 +++++++++++++++++ .../pcp_instance_333.smt2 | 53 +++++++++++++++++ .../pcp_instance_334.smt2 | 53 +++++++++++++++++ .../pcp_instance_335.smt2 | 53 +++++++++++++++++ .../pcp_instance_336.smt2 | 53 +++++++++++++++++ .../pcp_instance_337.smt2 | 53 +++++++++++++++++ .../pcp_instance_338.smt2 | 53 +++++++++++++++++ .../pcp_instance_339.smt2 | 53 +++++++++++++++++ .../pcp_instance_34.smt2 | 53 +++++++++++++++++ .../pcp_instance_340.smt2 | 53 +++++++++++++++++ .../pcp_instance_341.smt2 | 53 +++++++++++++++++ .../pcp_instance_342.smt2 | 53 +++++++++++++++++ .../pcp_instance_343.smt2 | 53 +++++++++++++++++ .../pcp_instance_344.smt2 | 53 +++++++++++++++++ .../pcp_instance_345.smt2 | 53 +++++++++++++++++ .../pcp_instance_346.smt2 | 53 +++++++++++++++++ .../pcp_instance_347.smt2 | 53 +++++++++++++++++ .../pcp_instance_348.smt2 | 53 +++++++++++++++++ .../pcp_instance_349.smt2 | 53 +++++++++++++++++ .../pcp_instance_35.smt2 | 53 +++++++++++++++++ .../pcp_instance_350.smt2 | 53 +++++++++++++++++ .../pcp_instance_351.smt2 | 53 +++++++++++++++++ .../pcp_instance_352.smt2 | 53 +++++++++++++++++ .../pcp_instance_353.smt2 | 53 +++++++++++++++++ .../pcp_instance_354.smt2 | 53 +++++++++++++++++ .../pcp_instance_355.smt2 | 53 +++++++++++++++++ .../pcp_instance_356.smt2 | 53 +++++++++++++++++ .../pcp_instance_357.smt2 | 53 +++++++++++++++++ .../pcp_instance_358.smt2 | 53 +++++++++++++++++ .../pcp_instance_359.smt2 | 53 +++++++++++++++++ .../pcp_instance_36.smt2 | 53 +++++++++++++++++ .../pcp_instance_360.smt2 | 53 +++++++++++++++++ .../pcp_instance_361.smt2 | 53 +++++++++++++++++ .../pcp_instance_362.smt2 | 53 +++++++++++++++++ .../pcp_instance_363.smt2 | 53 +++++++++++++++++ .../pcp_instance_364.smt2 | 53 +++++++++++++++++ .../pcp_instance_365.smt2 | 53 +++++++++++++++++ .../pcp_instance_366.smt2 | 53 +++++++++++++++++ .../pcp_instance_367.smt2 | 53 +++++++++++++++++ .../pcp_instance_368.smt2 | 53 +++++++++++++++++ .../pcp_instance_369.smt2 | 53 +++++++++++++++++ .../pcp_instance_37.smt2 | 53 +++++++++++++++++ .../pcp_instance_370.smt2 | 53 +++++++++++++++++ .../pcp_instance_371.smt2 | 53 +++++++++++++++++ .../pcp_instance_372.smt2 | 53 +++++++++++++++++ .../pcp_instance_373.smt2 | 53 +++++++++++++++++ .../pcp_instance_374.smt2 | 53 +++++++++++++++++ .../pcp_instance_375.smt2 | 53 +++++++++++++++++ .../pcp_instance_376.smt2 | 53 +++++++++++++++++ .../pcp_instance_377.smt2 | 53 +++++++++++++++++ .../pcp_instance_378.smt2 | 53 +++++++++++++++++ .../pcp_instance_379.smt2 | 53 +++++++++++++++++ .../pcp_instance_38.smt2 | 53 +++++++++++++++++ .../pcp_instance_380.smt2 | 53 +++++++++++++++++ .../pcp_instance_381.smt2 | 53 +++++++++++++++++ .../pcp_instance_382.smt2 | 53 +++++++++++++++++ .../pcp_instance_383.smt2 | 53 +++++++++++++++++ .../pcp_instance_384.smt2 | 53 +++++++++++++++++ .../pcp_instance_385.smt2 | 53 +++++++++++++++++ .../pcp_instance_386.smt2 | 53 +++++++++++++++++ .../pcp_instance_387.smt2 | 53 +++++++++++++++++ .../pcp_instance_388.smt2 | 53 +++++++++++++++++ .../pcp_instance_389.smt2 | 53 +++++++++++++++++ .../pcp_instance_39.smt2 | 53 +++++++++++++++++ .../pcp_instance_390.smt2 | 53 +++++++++++++++++ .../pcp_instance_391.smt2 | 53 +++++++++++++++++ .../pcp_instance_392.smt2 | 53 +++++++++++++++++ .../pcp_instance_393.smt2 | 53 +++++++++++++++++ .../pcp_instance_394.smt2 | 53 +++++++++++++++++ .../pcp_instance_395.smt2 | 53 +++++++++++++++++ .../pcp_instance_396.smt2 | 53 +++++++++++++++++ .../pcp_instance_397.smt2 | 53 +++++++++++++++++ .../pcp_instance_398.smt2 | 53 +++++++++++++++++ .../pcp_instance_399.smt2 | 53 +++++++++++++++++ .../pcp_instance_4.smt2 | 53 +++++++++++++++++ .../pcp_instance_40.smt2 | 53 +++++++++++++++++ .../pcp_instance_400.smt2 | 53 +++++++++++++++++ .../pcp_instance_401.smt2 | 53 +++++++++++++++++ .../pcp_instance_402.smt2 | 53 +++++++++++++++++ .../pcp_instance_403.smt2 | 53 +++++++++++++++++ .../pcp_instance_404.smt2 | 53 +++++++++++++++++ .../pcp_instance_405.smt2 | 53 +++++++++++++++++ .../pcp_instance_406.smt2 | 53 +++++++++++++++++ .../pcp_instance_407.smt2 | 53 +++++++++++++++++ .../pcp_instance_408.smt2 | 53 +++++++++++++++++ .../pcp_instance_409.smt2 | 53 +++++++++++++++++ .../pcp_instance_41.smt2 | 53 +++++++++++++++++ .../pcp_instance_410.smt2 | 53 +++++++++++++++++ .../pcp_instance_411.smt2 | 53 +++++++++++++++++ .../pcp_instance_412.smt2 | 53 +++++++++++++++++ .../pcp_instance_413.smt2 | 53 +++++++++++++++++ .../pcp_instance_414.smt2 | 53 +++++++++++++++++ .../pcp_instance_415.smt2 | 53 +++++++++++++++++ .../pcp_instance_416.smt2 | 53 +++++++++++++++++ .../pcp_instance_417.smt2 | 53 +++++++++++++++++ .../pcp_instance_418.smt2 | 53 +++++++++++++++++ .../pcp_instance_419.smt2 | 53 +++++++++++++++++ .../pcp_instance_42.smt2 | 53 +++++++++++++++++ .../pcp_instance_420.smt2 | 53 +++++++++++++++++ .../pcp_instance_421.smt2 | 53 +++++++++++++++++ .../pcp_instance_422.smt2 | 53 +++++++++++++++++ .../pcp_instance_423.smt2 | 53 +++++++++++++++++ .../pcp_instance_424.smt2 | 53 +++++++++++++++++ .../pcp_instance_425.smt2 | 53 +++++++++++++++++ .../pcp_instance_426.smt2 | 53 +++++++++++++++++ .../pcp_instance_427.smt2 | 53 +++++++++++++++++ .../pcp_instance_428.smt2 | 53 +++++++++++++++++ .../pcp_instance_429.smt2 | 53 +++++++++++++++++ .../pcp_instance_43.smt2 | 53 +++++++++++++++++ .../pcp_instance_430.smt2 | 53 +++++++++++++++++ .../pcp_instance_431.smt2 | 53 +++++++++++++++++ .../pcp_instance_432.smt2 | 53 +++++++++++++++++ .../pcp_instance_433.smt2 | 53 +++++++++++++++++ .../pcp_instance_434.smt2 | 53 +++++++++++++++++ .../pcp_instance_435.smt2 | 53 +++++++++++++++++ .../pcp_instance_436.smt2 | 53 +++++++++++++++++ .../pcp_instance_437.smt2 | 53 +++++++++++++++++ .../pcp_instance_438.smt2 | 53 +++++++++++++++++ .../pcp_instance_439.smt2 | 53 +++++++++++++++++ .../pcp_instance_44.smt2 | 53 +++++++++++++++++ .../pcp_instance_440.smt2 | 53 +++++++++++++++++ .../pcp_instance_441.smt2 | 53 +++++++++++++++++ .../pcp_instance_442.smt2 | 53 +++++++++++++++++ .../pcp_instance_443.smt2 | 53 +++++++++++++++++ .../pcp_instance_444.smt2 | 53 +++++++++++++++++ .../pcp_instance_445.smt2 | 53 +++++++++++++++++ .../pcp_instance_446.smt2 | 53 +++++++++++++++++ .../pcp_instance_447.smt2 | 53 +++++++++++++++++ .../pcp_instance_448.smt2 | 53 +++++++++++++++++ .../pcp_instance_449.smt2 | 53 +++++++++++++++++ .../pcp_instance_45.smt2 | 53 +++++++++++++++++ .../pcp_instance_450.smt2 | 53 +++++++++++++++++ .../pcp_instance_451.smt2 | 53 +++++++++++++++++ .../pcp_instance_452.smt2 | 53 +++++++++++++++++ .../pcp_instance_453.smt2 | 53 +++++++++++++++++ .../pcp_instance_454.smt2 | 53 +++++++++++++++++ .../pcp_instance_455.smt2 | 53 +++++++++++++++++ .../pcp_instance_456.smt2 | 53 +++++++++++++++++ .../pcp_instance_457.smt2 | 53 +++++++++++++++++ .../pcp_instance_458.smt2 | 53 +++++++++++++++++ .../pcp_instance_459.smt2 | 53 +++++++++++++++++ .../pcp_instance_46.smt2 | 53 +++++++++++++++++ .../pcp_instance_460.smt2 | 53 +++++++++++++++++ .../pcp_instance_461.smt2 | 53 +++++++++++++++++ .../pcp_instance_462.smt2 | 53 +++++++++++++++++ .../pcp_instance_463.smt2 | 53 +++++++++++++++++ .../pcp_instance_464.smt2 | 53 +++++++++++++++++ .../pcp_instance_465.smt2 | 53 +++++++++++++++++ .../pcp_instance_466.smt2 | 53 +++++++++++++++++ .../pcp_instance_467.smt2 | 53 +++++++++++++++++ .../pcp_instance_468.smt2 | 53 +++++++++++++++++ .../pcp_instance_469.smt2 | 53 +++++++++++++++++ .../pcp_instance_47.smt2 | 53 +++++++++++++++++ .../pcp_instance_470.smt2 | 53 +++++++++++++++++ .../pcp_instance_471.smt2 | 53 +++++++++++++++++ .../pcp_instance_472.smt2 | 53 +++++++++++++++++ .../pcp_instance_473.smt2 | 53 +++++++++++++++++ .../pcp_instance_474.smt2 | 53 +++++++++++++++++ .../pcp_instance_475.smt2 | 53 +++++++++++++++++ .../pcp_instance_476.smt2 | 53 +++++++++++++++++ .../pcp_instance_477.smt2 | 53 +++++++++++++++++ .../pcp_instance_478.smt2 | 53 +++++++++++++++++ .../pcp_instance_479.smt2 | 53 +++++++++++++++++ .../pcp_instance_48.smt2 | 53 +++++++++++++++++ .../pcp_instance_480.smt2 | 53 +++++++++++++++++ .../pcp_instance_481.smt2 | 53 +++++++++++++++++ .../pcp_instance_482.smt2 | 53 +++++++++++++++++ .../pcp_instance_483.smt2 | 53 +++++++++++++++++ .../pcp_instance_484.smt2 | 53 +++++++++++++++++ .../pcp_instance_485.smt2 | 53 +++++++++++++++++ .../pcp_instance_486.smt2 | 53 +++++++++++++++++ .../pcp_instance_487.smt2 | 53 +++++++++++++++++ .../pcp_instance_488.smt2 | 53 +++++++++++++++++ .../pcp_instance_489.smt2 | 53 +++++++++++++++++ .../pcp_instance_49.smt2 | 53 +++++++++++++++++ .../pcp_instance_490.smt2 | 53 +++++++++++++++++ .../pcp_instance_491.smt2 | 53 +++++++++++++++++ .../pcp_instance_492.smt2 | 53 +++++++++++++++++ .../pcp_instance_493.smt2 | 53 +++++++++++++++++ .../pcp_instance_494.smt2 | 53 +++++++++++++++++ .../pcp_instance_495.smt2 | 53 +++++++++++++++++ .../pcp_instance_496.smt2 | 53 +++++++++++++++++ .../pcp_instance_497.smt2 | 53 +++++++++++++++++ .../pcp_instance_498.smt2 | 53 +++++++++++++++++ .../pcp_instance_499.smt2 | 53 +++++++++++++++++ .../pcp_instance_5.smt2 | 53 +++++++++++++++++ .../pcp_instance_50.smt2 | 53 +++++++++++++++++ .../pcp_instance_500.smt2 | 53 +++++++++++++++++ .../pcp_instance_501.smt2 | 53 +++++++++++++++++ .../pcp_instance_502.smt2 | 53 +++++++++++++++++ .../pcp_instance_503.smt2 | 53 +++++++++++++++++ .../pcp_instance_504.smt2 | 53 +++++++++++++++++ .../pcp_instance_505.smt2 | 53 +++++++++++++++++ .../pcp_instance_506.smt2 | 53 +++++++++++++++++ .../pcp_instance_507.smt2 | 53 +++++++++++++++++ .../pcp_instance_508.smt2 | 53 +++++++++++++++++ .../pcp_instance_509.smt2 | 53 +++++++++++++++++ .../pcp_instance_51.smt2 | 53 +++++++++++++++++ .../pcp_instance_510.smt2 | 53 +++++++++++++++++ .../pcp_instance_511.smt2 | 53 +++++++++++++++++ .../pcp_instance_512.smt2 | 53 +++++++++++++++++ .../pcp_instance_513.smt2 | 53 +++++++++++++++++ .../pcp_instance_514.smt2 | 53 +++++++++++++++++ .../pcp_instance_515.smt2 | 53 +++++++++++++++++ .../pcp_instance_516.smt2 | 53 +++++++++++++++++ .../pcp_instance_517.smt2 | 53 +++++++++++++++++ .../pcp_instance_518.smt2 | 53 +++++++++++++++++ .../pcp_instance_519.smt2 | 53 +++++++++++++++++ .../pcp_instance_52.smt2 | 53 +++++++++++++++++ .../pcp_instance_520.smt2 | 53 +++++++++++++++++ .../pcp_instance_521.smt2 | 53 +++++++++++++++++ .../pcp_instance_522.smt2 | 53 +++++++++++++++++ .../pcp_instance_523.smt2 | 53 +++++++++++++++++ .../pcp_instance_524.smt2 | 53 +++++++++++++++++ .../pcp_instance_525.smt2 | 53 +++++++++++++++++ .../pcp_instance_526.smt2 | 53 +++++++++++++++++ .../pcp_instance_527.smt2 | 53 +++++++++++++++++ .../pcp_instance_528.smt2 | 53 +++++++++++++++++ .../pcp_instance_529.smt2 | 53 +++++++++++++++++ .../pcp_instance_53.smt2 | 53 +++++++++++++++++ .../pcp_instance_530.smt2 | 53 +++++++++++++++++ .../pcp_instance_531.smt2 | 53 +++++++++++++++++ .../pcp_instance_532.smt2 | 53 +++++++++++++++++ .../pcp_instance_533.smt2 | 53 +++++++++++++++++ .../pcp_instance_534.smt2 | 53 +++++++++++++++++ .../pcp_instance_535.smt2 | 53 +++++++++++++++++ .../pcp_instance_536.smt2 | 53 +++++++++++++++++ .../pcp_instance_537.smt2 | 53 +++++++++++++++++ .../pcp_instance_538.smt2 | 53 +++++++++++++++++ .../pcp_instance_539.smt2 | 53 +++++++++++++++++ .../pcp_instance_54.smt2 | 53 +++++++++++++++++ .../pcp_instance_540.smt2 | 53 +++++++++++++++++ .../pcp_instance_541.smt2 | 53 +++++++++++++++++ .../pcp_instance_542.smt2 | 53 +++++++++++++++++ .../pcp_instance_543.smt2 | 53 +++++++++++++++++ .../pcp_instance_544.smt2 | 53 +++++++++++++++++ .../pcp_instance_545.smt2 | 53 +++++++++++++++++ .../pcp_instance_546.smt2 | 53 +++++++++++++++++ .../pcp_instance_547.smt2 | 53 +++++++++++++++++ .../pcp_instance_548.smt2 | 53 +++++++++++++++++ .../pcp_instance_549.smt2 | 53 +++++++++++++++++ .../pcp_instance_55.smt2 | 53 +++++++++++++++++ .../pcp_instance_550.smt2 | 53 +++++++++++++++++ .../pcp_instance_551.smt2 | 53 +++++++++++++++++ .../pcp_instance_552.smt2 | 53 +++++++++++++++++ .../pcp_instance_553.smt2 | 53 +++++++++++++++++ .../pcp_instance_554.smt2 | 53 +++++++++++++++++ .../pcp_instance_555.smt2 | 53 +++++++++++++++++ .../pcp_instance_556.smt2 | 53 +++++++++++++++++ .../pcp_instance_557.smt2 | 53 +++++++++++++++++ .../pcp_instance_558.smt2 | 53 +++++++++++++++++ .../pcp_instance_559.smt2 | 53 +++++++++++++++++ .../pcp_instance_56.smt2 | 53 +++++++++++++++++ .../pcp_instance_560.smt2 | 53 +++++++++++++++++ .../pcp_instance_561.smt2 | 53 +++++++++++++++++ .../pcp_instance_562.smt2 | 53 +++++++++++++++++ .../pcp_instance_563.smt2 | 53 +++++++++++++++++ .../pcp_instance_564.smt2 | 53 +++++++++++++++++ .../pcp_instance_565.smt2 | 53 +++++++++++++++++ .../pcp_instance_566.smt2 | 53 +++++++++++++++++ .../pcp_instance_567.smt2 | 53 +++++++++++++++++ .../pcp_instance_568.smt2 | 53 +++++++++++++++++ .../pcp_instance_569.smt2 | 53 +++++++++++++++++ .../pcp_instance_57.smt2 | 53 +++++++++++++++++ .../pcp_instance_570.smt2 | 53 +++++++++++++++++ .../pcp_instance_571.smt2 | 53 +++++++++++++++++ .../pcp_instance_572.smt2 | 53 +++++++++++++++++ .../pcp_instance_573.smt2 | 53 +++++++++++++++++ .../pcp_instance_574.smt2 | 53 +++++++++++++++++ .../pcp_instance_575.smt2 | 53 +++++++++++++++++ .../pcp_instance_576.smt2 | 53 +++++++++++++++++ .../pcp_instance_577.smt2 | 53 +++++++++++++++++ .../pcp_instance_578.smt2 | 53 +++++++++++++++++ .../pcp_instance_579.smt2 | 53 +++++++++++++++++ .../pcp_instance_58.smt2 | 53 +++++++++++++++++ .../pcp_instance_580.smt2 | 53 +++++++++++++++++ .../pcp_instance_581.smt2 | 53 +++++++++++++++++ .../pcp_instance_582.smt2 | 53 +++++++++++++++++ .../pcp_instance_583.smt2 | 53 +++++++++++++++++ .../pcp_instance_584.smt2 | 53 +++++++++++++++++ .../pcp_instance_585.smt2 | 53 +++++++++++++++++ .../pcp_instance_586.smt2 | 53 +++++++++++++++++ .../pcp_instance_587.smt2 | 53 +++++++++++++++++ .../pcp_instance_588.smt2 | 53 +++++++++++++++++ .../pcp_instance_589.smt2 | 53 +++++++++++++++++ .../pcp_instance_59.smt2 | 53 +++++++++++++++++ .../pcp_instance_590.smt2 | 53 +++++++++++++++++ .../pcp_instance_591.smt2 | 53 +++++++++++++++++ .../pcp_instance_592.smt2 | 53 +++++++++++++++++ .../pcp_instance_593.smt2 | 53 +++++++++++++++++ .../pcp_instance_594.smt2 | 53 +++++++++++++++++ .../pcp_instance_595.smt2 | 53 +++++++++++++++++ .../pcp_instance_596.smt2 | 53 +++++++++++++++++ .../pcp_instance_597.smt2 | 53 +++++++++++++++++ .../pcp_instance_598.smt2 | 53 +++++++++++++++++ .../pcp_instance_599.smt2 | 53 +++++++++++++++++ .../pcp_instance_6.smt2 | 53 +++++++++++++++++ .../pcp_instance_60.smt2 | 53 +++++++++++++++++ .../pcp_instance_600.smt2 | 53 +++++++++++++++++ .../pcp_instance_601.smt2 | 53 +++++++++++++++++ .../pcp_instance_602.smt2 | 53 +++++++++++++++++ .../pcp_instance_603.smt2 | 53 +++++++++++++++++ .../pcp_instance_604.smt2 | 53 +++++++++++++++++ .../pcp_instance_605.smt2 | 53 +++++++++++++++++ .../pcp_instance_606.smt2 | 53 +++++++++++++++++ .../pcp_instance_607.smt2 | 53 +++++++++++++++++ .../pcp_instance_608.smt2 | 53 +++++++++++++++++ .../pcp_instance_609.smt2 | 53 +++++++++++++++++ .../pcp_instance_61.smt2 | 53 +++++++++++++++++ .../pcp_instance_610.smt2 | 53 +++++++++++++++++ .../pcp_instance_611.smt2 | 53 +++++++++++++++++ .../pcp_instance_612.smt2 | 53 +++++++++++++++++ .../pcp_instance_613.smt2 | 53 +++++++++++++++++ .../pcp_instance_614.smt2 | 53 +++++++++++++++++ .../pcp_instance_615.smt2 | 53 +++++++++++++++++ .../pcp_instance_616.smt2 | 53 +++++++++++++++++ .../pcp_instance_617.smt2 | 53 +++++++++++++++++ .../pcp_instance_618.smt2 | 53 +++++++++++++++++ .../pcp_instance_619.smt2 | 53 +++++++++++++++++ .../pcp_instance_62.smt2 | 53 +++++++++++++++++ .../pcp_instance_620.smt2 | 53 +++++++++++++++++ .../pcp_instance_621.smt2 | 53 +++++++++++++++++ .../pcp_instance_622.smt2 | 53 +++++++++++++++++ .../pcp_instance_623.smt2 | 53 +++++++++++++++++ .../pcp_instance_624.smt2 | 53 +++++++++++++++++ .../pcp_instance_625.smt2 | 53 +++++++++++++++++ .../pcp_instance_626.smt2 | 53 +++++++++++++++++ .../pcp_instance_627.smt2 | 53 +++++++++++++++++ .../pcp_instance_628.smt2 | 53 +++++++++++++++++ .../pcp_instance_629.smt2 | 53 +++++++++++++++++ .../pcp_instance_63.smt2 | 53 +++++++++++++++++ .../pcp_instance_630.smt2 | 53 +++++++++++++++++ .../pcp_instance_631.smt2 | 53 +++++++++++++++++ .../pcp_instance_632.smt2 | 53 +++++++++++++++++ .../pcp_instance_633.smt2 | 53 +++++++++++++++++ .../pcp_instance_634.smt2 | 53 +++++++++++++++++ .../pcp_instance_635.smt2 | 53 +++++++++++++++++ .../pcp_instance_636.smt2 | 53 +++++++++++++++++ .../pcp_instance_637.smt2 | 53 +++++++++++++++++ .../pcp_instance_638.smt2 | 53 +++++++++++++++++ .../pcp_instance_639.smt2 | 53 +++++++++++++++++ .../pcp_instance_64.smt2 | 53 +++++++++++++++++ .../pcp_instance_640.smt2 | 53 +++++++++++++++++ .../pcp_instance_641.smt2 | 53 +++++++++++++++++ .../pcp_instance_642.smt2 | 53 +++++++++++++++++ .../pcp_instance_643.smt2 | 53 +++++++++++++++++ .../pcp_instance_644.smt2 | 53 +++++++++++++++++ .../pcp_instance_645.smt2 | 53 +++++++++++++++++ .../pcp_instance_646.smt2 | 53 +++++++++++++++++ .../pcp_instance_647.smt2 | 53 +++++++++++++++++ .../pcp_instance_648.smt2 | 53 +++++++++++++++++ .../pcp_instance_649.smt2 | 53 +++++++++++++++++ .../pcp_instance_65.smt2 | 53 +++++++++++++++++ .../pcp_instance_650.smt2 | 53 +++++++++++++++++ .../pcp_instance_651.smt2 | 53 +++++++++++++++++ .../pcp_instance_652.smt2 | 53 +++++++++++++++++ .../pcp_instance_653.smt2 | 53 +++++++++++++++++ .../pcp_instance_654.smt2 | 53 +++++++++++++++++ .../pcp_instance_655.smt2 | 53 +++++++++++++++++ .../pcp_instance_656.smt2 | 53 +++++++++++++++++ .../pcp_instance_657.smt2 | 53 +++++++++++++++++ .../pcp_instance_658.smt2 | 53 +++++++++++++++++ .../pcp_instance_659.smt2 | 53 +++++++++++++++++ .../pcp_instance_66.smt2 | 53 +++++++++++++++++ .../pcp_instance_660.smt2 | 53 +++++++++++++++++ .../pcp_instance_661.smt2 | 53 +++++++++++++++++ .../pcp_instance_662.smt2 | 53 +++++++++++++++++ .../pcp_instance_663.smt2 | 53 +++++++++++++++++ .../pcp_instance_664.smt2 | 53 +++++++++++++++++ .../pcp_instance_665.smt2 | 53 +++++++++++++++++ .../pcp_instance_666.smt2 | 53 +++++++++++++++++ .../pcp_instance_667.smt2 | 53 +++++++++++++++++ .../pcp_instance_668.smt2 | 53 +++++++++++++++++ .../pcp_instance_669.smt2 | 53 +++++++++++++++++ .../pcp_instance_67.smt2 | 53 +++++++++++++++++ .../pcp_instance_670.smt2 | 53 +++++++++++++++++ .../pcp_instance_671.smt2 | 53 +++++++++++++++++ .../pcp_instance_672.smt2 | 53 +++++++++++++++++ .../pcp_instance_673.smt2 | 53 +++++++++++++++++ .../pcp_instance_674.smt2 | 53 +++++++++++++++++ .../pcp_instance_675.smt2 | 53 +++++++++++++++++ .../pcp_instance_676.smt2 | 53 +++++++++++++++++ .../pcp_instance_677.smt2 | 53 +++++++++++++++++ .../pcp_instance_678.smt2 | 53 +++++++++++++++++ .../pcp_instance_679.smt2 | 53 +++++++++++++++++ .../pcp_instance_68.smt2 | 53 +++++++++++++++++ .../pcp_instance_680.smt2 | 53 +++++++++++++++++ .../pcp_instance_681.smt2 | 53 +++++++++++++++++ .../pcp_instance_682.smt2 | 53 +++++++++++++++++ .../pcp_instance_683.smt2 | 53 +++++++++++++++++ .../pcp_instance_684.smt2 | 53 +++++++++++++++++ .../pcp_instance_685.smt2 | 53 +++++++++++++++++ .../pcp_instance_686.smt2 | 53 +++++++++++++++++ .../pcp_instance_687.smt2 | 53 +++++++++++++++++ .../pcp_instance_688.smt2 | 53 +++++++++++++++++ .../pcp_instance_689.smt2 | 53 +++++++++++++++++ .../pcp_instance_69.smt2 | 53 +++++++++++++++++ .../pcp_instance_690.smt2 | 53 +++++++++++++++++ .../pcp_instance_691.smt2 | 53 +++++++++++++++++ .../pcp_instance_692.smt2 | 53 +++++++++++++++++ .../pcp_instance_693.smt2 | 53 +++++++++++++++++ .../pcp_instance_694.smt2 | 53 +++++++++++++++++ .../pcp_instance_695.smt2 | 53 +++++++++++++++++ .../pcp_instance_696.smt2 | 53 +++++++++++++++++ .../pcp_instance_697.smt2 | 53 +++++++++++++++++ .../pcp_instance_698.smt2 | 53 +++++++++++++++++ .../pcp_instance_699.smt2 | 53 +++++++++++++++++ .../pcp_instance_7.smt2 | 53 +++++++++++++++++ .../pcp_instance_70.smt2 | 53 +++++++++++++++++ .../pcp_instance_700.smt2 | 53 +++++++++++++++++ .../pcp_instance_701.smt2 | 53 +++++++++++++++++ .../pcp_instance_702.smt2 | 53 +++++++++++++++++ .../pcp_instance_703.smt2 | 53 +++++++++++++++++ .../pcp_instance_704.smt2 | 53 +++++++++++++++++ .../pcp_instance_705.smt2 | 53 +++++++++++++++++ .../pcp_instance_706.smt2 | 53 +++++++++++++++++ .../pcp_instance_707.smt2 | 53 +++++++++++++++++ .../pcp_instance_708.smt2 | 53 +++++++++++++++++ .../pcp_instance_709.smt2 | 53 +++++++++++++++++ .../pcp_instance_71.smt2 | 53 +++++++++++++++++ .../pcp_instance_710.smt2 | 53 +++++++++++++++++ .../pcp_instance_711.smt2 | 53 +++++++++++++++++ .../pcp_instance_712.smt2 | 53 +++++++++++++++++ .../pcp_instance_713.smt2 | 53 +++++++++++++++++ .../pcp_instance_714.smt2 | 53 +++++++++++++++++ .../pcp_instance_715.smt2 | 53 +++++++++++++++++ .../pcp_instance_716.smt2 | 53 +++++++++++++++++ .../pcp_instance_717.smt2 | 53 +++++++++++++++++ .../pcp_instance_718.smt2 | 53 +++++++++++++++++ .../pcp_instance_719.smt2 | 53 +++++++++++++++++ .../pcp_instance_72.smt2 | 53 +++++++++++++++++ .../pcp_instance_720.smt2 | 53 +++++++++++++++++ .../pcp_instance_721.smt2 | 53 +++++++++++++++++ .../pcp_instance_722.smt2 | 53 +++++++++++++++++ .../pcp_instance_723.smt2 | 53 +++++++++++++++++ .../pcp_instance_724.smt2 | 53 +++++++++++++++++ .../pcp_instance_725.smt2 | 53 +++++++++++++++++ .../pcp_instance_726.smt2 | 53 +++++++++++++++++ .../pcp_instance_727.smt2 | 53 +++++++++++++++++ .../pcp_instance_728.smt2 | 53 +++++++++++++++++ .../pcp_instance_729.smt2 | 53 +++++++++++++++++ .../pcp_instance_73.smt2 | 53 +++++++++++++++++ .../pcp_instance_730.smt2 | 53 +++++++++++++++++ .../pcp_instance_731.smt2 | 53 +++++++++++++++++ .../pcp_instance_732.smt2 | 53 +++++++++++++++++ .../pcp_instance_733.smt2 | 53 +++++++++++++++++ .../pcp_instance_734.smt2 | 53 +++++++++++++++++ .../pcp_instance_735.smt2 | 53 +++++++++++++++++ .../pcp_instance_736.smt2 | 53 +++++++++++++++++ .../pcp_instance_737.smt2 | 53 +++++++++++++++++ .../pcp_instance_738.smt2 | 53 +++++++++++++++++ .../pcp_instance_739.smt2 | 53 +++++++++++++++++ .../pcp_instance_74.smt2 | 53 +++++++++++++++++ .../pcp_instance_740.smt2 | 53 +++++++++++++++++ .../pcp_instance_741.smt2 | 53 +++++++++++++++++ .../pcp_instance_742.smt2 | 53 +++++++++++++++++ .../pcp_instance_743.smt2 | 53 +++++++++++++++++ .../pcp_instance_744.smt2 | 53 +++++++++++++++++ .../pcp_instance_745.smt2 | 53 +++++++++++++++++ .../pcp_instance_746.smt2 | 53 +++++++++++++++++ .../pcp_instance_747.smt2 | 53 +++++++++++++++++ .../pcp_instance_748.smt2 | 53 +++++++++++++++++ .../pcp_instance_749.smt2 | 53 +++++++++++++++++ .../pcp_instance_75.smt2 | 53 +++++++++++++++++ .../pcp_instance_750.smt2 | 53 +++++++++++++++++ .../pcp_instance_751.smt2 | 53 +++++++++++++++++ .../pcp_instance_752.smt2 | 53 +++++++++++++++++ .../pcp_instance_753.smt2 | 53 +++++++++++++++++ .../pcp_instance_754.smt2 | 53 +++++++++++++++++ .../pcp_instance_755.smt2 | 53 +++++++++++++++++ .../pcp_instance_756.smt2 | 53 +++++++++++++++++ .../pcp_instance_757.smt2 | 53 +++++++++++++++++ .../pcp_instance_758.smt2 | 53 +++++++++++++++++ .../pcp_instance_759.smt2 | 53 +++++++++++++++++ .../pcp_instance_76.smt2 | 53 +++++++++++++++++ .../pcp_instance_760.smt2 | 53 +++++++++++++++++ .../pcp_instance_761.smt2 | 53 +++++++++++++++++ .../pcp_instance_762.smt2 | 53 +++++++++++++++++ .../pcp_instance_763.smt2 | 53 +++++++++++++++++ .../pcp_instance_764.smt2 | 53 +++++++++++++++++ .../pcp_instance_765.smt2 | 53 +++++++++++++++++ .../pcp_instance_766.smt2 | 53 +++++++++++++++++ .../pcp_instance_767.smt2 | 53 +++++++++++++++++ .../pcp_instance_768.smt2 | 53 +++++++++++++++++ .../pcp_instance_769.smt2 | 53 +++++++++++++++++ .../pcp_instance_77.smt2 | 53 +++++++++++++++++ .../pcp_instance_770.smt2 | 53 +++++++++++++++++ .../pcp_instance_771.smt2 | 53 +++++++++++++++++ .../pcp_instance_772.smt2 | 53 +++++++++++++++++ .../pcp_instance_773.smt2 | 53 +++++++++++++++++ .../pcp_instance_774.smt2 | 53 +++++++++++++++++ .../pcp_instance_775.smt2 | 53 +++++++++++++++++ .../pcp_instance_776.smt2 | 53 +++++++++++++++++ .../pcp_instance_777.smt2 | 53 +++++++++++++++++ .../pcp_instance_778.smt2 | 53 +++++++++++++++++ .../pcp_instance_779.smt2 | 53 +++++++++++++++++ .../pcp_instance_78.smt2 | 53 +++++++++++++++++ .../pcp_instance_780.smt2 | 53 +++++++++++++++++ .../pcp_instance_781.smt2 | 53 +++++++++++++++++ .../pcp_instance_782.smt2 | 53 +++++++++++++++++ .../pcp_instance_783.smt2 | 53 +++++++++++++++++ .../pcp_instance_784.smt2 | 53 +++++++++++++++++ .../pcp_instance_785.smt2 | 53 +++++++++++++++++ .../pcp_instance_786.smt2 | 53 +++++++++++++++++ .../pcp_instance_787.smt2 | 53 +++++++++++++++++ .../pcp_instance_788.smt2 | 53 +++++++++++++++++ .../pcp_instance_789.smt2 | 53 +++++++++++++++++ .../pcp_instance_79.smt2 | 53 +++++++++++++++++ .../pcp_instance_790.smt2 | 53 +++++++++++++++++ .../pcp_instance_791.smt2 | 53 +++++++++++++++++ .../pcp_instance_792.smt2 | 53 +++++++++++++++++ .../pcp_instance_793.smt2 | 53 +++++++++++++++++ .../pcp_instance_794.smt2 | 53 +++++++++++++++++ .../pcp_instance_795.smt2 | 53 +++++++++++++++++ .../pcp_instance_796.smt2 | 53 +++++++++++++++++ .../pcp_instance_797.smt2 | 53 +++++++++++++++++ .../pcp_instance_798.smt2 | 53 +++++++++++++++++ .../pcp_instance_799.smt2 | 53 +++++++++++++++++ .../pcp_instance_8.smt2 | 53 +++++++++++++++++ .../pcp_instance_80.smt2 | 53 +++++++++++++++++ .../pcp_instance_800.smt2 | 53 +++++++++++++++++ .../pcp_instance_801.smt2 | 53 +++++++++++++++++ .../pcp_instance_802.smt2 | 53 +++++++++++++++++ .../pcp_instance_803.smt2 | 53 +++++++++++++++++ .../pcp_instance_804.smt2 | 53 +++++++++++++++++ .../pcp_instance_805.smt2 | 53 +++++++++++++++++ .../pcp_instance_806.smt2 | 53 +++++++++++++++++ .../pcp_instance_807.smt2 | 53 +++++++++++++++++ .../pcp_instance_808.smt2 | 53 +++++++++++++++++ .../pcp_instance_809.smt2 | 53 +++++++++++++++++ .../pcp_instance_81.smt2 | 53 +++++++++++++++++ .../pcp_instance_810.smt2 | 53 +++++++++++++++++ .../pcp_instance_811.smt2 | 53 +++++++++++++++++ .../pcp_instance_812.smt2 | 53 +++++++++++++++++ .../pcp_instance_813.smt2 | 53 +++++++++++++++++ .../pcp_instance_814.smt2 | 53 +++++++++++++++++ .../pcp_instance_815.smt2 | 53 +++++++++++++++++ .../pcp_instance_816.smt2 | 53 +++++++++++++++++ .../pcp_instance_817.smt2 | 53 +++++++++++++++++ .../pcp_instance_818.smt2 | 53 +++++++++++++++++ .../pcp_instance_819.smt2 | 53 +++++++++++++++++ .../pcp_instance_82.smt2 | 53 +++++++++++++++++ .../pcp_instance_820.smt2 | 53 +++++++++++++++++ .../pcp_instance_821.smt2 | 53 +++++++++++++++++ .../pcp_instance_822.smt2 | 53 +++++++++++++++++ .../pcp_instance_823.smt2 | 53 +++++++++++++++++ .../pcp_instance_824.smt2 | 53 +++++++++++++++++ .../pcp_instance_825.smt2 | 53 +++++++++++++++++ .../pcp_instance_826.smt2 | 53 +++++++++++++++++ .../pcp_instance_827.smt2 | 53 +++++++++++++++++ .../pcp_instance_828.smt2 | 53 +++++++++++++++++ .../pcp_instance_829.smt2 | 53 +++++++++++++++++ .../pcp_instance_83.smt2 | 53 +++++++++++++++++ .../pcp_instance_830.smt2 | 53 +++++++++++++++++ .../pcp_instance_831.smt2 | 53 +++++++++++++++++ .../pcp_instance_832.smt2 | 53 +++++++++++++++++ .../pcp_instance_833.smt2 | 53 +++++++++++++++++ .../pcp_instance_834.smt2 | 53 +++++++++++++++++ .../pcp_instance_835.smt2 | 53 +++++++++++++++++ .../pcp_instance_836.smt2 | 53 +++++++++++++++++ .../pcp_instance_837.smt2 | 53 +++++++++++++++++ .../pcp_instance_838.smt2 | 53 +++++++++++++++++ .../pcp_instance_839.smt2 | 53 +++++++++++++++++ .../pcp_instance_84.smt2 | 53 +++++++++++++++++ .../pcp_instance_840.smt2 | 53 +++++++++++++++++ .../pcp_instance_841.smt2 | 53 +++++++++++++++++ .../pcp_instance_842.smt2 | 53 +++++++++++++++++ .../pcp_instance_843.smt2 | 53 +++++++++++++++++ .../pcp_instance_844.smt2 | 53 +++++++++++++++++ .../pcp_instance_845.smt2 | 53 +++++++++++++++++ .../pcp_instance_846.smt2 | 53 +++++++++++++++++ .../pcp_instance_847.smt2 | 53 +++++++++++++++++ .../pcp_instance_848.smt2 | 53 +++++++++++++++++ .../pcp_instance_849.smt2 | 53 +++++++++++++++++ .../pcp_instance_85.smt2 | 53 +++++++++++++++++ .../pcp_instance_850.smt2 | 53 +++++++++++++++++ .../pcp_instance_851.smt2 | 53 +++++++++++++++++ .../pcp_instance_852.smt2 | 53 +++++++++++++++++ .../pcp_instance_853.smt2 | 53 +++++++++++++++++ .../pcp_instance_854.smt2 | 53 +++++++++++++++++ .../pcp_instance_855.smt2 | 53 +++++++++++++++++ .../pcp_instance_856.smt2 | 53 +++++++++++++++++ .../pcp_instance_857.smt2 | 53 +++++++++++++++++ .../pcp_instance_858.smt2 | 53 +++++++++++++++++ .../pcp_instance_859.smt2 | 53 +++++++++++++++++ .../pcp_instance_86.smt2 | 53 +++++++++++++++++ .../pcp_instance_860.smt2 | 53 +++++++++++++++++ .../pcp_instance_861.smt2 | 53 +++++++++++++++++ .../pcp_instance_862.smt2 | 53 +++++++++++++++++ .../pcp_instance_863.smt2 | 53 +++++++++++++++++ .../pcp_instance_864.smt2 | 53 +++++++++++++++++ .../pcp_instance_865.smt2 | 53 +++++++++++++++++ .../pcp_instance_866.smt2 | 53 +++++++++++++++++ .../pcp_instance_867.smt2 | 53 +++++++++++++++++ .../pcp_instance_868.smt2 | 53 +++++++++++++++++ .../pcp_instance_869.smt2 | 53 +++++++++++++++++ .../pcp_instance_87.smt2 | 53 +++++++++++++++++ .../pcp_instance_870.smt2 | 53 +++++++++++++++++ .../pcp_instance_871.smt2 | 53 +++++++++++++++++ .../pcp_instance_872.smt2 | 53 +++++++++++++++++ .../pcp_instance_873.smt2 | 53 +++++++++++++++++ .../pcp_instance_874.smt2 | 53 +++++++++++++++++ .../pcp_instance_875.smt2 | 53 +++++++++++++++++ .../pcp_instance_876.smt2 | 53 +++++++++++++++++ .../pcp_instance_877.smt2 | 53 +++++++++++++++++ .../pcp_instance_878.smt2 | 53 +++++++++++++++++ .../pcp_instance_879.smt2 | 53 +++++++++++++++++ .../pcp_instance_88.smt2 | 53 +++++++++++++++++ .../pcp_instance_880.smt2 | 53 +++++++++++++++++ .../pcp_instance_881.smt2 | 53 +++++++++++++++++ .../pcp_instance_882.smt2 | 53 +++++++++++++++++ .../pcp_instance_883.smt2 | 53 +++++++++++++++++ .../pcp_instance_884.smt2 | 53 +++++++++++++++++ .../pcp_instance_885.smt2 | 53 +++++++++++++++++ .../pcp_instance_886.smt2 | 53 +++++++++++++++++ .../pcp_instance_887.smt2 | 53 +++++++++++++++++ .../pcp_instance_888.smt2 | 53 +++++++++++++++++ .../pcp_instance_889.smt2 | 53 +++++++++++++++++ .../pcp_instance_89.smt2 | 53 +++++++++++++++++ .../pcp_instance_890.smt2 | 53 +++++++++++++++++ .../pcp_instance_891.smt2 | 53 +++++++++++++++++ .../pcp_instance_892.smt2 | 53 +++++++++++++++++ .../pcp_instance_893.smt2 | 53 +++++++++++++++++ .../pcp_instance_894.smt2 | 53 +++++++++++++++++ .../pcp_instance_895.smt2 | 53 +++++++++++++++++ .../pcp_instance_896.smt2 | 53 +++++++++++++++++ .../pcp_instance_897.smt2 | 53 +++++++++++++++++ .../pcp_instance_898.smt2 | 53 +++++++++++++++++ .../pcp_instance_899.smt2 | 53 +++++++++++++++++ .../pcp_instance_9.smt2 | 53 +++++++++++++++++ .../pcp_instance_90.smt2 | 53 +++++++++++++++++ .../pcp_instance_900.smt2 | 53 +++++++++++++++++ .../pcp_instance_901.smt2 | 53 +++++++++++++++++ .../pcp_instance_902.smt2 | 53 +++++++++++++++++ .../pcp_instance_903.smt2 | 53 +++++++++++++++++ .../pcp_instance_904.smt2 | 53 +++++++++++++++++ .../pcp_instance_905.smt2 | 53 +++++++++++++++++ .../pcp_instance_906.smt2 | 53 +++++++++++++++++ .../pcp_instance_907.smt2 | 53 +++++++++++++++++ .../pcp_instance_908.smt2 | 53 +++++++++++++++++ .../pcp_instance_909.smt2 | 53 +++++++++++++++++ .../pcp_instance_91.smt2 | 53 +++++++++++++++++ .../pcp_instance_910.smt2 | 53 +++++++++++++++++ .../pcp_instance_911.smt2 | 53 +++++++++++++++++ .../pcp_instance_912.smt2 | 53 +++++++++++++++++ .../pcp_instance_913.smt2 | 53 +++++++++++++++++ .../pcp_instance_914.smt2 | 53 +++++++++++++++++ .../pcp_instance_915.smt2 | 53 +++++++++++++++++ .../pcp_instance_916.smt2 | 53 +++++++++++++++++ .../pcp_instance_917.smt2 | 53 +++++++++++++++++ .../pcp_instance_918.smt2 | 53 +++++++++++++++++ .../pcp_instance_919.smt2 | 53 +++++++++++++++++ .../pcp_instance_92.smt2 | 53 +++++++++++++++++ .../pcp_instance_920.smt2 | 53 +++++++++++++++++ .../pcp_instance_921.smt2 | 53 +++++++++++++++++ .../pcp_instance_922.smt2 | 53 +++++++++++++++++ .../pcp_instance_923.smt2 | 53 +++++++++++++++++ .../pcp_instance_924.smt2 | 53 +++++++++++++++++ .../pcp_instance_925.smt2 | 53 +++++++++++++++++ .../pcp_instance_926.smt2 | 53 +++++++++++++++++ .../pcp_instance_927.smt2 | 53 +++++++++++++++++ .../pcp_instance_928.smt2 | 53 +++++++++++++++++ .../pcp_instance_929.smt2 | 53 +++++++++++++++++ .../pcp_instance_93.smt2 | 53 +++++++++++++++++ .../pcp_instance_930.smt2 | 53 +++++++++++++++++ .../pcp_instance_931.smt2 | 53 +++++++++++++++++ .../pcp_instance_932.smt2 | 53 +++++++++++++++++ .../pcp_instance_933.smt2 | 53 +++++++++++++++++ .../pcp_instance_934.smt2 | 53 +++++++++++++++++ .../pcp_instance_935.smt2 | 53 +++++++++++++++++ .../pcp_instance_936.smt2 | 53 +++++++++++++++++ .../pcp_instance_937.smt2 | 53 +++++++++++++++++ .../pcp_instance_938.smt2 | 53 +++++++++++++++++ .../pcp_instance_939.smt2 | 53 +++++++++++++++++ .../pcp_instance_94.smt2 | 53 +++++++++++++++++ .../pcp_instance_940.smt2 | 53 +++++++++++++++++ .../pcp_instance_941.smt2 | 53 +++++++++++++++++ .../pcp_instance_942.smt2 | 53 +++++++++++++++++ .../pcp_instance_943.smt2 | 53 +++++++++++++++++ .../pcp_instance_944.smt2 | 53 +++++++++++++++++ .../pcp_instance_945.smt2 | 53 +++++++++++++++++ .../pcp_instance_946.smt2 | 53 +++++++++++++++++ .../pcp_instance_947.smt2 | 53 +++++++++++++++++ .../pcp_instance_948.smt2 | 53 +++++++++++++++++ .../pcp_instance_949.smt2 | 53 +++++++++++++++++ .../pcp_instance_95.smt2 | 53 +++++++++++++++++ .../pcp_instance_950.smt2 | 53 +++++++++++++++++ .../pcp_instance_951.smt2 | 53 +++++++++++++++++ .../pcp_instance_952.smt2 | 53 +++++++++++++++++ .../pcp_instance_953.smt2 | 53 +++++++++++++++++ .../pcp_instance_954.smt2 | 53 +++++++++++++++++ .../pcp_instance_955.smt2 | 53 +++++++++++++++++ .../pcp_instance_956.smt2 | 53 +++++++++++++++++ .../pcp_instance_957.smt2 | 53 +++++++++++++++++ .../pcp_instance_958.smt2 | 53 +++++++++++++++++ .../pcp_instance_959.smt2 | 53 +++++++++++++++++ .../pcp_instance_96.smt2 | 53 +++++++++++++++++ .../pcp_instance_960.smt2 | 53 +++++++++++++++++ .../pcp_instance_961.smt2 | 53 +++++++++++++++++ .../pcp_instance_962.smt2 | 53 +++++++++++++++++ .../pcp_instance_963.smt2 | 53 +++++++++++++++++ .../pcp_instance_964.smt2 | 53 +++++++++++++++++ .../pcp_instance_965.smt2 | 53 +++++++++++++++++ .../pcp_instance_966.smt2 | 53 +++++++++++++++++ .../pcp_instance_967.smt2 | 53 +++++++++++++++++ .../pcp_instance_968.smt2 | 53 +++++++++++++++++ .../pcp_instance_969.smt2 | 53 +++++++++++++++++ .../pcp_instance_97.smt2 | 53 +++++++++++++++++ .../pcp_instance_970.smt2 | 53 +++++++++++++++++ .../pcp_instance_971.smt2 | 53 +++++++++++++++++ .../pcp_instance_972.smt2 | 53 +++++++++++++++++ .../pcp_instance_973.smt2 | 53 +++++++++++++++++ .../pcp_instance_974.smt2 | 53 +++++++++++++++++ .../pcp_instance_975.smt2 | 53 +++++++++++++++++ .../pcp_instance_976.smt2 | 53 +++++++++++++++++ .../pcp_instance_977.smt2 | 53 +++++++++++++++++ .../pcp_instance_978.smt2 | 53 +++++++++++++++++ .../pcp_instance_979.smt2 | 53 +++++++++++++++++ .../pcp_instance_98.smt2 | 53 +++++++++++++++++ .../pcp_instance_980.smt2 | 53 +++++++++++++++++ .../pcp_instance_981.smt2 | 53 +++++++++++++++++ .../pcp_instance_982.smt2 | 53 +++++++++++++++++ .../pcp_instance_983.smt2 | 53 +++++++++++++++++ .../pcp_instance_984.smt2 | 53 +++++++++++++++++ .../pcp_instance_985.smt2 | 53 +++++++++++++++++ .../pcp_instance_986.smt2 | 53 +++++++++++++++++ .../pcp_instance_987.smt2 | 53 +++++++++++++++++ .../pcp_instance_988.smt2 | 53 +++++++++++++++++ .../pcp_instance_989.smt2 | 53 +++++++++++++++++ .../pcp_instance_99.smt2 | 53 +++++++++++++++++ .../pcp_instance_990.smt2 | 53 +++++++++++++++++ .../pcp_instance_991.smt2 | 53 +++++++++++++++++ .../pcp_instance_992.smt2 | 53 +++++++++++++++++ .../pcp_instance_993.smt2 | 53 +++++++++++++++++ .../pcp_instance_994.smt2 | 53 +++++++++++++++++ .../pcp_instance_995.smt2 | 53 +++++++++++++++++ .../pcp_instance_996.smt2 | 53 +++++++++++++++++ .../pcp_instance_997.smt2 | 53 +++++++++++++++++ .../pcp_instance_998.smt2 | 53 +++++++++++++++++ .../pcp_instance_999.smt2 | 53 +++++++++++++++++ .../unsolved_pcp_instance_0.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_10.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_100.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1000.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1001.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1002.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1003.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1004.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1005.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1006.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1007.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1008.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1009.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_101.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1010.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1011.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1012.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1013.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1014.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1015.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1016.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1017.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1018.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1019.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_102.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1020.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1021.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1022.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1023.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1024.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1025.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1026.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1027.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1028.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1029.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_103.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1030.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1031.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1032.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1033.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1034.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1035.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1036.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1037.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1038.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1039.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_104.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1040.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1041.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1042.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1043.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1044.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1045.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1046.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1047.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1048.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1049.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_105.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1050.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1051.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1052.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1053.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1054.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1055.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1056.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1057.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1058.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1059.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_106.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1060.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1061.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1062.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1063.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1064.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1065.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1066.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1067.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1068.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1069.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_107.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1070.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1071.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1072.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1073.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1074.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1075.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1076.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1077.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1078.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1079.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_108.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1080.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1081.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1082.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1083.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1084.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1085.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1086.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1087.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1088.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1089.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_109.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1090.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1091.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1092.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1093.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1094.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1095.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1096.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1097.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1098.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1099.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_11.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_110.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1100.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1101.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1102.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1103.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1104.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1105.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1106.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1107.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1108.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1109.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_111.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1110.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1111.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1112.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1113.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1114.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1115.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1116.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1117.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1118.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1119.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_112.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1120.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1121.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1122.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1123.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1124.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1125.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1126.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1127.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1128.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1129.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_113.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1130.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1131.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1132.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1133.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1134.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1135.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1136.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1137.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1138.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1139.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_114.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1140.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1141.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1142.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1143.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1144.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1145.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1146.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1147.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1148.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1149.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_115.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1150.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1151.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1152.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1153.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1154.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1155.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1156.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1157.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1158.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1159.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_116.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1160.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1161.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1162.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1163.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1164.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1165.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1166.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1167.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1168.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1169.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_117.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1170.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1171.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1172.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1173.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1174.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1175.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1176.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1177.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1178.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1179.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_118.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1180.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1181.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1182.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1183.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1184.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1185.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1186.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1187.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1188.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1189.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_119.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1190.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1191.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1192.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1193.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1194.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1195.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1196.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1197.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1198.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1199.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_12.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_120.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1200.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1201.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1202.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1203.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1204.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1205.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1206.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1207.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1208.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1209.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_121.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1210.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1211.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1212.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1213.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1214.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1215.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1216.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1217.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1218.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1219.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_122.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1220.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1221.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1222.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1223.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1224.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1225.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1226.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1227.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1228.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1229.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_123.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1230.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1231.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1232.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1233.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1234.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1235.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1236.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1237.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1238.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1239.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_124.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1240.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1241.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1242.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1243.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1244.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1245.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1246.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1247.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1248.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1249.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_125.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1250.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1251.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1252.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1253.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1254.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1255.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1256.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1257.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1258.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1259.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_126.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1260.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1261.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1262.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1263.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1264.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1265.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1266.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1267.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1268.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1269.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_127.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1270.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1271.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1272.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1273.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1274.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1275.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1276.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1277.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1278.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1279.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_128.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1280.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1281.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1282.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1283.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1284.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1285.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1286.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1287.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1288.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1289.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_129.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1290.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1291.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1292.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1293.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1294.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1295.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1296.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1297.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1298.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1299.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_13.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_130.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1300.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1301.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1302.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1303.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1304.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1305.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1306.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1307.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1308.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1309.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_131.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1310.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1311.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1312.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1313.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1314.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1315.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1316.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1317.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1318.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1319.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_132.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1320.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1321.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1322.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1323.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1324.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1325.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1326.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1327.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1328.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1329.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_133.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1330.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1331.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1332.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1333.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1334.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1335.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1336.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1337.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1338.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1339.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_134.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1340.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1341.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1342.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1343.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1344.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1345.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1346.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1347.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1348.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1349.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_135.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1350.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1351.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1352.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1353.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1354.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1355.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1356.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1357.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1358.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1359.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_136.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1360.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1361.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1362.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1363.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1364.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1365.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1366.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1367.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1368.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1369.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_137.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1370.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1371.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1372.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1373.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1374.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1375.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1376.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1377.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1378.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1379.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_138.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1380.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1381.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1382.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1383.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1384.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1385.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1386.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1387.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1388.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1389.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_139.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1390.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1391.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1392.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1393.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1394.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1395.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1396.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1397.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1398.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1399.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_14.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_140.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1400.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1401.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1402.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1403.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1404.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1405.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1406.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1407.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1408.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1409.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_141.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1410.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1411.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1412.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1413.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1414.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1415.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1416.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1417.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1418.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1419.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_142.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1420.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1421.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1422.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1423.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1424.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1425.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1426.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1427.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1428.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1429.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_143.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1430.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1431.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1432.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1433.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1434.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1435.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1436.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1437.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1438.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1439.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_144.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1440.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1441.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1442.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1443.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1444.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1445.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1446.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1447.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1448.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1449.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_145.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1450.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1451.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1452.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1453.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1454.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1455.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1456.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1457.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1458.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1459.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_146.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1460.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1461.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1462.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1463.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1464.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1465.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1466.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1467.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1468.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1469.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_147.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1470.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1471.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1472.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1473.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1474.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1475.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1476.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1477.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1478.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1479.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_148.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1480.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1481.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1482.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1483.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1484.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1485.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1486.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1487.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1488.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1489.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_149.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1490.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1491.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1492.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1493.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1494.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1495.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1496.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1497.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1498.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1499.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_15.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_150.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1500.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1501.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1502.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1503.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1504.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1505.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1506.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1507.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1508.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1509.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_151.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1510.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1511.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1512.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1513.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1514.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1515.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1516.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1517.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1518.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1519.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_152.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1520.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1521.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1522.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1523.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1524.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1525.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1526.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1527.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1528.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1529.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_153.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1530.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1531.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1532.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1533.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1534.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1535.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1536.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1537.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1538.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1539.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_154.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1540.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1541.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1542.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1543.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1544.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1545.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1546.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1547.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1548.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1549.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_155.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1550.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1551.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1552.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1553.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1554.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1555.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1556.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1557.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1558.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1559.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_156.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1560.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1561.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1562.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1563.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1564.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1565.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1566.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1567.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1568.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1569.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_157.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1570.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1571.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1572.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1573.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1574.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1575.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1576.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1577.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1578.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1579.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_158.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1580.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1581.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1582.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1583.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1584.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1585.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1586.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1587.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1588.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1589.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_159.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1590.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1591.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1592.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1593.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1594.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1595.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1596.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1597.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1598.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1599.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_16.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_160.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1600.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1601.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1602.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1603.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1604.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1605.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1606.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1607.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1608.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1609.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_161.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1610.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1611.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1612.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1613.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1614.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1615.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1616.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1617.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1618.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1619.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_162.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1620.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1621.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1622.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1623.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1624.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1625.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1626.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1627.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1628.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1629.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_163.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1630.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1631.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1632.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1633.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1634.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1635.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1636.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1637.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1638.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1639.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_164.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1640.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1641.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1642.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1643.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1644.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1645.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1646.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1647.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1648.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1649.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_165.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1650.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1651.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1652.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1653.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1654.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1655.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1656.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1657.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1658.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1659.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_166.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1660.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1661.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1662.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1663.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1664.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1665.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1666.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1667.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1668.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1669.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_167.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1670.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1671.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1672.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1673.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1674.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1675.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1676.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1677.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1678.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1679.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_168.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1680.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1681.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1682.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1683.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1684.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1685.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1686.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1687.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1688.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1689.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_169.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1690.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1691.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1692.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1693.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1694.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1695.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1696.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1697.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1698.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1699.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_17.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_170.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1700.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1701.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1702.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1703.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1704.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1705.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1706.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1707.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1708.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1709.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_171.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1710.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1711.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1712.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1713.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1714.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1715.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1716.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1717.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1718.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1719.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_172.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1720.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1721.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1722.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1723.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1724.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1725.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1726.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1727.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1728.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1729.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_173.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1730.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1731.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1732.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1733.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1734.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1735.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1736.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1737.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1738.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1739.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_174.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1740.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1741.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1742.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1743.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1744.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1745.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1746.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1747.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1748.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1749.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_175.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1750.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1751.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1752.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1753.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1754.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1755.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1756.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1757.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1758.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1759.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_176.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1760.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1761.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1762.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1763.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1764.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1765.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1766.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1767.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1768.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1769.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_177.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1770.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1771.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1772.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1773.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1774.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1775.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1776.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1777.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1778.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1779.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_178.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1780.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1781.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1782.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1783.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1784.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1785.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1786.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1787.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1788.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1789.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_179.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1790.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1791.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1792.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1793.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1794.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1795.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1796.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1797.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1798.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1799.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_18.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_180.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1800.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1801.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1802.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1803.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1804.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1805.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1806.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1807.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1808.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1809.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_181.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1810.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1811.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1812.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1813.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1814.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1815.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1816.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1817.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1818.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1819.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_182.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1820.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1821.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1822.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1823.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1824.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1825.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1826.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1827.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1828.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1829.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_183.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1830.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1831.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1832.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1833.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1834.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1835.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1836.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1837.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1838.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1839.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_184.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1840.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1841.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1842.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1843.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1844.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1845.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1846.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1847.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1848.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1849.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_185.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1850.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1851.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1852.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1853.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1854.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1855.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1856.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1857.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1858.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1859.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_186.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1860.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1861.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1862.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1863.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1864.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1865.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1866.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1867.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1868.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1869.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_187.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1870.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1871.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1872.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1873.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1874.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1875.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1876.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1877.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1878.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1879.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_188.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1880.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1881.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1882.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1883.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1884.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1885.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1886.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1887.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1888.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1889.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_189.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1890.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1891.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1892.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1893.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1894.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1895.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1896.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1897.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1898.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1899.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_19.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_190.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1900.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1901.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1902.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1903.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1904.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1905.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1906.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1907.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1908.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1909.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_191.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1910.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1911.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1912.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1913.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1914.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1915.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1916.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1917.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1918.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1919.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_192.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1920.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1921.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1922.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1923.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1924.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1925.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1926.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1927.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1928.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1929.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_193.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1930.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1931.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1932.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1933.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1934.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1935.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1936.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1937.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1938.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1939.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_194.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1940.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1941.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1942.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1943.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1944.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1945.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1946.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1947.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1948.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1949.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_195.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1950.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1951.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1952.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1953.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1954.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1955.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1956.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1957.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1958.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1959.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_196.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1960.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1961.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1962.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1963.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1964.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1965.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1966.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1967.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1968.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1969.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_197.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1970.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1971.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1972.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1973.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1974.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1975.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1976.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1977.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1978.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1979.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_198.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1980.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1981.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1982.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1983.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1984.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1985.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1986.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1987.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1988.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1989.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_199.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1990.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1991.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1992.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1993.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1994.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1995.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1996.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1997.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1998.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_1999.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_20.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_200.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2000.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2001.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2002.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2003.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2004.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2005.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2006.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2007.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2008.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2009.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_201.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2010.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2011.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2012.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2013.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2014.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2015.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2016.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2017.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2018.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2019.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_202.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2020.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2021.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2022.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2023.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2024.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2025.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2026.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2027.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2028.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2029.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_203.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2030.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2031.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2032.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2033.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2034.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2035.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2036.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2037.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2038.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2039.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_204.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2040.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2041.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2042.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2043.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2044.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2045.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2046.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2047.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2048.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2049.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_205.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2050.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2051.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2052.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2053.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2054.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2055.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2056.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2057.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2058.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2059.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_206.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2060.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2061.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2062.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2063.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2064.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2065.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2066.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2067.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2068.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2069.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_207.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2070.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2071.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2072.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2073.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2074.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2075.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2076.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2077.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2078.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2079.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_208.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2080.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2081.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2082.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2083.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2084.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2085.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2086.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2087.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2088.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2089.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_209.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2090.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2091.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2092.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2093.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2094.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2095.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2096.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2097.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2098.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2099.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_21.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_210.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2100.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2101.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2102.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2103.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2104.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2105.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2106.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2107.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2108.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2109.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_211.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2110.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2111.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2112.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2113.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2114.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2115.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2116.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2117.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2118.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2119.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_212.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2120.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2121.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2122.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2123.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2124.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2125.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2126.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2127.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2128.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2129.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_213.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2130.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2131.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2132.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2133.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2134.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2135.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2136.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2137.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2138.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2139.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_214.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2140.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2141.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2142.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2143.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2144.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2145.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2146.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2147.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2148.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2149.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_215.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2150.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2151.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2152.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2153.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2154.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2155.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2156.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2157.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2158.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2159.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_216.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2160.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2161.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2162.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2163.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2164.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2165.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2166.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2167.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2168.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2169.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_217.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2170.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2171.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2172.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2173.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2174.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2175.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2176.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2177.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2178.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2179.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_218.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2180.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2181.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2182.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2183.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2184.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2185.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2186.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2187.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2188.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2189.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_219.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2190.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2191.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2192.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2193.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2194.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2195.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2196.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2197.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2198.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2199.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_22.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_220.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2200.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2201.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2202.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2203.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2204.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2205.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2206.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2207.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2208.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2209.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_221.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2210.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2211.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2212.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2213.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2214.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2215.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2216.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2217.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2218.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2219.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_222.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2220.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2221.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2222.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2223.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2224.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2225.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2226.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2227.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2228.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2229.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_223.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2230.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2231.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2232.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2233.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2234.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2235.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2236.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2237.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2238.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2239.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_224.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2240.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2241.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2242.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2243.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2244.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2245.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2246.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2247.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2248.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2249.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_225.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2250.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2251.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2252.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2253.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2254.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2255.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2256.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2257.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2258.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2259.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_226.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2260.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2261.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2262.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2263.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2264.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2265.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2266.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2267.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2268.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2269.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_227.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2270.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2271.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2272.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2273.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2274.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2275.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2276.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2277.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2278.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2279.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_228.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2280.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2281.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2282.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2283.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2284.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2285.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2286.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2287.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2288.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2289.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_229.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2290.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2291.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2292.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2293.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2294.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2295.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2296.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2297.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2298.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2299.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_23.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_230.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2300.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2301.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2302.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2303.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2304.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2305.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2306.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2307.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2308.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2309.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_231.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2310.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2311.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2312.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2313.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2314.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2315.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2316.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2317.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2318.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2319.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_232.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2320.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2321.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2322.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2323.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2324.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2325.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2326.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2327.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2328.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2329.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_233.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2330.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2331.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2332.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2333.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2334.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2335.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2336.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2337.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2338.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2339.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_234.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2340.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2341.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2342.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2343.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2344.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2345.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2346.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2347.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2348.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2349.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_235.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2350.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2351.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2352.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2353.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2354.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2355.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2356.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2357.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2358.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2359.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_236.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2360.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2361.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2362.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2363.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2364.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2365.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2366.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2367.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2368.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2369.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_237.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2370.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2371.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2372.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2373.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2374.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2375.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2376.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2377.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2378.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2379.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_238.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2380.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2381.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2382.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2383.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2384.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2385.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2386.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2387.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2388.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2389.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_239.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2390.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2391.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2392.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2393.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2394.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2395.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2396.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2397.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2398.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2399.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_24.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_240.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2400.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2401.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2402.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2403.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2404.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2405.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2406.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2407.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2408.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2409.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_241.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2410.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2411.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2412.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2413.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2414.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2415.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2416.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2417.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2418.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2419.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_242.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2420.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2421.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2422.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2423.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2424.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2425.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2426.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2427.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2428.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2429.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_243.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2430.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2431.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2432.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2433.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2434.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2435.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2436.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2437.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2438.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2439.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_244.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2440.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2441.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2442.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2443.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2444.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2445.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2446.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2447.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2448.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2449.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_245.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2450.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2451.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2452.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2453.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2454.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2455.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2456.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2457.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2458.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2459.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_246.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2460.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2461.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2462.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2463.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2464.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2465.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2466.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2467.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2468.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2469.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_247.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2470.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2471.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2472.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2473.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2474.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2475.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2476.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2477.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2478.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2479.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_248.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2480.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2481.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2482.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2483.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2484.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2485.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2486.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2487.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2488.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2489.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_249.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2490.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2491.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2492.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2493.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2494.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2495.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2496.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2497.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2498.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2499.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_25.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_250.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2500.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2501.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2502.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2503.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2504.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2505.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2506.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2507.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2508.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2509.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_251.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2510.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2511.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2512.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2513.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2514.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2515.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2516.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2517.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2518.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2519.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_252.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2520.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2521.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2522.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2523.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2524.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2525.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2526.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2527.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2528.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2529.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_253.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2530.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2531.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2532.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2533.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2534.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2535.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2536.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2537.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2538.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2539.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_254.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2540.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2541.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2542.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2543.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2544.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2545.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2546.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2547.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2548.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2549.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_255.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2550.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2551.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2552.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2553.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2554.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2555.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2556.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2557.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2558.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2559.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_256.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2560.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2561.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2562.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2563.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2564.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2565.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2566.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2567.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2568.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2569.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_257.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2570.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2571.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2572.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2573.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2574.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2575.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2576.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2577.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2578.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2579.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_258.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2580.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2581.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2582.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2583.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2584.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2585.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2586.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2587.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2588.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2589.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_259.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2590.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2591.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2592.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2593.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2594.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2595.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2596.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2597.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2598.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2599.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_26.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_260.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2600.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2601.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2602.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2603.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2604.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2605.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2606.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2607.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2608.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2609.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_261.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2610.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2611.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2612.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2613.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2614.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2615.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2616.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2617.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2618.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2619.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_262.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2620.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2621.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2622.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2623.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2624.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2625.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2626.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2627.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2628.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2629.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_263.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2630.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2631.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2632.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2633.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2634.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2635.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2636.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2637.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2638.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2639.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_264.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2640.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2641.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2642.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2643.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2644.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2645.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2646.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2647.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2648.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2649.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_265.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2650.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2651.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2652.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2653.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2654.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2655.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2656.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2657.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2658.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2659.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_266.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2660.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2661.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2662.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2663.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2664.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2665.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2666.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2667.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2668.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2669.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_267.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2670.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2671.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2672.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2673.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2674.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2675.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2676.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2677.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2678.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2679.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_268.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2680.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2681.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2682.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2683.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2684.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2685.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2686.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2687.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2688.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2689.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_269.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2690.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2691.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2692.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2693.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2694.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2695.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2696.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2697.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2698.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2699.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_27.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_270.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2700.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2701.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2702.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2703.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2704.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2705.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2706.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2707.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2708.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2709.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_271.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2710.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2711.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2712.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2713.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2714.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2715.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2716.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2717.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2718.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2719.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_272.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2720.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2721.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2722.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2723.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2724.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2725.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2726.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2727.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2728.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2729.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_273.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2730.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2731.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2732.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2733.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2734.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2735.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2736.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2737.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2738.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2739.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_274.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2740.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2741.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2742.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2743.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2744.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2745.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2746.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2747.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2748.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2749.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_275.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2750.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2751.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2752.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2753.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2754.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2755.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2756.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2757.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2758.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2759.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_276.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2760.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2761.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2762.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2763.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2764.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2765.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2766.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2767.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2768.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2769.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_277.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2770.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2771.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2772.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2773.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2774.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2775.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2776.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2777.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2778.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2779.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_278.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2780.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2781.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2782.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2783.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2784.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2785.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2786.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2787.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2788.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2789.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_279.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2790.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2791.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2792.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2793.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2794.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2795.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2796.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2797.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2798.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2799.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_28.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_280.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2800.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2801.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2802.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2803.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2804.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2805.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2806.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2807.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2808.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2809.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_281.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2810.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2811.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2812.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2813.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2814.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2815.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2816.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2817.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2818.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2819.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_282.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2820.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2821.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2822.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2823.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2824.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2825.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2826.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2827.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2828.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2829.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_283.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2830.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2831.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2832.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2833.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2834.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2835.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2836.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2837.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2838.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2839.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_284.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2840.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2841.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2842.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2843.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2844.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2845.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2846.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2847.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2848.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2849.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_285.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2850.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2851.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2852.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2853.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2854.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2855.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2856.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2857.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2858.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2859.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_286.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2860.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2861.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2862.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2863.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2864.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2865.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2866.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2867.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2868.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2869.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_287.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2870.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2871.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2872.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2873.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2874.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2875.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2876.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2877.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2878.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2879.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_288.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2880.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2881.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2882.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2883.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2884.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2885.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2886.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2887.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2888.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2889.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_289.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2890.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2891.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2892.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2893.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2894.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2895.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2896.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2897.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2898.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2899.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_29.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_290.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2900.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2901.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2902.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2903.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2904.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2905.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2906.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2907.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2908.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2909.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_291.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2910.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2911.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2912.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2913.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2914.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2915.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2916.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2917.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2918.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2919.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_292.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2920.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2921.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2922.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2923.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2924.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2925.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2926.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2927.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2928.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2929.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_293.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2930.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2931.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2932.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2933.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2934.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2935.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2936.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2937.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2938.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2939.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_294.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2940.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2941.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2942.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2943.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2944.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2945.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2946.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2947.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2948.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2949.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_295.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2950.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2951.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2952.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2953.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2954.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2955.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2956.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2957.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2958.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2959.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_296.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2960.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2961.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2962.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2963.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2964.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2965.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2966.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2967.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2968.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2969.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_297.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2970.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2971.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2972.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2973.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2974.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2975.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2976.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2977.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2978.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2979.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_298.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2980.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2981.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2982.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2983.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2984.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2985.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2986.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2987.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2988.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2989.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_299.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2990.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2991.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2992.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2993.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2994.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2995.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2996.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2997.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2998.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_2999.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_30.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_300.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3000.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3001.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3002.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3003.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3004.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3005.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3006.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3007.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3008.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3009.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_301.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3010.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3011.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3012.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3013.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3014.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3015.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3016.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3017.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3018.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3019.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_302.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3020.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3021.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3022.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3023.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3024.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3025.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3026.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3027.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3028.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3029.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_303.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3030.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3031.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3032.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3033.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3034.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3035.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3036.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3037.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3038.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3039.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_304.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3040.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3041.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3042.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3043.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3044.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3045.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3046.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3047.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3048.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3049.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_305.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3050.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3051.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3052.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3053.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3054.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3055.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3056.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3057.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3058.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3059.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_306.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3060.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3061.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3062.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3063.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3064.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3065.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3066.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3067.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3068.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3069.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_307.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3070.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3071.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3072.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3073.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3074.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3075.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3076.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3077.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3078.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3079.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_308.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3080.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3081.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3082.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3083.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3084.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3085.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3086.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3087.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3088.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3089.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_309.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3090.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3091.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3092.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3093.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3094.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3095.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3096.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3097.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3098.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3099.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_31.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_310.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3100.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3101.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3102.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3103.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3104.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3105.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3106.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3107.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3108.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3109.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_311.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3110.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3111.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3112.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3113.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3114.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3115.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3116.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3117.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3118.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3119.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_312.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3120.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3121.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3122.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3123.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3124.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3125.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3126.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3127.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3128.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3129.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_313.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3130.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3131.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3132.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3133.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3134.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3135.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3136.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3137.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3138.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3139.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_314.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3140.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3141.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3142.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3143.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3144.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3145.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3146.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3147.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3148.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3149.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_315.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3150.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3151.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3152.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3153.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3154.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3155.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3156.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3157.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3158.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3159.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_316.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3160.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3161.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3162.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3163.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3164.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3165.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3166.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3167.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3168.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_3169.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_317.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_318.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_319.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_32.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_320.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_321.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_322.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_323.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_324.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_325.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_326.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_327.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_328.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_329.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_33.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_330.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_331.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_332.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_333.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_334.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_335.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_336.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_337.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_338.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_339.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_34.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_340.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_341.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_342.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_343.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_344.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_345.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_346.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_347.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_348.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_349.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_35.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_350.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_351.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_352.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_353.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_354.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_355.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_356.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_357.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_358.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_359.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_36.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_360.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_361.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_362.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_363.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_364.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_365.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_366.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_367.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_368.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_369.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_37.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_370.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_371.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_372.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_373.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_374.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_375.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_376.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_377.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_378.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_379.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_38.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_380.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_381.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_382.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_383.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_384.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_385.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_386.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_387.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_388.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_389.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_39.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_390.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_391.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_392.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_393.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_394.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_395.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_396.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_397.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_398.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_399.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_4.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_40.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_400.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_401.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_402.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_403.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_404.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_405.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_406.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_407.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_408.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_409.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_41.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_410.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_411.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_412.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_413.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_414.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_415.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_416.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_417.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_418.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_419.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_42.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_420.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_421.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_422.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_423.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_424.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_425.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_426.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_427.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_428.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_429.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_43.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_430.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_431.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_432.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_433.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_434.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_435.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_436.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_437.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_438.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_439.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_44.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_440.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_441.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_442.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_443.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_444.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_445.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_446.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_447.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_448.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_449.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_45.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_450.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_451.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_452.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_453.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_454.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_455.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_456.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_457.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_458.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_459.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_46.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_460.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_461.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_462.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_463.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_464.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_465.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_466.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_467.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_468.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_469.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_47.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_470.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_471.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_472.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_473.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_474.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_475.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_476.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_477.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_478.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_479.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_48.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_480.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_481.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_482.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_483.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_484.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_485.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_486.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_487.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_488.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_489.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_49.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_490.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_491.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_492.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_493.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_494.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_495.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_496.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_497.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_498.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_499.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_5.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_50.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_500.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_501.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_502.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_503.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_504.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_505.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_506.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_507.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_508.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_509.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_51.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_510.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_511.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_512.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_513.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_514.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_515.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_516.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_517.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_518.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_519.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_52.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_520.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_521.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_522.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_523.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_524.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_525.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_526.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_527.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_528.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_529.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_53.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_530.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_531.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_532.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_533.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_534.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_535.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_536.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_537.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_538.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_539.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_54.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_540.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_541.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_542.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_543.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_544.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_545.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_546.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_547.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_548.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_549.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_55.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_550.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_551.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_552.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_553.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_554.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_555.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_556.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_557.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_558.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_559.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_56.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_560.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_561.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_562.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_563.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_564.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_565.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_566.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_567.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_568.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_569.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_57.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_570.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_571.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_572.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_573.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_574.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_575.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_576.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_577.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_578.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_579.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_58.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_580.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_581.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_582.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_583.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_584.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_585.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_586.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_587.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_588.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_589.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_59.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_590.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_591.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_592.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_593.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_594.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_595.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_596.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_597.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_598.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_599.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_6.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_60.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_600.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_601.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_602.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_603.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_604.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_605.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_606.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_607.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_608.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_609.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_61.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_610.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_611.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_612.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_613.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_614.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_615.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_616.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_617.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_618.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_619.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_62.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_620.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_621.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_622.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_623.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_624.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_625.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_626.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_627.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_628.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_629.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_63.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_630.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_631.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_632.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_633.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_634.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_635.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_636.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_637.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_638.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_639.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_64.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_640.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_641.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_642.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_643.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_644.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_645.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_646.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_647.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_648.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_649.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_65.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_650.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_651.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_652.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_653.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_654.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_655.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_656.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_657.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_658.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_659.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_66.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_660.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_661.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_662.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_663.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_664.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_665.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_666.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_667.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_668.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_669.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_67.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_670.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_671.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_672.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_673.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_674.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_675.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_676.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_677.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_678.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_679.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_68.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_680.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_681.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_682.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_683.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_684.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_685.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_686.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_687.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_688.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_689.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_69.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_690.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_691.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_692.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_693.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_694.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_695.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_696.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_697.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_698.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_699.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_7.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_70.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_700.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_701.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_702.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_703.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_704.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_705.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_706.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_707.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_708.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_709.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_71.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_710.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_711.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_712.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_713.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_714.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_715.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_716.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_717.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_718.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_719.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_72.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_720.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_721.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_722.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_723.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_724.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_725.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_726.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_727.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_728.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_729.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_73.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_730.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_731.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_732.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_733.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_734.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_735.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_736.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_737.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_738.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_739.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_74.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_740.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_741.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_742.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_743.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_744.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_745.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_746.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_747.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_748.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_749.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_75.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_750.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_751.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_752.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_753.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_754.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_755.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_756.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_757.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_758.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_759.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_76.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_760.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_761.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_762.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_763.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_764.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_765.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_766.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_767.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_768.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_769.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_77.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_770.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_771.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_772.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_773.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_774.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_775.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_776.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_777.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_778.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_779.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_78.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_780.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_781.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_782.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_783.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_784.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_785.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_786.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_787.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_788.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_789.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_79.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_790.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_791.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_792.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_793.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_794.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_795.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_796.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_797.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_798.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_799.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_8.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_80.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_800.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_801.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_802.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_803.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_804.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_805.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_806.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_807.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_808.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_809.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_81.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_810.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_811.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_812.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_813.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_814.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_815.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_816.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_817.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_818.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_819.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_82.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_820.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_821.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_822.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_823.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_824.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_825.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_826.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_827.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_828.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_829.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_83.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_830.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_831.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_832.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_833.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_834.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_835.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_836.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_837.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_838.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_839.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_84.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_840.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_841.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_842.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_843.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_844.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_845.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_846.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_847.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_848.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_849.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_85.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_850.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_851.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_852.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_853.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_854.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_855.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_856.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_857.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_858.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_859.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_86.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_860.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_861.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_862.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_863.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_864.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_865.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_866.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_867.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_868.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_869.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_87.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_870.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_871.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_872.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_873.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_874.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_875.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_876.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_877.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_878.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_879.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_88.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_880.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_881.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_882.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_883.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_884.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_885.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_886.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_887.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_888.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_889.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_89.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_890.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_891.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_892.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_893.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_894.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_895.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_896.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_897.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_898.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_899.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_9.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_90.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_900.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_901.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_902.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_903.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_904.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_905.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_906.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_907.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_908.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_909.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_91.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_910.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_911.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_912.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_913.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_914.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_915.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_916.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_917.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_918.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_919.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_92.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_920.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_921.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_922.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_923.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_924.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_925.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_926.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_927.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_928.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_929.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_93.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_930.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_931.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_932.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_933.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_934.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_935.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_936.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_937.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_938.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_939.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_94.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_940.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_941.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_942.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_943.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_944.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_945.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_946.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_947.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_948.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_949.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_95.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_950.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_951.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_952.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_953.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_954.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_955.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_956.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_957.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_958.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_959.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_96.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_960.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_961.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_962.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_963.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_964.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_965.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_966.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_967.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_968.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_969.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_97.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_970.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_971.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_972.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_973.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_974.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_975.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_976.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_977.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_978.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_979.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_98.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_980.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_981.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_982.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_983.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_984.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_985.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_986.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_987.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_988.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_989.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_99.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_990.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_991.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_992.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_993.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_994.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_995.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_996.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_997.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_998.smt2 | 57 +++++++++++++++++++ .../unsolved_pcp_instance_999.smt2 | 57 +++++++++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0001.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0002.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0003.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0004.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0005.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0006.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0007.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0008.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0009.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0010.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0011.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0012.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0013.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0014.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0015.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0016.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0017.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0018.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0019.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0020.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0021.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0022.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0023.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0024.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0025.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0026.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0027.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0028.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0029.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0030.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0031.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0032.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0033.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0034.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0035.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0036.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0037.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0038.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0039.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0040.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0041.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0042.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0043.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0044.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0045.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0046.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0047.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0048.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0049.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0050.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0051.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0052.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0053.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0054.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0055.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0056.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0057.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0058.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0059.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0060.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0061.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0062.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0063.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0064.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0065.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0066.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0067.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0068.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0069.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0070.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0071.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0072.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0073.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0074.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0075.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0076.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0077.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0078.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0079.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0080.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0081.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0082.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0083.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0084.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0085.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0086.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0087.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0088.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0089.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0090.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0091.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0092.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0093.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0094.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0095.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0096.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0097.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0098.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0099.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0100.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0101.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0102.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0103.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0104.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0105.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0106.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0107.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0108.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0109.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0110.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0111.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0112.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0113.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0114.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0115.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0116.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0117.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0118.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0119.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0120.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0121.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0122.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0123.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0124.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0125.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0126.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0127.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0128.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0129.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0130.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0131.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0132.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0133.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0134.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0135.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0136.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0137.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0138.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0139.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0140.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0141.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0142.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0143.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0144.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0145.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0146.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0147.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0148.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0149.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0150.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0151.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0152.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0153.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0154.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0155.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0156.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0157.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0158.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0159.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0160.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0161.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0162.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0163.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0164.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0165.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0166.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0167.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0168.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0169.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0170.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0171.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0172.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0173.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0174.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0175.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0176.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0177.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0178.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0179.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0180.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0181.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0182.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0183.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0184.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0185.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0186.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0187.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0188.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0189.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0190.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0191.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0192.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0193.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0194.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0195.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0196.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0197.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0198.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0199.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0200.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0201.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0202.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0203.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0204.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0205.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0206.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0207.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0208.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0209.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0210.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0211.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0212.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0213.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0214.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0215.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0216.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0217.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0218.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0219.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0220.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0221.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0222.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0223.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0224.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0225.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0226.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0227.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0228.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0229.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0230.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0231.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0232.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0233.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0234.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0235.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0236.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0237.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0238.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0239.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0240.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0241.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0242.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0243.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0244.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0245.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0246.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0247.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0248.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0249.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0250.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0251.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0252.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0253.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0254.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0255.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0256.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0257.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0258.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0259.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0260.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0261.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0262.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0263.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0264.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0265.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0266.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0267.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0268.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0269.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0270.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0271.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0272.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0273.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0274.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0275.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0276.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0277.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0278.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0279.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0280.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0281.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0282.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0283.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0284.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0285.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0286.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0287.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0288.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0289.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0290.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0291.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0292.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0293.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0294.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0295.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0296.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0297.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0298.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0299.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0300.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0301.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0302.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0303.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0304.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0305.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0306.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0307.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0308.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0309.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0310.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0311.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0312.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0313.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0314.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0315.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0316.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0317.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0318.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0319.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0320.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0321.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0322.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0323.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0324.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0325.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0326.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0327.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0328.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0329.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0330.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0331.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0332.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0333.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0334.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0335.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0336.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0337.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0338.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0339.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0340.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0341.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0342.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0343.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0344.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0345.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0346.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0347.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0348.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0349.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0350.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0351.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0352.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0353.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0354.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0355.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0356.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0357.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0358.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0359.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0360.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0361.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0362.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0363.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0364.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0365.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0366.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0367.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0368.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0369.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0370.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0371.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0372.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0373.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0374.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0375.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0376.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0377.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0378.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0379.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0380.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0381.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0382.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0383.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0384.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0385.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0386.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0387.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0388.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0389.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0390.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0391.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0392.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0393.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0394.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0395.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0396.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0397.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0398.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0399.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0400.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0401.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0402.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0403.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0404.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0405.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0406.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0407.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0408.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0409.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0410.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0411.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0412.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0413.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0414.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0415.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0416.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0417.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0418.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0419.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0420.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0421.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0422.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0423.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0424.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0425.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0426.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0427.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0428.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0429.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0430.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0431.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0432.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0433.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0434.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0435.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0436.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0437.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0438.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0439.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0440.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0441.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0442.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0443.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0444.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0445.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0446.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0447.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0448.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0449.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0450.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0451.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0452.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0453.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0454.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0455.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0456.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0457.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0458.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0459.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0460.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0461.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0462.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0463.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0464.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0465.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0466.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0467.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0468.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0469.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0470.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0471.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0472.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0473.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0474.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0475.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0476.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0477.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0478.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0479.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0480.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0481.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0482.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0483.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0484.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0485.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0486.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0487.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0488.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0489.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0490.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0491.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0492.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0493.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0494.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0495.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0496.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0497.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0498.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0499.smt2 | 39 +++++++++++++ .../QF_S/20250403-rna-sat/benchmark_0500.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0001.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0002.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0003.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0004.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0005.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0006.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0007.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0008.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0009.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0010.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0011.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0012.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0013.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0014.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0015.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0016.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0017.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0018.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0019.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0020.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0021.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0022.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0023.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0024.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0025.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0026.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0027.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0028.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0029.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0030.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0031.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0032.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0033.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0034.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0035.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0036.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0037.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0038.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0039.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0040.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0041.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0042.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0043.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0044.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0045.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0046.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0047.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0048.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0049.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0050.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0051.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0052.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0053.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0054.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0055.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0056.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0057.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0058.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0059.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0060.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0061.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0062.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0063.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0064.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0065.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0066.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0067.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0068.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0069.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0070.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0071.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0072.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0073.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0074.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0075.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0076.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0077.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0078.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0079.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0080.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0081.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0082.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0083.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0084.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0085.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0086.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0087.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0088.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0089.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0090.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0091.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0092.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0093.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0094.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0095.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0096.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0097.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0098.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0099.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0100.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0101.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0102.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0103.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0104.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0105.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0106.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0107.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0108.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0109.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0110.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0111.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0112.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0113.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0114.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0115.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0116.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0117.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0118.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0119.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0120.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0121.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0122.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0123.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0124.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0125.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0126.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0127.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0128.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0129.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0130.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0131.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0132.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0133.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0134.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0135.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0136.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0137.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0138.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0139.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0140.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0141.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0142.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0143.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0144.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0145.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0146.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0147.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0148.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0149.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0150.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0151.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0152.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0153.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0154.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0155.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0156.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0157.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0158.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0159.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0160.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0161.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0162.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0163.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0164.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0165.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0166.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0167.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0168.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0169.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0170.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0171.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0172.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0173.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0174.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0175.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0176.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0177.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0178.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0179.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0180.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0181.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0182.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0183.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0184.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0185.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0186.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0187.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0188.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0189.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0190.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0191.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0192.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0193.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0194.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0195.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0196.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0197.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0198.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0199.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0200.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0201.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0202.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0203.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0204.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0205.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0206.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0207.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0208.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0209.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0210.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0211.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0212.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0213.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0214.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0215.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0216.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0217.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0218.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0219.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0220.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0221.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0222.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0223.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0224.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0225.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0226.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0227.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0228.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0229.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0230.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0231.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0232.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0233.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0234.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0235.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0236.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0237.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0238.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0239.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0240.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0241.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0242.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0243.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0244.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0245.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0246.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0247.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0248.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0249.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0250.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0251.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0252.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0253.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0254.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0255.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0256.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0257.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0258.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0259.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0260.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0261.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0262.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0263.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0264.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0265.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0266.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0267.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0268.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0269.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0270.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0271.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0272.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0273.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0274.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0275.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0276.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0277.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0278.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0279.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0280.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0281.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0282.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0283.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0284.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0285.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0286.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0287.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0288.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0289.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0290.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0291.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0292.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0293.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0294.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0295.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0296.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0297.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0298.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0299.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0300.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0301.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0302.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0303.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0304.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0305.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0306.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0307.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0308.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0309.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0310.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0311.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0312.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0313.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0314.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0315.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0316.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0317.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0318.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0319.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0320.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0321.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0322.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0323.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0324.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0325.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0326.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0327.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0328.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0329.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0330.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0331.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0332.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0333.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0334.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0335.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0336.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0337.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0338.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0339.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0340.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0341.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0342.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0343.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0344.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0345.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0346.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0347.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0348.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0349.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0350.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0351.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0352.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0353.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0354.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0355.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0356.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0357.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0358.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0359.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0360.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0361.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0362.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0363.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0364.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0365.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0366.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0367.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0368.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0369.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0370.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0371.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0372.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0373.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0374.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0375.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0376.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0377.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0378.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0379.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0380.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0381.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0382.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0383.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0384.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0385.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0386.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0387.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0388.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0389.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0390.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0391.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0392.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0393.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0394.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0395.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0396.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0397.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0398.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0399.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0400.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0401.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0402.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0403.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0404.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0405.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0406.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0407.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0408.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0409.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0410.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0411.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0412.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0413.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0414.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0415.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0416.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0417.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0418.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0419.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0420.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0421.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0422.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0423.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0424.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0425.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0426.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0427.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0428.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0429.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0430.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0431.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0432.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0433.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0434.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0435.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0436.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0437.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0438.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0439.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0440.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0441.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0442.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0443.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0444.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0445.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0446.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0447.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0448.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0449.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0450.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0451.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0452.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0453.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0454.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0455.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0456.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0457.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0458.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0459.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0460.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0461.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0462.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0463.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0464.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0465.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0466.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0467.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0468.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0469.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0470.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0471.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0472.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0473.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0474.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0475.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0476.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0477.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0478.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0479.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0480.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0481.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0482.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0483.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0484.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0485.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0486.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0487.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0488.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0489.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0490.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0491.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0492.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0493.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0494.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0495.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0496.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0497.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0498.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0499.smt2 | 39 +++++++++++++ .../20250403-rna-unsat/benchmark_0500.smt2 | 39 +++++++++++++ 5170 files changed, 272690 insertions(+) create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_0.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_1.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_10.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_100.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_101.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_102.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_103.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_104.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_105.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_106.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_107.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_108.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_109.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_11.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_110.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_111.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_112.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_113.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_114.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_115.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_116.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_117.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_118.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_119.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_12.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_120.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_121.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_122.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_123.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_124.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_125.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_126.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_127.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_128.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_129.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_13.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_130.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_131.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_132.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_133.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_134.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_135.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_136.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_137.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_138.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_139.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_14.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_140.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_141.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_142.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_143.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_144.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_145.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_146.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_147.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_148.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_149.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_15.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_150.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_151.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_152.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_153.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_154.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_155.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_156.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_157.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_158.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_159.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_16.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_160.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_161.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_162.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_163.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_164.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_165.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_166.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_167.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_168.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_169.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_17.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_170.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_171.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_172.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_173.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_174.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_175.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_176.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_177.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_178.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_179.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_18.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_180.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_181.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_182.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_183.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_184.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_185.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_186.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_187.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_188.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_189.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_19.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_190.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_191.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_192.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_193.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_194.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_195.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_196.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_197.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_198.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_199.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_2.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_20.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_200.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_201.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_202.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_203.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_204.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_205.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_206.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_207.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_208.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_209.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_21.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_210.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_211.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_212.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_213.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_214.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_215.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_216.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_217.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_218.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_219.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_22.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_220.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_221.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_222.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_223.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_224.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_225.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_226.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_227.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_228.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_229.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_23.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_230.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_231.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_232.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_233.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_234.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_235.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_236.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_237.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_238.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_239.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_24.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_240.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_241.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_242.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_243.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_244.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_245.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_246.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_247.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_248.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_249.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_25.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_250.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_251.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_252.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_253.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_254.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_255.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_256.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_257.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_258.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_259.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_26.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_260.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_261.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_262.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_263.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_264.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_265.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_266.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_267.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_268.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_269.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_27.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_270.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_271.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_272.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_273.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_274.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_275.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_276.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_277.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_278.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_279.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_28.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_280.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_281.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_282.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_283.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_284.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_285.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_286.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_287.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_288.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_289.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_29.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_290.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_291.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_292.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_293.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_294.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_295.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_296.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_297.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_298.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_299.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_3.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_30.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_300.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_301.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_302.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_303.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_304.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_305.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_306.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_307.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_308.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_309.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_31.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_310.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_311.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_312.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_313.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_314.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_315.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_316.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_317.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_318.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_319.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_32.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_320.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_321.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_322.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_323.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_324.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_325.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_326.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_327.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_328.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_329.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_33.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_330.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_331.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_332.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_333.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_334.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_335.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_336.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_337.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_338.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_339.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_34.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_340.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_341.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_342.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_343.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_344.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_345.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_346.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_347.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_348.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_349.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_35.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_350.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_351.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_352.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_353.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_354.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_355.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_356.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_357.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_358.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_359.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_36.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_360.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_361.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_362.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_363.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_364.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_365.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_366.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_367.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_368.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_369.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_37.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_370.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_371.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_372.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_373.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_374.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_375.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_376.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_377.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_378.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_379.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_38.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_380.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_381.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_382.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_383.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_384.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_385.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_386.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_387.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_388.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_389.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_39.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_390.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_391.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_392.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_393.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_394.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_395.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_396.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_397.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_398.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_399.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_4.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_40.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_400.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_401.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_402.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_403.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_404.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_405.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_406.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_407.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_408.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_409.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_41.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_410.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_411.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_412.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_413.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_414.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_415.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_416.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_417.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_418.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_419.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_42.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_420.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_421.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_422.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_423.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_424.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_425.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_426.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_427.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_428.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_429.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_43.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_430.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_431.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_432.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_433.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_434.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_435.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_436.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_437.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_438.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_439.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_44.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_440.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_441.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_442.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_443.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_444.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_445.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_446.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_447.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_448.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_449.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_45.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_450.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_451.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_452.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_453.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_454.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_455.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_456.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_457.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_458.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_459.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_46.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_460.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_461.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_462.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_463.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_464.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_465.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_466.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_467.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_468.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_469.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_47.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_470.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_471.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_472.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_473.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_474.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_475.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_476.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_477.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_478.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_479.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_48.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_480.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_481.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_482.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_483.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_484.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_485.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_486.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_487.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_488.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_489.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_49.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_490.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_491.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_492.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_493.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_494.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_495.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_496.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_497.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_498.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_499.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_5.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_50.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_51.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_52.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_53.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_54.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_55.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_56.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_57.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_58.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_59.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_6.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_60.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_61.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_62.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_63.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_64.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_65.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_66.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_67.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_68.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_69.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_7.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_70.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_71.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_72.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_73.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_74.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_75.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_76.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_77.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_78.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_79.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_8.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_80.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_81.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_82.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_83.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_84.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_85.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_86.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_87.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_88.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_89.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_9.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_90.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_91.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_92.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_93.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_94.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_95.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_96.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_97.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_98.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_99.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_0.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_10.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_100.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_101.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_102.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_103.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_104.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_105.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_106.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_107.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_108.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_109.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_11.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_110.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_111.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_112.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_113.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_114.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_115.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_116.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_117.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_118.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_119.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_12.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_120.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_121.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_122.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_123.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_124.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_125.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_126.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_127.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_128.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_129.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_13.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_130.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_131.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_132.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_133.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_134.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_135.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_136.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_137.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_138.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_139.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_14.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_140.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_141.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_142.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_143.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_144.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_145.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_146.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_147.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_148.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_149.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_15.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_150.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_151.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_152.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_153.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_154.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_155.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_156.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_157.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_158.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_159.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_16.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_160.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_161.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_162.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_163.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_164.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_165.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_166.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_167.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_168.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_169.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_17.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_170.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_171.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_172.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_173.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_174.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_175.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_176.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_177.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_178.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_179.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_18.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_180.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_181.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_182.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_183.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_184.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_185.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_186.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_187.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_188.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_189.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_19.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_190.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_191.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_192.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_193.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_194.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_195.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_196.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_197.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_198.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_199.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_20.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_200.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_201.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_202.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_203.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_204.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_205.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_206.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_207.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_208.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_209.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_21.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_210.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_211.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_212.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_213.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_214.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_215.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_216.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_217.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_218.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_219.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_22.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_220.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_221.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_222.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_223.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_224.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_225.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_226.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_227.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_228.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_229.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_23.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_230.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_231.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_232.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_233.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_234.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_235.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_236.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_237.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_238.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_239.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_24.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_240.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_241.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_242.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_243.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_244.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_245.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_246.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_247.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_248.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_249.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_25.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_250.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_251.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_252.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_253.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_254.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_255.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_256.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_257.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_258.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_259.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_26.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_260.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_261.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_262.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_263.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_264.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_265.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_266.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_267.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_268.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_269.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_27.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_270.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_271.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_272.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_273.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_274.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_275.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_276.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_277.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_278.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_279.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_28.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_280.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_281.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_282.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_283.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_284.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_285.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_286.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_287.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_288.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_289.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_29.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_290.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_291.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_292.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_293.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_294.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_295.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_296.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_297.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_298.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_299.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_30.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_300.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_301.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_302.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_303.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_304.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_305.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_306.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_307.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_308.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_309.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_31.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_310.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_311.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_312.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_313.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_314.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_315.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_316.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_317.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_318.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_319.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_32.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_320.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_321.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_322.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_323.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_324.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_325.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_326.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_327.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_328.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_329.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_33.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_330.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_331.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_332.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_333.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_334.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_335.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_336.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_337.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_338.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_339.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_34.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_340.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_341.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_342.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_343.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_344.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_345.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_346.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_347.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_348.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_349.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_35.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_350.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_351.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_352.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_353.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_354.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_355.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_356.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_357.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_358.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_359.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_36.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_360.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_361.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_362.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_363.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_364.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_365.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_366.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_367.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_368.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_369.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_37.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_370.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_371.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_372.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_373.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_374.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_375.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_376.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_377.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_378.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_379.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_38.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_380.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_381.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_382.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_383.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_384.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_385.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_386.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_387.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_388.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_389.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_39.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_390.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_391.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_392.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_393.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_394.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_395.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_396.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_397.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_398.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_399.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_4.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_40.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_400.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_401.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_402.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_403.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_404.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_405.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_406.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_407.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_408.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_409.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_41.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_410.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_411.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_412.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_413.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_414.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_415.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_416.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_417.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_418.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_419.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_42.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_420.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_421.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_422.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_423.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_424.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_425.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_426.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_427.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_428.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_429.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_43.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_430.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_431.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_432.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_433.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_434.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_435.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_436.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_437.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_438.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_439.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_44.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_440.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_441.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_442.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_443.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_444.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_445.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_446.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_447.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_448.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_449.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_45.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_450.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_451.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_452.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_453.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_454.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_455.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_456.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_457.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_458.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_459.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_46.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_460.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_461.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_462.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_463.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_464.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_465.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_466.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_467.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_468.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_469.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_47.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_470.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_471.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_472.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_473.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_474.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_475.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_476.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_477.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_478.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_479.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_48.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_480.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_481.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_482.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_483.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_484.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_485.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_486.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_487.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_488.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_489.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_49.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_490.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_491.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_492.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_493.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_494.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_495.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_496.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_497.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_498.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_499.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_5.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_50.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_51.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_52.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_53.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_54.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_55.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_56.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_57.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_58.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_59.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_6.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_60.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_61.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_62.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_63.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_64.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_65.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_66.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_67.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_68.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_69.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_7.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_70.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_71.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_72.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_73.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_74.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_75.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_76.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_77.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_78.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_79.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_8.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_80.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_81.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_82.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_83.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_84.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_85.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_86.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_87.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_88.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_89.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_9.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_90.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_91.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_92.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_93.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_94.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_95.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_96.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_97.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_98.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_99.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 create mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 create mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_0.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_0.smt2 new file mode 100644 index 000000000..688775281 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_0.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_1.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_1.smt2 new file mode 100644 index 000000000..3d016f653 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_1.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_10.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_10.smt2 new file mode 100644 index 000000000..903f2cc7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_10.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_100.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_100.smt2 new file mode 100644 index 000000000..992523ca7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_100.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_101.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_101.smt2 new file mode 100644 index 000000000..6674e1b1a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_101.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_102.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_102.smt2 new file mode 100644 index 000000000..1a2932bb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_102.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_103.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_103.smt2 new file mode 100644 index 000000000..c56df0942 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_103.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_104.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_104.smt2 new file mode 100644 index 000000000..1022648ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_104.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_105.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_105.smt2 new file mode 100644 index 000000000..b04c1b78d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_105.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_106.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_106.smt2 new file mode 100644 index 000000000..89052af62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_106.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_107.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_107.smt2 new file mode 100644 index 000000000..00037c5a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_107.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_108.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_108.smt2 new file mode 100644 index 000000000..9dfb53e5a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_108.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_109.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_109.smt2 new file mode 100644 index 000000000..323a3a6ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_109.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_11.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_11.smt2 new file mode 100644 index 000000000..0566ab2cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_11.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_110.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_110.smt2 new file mode 100644 index 000000000..426d61489 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_110.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_111.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_111.smt2 new file mode 100644 index 000000000..9a6c5655e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_111.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_112.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_112.smt2 new file mode 100644 index 000000000..2d101ce1a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_112.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_113.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_113.smt2 new file mode 100644 index 000000000..84d76c2b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_113.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_114.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_114.smt2 new file mode 100644 index 000000000..bc7c2e770 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_114.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_115.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_115.smt2 new file mode 100644 index 000000000..79d2efc6a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_115.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_116.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_116.smt2 new file mode 100644 index 000000000..7d7b8b436 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_116.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_117.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_117.smt2 new file mode 100644 index 000000000..b5fcaf905 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_117.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_118.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_118.smt2 new file mode 100644 index 000000000..200acbb46 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_118.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_119.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_119.smt2 new file mode 100644 index 000000000..dc5ad43c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_119.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_12.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_12.smt2 new file mode 100644 index 000000000..d745791f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_12.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_120.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_120.smt2 new file mode 100644 index 000000000..68ebf03e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_120.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_121.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_121.smt2 new file mode 100644 index 000000000..5fe34bfb2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_121.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_122.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_122.smt2 new file mode 100644 index 000000000..da72a1ea8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_122.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_123.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_123.smt2 new file mode 100644 index 000000000..1ac2313ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_123.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_124.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_124.smt2 new file mode 100644 index 000000000..c92ac5d18 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_124.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_125.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_125.smt2 new file mode 100644 index 000000000..0687f401f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_125.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_126.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_126.smt2 new file mode 100644 index 000000000..c3e0b61b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_126.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_127.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_127.smt2 new file mode 100644 index 000000000..72d8aa75a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_127.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_128.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_128.smt2 new file mode 100644 index 000000000..159f46a7d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_128.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_129.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_129.smt2 new file mode 100644 index 000000000..48c137beb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_129.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_13.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_13.smt2 new file mode 100644 index 000000000..a2b092012 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_13.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_130.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_130.smt2 new file mode 100644 index 000000000..252e90c4d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_130.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_131.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_131.smt2 new file mode 100644 index 000000000..54fbed004 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_131.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_132.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_132.smt2 new file mode 100644 index 000000000..4b5934f32 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_132.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_133.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_133.smt2 new file mode 100644 index 000000000..71971db9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_133.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_134.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_134.smt2 new file mode 100644 index 000000000..c226fe72f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_134.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_135.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_135.smt2 new file mode 100644 index 000000000..a24e1a4b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_135.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_136.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_136.smt2 new file mode 100644 index 000000000..799337ac4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_136.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_137.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_137.smt2 new file mode 100644 index 000000000..0fe00e27b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_137.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_138.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_138.smt2 new file mode 100644 index 000000000..7b8c88b14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_138.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_139.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_139.smt2 new file mode 100644 index 000000000..6cc55125d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_139.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_14.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_14.smt2 new file mode 100644 index 000000000..e3dbe041e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_14.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_140.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_140.smt2 new file mode 100644 index 000000000..8871eeb9d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_140.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_141.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_141.smt2 new file mode 100644 index 000000000..4c7674b03 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_141.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_142.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_142.smt2 new file mode 100644 index 000000000..290d81970 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_142.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_143.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_143.smt2 new file mode 100644 index 000000000..e8112f2cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_143.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_144.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_144.smt2 new file mode 100644 index 000000000..b0ff21adf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_144.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_145.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_145.smt2 new file mode 100644 index 000000000..a4cf76623 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_145.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_146.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_146.smt2 new file mode 100644 index 000000000..27b92523a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_146.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_147.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_147.smt2 new file mode 100644 index 000000000..aefcc370c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_147.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_148.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_148.smt2 new file mode 100644 index 000000000..97ae04370 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_148.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_149.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_149.smt2 new file mode 100644 index 000000000..dabd123aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_149.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_15.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_15.smt2 new file mode 100644 index 000000000..57bccccf6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_15.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_150.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_150.smt2 new file mode 100644 index 000000000..6e8589daa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_150.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_151.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_151.smt2 new file mode 100644 index 000000000..c66eeb63d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_151.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_152.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_152.smt2 new file mode 100644 index 000000000..b1afa363d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_152.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_153.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_153.smt2 new file mode 100644 index 000000000..813ecb9b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_153.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_154.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_154.smt2 new file mode 100644 index 000000000..4aa46104e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_154.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_155.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_155.smt2 new file mode 100644 index 000000000..bfacae467 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_155.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_156.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_156.smt2 new file mode 100644 index 000000000..0b278641e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_156.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_157.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_157.smt2 new file mode 100644 index 000000000..3dbfdef40 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_157.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_158.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_158.smt2 new file mode 100644 index 000000000..ca2a8c116 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_158.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_159.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_159.smt2 new file mode 100644 index 000000000..328c5edd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_159.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_16.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_16.smt2 new file mode 100644 index 000000000..642d0dad5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_16.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_160.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_160.smt2 new file mode 100644 index 000000000..0443479f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_160.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_161.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_161.smt2 new file mode 100644 index 000000000..895742811 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_161.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_162.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_162.smt2 new file mode 100644 index 000000000..c741454fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_162.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_163.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_163.smt2 new file mode 100644 index 000000000..fe7e465c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_163.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_164.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_164.smt2 new file mode 100644 index 000000000..8991ae97f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_164.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_165.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_165.smt2 new file mode 100644 index 000000000..2918a9f21 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_165.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_166.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_166.smt2 new file mode 100644 index 000000000..f96c5b43c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_166.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_167.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_167.smt2 new file mode 100644 index 000000000..c4769f4a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_167.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_168.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_168.smt2 new file mode 100644 index 000000000..3e90a4c93 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_168.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_169.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_169.smt2 new file mode 100644 index 000000000..e967e2dcd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_169.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_17.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_17.smt2 new file mode 100644 index 000000000..58030365f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_17.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_170.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_170.smt2 new file mode 100644 index 000000000..767619ced --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_170.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_171.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_171.smt2 new file mode 100644 index 000000000..4ad8f5058 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_171.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_172.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_172.smt2 new file mode 100644 index 000000000..eb179b75a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_172.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_173.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_173.smt2 new file mode 100644 index 000000000..946a0ad07 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_173.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_174.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_174.smt2 new file mode 100644 index 000000000..c94981345 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_174.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_175.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_175.smt2 new file mode 100644 index 000000000..3e3cc1685 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_175.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_176.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_176.smt2 new file mode 100644 index 000000000..d9a16e4b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_176.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_177.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_177.smt2 new file mode 100644 index 000000000..b1b9674e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_177.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_178.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_178.smt2 new file mode 100644 index 000000000..b8facaf8f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_178.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_179.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_179.smt2 new file mode 100644 index 000000000..2456d3e4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_179.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_18.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_18.smt2 new file mode 100644 index 000000000..d92f4fa7b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_18.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_180.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_180.smt2 new file mode 100644 index 000000000..caedbd29c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_180.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_181.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_181.smt2 new file mode 100644 index 000000000..c9ccfb1cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_181.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_182.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_182.smt2 new file mode 100644 index 000000000..cb2275b46 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_182.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_183.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_183.smt2 new file mode 100644 index 000000000..e13040d01 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_183.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_184.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_184.smt2 new file mode 100644 index 000000000..cfc20516a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_184.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_185.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_185.smt2 new file mode 100644 index 000000000..b8e7003e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_185.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_186.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_186.smt2 new file mode 100644 index 000000000..0a2f849c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_186.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_187.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_187.smt2 new file mode 100644 index 000000000..e7ca90630 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_187.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_188.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_188.smt2 new file mode 100644 index 000000000..9833c0d4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_188.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_189.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_189.smt2 new file mode 100644 index 000000000..68df247cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_189.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_19.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_19.smt2 new file mode 100644 index 000000000..5f903ec99 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_19.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_190.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_190.smt2 new file mode 100644 index 000000000..141288fa7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_190.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_191.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_191.smt2 new file mode 100644 index 000000000..ceeb4ed24 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_191.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_192.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_192.smt2 new file mode 100644 index 000000000..911bf8c56 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_192.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_193.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_193.smt2 new file mode 100644 index 000000000..615fa5dff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_193.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_194.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_194.smt2 new file mode 100644 index 000000000..1b45c7469 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_194.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_195.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_195.smt2 new file mode 100644 index 000000000..c464ea763 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_195.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_196.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_196.smt2 new file mode 100644 index 000000000..1dc2f6514 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_196.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_197.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_197.smt2 new file mode 100644 index 000000000..630a41d4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_197.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_198.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_198.smt2 new file mode 100644 index 000000000..9485678d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_198.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_199.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_199.smt2 new file mode 100644 index 000000000..3188321e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_199.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_2.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_2.smt2 new file mode 100644 index 000000000..8b6a76475 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_2.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_20.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_20.smt2 new file mode 100644 index 000000000..80f86d355 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_20.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_200.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_200.smt2 new file mode 100644 index 000000000..f28819d3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_200.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_201.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_201.smt2 new file mode 100644 index 000000000..413544149 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_201.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_202.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_202.smt2 new file mode 100644 index 000000000..9c5ab42b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_202.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_203.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_203.smt2 new file mode 100644 index 000000000..f444f0805 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_203.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_204.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_204.smt2 new file mode 100644 index 000000000..e3e4773ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_204.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_205.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_205.smt2 new file mode 100644 index 000000000..c4a3e82e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_205.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_206.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_206.smt2 new file mode 100644 index 000000000..aa1bf9143 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_206.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_207.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_207.smt2 new file mode 100644 index 000000000..5c4a97f5d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_207.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_208.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_208.smt2 new file mode 100644 index 000000000..e288b3ca6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_208.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_209.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_209.smt2 new file mode 100644 index 000000000..c7c5a17cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_209.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_21.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_21.smt2 new file mode 100644 index 000000000..11c7c577c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_21.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_210.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_210.smt2 new file mode 100644 index 000000000..2498619dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_210.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_211.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_211.smt2 new file mode 100644 index 000000000..1e161c832 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_211.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_212.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_212.smt2 new file mode 100644 index 000000000..2c55f0192 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_212.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_213.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_213.smt2 new file mode 100644 index 000000000..cf75a57ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_213.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_214.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_214.smt2 new file mode 100644 index 000000000..7baa6bf55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_214.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_215.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_215.smt2 new file mode 100644 index 000000000..78e3ae46d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_215.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_216.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_216.smt2 new file mode 100644 index 000000000..a14d175d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_216.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_217.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_217.smt2 new file mode 100644 index 000000000..78e8a6280 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_217.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_218.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_218.smt2 new file mode 100644 index 000000000..387ba90d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_218.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_219.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_219.smt2 new file mode 100644 index 000000000..d561b2009 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_219.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_22.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_22.smt2 new file mode 100644 index 000000000..2f8e53b44 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_22.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_220.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_220.smt2 new file mode 100644 index 000000000..d2152c43a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_220.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_221.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_221.smt2 new file mode 100644 index 000000000..daaeae6dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_221.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_222.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_222.smt2 new file mode 100644 index 000000000..2a8c96825 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_222.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_223.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_223.smt2 new file mode 100644 index 000000000..852f7112c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_223.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_224.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_224.smt2 new file mode 100644 index 000000000..bf0a5e0b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_224.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_225.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_225.smt2 new file mode 100644 index 000000000..53701ead7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_225.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_226.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_226.smt2 new file mode 100644 index 000000000..cf5fd7be9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_226.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_227.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_227.smt2 new file mode 100644 index 000000000..7e8bd66fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_227.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_228.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_228.smt2 new file mode 100644 index 000000000..97eb5eff5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_228.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_229.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_229.smt2 new file mode 100644 index 000000000..484a0d990 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_229.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_23.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_23.smt2 new file mode 100644 index 000000000..9660dc900 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_23.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_230.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_230.smt2 new file mode 100644 index 000000000..fc10a3d5d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_230.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_231.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_231.smt2 new file mode 100644 index 000000000..761ba5e81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_231.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_232.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_232.smt2 new file mode 100644 index 000000000..f7e5f885d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_232.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_233.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_233.smt2 new file mode 100644 index 000000000..b8795b09c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_233.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_234.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_234.smt2 new file mode 100644 index 000000000..a75d8c3af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_234.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_235.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_235.smt2 new file mode 100644 index 000000000..3ccc464bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_235.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_236.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_236.smt2 new file mode 100644 index 000000000..905698b56 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_236.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_237.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_237.smt2 new file mode 100644 index 000000000..9301b1164 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_237.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_238.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_238.smt2 new file mode 100644 index 000000000..043f6f981 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_238.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_239.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_239.smt2 new file mode 100644 index 000000000..27884aa5d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_239.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_24.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_24.smt2 new file mode 100644 index 000000000..220904071 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_24.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_240.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_240.smt2 new file mode 100644 index 000000000..262cfe793 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_240.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_241.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_241.smt2 new file mode 100644 index 000000000..e99d368cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_241.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_242.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_242.smt2 new file mode 100644 index 000000000..6143da8b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_242.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_243.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_243.smt2 new file mode 100644 index 000000000..df711dbce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_243.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_244.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_244.smt2 new file mode 100644 index 000000000..10beeabc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_244.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_245.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_245.smt2 new file mode 100644 index 000000000..c68f75128 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_245.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_246.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_246.smt2 new file mode 100644 index 000000000..2a0c38cf6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_246.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_247.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_247.smt2 new file mode 100644 index 000000000..75c18e785 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_247.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_248.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_248.smt2 new file mode 100644 index 000000000..080b016eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_248.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_249.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_249.smt2 new file mode 100644 index 000000000..59178dec8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_249.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_25.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_25.smt2 new file mode 100644 index 000000000..2be7f55ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_25.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_250.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_250.smt2 new file mode 100644 index 000000000..504fd41d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_250.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_251.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_251.smt2 new file mode 100644 index 000000000..1636cb496 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_251.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_252.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_252.smt2 new file mode 100644 index 000000000..4ad81ec39 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_252.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_253.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_253.smt2 new file mode 100644 index 000000000..4a3db927b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_253.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_254.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_254.smt2 new file mode 100644 index 000000000..cde920ff7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_254.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_255.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_255.smt2 new file mode 100644 index 000000000..baea72d43 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_255.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_256.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_256.smt2 new file mode 100644 index 000000000..258dff405 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_256.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_257.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_257.smt2 new file mode 100644 index 000000000..65f28c10d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_257.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_258.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_258.smt2 new file mode 100644 index 000000000..10f839430 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_258.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_259.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_259.smt2 new file mode 100644 index 000000000..2dd697124 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_259.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_26.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_26.smt2 new file mode 100644 index 000000000..24b2eff55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_26.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_260.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_260.smt2 new file mode 100644 index 000000000..7a7a70216 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_260.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_261.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_261.smt2 new file mode 100644 index 000000000..879317a11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_261.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_262.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_262.smt2 new file mode 100644 index 000000000..437eef7c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_262.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_263.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_263.smt2 new file mode 100644 index 000000000..92c702eda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_263.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_264.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_264.smt2 new file mode 100644 index 000000000..1c8899a4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_264.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_265.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_265.smt2 new file mode 100644 index 000000000..76db4ff61 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_265.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_266.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_266.smt2 new file mode 100644 index 000000000..ef73492cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_266.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_267.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_267.smt2 new file mode 100644 index 000000000..0ea6c7642 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_267.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_268.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_268.smt2 new file mode 100644 index 000000000..0d4cf4c01 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_268.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_269.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_269.smt2 new file mode 100644 index 000000000..5018d3088 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_269.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_27.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_27.smt2 new file mode 100644 index 000000000..9f795d8e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_27.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_270.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_270.smt2 new file mode 100644 index 000000000..fa9f99a7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_270.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_271.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_271.smt2 new file mode 100644 index 000000000..431819f95 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_271.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_272.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_272.smt2 new file mode 100644 index 000000000..c3aa6a8c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_272.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_273.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_273.smt2 new file mode 100644 index 000000000..e8791f93f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_273.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_274.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_274.smt2 new file mode 100644 index 000000000..543caebd0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_274.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_275.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_275.smt2 new file mode 100644 index 000000000..456bddbbe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_275.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_276.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_276.smt2 new file mode 100644 index 000000000..a97750bcd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_276.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_277.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_277.smt2 new file mode 100644 index 000000000..b3835c809 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_277.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_278.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_278.smt2 new file mode 100644 index 000000000..f688c894e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_278.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_279.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_279.smt2 new file mode 100644 index 000000000..c52fd92a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_279.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_28.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_28.smt2 new file mode 100644 index 000000000..4e5b47a7f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_28.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_280.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_280.smt2 new file mode 100644 index 000000000..74093ca37 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_280.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_281.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_281.smt2 new file mode 100644 index 000000000..ec3a751b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_281.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_282.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_282.smt2 new file mode 100644 index 000000000..293777c17 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_282.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_283.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_283.smt2 new file mode 100644 index 000000000..f1a377421 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_283.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_284.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_284.smt2 new file mode 100644 index 000000000..13d8c0d82 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_284.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_285.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_285.smt2 new file mode 100644 index 000000000..9f5b465c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_285.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_286.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_286.smt2 new file mode 100644 index 000000000..c4f0d7487 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_286.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_287.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_287.smt2 new file mode 100644 index 000000000..dc2da558c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_287.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_288.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_288.smt2 new file mode 100644 index 000000000..396adfd23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_288.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_289.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_289.smt2 new file mode 100644 index 000000000..b1966798b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_289.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_29.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_29.smt2 new file mode 100644 index 000000000..765af5d5f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_29.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_290.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_290.smt2 new file mode 100644 index 000000000..846181dbb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_290.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_291.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_291.smt2 new file mode 100644 index 000000000..34bf0c19e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_291.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_292.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_292.smt2 new file mode 100644 index 000000000..0ab8ef8ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_292.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_293.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_293.smt2 new file mode 100644 index 000000000..15eedec95 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_293.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_294.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_294.smt2 new file mode 100644 index 000000000..ca6c6358e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_294.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_295.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_295.smt2 new file mode 100644 index 000000000..9ff4bbc9a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_295.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_296.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_296.smt2 new file mode 100644 index 000000000..63bf8de0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_296.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_297.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_297.smt2 new file mode 100644 index 000000000..f6db6d2d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_297.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_298.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_298.smt2 new file mode 100644 index 000000000..12a0f9b19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_298.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_299.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_299.smt2 new file mode 100644 index 000000000..92f13b9b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_299.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_3.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_3.smt2 new file mode 100644 index 000000000..9326e6031 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_3.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_30.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_30.smt2 new file mode 100644 index 000000000..9bc1ee45a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_30.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_300.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_300.smt2 new file mode 100644 index 000000000..42aa02325 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_300.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_301.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_301.smt2 new file mode 100644 index 000000000..7b1a51e4d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_301.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_302.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_302.smt2 new file mode 100644 index 000000000..8b9f56a83 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_302.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_303.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_303.smt2 new file mode 100644 index 000000000..eb1b7c0e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_303.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_304.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_304.smt2 new file mode 100644 index 000000000..4056f1435 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_304.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_305.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_305.smt2 new file mode 100644 index 000000000..5877e3f37 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_305.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_306.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_306.smt2 new file mode 100644 index 000000000..bee16aebd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_306.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_307.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_307.smt2 new file mode 100644 index 000000000..b545d4cda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_307.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_308.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_308.smt2 new file mode 100644 index 000000000..ad39cce76 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_308.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_309.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_309.smt2 new file mode 100644 index 000000000..6a3814cf9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_309.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_31.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_31.smt2 new file mode 100644 index 000000000..a20453d03 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_31.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_310.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_310.smt2 new file mode 100644 index 000000000..370b234b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_310.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_311.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_311.smt2 new file mode 100644 index 000000000..4123e2aa2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_311.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_312.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_312.smt2 new file mode 100644 index 000000000..ba6394238 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_312.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_313.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_313.smt2 new file mode 100644 index 000000000..03a99d896 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_313.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_314.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_314.smt2 new file mode 100644 index 000000000..19baebd72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_314.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_315.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_315.smt2 new file mode 100644 index 000000000..5486363ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_315.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_316.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_316.smt2 new file mode 100644 index 000000000..be82ea6a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_316.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_317.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_317.smt2 new file mode 100644 index 000000000..10c73a5dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_317.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_318.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_318.smt2 new file mode 100644 index 000000000..83dc8ee5a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_318.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_319.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_319.smt2 new file mode 100644 index 000000000..c5e3e5fbc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_319.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_32.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_32.smt2 new file mode 100644 index 000000000..c30e8210d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_32.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_320.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_320.smt2 new file mode 100644 index 000000000..f4f02a2b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_320.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_321.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_321.smt2 new file mode 100644 index 000000000..37bdbdeea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_321.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_322.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_322.smt2 new file mode 100644 index 000000000..09e6a3601 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_322.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_323.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_323.smt2 new file mode 100644 index 000000000..711b6fb80 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_323.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_324.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_324.smt2 new file mode 100644 index 000000000..26ae92310 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_324.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_325.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_325.smt2 new file mode 100644 index 000000000..3f97bc761 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_325.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_326.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_326.smt2 new file mode 100644 index 000000000..48c3dd70d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_326.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_327.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_327.smt2 new file mode 100644 index 000000000..f30ac6c87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_327.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_328.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_328.smt2 new file mode 100644 index 000000000..37e434c31 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_328.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_329.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_329.smt2 new file mode 100644 index 000000000..fa9cedcd2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_329.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_33.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_33.smt2 new file mode 100644 index 000000000..763260d80 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_33.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_330.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_330.smt2 new file mode 100644 index 000000000..fb92b08de --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_330.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_331.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_331.smt2 new file mode 100644 index 000000000..fe8b0c7e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_331.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_332.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_332.smt2 new file mode 100644 index 000000000..14f732004 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_332.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_333.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_333.smt2 new file mode 100644 index 000000000..9ec7943dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_333.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_334.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_334.smt2 new file mode 100644 index 000000000..93671222b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_334.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_335.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_335.smt2 new file mode 100644 index 000000000..7b5e4fe29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_335.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_336.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_336.smt2 new file mode 100644 index 000000000..0714fd185 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_336.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_337.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_337.smt2 new file mode 100644 index 000000000..fe55bcfc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_337.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_338.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_338.smt2 new file mode 100644 index 000000000..2742955fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_338.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_339.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_339.smt2 new file mode 100644 index 000000000..4a4651d2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_339.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_34.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_34.smt2 new file mode 100644 index 000000000..04d415e29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_34.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_340.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_340.smt2 new file mode 100644 index 000000000..9d3d65a3e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_340.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_341.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_341.smt2 new file mode 100644 index 000000000..ea6ce4834 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_341.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_342.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_342.smt2 new file mode 100644 index 000000000..f5793b4d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_342.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_343.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_343.smt2 new file mode 100644 index 000000000..03e69cb8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_343.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_344.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_344.smt2 new file mode 100644 index 000000000..7f827c972 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_344.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_345.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_345.smt2 new file mode 100644 index 000000000..7107f5db6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_345.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_346.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_346.smt2 new file mode 100644 index 000000000..c09a73e19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_346.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_347.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_347.smt2 new file mode 100644 index 000000000..80aaa0a8a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_347.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_348.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_348.smt2 new file mode 100644 index 000000000..140031a2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_348.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_349.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_349.smt2 new file mode 100644 index 000000000..477634ed7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_349.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_35.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_35.smt2 new file mode 100644 index 000000000..d339f5251 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_35.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_350.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_350.smt2 new file mode 100644 index 000000000..9eb32b998 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_350.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_351.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_351.smt2 new file mode 100644 index 000000000..31a8ba625 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_351.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_352.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_352.smt2 new file mode 100644 index 000000000..222723bd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_352.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_353.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_353.smt2 new file mode 100644 index 000000000..e172d7c6b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_353.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_354.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_354.smt2 new file mode 100644 index 000000000..e791bc46f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_354.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_355.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_355.smt2 new file mode 100644 index 000000000..057fcb1d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_355.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_356.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_356.smt2 new file mode 100644 index 000000000..55aaae230 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_356.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_357.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_357.smt2 new file mode 100644 index 000000000..0ec802489 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_357.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_358.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_358.smt2 new file mode 100644 index 000000000..04032df14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_358.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_359.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_359.smt2 new file mode 100644 index 000000000..bb63db739 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_359.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_36.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_36.smt2 new file mode 100644 index 000000000..6889b7832 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_36.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_360.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_360.smt2 new file mode 100644 index 000000000..3bf2eba7c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_360.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_361.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_361.smt2 new file mode 100644 index 000000000..0ded8bba3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_361.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_362.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_362.smt2 new file mode 100644 index 000000000..6c350c1ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_362.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_363.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_363.smt2 new file mode 100644 index 000000000..acbc98a0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_363.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_364.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_364.smt2 new file mode 100644 index 000000000..390fbd477 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_364.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_365.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_365.smt2 new file mode 100644 index 000000000..a20ffe5a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_365.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_366.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_366.smt2 new file mode 100644 index 000000000..dd96e2f99 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_366.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_367.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_367.smt2 new file mode 100644 index 000000000..91e780475 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_367.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_368.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_368.smt2 new file mode 100644 index 000000000..64051d809 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_368.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_369.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_369.smt2 new file mode 100644 index 000000000..fa642d4a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_369.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_37.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_37.smt2 new file mode 100644 index 000000000..2b47e8f7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_37.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_370.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_370.smt2 new file mode 100644 index 000000000..cea9ef0d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_370.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_371.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_371.smt2 new file mode 100644 index 000000000..ca1cd4666 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_371.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_372.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_372.smt2 new file mode 100644 index 000000000..b18d58d81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_372.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_373.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_373.smt2 new file mode 100644 index 000000000..e0eb487a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_373.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_374.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_374.smt2 new file mode 100644 index 000000000..15e74eafd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_374.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_375.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_375.smt2 new file mode 100644 index 000000000..840980dc5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_375.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_376.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_376.smt2 new file mode 100644 index 000000000..a9aa238dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_376.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_377.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_377.smt2 new file mode 100644 index 000000000..c9d66456b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_377.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_378.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_378.smt2 new file mode 100644 index 000000000..9d173f0cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_378.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_379.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_379.smt2 new file mode 100644 index 000000000..08bba66c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_379.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_38.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_38.smt2 new file mode 100644 index 000000000..bdf481f59 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_38.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_380.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_380.smt2 new file mode 100644 index 000000000..f78f19177 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_380.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_381.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_381.smt2 new file mode 100644 index 000000000..607b55cc1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_381.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_382.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_382.smt2 new file mode 100644 index 000000000..dada6909d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_382.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_383.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_383.smt2 new file mode 100644 index 000000000..02b96384b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_383.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_384.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_384.smt2 new file mode 100644 index 000000000..a2511031e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_384.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_385.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_385.smt2 new file mode 100644 index 000000000..d0a473966 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_385.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_386.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_386.smt2 new file mode 100644 index 000000000..c3384857b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_386.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_387.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_387.smt2 new file mode 100644 index 000000000..01b1c34c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_387.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_388.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_388.smt2 new file mode 100644 index 000000000..5e28f7a86 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_388.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_389.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_389.smt2 new file mode 100644 index 000000000..5a4a16fb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_389.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_39.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_39.smt2 new file mode 100644 index 000000000..80e751168 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_39.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_390.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_390.smt2 new file mode 100644 index 000000000..9292dd956 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_390.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_391.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_391.smt2 new file mode 100644 index 000000000..95eaed72b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_391.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_392.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_392.smt2 new file mode 100644 index 000000000..aada5708d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_392.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_393.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_393.smt2 new file mode 100644 index 000000000..7eda08330 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_393.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_394.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_394.smt2 new file mode 100644 index 000000000..67272e195 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_394.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_395.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_395.smt2 new file mode 100644 index 000000000..8e1f064e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_395.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_396.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_396.smt2 new file mode 100644 index 000000000..85aef34a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_396.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_397.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_397.smt2 new file mode 100644 index 000000000..76f32e6a8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_397.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_398.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_398.smt2 new file mode 100644 index 000000000..ea893eb5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_398.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_399.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_399.smt2 new file mode 100644 index 000000000..8099627ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_399.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_4.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_4.smt2 new file mode 100644 index 000000000..56b1101f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_4.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_40.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_40.smt2 new file mode 100644 index 000000000..20f150a84 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_40.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_400.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_400.smt2 new file mode 100644 index 000000000..c3f0756e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_400.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_401.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_401.smt2 new file mode 100644 index 000000000..b5683c966 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_401.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_402.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_402.smt2 new file mode 100644 index 000000000..8f187df48 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_402.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_403.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_403.smt2 new file mode 100644 index 000000000..41db50b59 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_403.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_404.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_404.smt2 new file mode 100644 index 000000000..47edb645c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_404.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_405.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_405.smt2 new file mode 100644 index 000000000..5682f1788 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_405.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_406.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_406.smt2 new file mode 100644 index 000000000..ec81624d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_406.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_407.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_407.smt2 new file mode 100644 index 000000000..cf3e36f53 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_407.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_408.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_408.smt2 new file mode 100644 index 000000000..6d7993c12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_408.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_409.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_409.smt2 new file mode 100644 index 000000000..1700aaf31 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_409.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_41.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_41.smt2 new file mode 100644 index 000000000..c4e87092d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_41.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_410.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_410.smt2 new file mode 100644 index 000000000..d21a120fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_410.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_411.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_411.smt2 new file mode 100644 index 000000000..893a08a2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_411.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_412.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_412.smt2 new file mode 100644 index 000000000..c3a3ee69a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_412.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_413.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_413.smt2 new file mode 100644 index 000000000..697e10787 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_413.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_414.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_414.smt2 new file mode 100644 index 000000000..a9e25ef6c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_414.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_415.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_415.smt2 new file mode 100644 index 000000000..7e7d14f3a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_415.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_416.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_416.smt2 new file mode 100644 index 000000000..15ea0d01e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_416.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_417.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_417.smt2 new file mode 100644 index 000000000..911881d21 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_417.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_418.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_418.smt2 new file mode 100644 index 000000000..22e0f5d25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_418.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_419.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_419.smt2 new file mode 100644 index 000000000..fa27110f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_419.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_42.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_42.smt2 new file mode 100644 index 000000000..ac4c9df11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_42.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_420.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_420.smt2 new file mode 100644 index 000000000..985cc467c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_420.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_421.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_421.smt2 new file mode 100644 index 000000000..e9ef77996 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_421.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_422.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_422.smt2 new file mode 100644 index 000000000..ac54eb57e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_422.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_423.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_423.smt2 new file mode 100644 index 000000000..1ab11c70d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_423.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_424.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_424.smt2 new file mode 100644 index 000000000..689b61fc0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_424.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_425.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_425.smt2 new file mode 100644 index 000000000..98a71ae58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_425.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_426.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_426.smt2 new file mode 100644 index 000000000..183a45319 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_426.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_427.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_427.smt2 new file mode 100644 index 000000000..167272090 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_427.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_428.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_428.smt2 new file mode 100644 index 000000000..598990ddb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_428.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_429.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_429.smt2 new file mode 100644 index 000000000..b144aff8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_429.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_43.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_43.smt2 new file mode 100644 index 000000000..e86203246 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_43.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_430.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_430.smt2 new file mode 100644 index 000000000..5997a739f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_430.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_431.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_431.smt2 new file mode 100644 index 000000000..872d4e321 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_431.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_432.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_432.smt2 new file mode 100644 index 000000000..3e4bf63d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_432.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_433.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_433.smt2 new file mode 100644 index 000000000..4519a81ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_433.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_434.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_434.smt2 new file mode 100644 index 000000000..466d684ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_434.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_435.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_435.smt2 new file mode 100644 index 000000000..788c7c74b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_435.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_436.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_436.smt2 new file mode 100644 index 000000000..7075f3daa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_436.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_437.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_437.smt2 new file mode 100644 index 000000000..50d60e11c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_437.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_438.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_438.smt2 new file mode 100644 index 000000000..aa60070ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_438.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_439.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_439.smt2 new file mode 100644 index 000000000..b66b39a1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_439.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_44.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_44.smt2 new file mode 100644 index 000000000..cc9c3edc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_44.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_440.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_440.smt2 new file mode 100644 index 000000000..5f7ab0138 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_440.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_441.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_441.smt2 new file mode 100644 index 000000000..66d32d7c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_441.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_442.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_442.smt2 new file mode 100644 index 000000000..42d87a7f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_442.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_443.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_443.smt2 new file mode 100644 index 000000000..c4eabbcfb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_443.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_444.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_444.smt2 new file mode 100644 index 000000000..befec4927 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_444.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_445.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_445.smt2 new file mode 100644 index 000000000..b48745510 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_445.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_446.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_446.smt2 new file mode 100644 index 000000000..fe6cbc3bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_446.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_447.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_447.smt2 new file mode 100644 index 000000000..bd81bb204 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_447.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_448.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_448.smt2 new file mode 100644 index 000000000..024fdb0b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_448.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_449.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_449.smt2 new file mode 100644 index 000000000..4d4128710 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_449.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_45.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_45.smt2 new file mode 100644 index 000000000..459a28044 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_45.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_450.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_450.smt2 new file mode 100644 index 000000000..40d64262d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_450.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_451.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_451.smt2 new file mode 100644 index 000000000..ae8642869 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_451.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_452.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_452.smt2 new file mode 100644 index 000000000..e2822bfd2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_452.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_453.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_453.smt2 new file mode 100644 index 000000000..2e0dce829 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_453.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_454.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_454.smt2 new file mode 100644 index 000000000..61d64c78d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_454.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_455.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_455.smt2 new file mode 100644 index 000000000..187e78cca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_455.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_456.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_456.smt2 new file mode 100644 index 000000000..256a8813a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_456.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_457.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_457.smt2 new file mode 100644 index 000000000..a0067c0ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_457.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_458.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_458.smt2 new file mode 100644 index 000000000..bc0682071 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_458.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_459.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_459.smt2 new file mode 100644 index 000000000..88167128e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_459.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_46.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_46.smt2 new file mode 100644 index 000000000..a37ab4b90 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_46.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_460.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_460.smt2 new file mode 100644 index 000000000..1b5047f03 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_460.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_461.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_461.smt2 new file mode 100644 index 000000000..cdf68b588 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_461.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_462.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_462.smt2 new file mode 100644 index 000000000..c4befdeff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_462.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_463.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_463.smt2 new file mode 100644 index 000000000..de1d9b754 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_463.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_464.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_464.smt2 new file mode 100644 index 000000000..bd4894f9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_464.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_465.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_465.smt2 new file mode 100644 index 000000000..4d8c4f190 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_465.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_466.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_466.smt2 new file mode 100644 index 000000000..adf3ac5c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_466.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_467.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_467.smt2 new file mode 100644 index 000000000..3b13b93cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_467.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_468.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_468.smt2 new file mode 100644 index 000000000..eae27818e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_468.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_469.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_469.smt2 new file mode 100644 index 000000000..2ce1a4b44 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_469.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_47.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_47.smt2 new file mode 100644 index 000000000..d0b9e6a91 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_47.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_470.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_470.smt2 new file mode 100644 index 000000000..53985573f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_470.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_471.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_471.smt2 new file mode 100644 index 000000000..b6ed286ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_471.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_472.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_472.smt2 new file mode 100644 index 000000000..cee01597d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_472.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_473.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_473.smt2 new file mode 100644 index 000000000..be5b1fc82 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_473.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_474.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_474.smt2 new file mode 100644 index 000000000..2b7f19bad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_474.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_475.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_475.smt2 new file mode 100644 index 000000000..5812caa86 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_475.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_476.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_476.smt2 new file mode 100644 index 000000000..9a675b1fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_476.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_477.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_477.smt2 new file mode 100644 index 000000000..f30c010a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_477.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_478.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_478.smt2 new file mode 100644 index 000000000..d3f6919cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_478.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_479.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_479.smt2 new file mode 100644 index 000000000..ec95538a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_479.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_48.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_48.smt2 new file mode 100644 index 000000000..56dab0a95 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_48.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_480.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_480.smt2 new file mode 100644 index 000000000..aede613f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_480.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_481.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_481.smt2 new file mode 100644 index 000000000..ad25ea57d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_481.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_482.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_482.smt2 new file mode 100644 index 000000000..e08fed63f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_482.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_483.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_483.smt2 new file mode 100644 index 000000000..18686e430 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_483.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_484.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_484.smt2 new file mode 100644 index 000000000..f4f3611f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_484.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_485.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_485.smt2 new file mode 100644 index 000000000..6054acceb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_485.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_486.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_486.smt2 new file mode 100644 index 000000000..b3d31f593 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_486.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_487.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_487.smt2 new file mode 100644 index 000000000..412dd8f07 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_487.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_488.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_488.smt2 new file mode 100644 index 000000000..8654b0e2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_488.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_489.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_489.smt2 new file mode 100644 index 000000000..0a7d814f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_489.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_49.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_49.smt2 new file mode 100644 index 000000000..010cd9825 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_49.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_490.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_490.smt2 new file mode 100644 index 000000000..9da228d03 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_490.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_491.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_491.smt2 new file mode 100644 index 000000000..cc0af080d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_491.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_492.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_492.smt2 new file mode 100644 index 000000000..8ccf72c2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_492.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_493.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_493.smt2 new file mode 100644 index 000000000..e3c3b6405 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_493.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_494.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_494.smt2 new file mode 100644 index 000000000..e173962ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_494.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_495.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_495.smt2 new file mode 100644 index 000000000..506c36d66 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_495.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_496.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_496.smt2 new file mode 100644 index 000000000..1dd271820 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_496.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_497.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_497.smt2 new file mode 100644 index 000000000..5a1b3d711 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_497.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_498.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_498.smt2 new file mode 100644 index 000000000..626240b10 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_498.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_499.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_499.smt2 new file mode 100644 index 000000000..ff7b2e487 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_499.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_5.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_5.smt2 new file mode 100644 index 000000000..aa45d7040 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_5.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_50.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_50.smt2 new file mode 100644 index 000000000..019413d58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_50.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 new file mode 100644 index 000000000..d06b8c241 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 new file mode 100644 index 000000000..3d1753d75 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 new file mode 100644 index 000000000..1774a4e97 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 new file mode 100644 index 000000000..8d52629e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 new file mode 100644 index 000000000..c2b9cdade --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 new file mode 100644 index 000000000..979f93232 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 new file mode 100644 index 000000000..7064b1d72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 new file mode 100644 index 000000000..27910081c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 new file mode 100644 index 000000000..99df2b42e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 new file mode 100644 index 000000000..a13320360 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_51.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_51.smt2 new file mode 100644 index 000000000..3ba2c8576 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_51.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 new file mode 100644 index 000000000..70f6bd091 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 new file mode 100644 index 000000000..ad56a9d64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 new file mode 100644 index 000000000..23ed9d4b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 new file mode 100644 index 000000000..87a9521ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 new file mode 100644 index 000000000..857498f62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 new file mode 100644 index 000000000..b186b19bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 new file mode 100644 index 000000000..f109e9fc8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 new file mode 100644 index 000000000..11c355837 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 new file mode 100644 index 000000000..c1b924e3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 new file mode 100644 index 000000000..0f6c0e769 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_52.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_52.smt2 new file mode 100644 index 000000000..a4714ff1b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_52.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 new file mode 100644 index 000000000..74bf9aeec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 new file mode 100644 index 000000000..f78553784 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 new file mode 100644 index 000000000..e763fbf53 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 new file mode 100644 index 000000000..67ecf5802 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 new file mode 100644 index 000000000..c96708115 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 new file mode 100644 index 000000000..0a8f8d070 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 new file mode 100644 index 000000000..813a16fac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 new file mode 100644 index 000000000..eee6fe449 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 new file mode 100644 index 000000000..b260b4b85 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 new file mode 100644 index 000000000..5407795f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_53.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_53.smt2 new file mode 100644 index 000000000..453d9bef8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_53.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 new file mode 100644 index 000000000..22797f13e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 new file mode 100644 index 000000000..39c450d65 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 new file mode 100644 index 000000000..58c86cbc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 new file mode 100644 index 000000000..cc550a57f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 new file mode 100644 index 000000000..f9c8d4d10 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 new file mode 100644 index 000000000..0efce6a12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 new file mode 100644 index 000000000..f3776c4c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 new file mode 100644 index 000000000..46d6f9683 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 new file mode 100644 index 000000000..3b3dc83f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 new file mode 100644 index 000000000..c041c1b83 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_54.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_54.smt2 new file mode 100644 index 000000000..b223cb480 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_54.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 new file mode 100644 index 000000000..84e91ba0c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 new file mode 100644 index 000000000..6bc19df3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 new file mode 100644 index 000000000..93661fb80 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 new file mode 100644 index 000000000..a7395211c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 new file mode 100644 index 000000000..5295aef33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 new file mode 100644 index 000000000..b27aea512 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 new file mode 100644 index 000000000..7488571c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 new file mode 100644 index 000000000..f69d5ba33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 new file mode 100644 index 000000000..0d2031f08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 new file mode 100644 index 000000000..a0abbc2b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_55.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_55.smt2 new file mode 100644 index 000000000..847cc147a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_55.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 new file mode 100644 index 000000000..5fda56591 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 new file mode 100644 index 000000000..333b0b641 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 new file mode 100644 index 000000000..710c8a555 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 new file mode 100644 index 000000000..723932be9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 new file mode 100644 index 000000000..5e7f8e239 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 new file mode 100644 index 000000000..25b1f5a5a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 new file mode 100644 index 000000000..96374228f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 new file mode 100644 index 000000000..ce6742b52 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 new file mode 100644 index 000000000..1fc1edbf5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 new file mode 100644 index 000000000..0eb361a39 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_56.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_56.smt2 new file mode 100644 index 000000000..453992723 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_56.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 new file mode 100644 index 000000000..498bd5d43 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 new file mode 100644 index 000000000..155830075 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 new file mode 100644 index 000000000..fe7e79139 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 new file mode 100644 index 000000000..2267ec032 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 new file mode 100644 index 000000000..1872b6f48 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 new file mode 100644 index 000000000..b349de91e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 new file mode 100644 index 000000000..75a75c3ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 new file mode 100644 index 000000000..93c2b10a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 new file mode 100644 index 000000000..40fa21294 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 new file mode 100644 index 000000000..60b85cdac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_57.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_57.smt2 new file mode 100644 index 000000000..b30364c39 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_57.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 new file mode 100644 index 000000000..655a073dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 new file mode 100644 index 000000000..bb8bdfad4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 new file mode 100644 index 000000000..d5224bf07 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 new file mode 100644 index 000000000..b0ea64a0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 new file mode 100644 index 000000000..37a8bcbd9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 new file mode 100644 index 000000000..a662f8fc8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 new file mode 100644 index 000000000..b1ee0aa92 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 new file mode 100644 index 000000000..5c9a5da11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 new file mode 100644 index 000000000..3523a059c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 new file mode 100644 index 000000000..5314c1fcf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_58.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_58.smt2 new file mode 100644 index 000000000..3cd4f54aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_58.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 new file mode 100644 index 000000000..53486c226 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 new file mode 100644 index 000000000..370722e1e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 new file mode 100644 index 000000000..7faff6230 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 new file mode 100644 index 000000000..459eb1054 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 new file mode 100644 index 000000000..6336d6f32 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 new file mode 100644 index 000000000..0195a2c7b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 new file mode 100644 index 000000000..039d8163e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 new file mode 100644 index 000000000..6b8ac1a6b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 new file mode 100644 index 000000000..77b0c1e7c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 new file mode 100644 index 000000000..25aa804ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_59.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_59.smt2 new file mode 100644 index 000000000..c16f8e406 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_59.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 new file mode 100644 index 000000000..148b4fcc8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 new file mode 100644 index 000000000..01e8bb1ec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 new file mode 100644 index 000000000..50273ee23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 new file mode 100644 index 000000000..dde240952 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 new file mode 100644 index 000000000..b5ecf4d3b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 new file mode 100644 index 000000000..74ba43369 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 new file mode 100644 index 000000000..e7244bcee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 new file mode 100644 index 000000000..eadd68d4f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 new file mode 100644 index 000000000..2941998b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 new file mode 100644 index 000000000..63947f9d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_6.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_6.smt2 new file mode 100644 index 000000000..539747665 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_6.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_60.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_60.smt2 new file mode 100644 index 000000000..51b1bc9bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_60.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 new file mode 100644 index 000000000..dbf56fadf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 new file mode 100644 index 000000000..a5d2af586 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 new file mode 100644 index 000000000..8c0737e68 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 new file mode 100644 index 000000000..d7ec7a4ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 new file mode 100644 index 000000000..a05acbeff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 new file mode 100644 index 000000000..e7e5c1b30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 new file mode 100644 index 000000000..24ac15ad9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 new file mode 100644 index 000000000..1cb874ae2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 new file mode 100644 index 000000000..e489dcfb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 new file mode 100644 index 000000000..00024d670 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_61.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_61.smt2 new file mode 100644 index 000000000..8b62ef379 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_61.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 new file mode 100644 index 000000000..9ac4e29ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 new file mode 100644 index 000000000..a09b3fb2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 new file mode 100644 index 000000000..e380536dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 new file mode 100644 index 000000000..e94ca6ed8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 new file mode 100644 index 000000000..bf5ac75cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 new file mode 100644 index 000000000..33d1d6276 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 new file mode 100644 index 000000000..103bb8a08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 new file mode 100644 index 000000000..df83410c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 new file mode 100644 index 000000000..7c94d6976 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 new file mode 100644 index 000000000..72c42d0f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_62.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_62.smt2 new file mode 100644 index 000000000..03748806b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_62.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 new file mode 100644 index 000000000..02dc7406c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 new file mode 100644 index 000000000..191a8aaed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 new file mode 100644 index 000000000..9d76cb53c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 new file mode 100644 index 000000000..89da5d317 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 new file mode 100644 index 000000000..713a94371 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 new file mode 100644 index 000000000..66d2f3704 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 new file mode 100644 index 000000000..b75e8d749 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 new file mode 100644 index 000000000..61bb999b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 new file mode 100644 index 000000000..0d134a1e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 new file mode 100644 index 000000000..7f79628da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_63.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_63.smt2 new file mode 100644 index 000000000..8380a856f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_63.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 new file mode 100644 index 000000000..32604832f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 new file mode 100644 index 000000000..720a98c73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 new file mode 100644 index 000000000..caff200bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 new file mode 100644 index 000000000..262058f73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 new file mode 100644 index 000000000..d05dbf293 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 new file mode 100644 index 000000000..650df40bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 new file mode 100644 index 000000000..a5623ea42 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 new file mode 100644 index 000000000..b2f05598c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 new file mode 100644 index 000000000..c7525b613 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 new file mode 100644 index 000000000..bab2109e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_64.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_64.smt2 new file mode 100644 index 000000000..cf3461ec2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_64.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 new file mode 100644 index 000000000..85f905b4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 new file mode 100644 index 000000000..5e1eccbf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 new file mode 100644 index 000000000..3363822d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 new file mode 100644 index 000000000..b210f4dea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 new file mode 100644 index 000000000..3a532d22f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 new file mode 100644 index 000000000..0f876d15f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 new file mode 100644 index 000000000..9e161b213 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 new file mode 100644 index 000000000..889843fed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 new file mode 100644 index 000000000..8d9b98923 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 new file mode 100644 index 000000000..ee5f8a1ec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_65.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_65.smt2 new file mode 100644 index 000000000..e928c43dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_65.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 new file mode 100644 index 000000000..5c6b3e266 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 new file mode 100644 index 000000000..28cc2923c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 new file mode 100644 index 000000000..fe45d5726 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 new file mode 100644 index 000000000..cc0a24fc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 new file mode 100644 index 000000000..75c02eeb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 new file mode 100644 index 000000000..fd9ff129f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 new file mode 100644 index 000000000..6014de730 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 new file mode 100644 index 000000000..2d05fd00d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 new file mode 100644 index 000000000..422f954e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 new file mode 100644 index 000000000..73884e7e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_66.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_66.smt2 new file mode 100644 index 000000000..d437884bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_66.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 new file mode 100644 index 000000000..991191919 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 new file mode 100644 index 000000000..f38cdbec8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 new file mode 100644 index 000000000..6e90a0920 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 new file mode 100644 index 000000000..b703c010f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 new file mode 100644 index 000000000..77f93e989 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 new file mode 100644 index 000000000..f264bd0bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 new file mode 100644 index 000000000..8df87a102 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 new file mode 100644 index 000000000..9d4e1f23f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 new file mode 100644 index 000000000..62fc26305 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 new file mode 100644 index 000000000..d0c5aa827 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_67.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_67.smt2 new file mode 100644 index 000000000..bbaddad20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_67.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 new file mode 100644 index 000000000..bc773903d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 new file mode 100644 index 000000000..3114c915c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 new file mode 100644 index 000000000..221dfeec4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 new file mode 100644 index 000000000..de5c2c1ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 new file mode 100644 index 000000000..a7d88711b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 new file mode 100644 index 000000000..a6a08b912 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 new file mode 100644 index 000000000..6b9eb2ccc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 new file mode 100644 index 000000000..bf3aec7f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 new file mode 100644 index 000000000..037a80e8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 new file mode 100644 index 000000000..d3b8c8d3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_68.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_68.smt2 new file mode 100644 index 000000000..8cb7be04b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_68.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 new file mode 100644 index 000000000..1e9aef65d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 new file mode 100644 index 000000000..b25cb0c80 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 new file mode 100644 index 000000000..9918d4b33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 new file mode 100644 index 000000000..8d0d440f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 new file mode 100644 index 000000000..3dac1ed0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 new file mode 100644 index 000000000..f398dab00 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 new file mode 100644 index 000000000..a03fe829d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 new file mode 100644 index 000000000..f414b5fb6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 new file mode 100644 index 000000000..b390d6b77 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 new file mode 100644 index 000000000..e7175c755 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_69.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_69.smt2 new file mode 100644 index 000000000..12856c6be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_69.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 new file mode 100644 index 000000000..23aaaebfc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 new file mode 100644 index 000000000..a270baabf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 new file mode 100644 index 000000000..b3654f695 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 new file mode 100644 index 000000000..acad952be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 new file mode 100644 index 000000000..b8279493b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 new file mode 100644 index 000000000..5fd7c190b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 new file mode 100644 index 000000000..478e01f9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 new file mode 100644 index 000000000..45b64ef84 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 new file mode 100644 index 000000000..9e3d60b78 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 new file mode 100644 index 000000000..3c24e1b08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_7.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_7.smt2 new file mode 100644 index 000000000..1a4325556 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_7.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_70.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_70.smt2 new file mode 100644 index 000000000..4273ccb6c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_70.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 new file mode 100644 index 000000000..024d81dc1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 new file mode 100644 index 000000000..e414cc654 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 new file mode 100644 index 000000000..9957225b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 new file mode 100644 index 000000000..96a900ca6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 new file mode 100644 index 000000000..9f3be373a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 new file mode 100644 index 000000000..b0f257c0c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 new file mode 100644 index 000000000..cddf2f605 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 new file mode 100644 index 000000000..d56400343 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 new file mode 100644 index 000000000..6e690def4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 new file mode 100644 index 000000000..8c06355ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_71.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_71.smt2 new file mode 100644 index 000000000..286c293aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_71.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 new file mode 100644 index 000000000..8be59ce55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 new file mode 100644 index 000000000..60b8a4b60 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 new file mode 100644 index 000000000..175c5cafc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 new file mode 100644 index 000000000..ee3a7167f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 new file mode 100644 index 000000000..2839cd336 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 new file mode 100644 index 000000000..29e180207 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 new file mode 100644 index 000000000..2d61213f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 new file mode 100644 index 000000000..e3b06b019 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 new file mode 100644 index 000000000..cb21fda58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 new file mode 100644 index 000000000..c3b146fe1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_72.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_72.smt2 new file mode 100644 index 000000000..a079e5b42 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_72.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 new file mode 100644 index 000000000..0cd38db83 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 new file mode 100644 index 000000000..08118a755 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 new file mode 100644 index 000000000..6bf0b2a49 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 new file mode 100644 index 000000000..7bd6d7e91 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 new file mode 100644 index 000000000..0f8d8dccf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 new file mode 100644 index 000000000..69a7eebbc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 new file mode 100644 index 000000000..ec0724a16 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 new file mode 100644 index 000000000..882d8b511 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 new file mode 100644 index 000000000..df768fb59 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 new file mode 100644 index 000000000..b5c1cc23f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_73.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_73.smt2 new file mode 100644 index 000000000..0741da2ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_73.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 new file mode 100644 index 000000000..fce8eff8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 new file mode 100644 index 000000000..c7bda0252 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 new file mode 100644 index 000000000..5cbdc5b5b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 new file mode 100644 index 000000000..b5b6f5871 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 new file mode 100644 index 000000000..8620e0feb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 new file mode 100644 index 000000000..834b579b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 new file mode 100644 index 000000000..7dc8ecf42 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 new file mode 100644 index 000000000..6ea149eef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 new file mode 100644 index 000000000..5342c044b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 new file mode 100644 index 000000000..46a9e6b36 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_74.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_74.smt2 new file mode 100644 index 000000000..a05b10696 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_74.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 new file mode 100644 index 000000000..cc59cd5da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 new file mode 100644 index 000000000..af4ebda58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 new file mode 100644 index 000000000..17cc5345f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 new file mode 100644 index 000000000..33b007e09 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 new file mode 100644 index 000000000..a2b4ca7fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 new file mode 100644 index 000000000..990a87852 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 new file mode 100644 index 000000000..ef711297d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 new file mode 100644 index 000000000..ec7f801b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 new file mode 100644 index 000000000..d5c907a37 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 new file mode 100644 index 000000000..647da47a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_75.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_75.smt2 new file mode 100644 index 000000000..b9052ec20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_75.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 new file mode 100644 index 000000000..ac15800be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 new file mode 100644 index 000000000..b06b2d79f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 new file mode 100644 index 000000000..763ccda67 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 new file mode 100644 index 000000000..5cca0bfd4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 new file mode 100644 index 000000000..5fc4ca319 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 new file mode 100644 index 000000000..003e3c2d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 new file mode 100644 index 000000000..b3b2cc393 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 new file mode 100644 index 000000000..dc492474c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 new file mode 100644 index 000000000..35445ed12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 new file mode 100644 index 000000000..a095c7fe4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_76.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_76.smt2 new file mode 100644 index 000000000..4bc9cca0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_76.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 new file mode 100644 index 000000000..74c920d30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 new file mode 100644 index 000000000..9b4264847 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 new file mode 100644 index 000000000..68165f322 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 new file mode 100644 index 000000000..77741be1c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 new file mode 100644 index 000000000..2a1e24ce5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 new file mode 100644 index 000000000..886ab8bba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 new file mode 100644 index 000000000..b818d9ae5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 new file mode 100644 index 000000000..04347a105 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 new file mode 100644 index 000000000..941f065c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 new file mode 100644 index 000000000..4135c24a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_77.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_77.smt2 new file mode 100644 index 000000000..929e84776 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_77.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 new file mode 100644 index 000000000..249803687 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 new file mode 100644 index 000000000..62db0a00a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 new file mode 100644 index 000000000..78fd5c52b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 new file mode 100644 index 000000000..5fcd363c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 new file mode 100644 index 000000000..d725e16cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 new file mode 100644 index 000000000..c352e1413 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 new file mode 100644 index 000000000..f7a1270cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 new file mode 100644 index 000000000..d4dd8f144 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 new file mode 100644 index 000000000..781b31593 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 new file mode 100644 index 000000000..474039508 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_78.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_78.smt2 new file mode 100644 index 000000000..c5136c61c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_78.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 new file mode 100644 index 000000000..dcd5a848c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 new file mode 100644 index 000000000..55f6cc73f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 new file mode 100644 index 000000000..7438d87db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 new file mode 100644 index 000000000..a0b2d0b50 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 new file mode 100644 index 000000000..4cda319c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 new file mode 100644 index 000000000..3399cbc1a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 new file mode 100644 index 000000000..4bd5bf48f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 new file mode 100644 index 000000000..77823d510 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 new file mode 100644 index 000000000..2d8aef7a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 new file mode 100644 index 000000000..2c7a27132 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_79.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_79.smt2 new file mode 100644 index 000000000..2116207fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_79.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 new file mode 100644 index 000000000..8738b9de2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 new file mode 100644 index 000000000..463c583f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 new file mode 100644 index 000000000..e619c4db1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 new file mode 100644 index 000000000..1bb5cd824 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 new file mode 100644 index 000000000..1662be576 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 new file mode 100644 index 000000000..44a445b34 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 new file mode 100644 index 000000000..0a2c091b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 new file mode 100644 index 000000000..9ea3747c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 new file mode 100644 index 000000000..4aa180fd3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 new file mode 100644 index 000000000..5d5dbacd5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_8.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_8.smt2 new file mode 100644 index 000000000..d2fc9d372 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_8.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_80.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_80.smt2 new file mode 100644 index 000000000..d02b1d51e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_80.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 new file mode 100644 index 000000000..cacafb949 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 new file mode 100644 index 000000000..c5f87e85c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 new file mode 100644 index 000000000..e635c848a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 new file mode 100644 index 000000000..b1e81a5a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 new file mode 100644 index 000000000..5c2571cbc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 new file mode 100644 index 000000000..eaac29e72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 new file mode 100644 index 000000000..cd3d93df1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 new file mode 100644 index 000000000..409ed2bb7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 new file mode 100644 index 000000000..717805b5a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 new file mode 100644 index 000000000..84354bee4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_81.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_81.smt2 new file mode 100644 index 000000000..cf0f1b6b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_81.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 new file mode 100644 index 000000000..dbb915460 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 new file mode 100644 index 000000000..c5891e1f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 new file mode 100644 index 000000000..58e985a9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 new file mode 100644 index 000000000..61828bdbf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 new file mode 100644 index 000000000..a32d0709b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 new file mode 100644 index 000000000..6fecf6e94 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 new file mode 100644 index 000000000..569b84814 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 new file mode 100644 index 000000000..efa105fc9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 new file mode 100644 index 000000000..3d04f6659 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 new file mode 100644 index 000000000..ccda6c5f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_82.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_82.smt2 new file mode 100644 index 000000000..da461f460 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_82.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 new file mode 100644 index 000000000..7a6853a0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 new file mode 100644 index 000000000..f544d30a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 new file mode 100644 index 000000000..ac90e9d3b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 new file mode 100644 index 000000000..1087b1188 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 new file mode 100644 index 000000000..8dccad886 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 new file mode 100644 index 000000000..2b512c370 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 new file mode 100644 index 000000000..3ac6b10b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 new file mode 100644 index 000000000..057669d25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 new file mode 100644 index 000000000..d15b9e783 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 new file mode 100644 index 000000000..e7314eade --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_83.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_83.smt2 new file mode 100644 index 000000000..90dd4635c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_83.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 new file mode 100644 index 000000000..a8648e412 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 new file mode 100644 index 000000000..5555fe60f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 new file mode 100644 index 000000000..170c54737 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 new file mode 100644 index 000000000..1337c091d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 new file mode 100644 index 000000000..6f174767b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 new file mode 100644 index 000000000..8a2e04e66 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 new file mode 100644 index 000000000..d5d9d92b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 new file mode 100644 index 000000000..9e47c241b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 new file mode 100644 index 000000000..235f332b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 new file mode 100644 index 000000000..6449bf027 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_84.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_84.smt2 new file mode 100644 index 000000000..c5dcf2223 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_84.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 new file mode 100644 index 000000000..212abee91 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 new file mode 100644 index 000000000..9f7ab1362 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 new file mode 100644 index 000000000..e94425d0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 new file mode 100644 index 000000000..052ebec56 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 new file mode 100644 index 000000000..747f78761 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 new file mode 100644 index 000000000..f9782ed89 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 new file mode 100644 index 000000000..a41cae19f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 new file mode 100644 index 000000000..d4b26aede --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 new file mode 100644 index 000000000..88ee8476e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 new file mode 100644 index 000000000..5a78527ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_85.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_85.smt2 new file mode 100644 index 000000000..8e67749a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_85.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 new file mode 100644 index 000000000..f1659238b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 new file mode 100644 index 000000000..1a5521943 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 new file mode 100644 index 000000000..b08ea5907 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 new file mode 100644 index 000000000..dd08f3650 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 new file mode 100644 index 000000000..429bac3a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 new file mode 100644 index 000000000..becaa30c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 new file mode 100644 index 000000000..accb1e509 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 new file mode 100644 index 000000000..32b3d602a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 new file mode 100644 index 000000000..b9c31446b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 new file mode 100644 index 000000000..64fba4730 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_86.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_86.smt2 new file mode 100644 index 000000000..74b77b623 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_86.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 new file mode 100644 index 000000000..a27438928 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 new file mode 100644 index 000000000..6f033bd2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 new file mode 100644 index 000000000..afd4085f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 new file mode 100644 index 000000000..f2b41ed0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 new file mode 100644 index 000000000..c00ddbf51 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 new file mode 100644 index 000000000..1bd3585ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 new file mode 100644 index 000000000..ca0d4088c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 new file mode 100644 index 000000000..8f5b65889 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 new file mode 100644 index 000000000..89400ca24 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 new file mode 100644 index 000000000..56b08ac4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_87.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_87.smt2 new file mode 100644 index 000000000..9caafa044 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_87.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 new file mode 100644 index 000000000..09bac8c4b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 new file mode 100644 index 000000000..c5b285a93 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 new file mode 100644 index 000000000..be5aa44ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 new file mode 100644 index 000000000..4864d4aa5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 new file mode 100644 index 000000000..31e7757c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 new file mode 100644 index 000000000..349711ef5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 new file mode 100644 index 000000000..f6ecd8fd9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 new file mode 100644 index 000000000..738736444 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 new file mode 100644 index 000000000..2de4bbaa7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 new file mode 100644 index 000000000..0960f522b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_88.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_88.smt2 new file mode 100644 index 000000000..d4fc1fc9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_88.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 new file mode 100644 index 000000000..64e534fcf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 new file mode 100644 index 000000000..a53180f3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 new file mode 100644 index 000000000..690304cce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 new file mode 100644 index 000000000..b631692ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 new file mode 100644 index 000000000..b0a47177c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 new file mode 100644 index 000000000..5c292f669 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 new file mode 100644 index 000000000..2bb6c57ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 new file mode 100644 index 000000000..1a6c766bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 new file mode 100644 index 000000000..bf6bdd88b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 new file mode 100644 index 000000000..d0b688939 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_89.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_89.smt2 new file mode 100644 index 000000000..5c1b1ea84 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_89.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 new file mode 100644 index 000000000..ee26fadda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 new file mode 100644 index 000000000..0bcd6205e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 new file mode 100644 index 000000000..f3acdfe8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 new file mode 100644 index 000000000..d9872712f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 new file mode 100644 index 000000000..30d4e50bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 new file mode 100644 index 000000000..2e4b42193 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 new file mode 100644 index 000000000..2779cee76 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 new file mode 100644 index 000000000..d1c0f1732 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 new file mode 100644 index 000000000..92e61e7bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 new file mode 100644 index 000000000..def5a484f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_9.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_9.smt2 new file mode 100644 index 000000000..f30ed24cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_9.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_90.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_90.smt2 new file mode 100644 index 000000000..a7744ab66 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_90.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 new file mode 100644 index 000000000..301758d66 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 new file mode 100644 index 000000000..cc6547a2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 new file mode 100644 index 000000000..5260b36ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 new file mode 100644 index 000000000..b6eddd7ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 new file mode 100644 index 000000000..40ec74999 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 new file mode 100644 index 000000000..6a30a833a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 new file mode 100644 index 000000000..6fb9755cc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 new file mode 100644 index 000000000..75936c439 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 new file mode 100644 index 000000000..71ac47f5e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 new file mode 100644 index 000000000..51803f5a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_91.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_91.smt2 new file mode 100644 index 000000000..4cd975c6b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_91.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 new file mode 100644 index 000000000..a48ab9835 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 new file mode 100644 index 000000000..7fb445f3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 new file mode 100644 index 000000000..327c92321 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 new file mode 100644 index 000000000..dae477db3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 new file mode 100644 index 000000000..96fb00d72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 new file mode 100644 index 000000000..4a9d5ce07 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 new file mode 100644 index 000000000..f0fd23bdb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 new file mode 100644 index 000000000..4fe57da18 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 new file mode 100644 index 000000000..38f79380a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 new file mode 100644 index 000000000..fbc0f6917 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_92.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_92.smt2 new file mode 100644 index 000000000..61dd3b7fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_92.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 new file mode 100644 index 000000000..432057e9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 new file mode 100644 index 000000000..4f5b0fb9c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 new file mode 100644 index 000000000..dd7cc5884 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 new file mode 100644 index 000000000..deeeb05ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 new file mode 100644 index 000000000..ec7f24cde --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 new file mode 100644 index 000000000..ede36adea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 new file mode 100644 index 000000000..8d97818fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 new file mode 100644 index 000000000..0a5ec5d86 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 new file mode 100644 index 000000000..0cac06bbc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 new file mode 100644 index 000000000..7f0260882 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_93.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_93.smt2 new file mode 100644 index 000000000..d415ef792 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_93.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 new file mode 100644 index 000000000..acdf5612f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 new file mode 100644 index 000000000..3d87bc2b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 new file mode 100644 index 000000000..31cac8587 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 new file mode 100644 index 000000000..4f37ab3f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 new file mode 100644 index 000000000..143ae5c8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 new file mode 100644 index 000000000..1e2d6376c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 new file mode 100644 index 000000000..d209705c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 new file mode 100644 index 000000000..1f1c05e62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 new file mode 100644 index 000000000..93fecc508 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 new file mode 100644 index 000000000..d652f8e77 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_94.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_94.smt2 new file mode 100644 index 000000000..debacf647 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_94.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 new file mode 100644 index 000000000..830992653 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 new file mode 100644 index 000000000..9a2d06ede --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 new file mode 100644 index 000000000..5c46ebc65 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 new file mode 100644 index 000000000..35a263995 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 new file mode 100644 index 000000000..cf035ae65 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 new file mode 100644 index 000000000..a4fd6522c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 new file mode 100644 index 000000000..5ec014d21 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 new file mode 100644 index 000000000..32c193b36 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 new file mode 100644 index 000000000..88bcf20ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 new file mode 100644 index 000000000..7ff7742be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_95.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_95.smt2 new file mode 100644 index 000000000..fc6630259 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_95.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 new file mode 100644 index 000000000..1d8d39bdb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 new file mode 100644 index 000000000..a7758fe5d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 new file mode 100644 index 000000000..bedb2f7ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 new file mode 100644 index 000000000..19c121845 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 new file mode 100644 index 000000000..4d535225c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 new file mode 100644 index 000000000..a9d64da3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 new file mode 100644 index 000000000..0d51d6cbf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 new file mode 100644 index 000000000..a8a0cd927 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 new file mode 100644 index 000000000..a955d8d9a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 new file mode 100644 index 000000000..d1618df54 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_96.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_96.smt2 new file mode 100644 index 000000000..20381db64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_96.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 new file mode 100644 index 000000000..f3b9173ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 new file mode 100644 index 000000000..af7d6bc8a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 new file mode 100644 index 000000000..f05dccc30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 new file mode 100644 index 000000000..b1bdf5dbd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 new file mode 100644 index 000000000..3ac331524 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 new file mode 100644 index 000000000..d5b12fd4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 new file mode 100644 index 000000000..3406741ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 new file mode 100644 index 000000000..e2b7eacd4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 new file mode 100644 index 000000000..48e716dc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 new file mode 100644 index 000000000..89df7871a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_97.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_97.smt2 new file mode 100644 index 000000000..02ddc9437 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_97.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 new file mode 100644 index 000000000..6b564bb07 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 new file mode 100644 index 000000000..01456794b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 new file mode 100644 index 000000000..4c0c9f556 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 new file mode 100644 index 000000000..b00c45ab7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 new file mode 100644 index 000000000..bdceaf4f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 new file mode 100644 index 000000000..9e57b89ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 new file mode 100644 index 000000000..dd3157486 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 new file mode 100644 index 000000000..b421e304c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 new file mode 100644 index 000000000..e0251f2a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 new file mode 100644 index 000000000..986096506 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_98.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_98.smt2 new file mode 100644 index 000000000..3bf49586a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_98.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 new file mode 100644 index 000000000..e9f0b0eb2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 new file mode 100644 index 000000000..cba7d80e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 new file mode 100644 index 000000000..4fcbb5929 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 new file mode 100644 index 000000000..cc9eea04a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 new file mode 100644 index 000000000..8db358bf9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 new file mode 100644 index 000000000..7b52fbcb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 new file mode 100644 index 000000000..3c89efd6f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 new file mode 100644 index 000000000..3868ae2d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 new file mode 100644 index 000000000..0d177332e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 new file mode 100644 index 000000000..e2c1c7547 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_99.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_99.smt2 new file mode 100644 index 000000000..f530b6c38 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_99.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "000")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 new file mode 100644 index 000000000..302c1cdc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 new file mode 100644 index 000000000..420682dc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "011")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 new file mode 100644 index 000000000..d90bfd8c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 new file mode 100644 index 000000000..32293ec41 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 new file mode 100644 index 000000000..d8c1f11f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 new file mode 100644 index 000000000..0af728130 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 new file mode 100644 index 000000000..e205842fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 new file mode 100644 index 000000000..8ff028274 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 new file mode 100644 index 000000000..d59991914 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 new file mode 100644 index 000000000..101164d90 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 @@ -0,0 +1,53 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. +Most benchmarks expected to be unsat. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_0.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_0.smt2 new file mode 100644 index 000000000..63564c0d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_0.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1.smt2 new file mode 100644 index 000000000..aaf28b1fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_10.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_10.smt2 new file mode 100644 index 000000000..1d5102030 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_10.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_100.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_100.smt2 new file mode 100644 index 000000000..f38dc193d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_100.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 new file mode 100644 index 000000000..1d60160b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 new file mode 100644 index 000000000..4f8703931 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 new file mode 100644 index 000000000..00c7721e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 new file mode 100644 index 000000000..f8d6d766a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 new file mode 100644 index 000000000..090ebca3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 new file mode 100644 index 000000000..13da290b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 new file mode 100644 index 000000000..efb824d0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 new file mode 100644 index 000000000..027d8136d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 new file mode 100644 index 000000000..9de409ca5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 new file mode 100644 index 000000000..7e90a9a3f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_101.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_101.smt2 new file mode 100644 index 000000000..9653a3f33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_101.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 new file mode 100644 index 000000000..495fa6300 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 new file mode 100644 index 000000000..6b04e4746 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 new file mode 100644 index 000000000..7267574ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 new file mode 100644 index 000000000..5df2ff680 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 new file mode 100644 index 000000000..7ea7e1aef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 new file mode 100644 index 000000000..cc7a8a478 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 new file mode 100644 index 000000000..de1fbedd2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 new file mode 100644 index 000000000..7a1f87493 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 new file mode 100644 index 000000000..fcd4cdbf0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 new file mode 100644 index 000000000..83813c6b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_102.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_102.smt2 new file mode 100644 index 000000000..3d56995c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_102.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 new file mode 100644 index 000000000..0627304fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 new file mode 100644 index 000000000..1598ff3a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 new file mode 100644 index 000000000..1c8898183 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 new file mode 100644 index 000000000..50b97c53c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 new file mode 100644 index 000000000..60fb489e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 new file mode 100644 index 000000000..96d98d9a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 new file mode 100644 index 000000000..d5b41f597 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 new file mode 100644 index 000000000..343adcbb2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 new file mode 100644 index 000000000..c7570340e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 new file mode 100644 index 000000000..161e66b73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_103.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_103.smt2 new file mode 100644 index 000000000..0c5b86385 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_103.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 new file mode 100644 index 000000000..6c0614ee8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 new file mode 100644 index 000000000..66e1aa230 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 new file mode 100644 index 000000000..3c541c40d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 new file mode 100644 index 000000000..89c7f6d9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 new file mode 100644 index 000000000..ce314874d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 new file mode 100644 index 000000000..17b457fc1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 new file mode 100644 index 000000000..fe8b5abc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 new file mode 100644 index 000000000..79c3d17f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 new file mode 100644 index 000000000..c790a3309 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 new file mode 100644 index 000000000..542a85592 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_104.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_104.smt2 new file mode 100644 index 000000000..6cc4a920a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_104.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 new file mode 100644 index 000000000..9c490d45d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 new file mode 100644 index 000000000..5d596caff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 new file mode 100644 index 000000000..dfe725264 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 new file mode 100644 index 000000000..b47a60abe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 new file mode 100644 index 000000000..b30325a1a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 new file mode 100644 index 000000000..cafa9eb9a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 new file mode 100644 index 000000000..72a773dfd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 new file mode 100644 index 000000000..2fb4e4770 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 new file mode 100644 index 000000000..a92f9a872 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 new file mode 100644 index 000000000..08959c61e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_105.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_105.smt2 new file mode 100644 index 000000000..170987c74 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_105.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 new file mode 100644 index 000000000..23d8a8aeb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 new file mode 100644 index 000000000..dc7f79ad1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 new file mode 100644 index 000000000..15a10d363 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 new file mode 100644 index 000000000..f706d50fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 new file mode 100644 index 000000000..50c8697ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 new file mode 100644 index 000000000..177416ea2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 new file mode 100644 index 000000000..aa70931aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 new file mode 100644 index 000000000..a5f78178f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 new file mode 100644 index 000000000..43b6f2998 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 new file mode 100644 index 000000000..463c18c29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_106.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_106.smt2 new file mode 100644 index 000000000..623f46865 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_106.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 new file mode 100644 index 000000000..62ce297c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 new file mode 100644 index 000000000..e728614c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 new file mode 100644 index 000000000..3a6aed591 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 new file mode 100644 index 000000000..75a690db4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 new file mode 100644 index 000000000..590aab2ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 new file mode 100644 index 000000000..3f701b921 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 new file mode 100644 index 000000000..3eda74ef0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 new file mode 100644 index 000000000..14dbe1cc9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 new file mode 100644 index 000000000..ee7102848 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 new file mode 100644 index 000000000..f0526f6ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_107.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_107.smt2 new file mode 100644 index 000000000..01989db9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_107.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 new file mode 100644 index 000000000..6f654e5b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 new file mode 100644 index 000000000..f0fa58ef4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 new file mode 100644 index 000000000..b24787493 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 new file mode 100644 index 000000000..6f1c14b89 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 new file mode 100644 index 000000000..5dd8610cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 new file mode 100644 index 000000000..7d1b52b81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 new file mode 100644 index 000000000..45f0828eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 new file mode 100644 index 000000000..4f1fe2ea4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 new file mode 100644 index 000000000..b243d7c58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 new file mode 100644 index 000000000..7b606107b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_108.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_108.smt2 new file mode 100644 index 000000000..f59382801 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_108.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 new file mode 100644 index 000000000..21fb9e295 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 new file mode 100644 index 000000000..57e293b7e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 new file mode 100644 index 000000000..402803272 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 new file mode 100644 index 000000000..869a44788 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 new file mode 100644 index 000000000..8f222e90c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 new file mode 100644 index 000000000..23b8d59dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 new file mode 100644 index 000000000..bdb22005f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 new file mode 100644 index 000000000..4befe51a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 new file mode 100644 index 000000000..b11bf066c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 new file mode 100644 index 000000000..90704d7ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_109.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_109.smt2 new file mode 100644 index 000000000..5abe8cfc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_109.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 new file mode 100644 index 000000000..5e5ceb862 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 new file mode 100644 index 000000000..9fbf8d1cc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 new file mode 100644 index 000000000..1559fd36a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 new file mode 100644 index 000000000..1a687b9df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 new file mode 100644 index 000000000..4462b9452 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 new file mode 100644 index 000000000..49afc775a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 new file mode 100644 index 000000000..994dc7d73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 new file mode 100644 index 000000000..6f444e798 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 new file mode 100644 index 000000000..a79ec9246 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 new file mode 100644 index 000000000..7dede19b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_11.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_11.smt2 new file mode 100644 index 000000000..1b58445b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_11.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_110.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_110.smt2 new file mode 100644 index 000000000..bc311b795 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_110.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 new file mode 100644 index 000000000..a49205087 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 new file mode 100644 index 000000000..06b3e43a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 new file mode 100644 index 000000000..8836f9d9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 new file mode 100644 index 000000000..62e21622d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 new file mode 100644 index 000000000..3054832b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 new file mode 100644 index 000000000..4ca666f7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 new file mode 100644 index 000000000..af811fde3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 new file mode 100644 index 000000000..f42587c6d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 new file mode 100644 index 000000000..c7f3417c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 new file mode 100644 index 000000000..14523b63e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_111.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_111.smt2 new file mode 100644 index 000000000..e84898f29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_111.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 new file mode 100644 index 000000000..5ad9950f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 new file mode 100644 index 000000000..dda5e3188 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 new file mode 100644 index 000000000..0cab768d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 new file mode 100644 index 000000000..2affbe05c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 new file mode 100644 index 000000000..60f690232 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 new file mode 100644 index 000000000..3a57b0d83 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 new file mode 100644 index 000000000..8ecaf9493 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 new file mode 100644 index 000000000..e0422fb9a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 new file mode 100644 index 000000000..4d0fe07e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 new file mode 100644 index 000000000..bd2bacf21 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_112.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_112.smt2 new file mode 100644 index 000000000..430dc70ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_112.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 new file mode 100644 index 000000000..885c54566 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 new file mode 100644 index 000000000..7c5f9a7d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 new file mode 100644 index 000000000..4e1f4a70b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 new file mode 100644 index 000000000..2fceb68aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 new file mode 100644 index 000000000..bd2f9d4db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 new file mode 100644 index 000000000..d7270e457 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 new file mode 100644 index 000000000..e2d32425c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 new file mode 100644 index 000000000..eefe55de1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 new file mode 100644 index 000000000..a9e0e5b96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 new file mode 100644 index 000000000..19b65c9ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_113.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_113.smt2 new file mode 100644 index 000000000..eb9c476aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_113.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 new file mode 100644 index 000000000..02919e698 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 new file mode 100644 index 000000000..22aab1468 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 new file mode 100644 index 000000000..7bda3cbc0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 new file mode 100644 index 000000000..0ad965677 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 new file mode 100644 index 000000000..b99d350ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 new file mode 100644 index 000000000..73d46f3dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 new file mode 100644 index 000000000..4f17c3602 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 new file mode 100644 index 000000000..4f2688a08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 new file mode 100644 index 000000000..0363a6d67 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 new file mode 100644 index 000000000..f243fb3c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_114.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_114.smt2 new file mode 100644 index 000000000..8af62a664 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_114.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 new file mode 100644 index 000000000..52f47ccc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 new file mode 100644 index 000000000..d8ed683c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 new file mode 100644 index 000000000..6107db4f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 new file mode 100644 index 000000000..0fc773198 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 new file mode 100644 index 000000000..84a9baf5f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 new file mode 100644 index 000000000..d8f31c0cc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 new file mode 100644 index 000000000..b41360b93 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 new file mode 100644 index 000000000..62b994d5e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 new file mode 100644 index 000000000..8fd4f302c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 new file mode 100644 index 000000000..b21b925f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_115.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_115.smt2 new file mode 100644 index 000000000..1645ee2c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_115.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 new file mode 100644 index 000000000..627492e16 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 new file mode 100644 index 000000000..4d341222b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 new file mode 100644 index 000000000..f8064a4d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 new file mode 100644 index 000000000..4cfcb0bf1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 new file mode 100644 index 000000000..2fb604551 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 new file mode 100644 index 000000000..3c48baea4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 new file mode 100644 index 000000000..ce4724212 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 new file mode 100644 index 000000000..24b0032b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 new file mode 100644 index 000000000..d5d0bc765 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 new file mode 100644 index 000000000..1dafb087e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_116.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_116.smt2 new file mode 100644 index 000000000..d44c621e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_116.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 new file mode 100644 index 000000000..a8599d271 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 new file mode 100644 index 000000000..134a0dd1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 new file mode 100644 index 000000000..421e91afe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 new file mode 100644 index 000000000..19ac7c11d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 new file mode 100644 index 000000000..74106e522 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 new file mode 100644 index 000000000..fad38a0f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 new file mode 100644 index 000000000..6ad5f638e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 new file mode 100644 index 000000000..e6937c6fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 new file mode 100644 index 000000000..8b5a81f8f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 new file mode 100644 index 000000000..8e4356156 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_117.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_117.smt2 new file mode 100644 index 000000000..f067d80b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_117.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 new file mode 100644 index 000000000..d47171919 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 new file mode 100644 index 000000000..d533ea775 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 new file mode 100644 index 000000000..4021339ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 new file mode 100644 index 000000000..1d90188e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 new file mode 100644 index 000000000..343af78c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 new file mode 100644 index 000000000..13cdf7323 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 new file mode 100644 index 000000000..140f89cd3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 new file mode 100644 index 000000000..5ad2da4d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 new file mode 100644 index 000000000..699880630 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 new file mode 100644 index 000000000..c48f1ae12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_118.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_118.smt2 new file mode 100644 index 000000000..b99c47796 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_118.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 new file mode 100644 index 000000000..074e0d47a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 new file mode 100644 index 000000000..b66e57ddc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 new file mode 100644 index 000000000..79d368848 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 new file mode 100644 index 000000000..a827b0501 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 new file mode 100644 index 000000000..06eb37e4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 new file mode 100644 index 000000000..3902e629a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 new file mode 100644 index 000000000..acdd475f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 new file mode 100644 index 000000000..d3771e3ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 new file mode 100644 index 000000000..581422c2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 new file mode 100644 index 000000000..3748e5e3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_119.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_119.smt2 new file mode 100644 index 000000000..2b5f12b8c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_119.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 new file mode 100644 index 000000000..ede2c396a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 new file mode 100644 index 000000000..d1deecb56 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 new file mode 100644 index 000000000..51a72daf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 new file mode 100644 index 000000000..701da8d9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 new file mode 100644 index 000000000..4b1d45ac1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 new file mode 100644 index 000000000..837c8fbf5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 new file mode 100644 index 000000000..a6df4ab2f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 new file mode 100644 index 000000000..73b1353ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 new file mode 100644 index 000000000..91034ee8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 new file mode 100644 index 000000000..260c502ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_12.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_12.smt2 new file mode 100644 index 000000000..ca993dae2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_12.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_120.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_120.smt2 new file mode 100644 index 000000000..b460216be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_120.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 new file mode 100644 index 000000000..50480af2f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 new file mode 100644 index 000000000..7e0bf4075 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 new file mode 100644 index 000000000..b8408829f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 new file mode 100644 index 000000000..f210eb978 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 new file mode 100644 index 000000000..027bd1e9c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 new file mode 100644 index 000000000..c3904c191 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 new file mode 100644 index 000000000..a357858ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 new file mode 100644 index 000000000..8249dfa71 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 new file mode 100644 index 000000000..26353fe4f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 new file mode 100644 index 000000000..3870dde0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_121.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_121.smt2 new file mode 100644 index 000000000..233147c57 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_121.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 new file mode 100644 index 000000000..f79f948a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 new file mode 100644 index 000000000..3e1d09532 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 new file mode 100644 index 000000000..edcd01363 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 new file mode 100644 index 000000000..dce5d191d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 new file mode 100644 index 000000000..d8ab65524 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 new file mode 100644 index 000000000..26d68fe8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 new file mode 100644 index 000000000..3d70fc389 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 new file mode 100644 index 000000000..f30cbd0c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 new file mode 100644 index 000000000..f6ba81e3a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 new file mode 100644 index 000000000..ecec68583 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_122.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_122.smt2 new file mode 100644 index 000000000..6e277f4ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_122.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 new file mode 100644 index 000000000..929e8d724 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 new file mode 100644 index 000000000..a6e77f3e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 new file mode 100644 index 000000000..0f2cc0c26 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 new file mode 100644 index 000000000..1afc5fbfc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 new file mode 100644 index 000000000..ee447ead4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 new file mode 100644 index 000000000..892a7ffec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 new file mode 100644 index 000000000..328e9e926 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 new file mode 100644 index 000000000..9bcb3a19c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 new file mode 100644 index 000000000..2b4376e09 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 new file mode 100644 index 000000000..84b5fdcb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_123.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_123.smt2 new file mode 100644 index 000000000..d39c36b0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_123.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 new file mode 100644 index 000000000..f1027bdda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 new file mode 100644 index 000000000..ee009a222 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 new file mode 100644 index 000000000..317bc08a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 new file mode 100644 index 000000000..1c46708e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 new file mode 100644 index 000000000..0fc8c9e4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 new file mode 100644 index 000000000..ccc640944 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 new file mode 100644 index 000000000..b9e30d39d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 new file mode 100644 index 000000000..1869a249a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 new file mode 100644 index 000000000..26760f23d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 new file mode 100644 index 000000000..bb5d5001a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_124.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_124.smt2 new file mode 100644 index 000000000..bebcd2d81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_124.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 new file mode 100644 index 000000000..801eaecb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 new file mode 100644 index 000000000..8085eeaed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 new file mode 100644 index 000000000..9cefe8818 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 new file mode 100644 index 000000000..f42fe0fa3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 new file mode 100644 index 000000000..6283f43cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 new file mode 100644 index 000000000..b3dfe10dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 new file mode 100644 index 000000000..66f9fad14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 new file mode 100644 index 000000000..64f20938f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 new file mode 100644 index 000000000..d6697b20c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 new file mode 100644 index 000000000..7b58d1836 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_125.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_125.smt2 new file mode 100644 index 000000000..d68ebc62a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_125.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 new file mode 100644 index 000000000..76d585ba8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 new file mode 100644 index 000000000..bec1ea42a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 new file mode 100644 index 000000000..9f628edc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 new file mode 100644 index 000000000..8b484c1b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 new file mode 100644 index 000000000..6cb3cefd7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 new file mode 100644 index 000000000..f49eaf857 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 new file mode 100644 index 000000000..aa4860b4d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 new file mode 100644 index 000000000..b62415a53 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 new file mode 100644 index 000000000..324a78f35 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 new file mode 100644 index 000000000..d046a1a62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_126.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_126.smt2 new file mode 100644 index 000000000..ae12a3db4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_126.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 new file mode 100644 index 000000000..a29527865 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 new file mode 100644 index 000000000..a9ce3bbf2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 new file mode 100644 index 000000000..bff2e655e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 new file mode 100644 index 000000000..cea2b8a2f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 new file mode 100644 index 000000000..4ebd9dfc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 new file mode 100644 index 000000000..ba84dc33e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 new file mode 100644 index 000000000..a92607fa5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 new file mode 100644 index 000000000..7f39d5ee2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 new file mode 100644 index 000000000..efa992c2f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 new file mode 100644 index 000000000..2173f864d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_127.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_127.smt2 new file mode 100644 index 000000000..d7037ff77 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_127.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 new file mode 100644 index 000000000..32b816001 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 new file mode 100644 index 000000000..978241481 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 new file mode 100644 index 000000000..27dac7556 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 new file mode 100644 index 000000000..831e03271 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 new file mode 100644 index 000000000..ca6e6e116 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 new file mode 100644 index 000000000..1f9e9bb72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 new file mode 100644 index 000000000..33931b1e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 new file mode 100644 index 000000000..bc94d0c69 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 new file mode 100644 index 000000000..74b18ad05 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 new file mode 100644 index 000000000..6ea62db55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_128.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_128.smt2 new file mode 100644 index 000000000..09f71f4d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_128.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 new file mode 100644 index 000000000..452a2082d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 new file mode 100644 index 000000000..754677b6d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 new file mode 100644 index 000000000..4d0c6ff21 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 new file mode 100644 index 000000000..0d5c08b96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 new file mode 100644 index 000000000..d7f77feac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 new file mode 100644 index 000000000..983cfc265 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 new file mode 100644 index 000000000..f6e6662b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 new file mode 100644 index 000000000..9d17f2007 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 new file mode 100644 index 000000000..0aa8436f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 new file mode 100644 index 000000000..201c6c58e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_129.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_129.smt2 new file mode 100644 index 000000000..20be80a6f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_129.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 new file mode 100644 index 000000000..b5a17867e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 new file mode 100644 index 000000000..47ef7ab2c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 new file mode 100644 index 000000000..05c497e29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 new file mode 100644 index 000000000..35fd1dc89 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 new file mode 100644 index 000000000..ecaf72680 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 new file mode 100644 index 000000000..f5c241062 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 new file mode 100644 index 000000000..c74d7b464 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 new file mode 100644 index 000000000..34ad6f890 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 new file mode 100644 index 000000000..0683a23d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 new file mode 100644 index 000000000..db4016792 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_13.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_13.smt2 new file mode 100644 index 000000000..d0e4219bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_13.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_130.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_130.smt2 new file mode 100644 index 000000000..a8c89254d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_130.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 new file mode 100644 index 000000000..090b6b670 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 new file mode 100644 index 000000000..48bc77474 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 new file mode 100644 index 000000000..0d4b04bd1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 new file mode 100644 index 000000000..aea32afd7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 new file mode 100644 index 000000000..1f0e0b26e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 new file mode 100644 index 000000000..6e9d0d55d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 new file mode 100644 index 000000000..3798f5d2c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 new file mode 100644 index 000000000..2adbf6752 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 new file mode 100644 index 000000000..4744d7100 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 new file mode 100644 index 000000000..232f8c2cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_131.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_131.smt2 new file mode 100644 index 000000000..e28d6fee4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_131.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 new file mode 100644 index 000000000..7c8fb2c51 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 new file mode 100644 index 000000000..55222fd0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 new file mode 100644 index 000000000..d9f833cec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 new file mode 100644 index 000000000..a03b2ea74 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 new file mode 100644 index 000000000..04c8dd9b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 new file mode 100644 index 000000000..ea935d976 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 new file mode 100644 index 000000000..273a7dede --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 new file mode 100644 index 000000000..0f8bb4f02 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 new file mode 100644 index 000000000..e4c75ca66 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 new file mode 100644 index 000000000..2a8a31583 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_132.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_132.smt2 new file mode 100644 index 000000000..c1f53ab16 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_132.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 new file mode 100644 index 000000000..4297a28d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 new file mode 100644 index 000000000..092711134 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 new file mode 100644 index 000000000..7b0770114 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 new file mode 100644 index 000000000..a3ea8d09e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 new file mode 100644 index 000000000..a1925493e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 new file mode 100644 index 000000000..a8670b66c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 new file mode 100644 index 000000000..203b700cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 new file mode 100644 index 000000000..d0602060a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 new file mode 100644 index 000000000..685cc1122 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 new file mode 100644 index 000000000..4c7e4e2f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_133.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_133.smt2 new file mode 100644 index 000000000..4c42cbd76 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_133.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 new file mode 100644 index 000000000..a4a571ddc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 new file mode 100644 index 000000000..609bf0ab1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 new file mode 100644 index 000000000..ec827c84d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 new file mode 100644 index 000000000..64f42b36e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 new file mode 100644 index 000000000..33699f703 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 new file mode 100644 index 000000000..fb10f0f55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 new file mode 100644 index 000000000..6b0481c8a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 new file mode 100644 index 000000000..6ef3e887d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 new file mode 100644 index 000000000..8de9611d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 new file mode 100644 index 000000000..35bf40237 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_134.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_134.smt2 new file mode 100644 index 000000000..fdbeb1674 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_134.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 new file mode 100644 index 000000000..a8b10d665 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 new file mode 100644 index 000000000..e5e4ca688 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 new file mode 100644 index 000000000..762b2d4a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 new file mode 100644 index 000000000..2c4568a27 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 new file mode 100644 index 000000000..d7d7af39c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 new file mode 100644 index 000000000..540013903 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 new file mode 100644 index 000000000..33fb32d14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 new file mode 100644 index 000000000..091a3cda0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 new file mode 100644 index 000000000..5f4df772e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 new file mode 100644 index 000000000..7e5ea1755 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_135.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_135.smt2 new file mode 100644 index 000000000..250e30184 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_135.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 new file mode 100644 index 000000000..67e88d717 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 new file mode 100644 index 000000000..804828f19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 new file mode 100644 index 000000000..cd0f1251d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 new file mode 100644 index 000000000..5df468718 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 new file mode 100644 index 000000000..09b6ecd15 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 new file mode 100644 index 000000000..4b526b7dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 new file mode 100644 index 000000000..00510e1df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 new file mode 100644 index 000000000..11b27aed9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 new file mode 100644 index 000000000..2e37242b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 new file mode 100644 index 000000000..c953b6dfc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_136.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_136.smt2 new file mode 100644 index 000000000..8f327b8d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_136.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 new file mode 100644 index 000000000..e249a16ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 new file mode 100644 index 000000000..e2e743f53 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 new file mode 100644 index 000000000..da190b4af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 new file mode 100644 index 000000000..77bfad6bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 new file mode 100644 index 000000000..673612caf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 new file mode 100644 index 000000000..bd5fa4363 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 new file mode 100644 index 000000000..d249e9c08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 new file mode 100644 index 000000000..2b36e7392 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 new file mode 100644 index 000000000..0ea5de342 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 new file mode 100644 index 000000000..235c31d20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_137.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_137.smt2 new file mode 100644 index 000000000..88e6bd569 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_137.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 new file mode 100644 index 000000000..a3a0b2641 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 new file mode 100644 index 000000000..f543118a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 new file mode 100644 index 000000000..06a90be68 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 new file mode 100644 index 000000000..3a7ad6bf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 new file mode 100644 index 000000000..f4888121e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 new file mode 100644 index 000000000..752a6e50c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 new file mode 100644 index 000000000..271fd9fea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 new file mode 100644 index 000000000..51a947d0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 new file mode 100644 index 000000000..4812c0a62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 new file mode 100644 index 000000000..0fcdd48f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_138.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_138.smt2 new file mode 100644 index 000000000..e5ca5388e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_138.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 new file mode 100644 index 000000000..dc80bff98 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 new file mode 100644 index 000000000..92ef27284 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 new file mode 100644 index 000000000..f7e40dc62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 new file mode 100644 index 000000000..08e05136f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 new file mode 100644 index 000000000..b8f9b1b9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 new file mode 100644 index 000000000..eabf7a80b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 new file mode 100644 index 000000000..26b95800d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 new file mode 100644 index 000000000..c2083a5ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 new file mode 100644 index 000000000..b716eae0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 new file mode 100644 index 000000000..c4045e6a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_139.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_139.smt2 new file mode 100644 index 000000000..4b433ea0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_139.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 new file mode 100644 index 000000000..46bfdb4fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 new file mode 100644 index 000000000..395deb7c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 new file mode 100644 index 000000000..53e7d97ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 new file mode 100644 index 000000000..f166854aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 new file mode 100644 index 000000000..bbc35baf4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 new file mode 100644 index 000000000..e5a878154 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 new file mode 100644 index 000000000..afabbe6d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 new file mode 100644 index 000000000..7b16fb8f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 new file mode 100644 index 000000000..3b5607229 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 new file mode 100644 index 000000000..3af14172b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_14.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_14.smt2 new file mode 100644 index 000000000..fe9f4016a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_14.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_140.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_140.smt2 new file mode 100644 index 000000000..c66134eb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_140.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 new file mode 100644 index 000000000..1a21f6541 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 new file mode 100644 index 000000000..727b9a436 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 new file mode 100644 index 000000000..1d5f54efe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 new file mode 100644 index 000000000..a12ec2135 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 new file mode 100644 index 000000000..654124e31 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 new file mode 100644 index 000000000..9da23df4f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 new file mode 100644 index 000000000..c9904b4b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 new file mode 100644 index 000000000..916924712 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 new file mode 100644 index 000000000..b143cfcc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 new file mode 100644 index 000000000..5517439a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_141.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_141.smt2 new file mode 100644 index 000000000..ac7863b58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_141.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 new file mode 100644 index 000000000..2a382464e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 new file mode 100644 index 000000000..04927439a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 new file mode 100644 index 000000000..5947b0996 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 new file mode 100644 index 000000000..703fb2fa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 new file mode 100644 index 000000000..48e472c8d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 new file mode 100644 index 000000000..4c30ac5c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 new file mode 100644 index 000000000..cb62d90db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 new file mode 100644 index 000000000..fd10c2a6b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 new file mode 100644 index 000000000..75a46fab3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 new file mode 100644 index 000000000..07f20f29c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_142.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_142.smt2 new file mode 100644 index 000000000..549b60eb0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_142.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 new file mode 100644 index 000000000..639fad9dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 new file mode 100644 index 000000000..750b3d79d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 new file mode 100644 index 000000000..b64a44fc0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 new file mode 100644 index 000000000..58a3987f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 new file mode 100644 index 000000000..0d3227559 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 new file mode 100644 index 000000000..15e2e5751 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 new file mode 100644 index 000000000..ca7ab94be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 new file mode 100644 index 000000000..8642ede87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 new file mode 100644 index 000000000..f105740af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 new file mode 100644 index 000000000..298f1c851 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_143.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_143.smt2 new file mode 100644 index 000000000..c5f8edde5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_143.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 new file mode 100644 index 000000000..8a0892766 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 new file mode 100644 index 000000000..2dc9fa85b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 new file mode 100644 index 000000000..fb38773ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 new file mode 100644 index 000000000..3b3b94a4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 new file mode 100644 index 000000000..ee6c2206b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 new file mode 100644 index 000000000..09e019c05 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 new file mode 100644 index 000000000..db111b22d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 new file mode 100644 index 000000000..0d6acfa31 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 new file mode 100644 index 000000000..f43ec31d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 new file mode 100644 index 000000000..25e4db928 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_144.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_144.smt2 new file mode 100644 index 000000000..36c422d86 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_144.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 new file mode 100644 index 000000000..9fc61771f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 new file mode 100644 index 000000000..64f98b988 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 new file mode 100644 index 000000000..57b208716 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 new file mode 100644 index 000000000..526f70440 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 new file mode 100644 index 000000000..b01fd9709 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 new file mode 100644 index 000000000..2a8084d63 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 new file mode 100644 index 000000000..ac2f7122f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 new file mode 100644 index 000000000..c433fba41 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 new file mode 100644 index 000000000..544bc2d30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 new file mode 100644 index 000000000..d5ac7c19e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_145.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_145.smt2 new file mode 100644 index 000000000..d9afc43f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_145.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 new file mode 100644 index 000000000..fc0d27334 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 new file mode 100644 index 000000000..f35509d5e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 new file mode 100644 index 000000000..1f9f9520c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 new file mode 100644 index 000000000..a9314cda7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 new file mode 100644 index 000000000..2b9405de9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 new file mode 100644 index 000000000..b8e5c30fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 new file mode 100644 index 000000000..222503ba1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 new file mode 100644 index 000000000..a51ab0083 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 new file mode 100644 index 000000000..0bcab85e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 new file mode 100644 index 000000000..6ddeac649 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_146.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_146.smt2 new file mode 100644 index 000000000..37cbdde91 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_146.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 new file mode 100644 index 000000000..0fa78d139 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 new file mode 100644 index 000000000..7943b471b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 new file mode 100644 index 000000000..2501b47b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 new file mode 100644 index 000000000..33b252ffb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 new file mode 100644 index 000000000..0594ef7ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 new file mode 100644 index 000000000..cbeb5f9a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 new file mode 100644 index 000000000..a7d7dca3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 new file mode 100644 index 000000000..956b0ac2e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 new file mode 100644 index 000000000..b8521a9f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 new file mode 100644 index 000000000..e12927c98 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_147.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_147.smt2 new file mode 100644 index 000000000..1a718b377 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_147.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 new file mode 100644 index 000000000..6b47d5de2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 new file mode 100644 index 000000000..3fa703e14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 new file mode 100644 index 000000000..b032073a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 new file mode 100644 index 000000000..f03e0ae4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 new file mode 100644 index 000000000..2ee0073bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 new file mode 100644 index 000000000..9f4ca6e84 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 new file mode 100644 index 000000000..13f253f1f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 new file mode 100644 index 000000000..754b292e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 new file mode 100644 index 000000000..867a32cd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 new file mode 100644 index 000000000..47333c81c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_148.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_148.smt2 new file mode 100644 index 000000000..799a845dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_148.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 new file mode 100644 index 000000000..7e5c03cc1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 new file mode 100644 index 000000000..362dca282 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 new file mode 100644 index 000000000..27198ebed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 new file mode 100644 index 000000000..014860083 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 new file mode 100644 index 000000000..bc0d65dfb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 new file mode 100644 index 000000000..436aa59ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 new file mode 100644 index 000000000..f2fa9a2b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 new file mode 100644 index 000000000..edb3c403a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 new file mode 100644 index 000000000..78b99e567 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 new file mode 100644 index 000000000..9c239503f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_149.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_149.smt2 new file mode 100644 index 000000000..0e9d11340 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_149.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 new file mode 100644 index 000000000..7588da4c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 new file mode 100644 index 000000000..9c1b6a1cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 new file mode 100644 index 000000000..87a10320f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 new file mode 100644 index 000000000..651752c47 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 new file mode 100644 index 000000000..141a22681 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 new file mode 100644 index 000000000..3df828071 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 new file mode 100644 index 000000000..6b8cd659c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 new file mode 100644 index 000000000..4203380fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 new file mode 100644 index 000000000..2e653006c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 new file mode 100644 index 000000000..0f540b211 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_15.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_15.smt2 new file mode 100644 index 000000000..5d1665b3f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_15.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_150.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_150.smt2 new file mode 100644 index 000000000..6fd86a351 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_150.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 new file mode 100644 index 000000000..6b2013744 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 new file mode 100644 index 000000000..085f9b613 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 new file mode 100644 index 000000000..8dc70da56 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 new file mode 100644 index 000000000..00b998d43 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 new file mode 100644 index 000000000..42d5ace2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 new file mode 100644 index 000000000..332e5ad16 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 new file mode 100644 index 000000000..7c6a177e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 new file mode 100644 index 000000000..defe0d8d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 new file mode 100644 index 000000000..d0c1ed0d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 new file mode 100644 index 000000000..daa0f42fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_151.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_151.smt2 new file mode 100644 index 000000000..6dac2a61e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_151.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 new file mode 100644 index 000000000..27a0c7bf5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 new file mode 100644 index 000000000..ce908d91d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 new file mode 100644 index 000000000..a3abc4ba0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 new file mode 100644 index 000000000..ecea4e275 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 new file mode 100644 index 000000000..fbe7b27b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 new file mode 100644 index 000000000..4425f3684 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 new file mode 100644 index 000000000..8320936f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 new file mode 100644 index 000000000..b5f1fe0bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 new file mode 100644 index 000000000..17c6cac30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 new file mode 100644 index 000000000..863e686fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_152.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_152.smt2 new file mode 100644 index 000000000..179953fea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_152.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 new file mode 100644 index 000000000..2c9d1dbd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 new file mode 100644 index 000000000..47a7a43a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 new file mode 100644 index 000000000..f7094a4e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 new file mode 100644 index 000000000..99a2b3558 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 new file mode 100644 index 000000000..a8ffe9742 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 new file mode 100644 index 000000000..482a86010 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 new file mode 100644 index 000000000..3a4cd02b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 new file mode 100644 index 000000000..391df312e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 new file mode 100644 index 000000000..998b10eb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 new file mode 100644 index 000000000..d5e87cab3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_153.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_153.smt2 new file mode 100644 index 000000000..6fdf5b85c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_153.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 new file mode 100644 index 000000000..be1e586ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 new file mode 100644 index 000000000..8ea73f0d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 new file mode 100644 index 000000000..b2308a0ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 new file mode 100644 index 000000000..c417d40dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 new file mode 100644 index 000000000..921e53533 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 new file mode 100644 index 000000000..9bafa8dea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 new file mode 100644 index 000000000..b5fc5dc3b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 new file mode 100644 index 000000000..f3bd1da59 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 new file mode 100644 index 000000000..02b2463f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 new file mode 100644 index 000000000..5375a6157 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_154.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_154.smt2 new file mode 100644 index 000000000..5e63b2916 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_154.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 new file mode 100644 index 000000000..ff6e730a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 new file mode 100644 index 000000000..e536f090b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 new file mode 100644 index 000000000..0ddd41e90 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 new file mode 100644 index 000000000..e607b949c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 new file mode 100644 index 000000000..09fbe402d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 new file mode 100644 index 000000000..7a20cf695 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 new file mode 100644 index 000000000..afe1465c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 new file mode 100644 index 000000000..9ec9d0914 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 new file mode 100644 index 000000000..2742c7ca2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 new file mode 100644 index 000000000..073199761 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_155.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_155.smt2 new file mode 100644 index 000000000..5d7677bf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_155.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 new file mode 100644 index 000000000..f7549a04c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 new file mode 100644 index 000000000..840da9e81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 new file mode 100644 index 000000000..eabf944ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 new file mode 100644 index 000000000..409ab44e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 new file mode 100644 index 000000000..f093f56b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 new file mode 100644 index 000000000..c6da36226 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 new file mode 100644 index 000000000..aa2aa9f98 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 new file mode 100644 index 000000000..809c3a877 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 new file mode 100644 index 000000000..d67b4968e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 new file mode 100644 index 000000000..4c41016cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_156.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_156.smt2 new file mode 100644 index 000000000..632d87c62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_156.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 new file mode 100644 index 000000000..0efd50b54 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 new file mode 100644 index 000000000..17bce6255 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 new file mode 100644 index 000000000..c547ceefb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 new file mode 100644 index 000000000..78ffab8ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 new file mode 100644 index 000000000..6116336a8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 new file mode 100644 index 000000000..673eca342 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 new file mode 100644 index 000000000..775080771 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 new file mode 100644 index 000000000..f59f6a520 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 new file mode 100644 index 000000000..205a64fd9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 new file mode 100644 index 000000000..25850a882 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_157.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_157.smt2 new file mode 100644 index 000000000..afafc3640 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_157.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 new file mode 100644 index 000000000..bfac28e1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 new file mode 100644 index 000000000..5fbd13188 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 new file mode 100644 index 000000000..8228eda55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 new file mode 100644 index 000000000..f24e7f974 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 new file mode 100644 index 000000000..21ac5702c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 new file mode 100644 index 000000000..5cfcd7448 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 new file mode 100644 index 000000000..90ceb4957 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 new file mode 100644 index 000000000..ce18c3b1c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 new file mode 100644 index 000000000..b954f1ebb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 new file mode 100644 index 000000000..180daf31d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_158.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_158.smt2 new file mode 100644 index 000000000..f6b28aebf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_158.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 new file mode 100644 index 000000000..f3c564881 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 new file mode 100644 index 000000000..28c901e11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 new file mode 100644 index 000000000..f9553ca60 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 new file mode 100644 index 000000000..61976bd66 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 new file mode 100644 index 000000000..cfe150524 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 new file mode 100644 index 000000000..aab650200 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 new file mode 100644 index 000000000..e56600084 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 new file mode 100644 index 000000000..14b804e46 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 new file mode 100644 index 000000000..856fb17a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 new file mode 100644 index 000000000..5e43f8268 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_159.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_159.smt2 new file mode 100644 index 000000000..f802fd760 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_159.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 new file mode 100644 index 000000000..b06cbf220 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 new file mode 100644 index 000000000..80dcfb932 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 new file mode 100644 index 000000000..0fc82b81e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 new file mode 100644 index 000000000..e00a43859 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 new file mode 100644 index 000000000..c8fa157c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 new file mode 100644 index 000000000..9345c8d24 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 new file mode 100644 index 000000000..665f688a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 new file mode 100644 index 000000000..7e768354e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 new file mode 100644 index 000000000..c952decbe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 new file mode 100644 index 000000000..adc63ab9d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_16.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_16.smt2 new file mode 100644 index 000000000..ba84ddf44 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_16.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_160.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_160.smt2 new file mode 100644 index 000000000..eca9ff61a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_160.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 new file mode 100644 index 000000000..b62b9046b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 new file mode 100644 index 000000000..c106466ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 new file mode 100644 index 000000000..ffa09339d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 new file mode 100644 index 000000000..102cf7294 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 new file mode 100644 index 000000000..7043ac5ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 new file mode 100644 index 000000000..4f5838218 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 new file mode 100644 index 000000000..b42b1daf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 new file mode 100644 index 000000000..60d5456a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 new file mode 100644 index 000000000..352791d4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 new file mode 100644 index 000000000..f6b761c23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_161.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_161.smt2 new file mode 100644 index 000000000..80314c793 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_161.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 new file mode 100644 index 000000000..9d6ce8d30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 new file mode 100644 index 000000000..6e92df2ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 new file mode 100644 index 000000000..7f9b3f536 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 new file mode 100644 index 000000000..fb8627663 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 new file mode 100644 index 000000000..781e13190 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 new file mode 100644 index 000000000..5238e4547 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 new file mode 100644 index 000000000..def01180e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 new file mode 100644 index 000000000..d7cc64562 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 new file mode 100644 index 000000000..843c69fef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 new file mode 100644 index 000000000..b6acf9cfd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_162.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_162.smt2 new file mode 100644 index 000000000..0fa7cccc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_162.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 new file mode 100644 index 000000000..cf9e175d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 new file mode 100644 index 000000000..713adddd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 new file mode 100644 index 000000000..c7d3b78e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 new file mode 100644 index 000000000..1ba6eb4eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 new file mode 100644 index 000000000..f1dc78413 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 new file mode 100644 index 000000000..45c3d125b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 new file mode 100644 index 000000000..dadae26bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 new file mode 100644 index 000000000..74a7b113e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 new file mode 100644 index 000000000..8d00a7e8d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 new file mode 100644 index 000000000..bceaaf0e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_163.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_163.smt2 new file mode 100644 index 000000000..457e930c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_163.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 new file mode 100644 index 000000000..ecb697168 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 new file mode 100644 index 000000000..bc6a2fd39 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 new file mode 100644 index 000000000..aa36a6f67 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 new file mode 100644 index 000000000..a305a4edd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 new file mode 100644 index 000000000..583a6b089 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 new file mode 100644 index 000000000..4b6ddaf1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 new file mode 100644 index 000000000..bb7003b3e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 new file mode 100644 index 000000000..e2c2fa8fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 new file mode 100644 index 000000000..2a9854276 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 new file mode 100644 index 000000000..e2f6bbdae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_164.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_164.smt2 new file mode 100644 index 000000000..e848392b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_164.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 new file mode 100644 index 000000000..bb94a408d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 new file mode 100644 index 000000000..4b7738123 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 new file mode 100644 index 000000000..121940fd0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 new file mode 100644 index 000000000..246244d5e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 new file mode 100644 index 000000000..a00f60b7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 new file mode 100644 index 000000000..328b47911 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 new file mode 100644 index 000000000..4524c3e46 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 new file mode 100644 index 000000000..12ef9f4ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 new file mode 100644 index 000000000..9281662df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 new file mode 100644 index 000000000..cbea682c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_165.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_165.smt2 new file mode 100644 index 000000000..36f5ce8a8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_165.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 new file mode 100644 index 000000000..4700a591c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 new file mode 100644 index 000000000..fd44c3cc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 new file mode 100644 index 000000000..15557e196 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 new file mode 100644 index 000000000..59f335393 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 new file mode 100644 index 000000000..f8fea969f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 new file mode 100644 index 000000000..ab4597cb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 new file mode 100644 index 000000000..2990ca4c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 new file mode 100644 index 000000000..8805de0dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 new file mode 100644 index 000000000..ec4bcc07f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 new file mode 100644 index 000000000..b450e7dee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_166.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_166.smt2 new file mode 100644 index 000000000..607b3f54a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_166.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 new file mode 100644 index 000000000..afdf22295 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 new file mode 100644 index 000000000..b3c02954d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 new file mode 100644 index 000000000..6e3fb2b14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 new file mode 100644 index 000000000..0cf85812b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 new file mode 100644 index 000000000..735cf5769 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 new file mode 100644 index 000000000..9b887ad6f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 new file mode 100644 index 000000000..4b6c13ba6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 new file mode 100644 index 000000000..dcd5d4816 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 new file mode 100644 index 000000000..79f251db2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 new file mode 100644 index 000000000..e30b586df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_167.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_167.smt2 new file mode 100644 index 000000000..76e2d7c2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_167.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 new file mode 100644 index 000000000..28fa65c53 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 new file mode 100644 index 000000000..e6d92c1f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 new file mode 100644 index 000000000..179f66688 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 new file mode 100644 index 000000000..0b64a0770 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 new file mode 100644 index 000000000..68e069d63 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 new file mode 100644 index 000000000..3bc7949a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 new file mode 100644 index 000000000..d003a6f27 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 new file mode 100644 index 000000000..bb9c394b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 new file mode 100644 index 000000000..d2a7d98da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 new file mode 100644 index 000000000..825bab624 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_168.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_168.smt2 new file mode 100644 index 000000000..781de09be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_168.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 new file mode 100644 index 000000000..dffc0dbd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 new file mode 100644 index 000000000..64c1ffa7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 new file mode 100644 index 000000000..aba711633 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 new file mode 100644 index 000000000..78494c90d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 new file mode 100644 index 000000000..8f7143c08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 new file mode 100644 index 000000000..19cf6f4f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 new file mode 100644 index 000000000..4a45aeabe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 new file mode 100644 index 000000000..982267a42 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 new file mode 100644 index 000000000..58bf5f0a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 new file mode 100644 index 000000000..b2e7b079e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_169.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_169.smt2 new file mode 100644 index 000000000..e0f2ff1a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_169.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 new file mode 100644 index 000000000..76753ad47 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 new file mode 100644 index 000000000..c7c918d3a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 new file mode 100644 index 000000000..5a85a7992 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 new file mode 100644 index 000000000..867d7bef7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 new file mode 100644 index 000000000..098ba718c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 new file mode 100644 index 000000000..fa8b5cc7e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 new file mode 100644 index 000000000..f1f8a0b52 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 new file mode 100644 index 000000000..a543360c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 new file mode 100644 index 000000000..1ab7e4739 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 new file mode 100644 index 000000000..7cb681b19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_17.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_17.smt2 new file mode 100644 index 000000000..6e9bf839b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_17.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_170.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_170.smt2 new file mode 100644 index 000000000..d75fdc520 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_170.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 new file mode 100644 index 000000000..62e7cf71f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 new file mode 100644 index 000000000..ce702f546 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 new file mode 100644 index 000000000..8189f2ac1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 new file mode 100644 index 000000000..a2a0068e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 new file mode 100644 index 000000000..63d7fa847 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 new file mode 100644 index 000000000..cc578fdc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 new file mode 100644 index 000000000..3bbac9c2f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 new file mode 100644 index 000000000..48b256b31 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 new file mode 100644 index 000000000..32b785e2c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 new file mode 100644 index 000000000..5bfee1956 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_171.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_171.smt2 new file mode 100644 index 000000000..b327ce091 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_171.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 new file mode 100644 index 000000000..c70ed9d2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 new file mode 100644 index 000000000..0979a6492 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 new file mode 100644 index 000000000..a02c5b94c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 new file mode 100644 index 000000000..b393092e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 new file mode 100644 index 000000000..2252a546e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 new file mode 100644 index 000000000..ea07eb88c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 new file mode 100644 index 000000000..47edbdea6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 new file mode 100644 index 000000000..e2303390a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 new file mode 100644 index 000000000..54499f42a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 new file mode 100644 index 000000000..271cde7cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_172.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_172.smt2 new file mode 100644 index 000000000..5d4c31b25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_172.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 new file mode 100644 index 000000000..e20f3078e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 new file mode 100644 index 000000000..ec781765e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 new file mode 100644 index 000000000..49ba6e2eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 new file mode 100644 index 000000000..5f7742956 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 new file mode 100644 index 000000000..d0bd2ede7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 new file mode 100644 index 000000000..d3dc5ed88 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 new file mode 100644 index 000000000..0b15da6a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 new file mode 100644 index 000000000..7b6b3f90b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 new file mode 100644 index 000000000..9d5ff4944 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 new file mode 100644 index 000000000..87a0903e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_173.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_173.smt2 new file mode 100644 index 000000000..1305c7923 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_173.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 new file mode 100644 index 000000000..108442f8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 new file mode 100644 index 000000000..6db7870e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 new file mode 100644 index 000000000..5d29222db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 new file mode 100644 index 000000000..79ce178c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 new file mode 100644 index 000000000..86746f033 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 new file mode 100644 index 000000000..812f93cf5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 new file mode 100644 index 000000000..b6bfc1a93 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 new file mode 100644 index 000000000..acca42464 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 new file mode 100644 index 000000000..322cc7b05 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 new file mode 100644 index 000000000..f8e4190f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_174.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_174.smt2 new file mode 100644 index 000000000..80e028842 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_174.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 new file mode 100644 index 000000000..073808704 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 new file mode 100644 index 000000000..65fbbc93d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 new file mode 100644 index 000000000..3b0f251e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 new file mode 100644 index 000000000..1d9fbcc9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 new file mode 100644 index 000000000..540cb12c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 new file mode 100644 index 000000000..709fb1760 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 new file mode 100644 index 000000000..812ae77cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 new file mode 100644 index 000000000..256206deb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 new file mode 100644 index 000000000..145c77a73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 new file mode 100644 index 000000000..8fa14f4ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_175.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_175.smt2 new file mode 100644 index 000000000..50bc068c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_175.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 new file mode 100644 index 000000000..9a3c3a826 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 new file mode 100644 index 000000000..d2d1d7d8d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 new file mode 100644 index 000000000..ff6191a3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 new file mode 100644 index 000000000..9ac371e23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 new file mode 100644 index 000000000..54d94ac0c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 new file mode 100644 index 000000000..c962cbcd3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 new file mode 100644 index 000000000..5b71463a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 new file mode 100644 index 000000000..fac44606e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 new file mode 100644 index 000000000..0dabd1330 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 new file mode 100644 index 000000000..0fd7293f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_176.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_176.smt2 new file mode 100644 index 000000000..9ea30f9a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_176.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 new file mode 100644 index 000000000..13c86b91e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 new file mode 100644 index 000000000..cfd552ecb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 new file mode 100644 index 000000000..dca0c59f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 new file mode 100644 index 000000000..061d1e000 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 new file mode 100644 index 000000000..6ca98b1f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 new file mode 100644 index 000000000..4d23066ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 new file mode 100644 index 000000000..26f7c72e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 new file mode 100644 index 000000000..f079e14b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 new file mode 100644 index 000000000..1485e3e81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 new file mode 100644 index 000000000..1ba773907 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_177.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_177.smt2 new file mode 100644 index 000000000..af00febdc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_177.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 new file mode 100644 index 000000000..c187b7308 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 new file mode 100644 index 000000000..2dea6e552 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 new file mode 100644 index 000000000..4a1a26e75 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 new file mode 100644 index 000000000..1da804a7d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 new file mode 100644 index 000000000..71e677238 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 new file mode 100644 index 000000000..15661646a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 new file mode 100644 index 000000000..42f70d230 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 new file mode 100644 index 000000000..3ff2d9fe9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 new file mode 100644 index 000000000..cbdd325c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 new file mode 100644 index 000000000..1ff3196bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_178.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_178.smt2 new file mode 100644 index 000000000..0b9c5885a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_178.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 new file mode 100644 index 000000000..6f1af1b00 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 new file mode 100644 index 000000000..ef0977275 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 new file mode 100644 index 000000000..90f2cae39 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 new file mode 100644 index 000000000..485a9c2bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 new file mode 100644 index 000000000..df836e51a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 new file mode 100644 index 000000000..1e8814357 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 new file mode 100644 index 000000000..b6c18be3f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 new file mode 100644 index 000000000..ab1004d98 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 new file mode 100644 index 000000000..18802f491 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 new file mode 100644 index 000000000..28a159e11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_179.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_179.smt2 new file mode 100644 index 000000000..022862078 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_179.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 new file mode 100644 index 000000000..700752f03 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 new file mode 100644 index 000000000..06d1bcf25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 new file mode 100644 index 000000000..77fc6e638 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 new file mode 100644 index 000000000..3529b81af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 new file mode 100644 index 000000000..31107e2b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 new file mode 100644 index 000000000..82e160074 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 new file mode 100644 index 000000000..9831c50c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 new file mode 100644 index 000000000..e182c4b7f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 new file mode 100644 index 000000000..948b21d51 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 new file mode 100644 index 000000000..384b3e54b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_18.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_18.smt2 new file mode 100644 index 000000000..b56e00013 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_18.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_180.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_180.smt2 new file mode 100644 index 000000000..d45a71a96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_180.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 new file mode 100644 index 000000000..e27b26467 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 new file mode 100644 index 000000000..5895cc9ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 new file mode 100644 index 000000000..4a80260cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 new file mode 100644 index 000000000..05316815b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 new file mode 100644 index 000000000..03396e8ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 new file mode 100644 index 000000000..fddb83940 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 new file mode 100644 index 000000000..71f35ba22 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 new file mode 100644 index 000000000..5d91653df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 new file mode 100644 index 000000000..d43ba2132 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 new file mode 100644 index 000000000..8cf60755a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_181.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_181.smt2 new file mode 100644 index 000000000..15119fadd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_181.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 new file mode 100644 index 000000000..e9eecd931 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 new file mode 100644 index 000000000..9de14c213 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 new file mode 100644 index 000000000..756ccde99 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 new file mode 100644 index 000000000..096fcd55f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 new file mode 100644 index 000000000..de64ff0e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 new file mode 100644 index 000000000..d27821c0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 new file mode 100644 index 000000000..25ad4fc31 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 new file mode 100644 index 000000000..7b2f793ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 new file mode 100644 index 000000000..97da30a44 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 new file mode 100644 index 000000000..b7f6b680d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_182.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_182.smt2 new file mode 100644 index 000000000..d0332bcc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_182.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 new file mode 100644 index 000000000..d492a49fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 new file mode 100644 index 000000000..cefe5e735 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 new file mode 100644 index 000000000..e11f76e01 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 new file mode 100644 index 000000000..078445189 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 new file mode 100644 index 000000000..bcb645f1c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 new file mode 100644 index 000000000..e79ce7cdb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 new file mode 100644 index 000000000..01d856654 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 new file mode 100644 index 000000000..cfba53e4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 new file mode 100644 index 000000000..4271ee8ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 new file mode 100644 index 000000000..48cf19684 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_183.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_183.smt2 new file mode 100644 index 000000000..0ff40c92d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_183.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 new file mode 100644 index 000000000..b05c7ab54 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 new file mode 100644 index 000000000..6499fd4fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 new file mode 100644 index 000000000..5a046e0b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 new file mode 100644 index 000000000..f8725d249 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 new file mode 100644 index 000000000..40235939c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 new file mode 100644 index 000000000..e64798916 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 new file mode 100644 index 000000000..05646f0c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 new file mode 100644 index 000000000..056d5bf4d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 new file mode 100644 index 000000000..75d22500f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 new file mode 100644 index 000000000..3e64005fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_184.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_184.smt2 new file mode 100644 index 000000000..b7be2c9a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_184.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 new file mode 100644 index 000000000..76da48dfa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 new file mode 100644 index 000000000..020c95d0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 new file mode 100644 index 000000000..2d1acf3b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 new file mode 100644 index 000000000..d97128d1b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 new file mode 100644 index 000000000..a4d14149d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 new file mode 100644 index 000000000..67f031aae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 new file mode 100644 index 000000000..33163e7e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 new file mode 100644 index 000000000..345858251 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 new file mode 100644 index 000000000..c23d2f79c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 new file mode 100644 index 000000000..ea5938915 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_185.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_185.smt2 new file mode 100644 index 000000000..2eea05e5f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_185.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 new file mode 100644 index 000000000..160113163 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 new file mode 100644 index 000000000..6bdd58b23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 new file mode 100644 index 000000000..57ad492be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 new file mode 100644 index 000000000..4862be44a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 new file mode 100644 index 000000000..a05605ab5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 new file mode 100644 index 000000000..5e4d628c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 new file mode 100644 index 000000000..567e8de8d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 new file mode 100644 index 000000000..144d8fc64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 new file mode 100644 index 000000000..2e05fd9a8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 new file mode 100644 index 000000000..5953ae4b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_186.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_186.smt2 new file mode 100644 index 000000000..47539d19f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_186.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 new file mode 100644 index 000000000..2243c2caa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 new file mode 100644 index 000000000..f7b9312ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 new file mode 100644 index 000000000..f15ff1a09 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 new file mode 100644 index 000000000..3b00627f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 new file mode 100644 index 000000000..43f5cb57b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 new file mode 100644 index 000000000..6cf394d8a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 new file mode 100644 index 000000000..33d0a5f81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 new file mode 100644 index 000000000..2ac2f2fa8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 new file mode 100644 index 000000000..de3e11488 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 new file mode 100644 index 000000000..c6ba2badf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_187.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_187.smt2 new file mode 100644 index 000000000..2f0fee3bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_187.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 new file mode 100644 index 000000000..e609c7057 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 new file mode 100644 index 000000000..5c641899a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 new file mode 100644 index 000000000..2340bf540 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 new file mode 100644 index 000000000..a75f80775 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 new file mode 100644 index 000000000..13696afc8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 new file mode 100644 index 000000000..84846a1d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 new file mode 100644 index 000000000..2d931af2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 new file mode 100644 index 000000000..76dd775bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 new file mode 100644 index 000000000..a70d7df5f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 new file mode 100644 index 000000000..2f5772790 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_188.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_188.smt2 new file mode 100644 index 000000000..30b3f08c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_188.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 new file mode 100644 index 000000000..d773b5d3f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 new file mode 100644 index 000000000..047292407 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 new file mode 100644 index 000000000..005ada7dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 new file mode 100644 index 000000000..acbb16655 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 new file mode 100644 index 000000000..1bfb321a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 new file mode 100644 index 000000000..7782e7341 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 new file mode 100644 index 000000000..d15713e85 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 new file mode 100644 index 000000000..5a1b38343 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 new file mode 100644 index 000000000..f7d74e742 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 new file mode 100644 index 000000000..ebbdc262e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_189.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_189.smt2 new file mode 100644 index 000000000..348024452 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_189.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 new file mode 100644 index 000000000..d92fe27b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 new file mode 100644 index 000000000..b3e4c5456 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 new file mode 100644 index 000000000..1a36646fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 new file mode 100644 index 000000000..b06e6411a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 new file mode 100644 index 000000000..bb171d6bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 new file mode 100644 index 000000000..9993526f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 new file mode 100644 index 000000000..b37018fb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 new file mode 100644 index 000000000..8acee4c11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 new file mode 100644 index 000000000..01660afa7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 new file mode 100644 index 000000000..31f398685 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_19.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_19.smt2 new file mode 100644 index 000000000..9af340092 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_19.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_190.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_190.smt2 new file mode 100644 index 000000000..35a0965a8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_190.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 new file mode 100644 index 000000000..b13d49459 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 new file mode 100644 index 000000000..d0eac3802 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 new file mode 100644 index 000000000..bbaca5110 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 new file mode 100644 index 000000000..97990e93b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 new file mode 100644 index 000000000..e46d05974 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 new file mode 100644 index 000000000..2428fb55a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 new file mode 100644 index 000000000..82d96a2c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1110")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 new file mode 100644 index 000000000..bced1dee4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 new file mode 100644 index 000000000..865881209 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 new file mode 100644 index 000000000..c8d00939a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_191.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_191.smt2 new file mode 100644 index 000000000..1b3437b3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_191.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 new file mode 100644 index 000000000..645babd81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 new file mode 100644 index 000000000..baa045ca4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 new file mode 100644 index 000000000..c8bc1a7f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 new file mode 100644 index 000000000..ef8e1422a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 new file mode 100644 index 000000000..7cf6a9c76 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 new file mode 100644 index 000000000..1e0401844 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 new file mode 100644 index 000000000..cc956dd02 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 new file mode 100644 index 000000000..fa71e68b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 new file mode 100644 index 000000000..2b888befd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 new file mode 100644 index 000000000..165c2a474 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_192.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_192.smt2 new file mode 100644 index 000000000..d4b81ba35 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_192.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 new file mode 100644 index 000000000..ca5dc73f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 new file mode 100644 index 000000000..da560fe19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 new file mode 100644 index 000000000..50e49a3fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 new file mode 100644 index 000000000..431db86a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 new file mode 100644 index 000000000..43a769bd2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 new file mode 100644 index 000000000..860597623 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 new file mode 100644 index 000000000..3e604c1e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 new file mode 100644 index 000000000..58c15d2bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 new file mode 100644 index 000000000..0f5c87daf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 new file mode 100644 index 000000000..d1f9b3dff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_193.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_193.smt2 new file mode 100644 index 000000000..d29b6f006 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_193.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 new file mode 100644 index 000000000..cec611547 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 new file mode 100644 index 000000000..26bcecec7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 new file mode 100644 index 000000000..7896ea9a8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 new file mode 100644 index 000000000..736a11c23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 new file mode 100644 index 000000000..7c54e543a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 new file mode 100644 index 000000000..b29160cd4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 new file mode 100644 index 000000000..62274faab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 new file mode 100644 index 000000000..33aeb7158 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 new file mode 100644 index 000000000..fbfb5849c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 new file mode 100644 index 000000000..427caddae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_194.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_194.smt2 new file mode 100644 index 000000000..a79e8b414 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_194.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 new file mode 100644 index 000000000..0ac978069 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 new file mode 100644 index 000000000..96c358f17 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 new file mode 100644 index 000000000..c8b56fbe3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 new file mode 100644 index 000000000..ed7585f86 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 new file mode 100644 index 000000000..a608785c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 new file mode 100644 index 000000000..184a27239 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 new file mode 100644 index 000000000..241c3582e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 new file mode 100644 index 000000000..aaaddd7a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 new file mode 100644 index 000000000..695bbe9a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 new file mode 100644 index 000000000..fb92afca3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_195.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_195.smt2 new file mode 100644 index 000000000..09672753a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_195.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 new file mode 100644 index 000000000..09a521e66 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 new file mode 100644 index 000000000..7cd7ec422 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 new file mode 100644 index 000000000..f9a69e58e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 new file mode 100644 index 000000000..fbd77561c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 new file mode 100644 index 000000000..2817e1516 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 new file mode 100644 index 000000000..518113832 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 new file mode 100644 index 000000000..d2a91ea9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 new file mode 100644 index 000000000..eef540627 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 new file mode 100644 index 000000000..43717b660 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 new file mode 100644 index 000000000..c51abf7fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_196.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_196.smt2 new file mode 100644 index 000000000..c323871bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_196.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 new file mode 100644 index 000000000..0ecf6fced --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 new file mode 100644 index 000000000..b3aca3263 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 new file mode 100644 index 000000000..a6484eb88 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 new file mode 100644 index 000000000..63346ef5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 new file mode 100644 index 000000000..a095f3015 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 new file mode 100644 index 000000000..a2d0c93c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 new file mode 100644 index 000000000..f851b9a23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 new file mode 100644 index 000000000..5bdb62c2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 new file mode 100644 index 000000000..bb8a0b713 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 new file mode 100644 index 000000000..598a8310e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_197.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_197.smt2 new file mode 100644 index 000000000..e8d9d2791 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_197.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 new file mode 100644 index 000000000..0c1f167f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 new file mode 100644 index 000000000..8c9591c11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 new file mode 100644 index 000000000..57fc3503b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 new file mode 100644 index 000000000..9cfb968d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 new file mode 100644 index 000000000..7ee223ee8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 new file mode 100644 index 000000000..f5249932f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 new file mode 100644 index 000000000..c899463b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 new file mode 100644 index 000000000..3c3eec309 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 new file mode 100644 index 000000000..6055a088b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 new file mode 100644 index 000000000..2edd04db2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_198.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_198.smt2 new file mode 100644 index 000000000..2687879bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_198.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 new file mode 100644 index 000000000..ebc1a9c38 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 new file mode 100644 index 000000000..62183ebd7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 new file mode 100644 index 000000000..b8d978240 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 new file mode 100644 index 000000000..671ceea3f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 new file mode 100644 index 000000000..6e95715ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 new file mode 100644 index 000000000..01b4c0151 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 new file mode 100644 index 000000000..292a03188 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 new file mode 100644 index 000000000..65819393a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 new file mode 100644 index 000000000..a030122c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 new file mode 100644 index 000000000..b156ba7cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_199.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_199.smt2 new file mode 100644 index 000000000..6f9f1bec8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_199.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 new file mode 100644 index 000000000..39f3370c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 new file mode 100644 index 000000000..d6b104427 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 new file mode 100644 index 000000000..c7f6c9b5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 new file mode 100644 index 000000000..bc4030ccc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 new file mode 100644 index 000000000..ec6cd5a9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 new file mode 100644 index 000000000..3e1548ea7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 new file mode 100644 index 000000000..144be1e64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 new file mode 100644 index 000000000..65d8676f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 new file mode 100644 index 000000000..8772c5ca6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 new file mode 100644 index 000000000..e198fc4ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2.smt2 new file mode 100644 index 000000000..70d4bcfe2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_20.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_20.smt2 new file mode 100644 index 000000000..60119b2c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_20.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_200.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_200.smt2 new file mode 100644 index 000000000..6446985bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_200.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 new file mode 100644 index 000000000..fb92169b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 new file mode 100644 index 000000000..658ed006f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 new file mode 100644 index 000000000..26e98d630 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 new file mode 100644 index 000000000..f59f1645b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 new file mode 100644 index 000000000..185151e4d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 new file mode 100644 index 000000000..4c7861fd0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 new file mode 100644 index 000000000..b22ad43a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 new file mode 100644 index 000000000..a994dd1d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 new file mode 100644 index 000000000..35f55b3d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 new file mode 100644 index 000000000..69f1ca035 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_201.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_201.smt2 new file mode 100644 index 000000000..92242044c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_201.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 new file mode 100644 index 000000000..90b04122e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 new file mode 100644 index 000000000..141499b88 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 new file mode 100644 index 000000000..b3fb3c048 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 new file mode 100644 index 000000000..217a86a44 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 new file mode 100644 index 000000000..2e0ff025e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 new file mode 100644 index 000000000..724c1a092 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 new file mode 100644 index 000000000..4204347e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 new file mode 100644 index 000000000..f4c41c867 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 new file mode 100644 index 000000000..e4cdf888a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 new file mode 100644 index 000000000..e2eb5032e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_202.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_202.smt2 new file mode 100644 index 000000000..934480b2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_202.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 new file mode 100644 index 000000000..ac2cc11ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 new file mode 100644 index 000000000..6c59d57bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 new file mode 100644 index 000000000..c43fdbe24 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 new file mode 100644 index 000000000..9af52eb12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 new file mode 100644 index 000000000..b33b2a758 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 new file mode 100644 index 000000000..62bb0c3f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 new file mode 100644 index 000000000..e35758133 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 new file mode 100644 index 000000000..abe94636b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 new file mode 100644 index 000000000..b4d57f860 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 new file mode 100644 index 000000000..f107662fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_203.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_203.smt2 new file mode 100644 index 000000000..9e5e713c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_203.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 new file mode 100644 index 000000000..5ef035d0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 new file mode 100644 index 000000000..fa0bc8e14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 new file mode 100644 index 000000000..a27bb9e69 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 new file mode 100644 index 000000000..c86544c94 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 new file mode 100644 index 000000000..bb3c516e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 new file mode 100644 index 000000000..e6eef132a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 new file mode 100644 index 000000000..538069922 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 new file mode 100644 index 000000000..bf06e2d19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 new file mode 100644 index 000000000..4acab7d27 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 new file mode 100644 index 000000000..ff2d40599 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_204.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_204.smt2 new file mode 100644 index 000000000..62b126d72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_204.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 new file mode 100644 index 000000000..5710f7720 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 new file mode 100644 index 000000000..285b91f3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 new file mode 100644 index 000000000..a3c9ca39d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 new file mode 100644 index 000000000..7df467d3a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 new file mode 100644 index 000000000..6af5348ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 new file mode 100644 index 000000000..a9235315c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 new file mode 100644 index 000000000..2efe57675 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 new file mode 100644 index 000000000..5d35e1cf6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 new file mode 100644 index 000000000..c6364c93b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 new file mode 100644 index 000000000..b5ce51d35 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_205.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_205.smt2 new file mode 100644 index 000000000..994ae5dfd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_205.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 new file mode 100644 index 000000000..99ea6d7e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 new file mode 100644 index 000000000..98c528daf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 new file mode 100644 index 000000000..0bb783ed2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 new file mode 100644 index 000000000..69b039322 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 new file mode 100644 index 000000000..3bd60ce2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 new file mode 100644 index 000000000..6a02e0169 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 new file mode 100644 index 000000000..6516f9cbc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 new file mode 100644 index 000000000..7fc56fe28 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 new file mode 100644 index 000000000..84accabd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 new file mode 100644 index 000000000..10083e4f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_206.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_206.smt2 new file mode 100644 index 000000000..00e13bb0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_206.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 new file mode 100644 index 000000000..58413491e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 new file mode 100644 index 000000000..358689260 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 new file mode 100644 index 000000000..d9ba619c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 new file mode 100644 index 000000000..46a3e0ef9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 new file mode 100644 index 000000000..44db875f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 new file mode 100644 index 000000000..b741fb805 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 new file mode 100644 index 000000000..97170beb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 new file mode 100644 index 000000000..4620ee235 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 new file mode 100644 index 000000000..da35044f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 new file mode 100644 index 000000000..238aa28a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_207.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_207.smt2 new file mode 100644 index 000000000..43f1315ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_207.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 new file mode 100644 index 000000000..bcf586132 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 new file mode 100644 index 000000000..701bd59eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 new file mode 100644 index 000000000..d2ef16245 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 new file mode 100644 index 000000000..093ee04de --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 new file mode 100644 index 000000000..1c237bb24 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 new file mode 100644 index 000000000..1e2efb6bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 new file mode 100644 index 000000000..434915f02 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 new file mode 100644 index 000000000..019c27556 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 new file mode 100644 index 000000000..f72274550 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 new file mode 100644 index 000000000..5bdc4a3db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_208.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_208.smt2 new file mode 100644 index 000000000..d70ac255b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_208.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 new file mode 100644 index 000000000..a064c44c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 new file mode 100644 index 000000000..190b85c87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 new file mode 100644 index 000000000..770476392 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 new file mode 100644 index 000000000..e36193674 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 new file mode 100644 index 000000000..0948333f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 new file mode 100644 index 000000000..a26662287 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 new file mode 100644 index 000000000..9419228ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 new file mode 100644 index 000000000..64a4bf8b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 new file mode 100644 index 000000000..c3bea0116 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 new file mode 100644 index 000000000..e621e13fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_209.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_209.smt2 new file mode 100644 index 000000000..f483f7c24 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_209.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 new file mode 100644 index 000000000..37e4d1aa0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 new file mode 100644 index 000000000..712b8d898 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 new file mode 100644 index 000000000..adfbb6647 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 new file mode 100644 index 000000000..d6e838cc5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 new file mode 100644 index 000000000..c1ddb6fa8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 new file mode 100644 index 000000000..88372bed8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 new file mode 100644 index 000000000..8cadff4b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 new file mode 100644 index 000000000..c7027d9b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 new file mode 100644 index 000000000..ddfc6f2c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 new file mode 100644 index 000000000..1073d63ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_21.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_21.smt2 new file mode 100644 index 000000000..d9a37b05d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_21.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_210.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_210.smt2 new file mode 100644 index 000000000..f381c3c9d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_210.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 new file mode 100644 index 000000000..c6ae89da8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 new file mode 100644 index 000000000..031412421 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 new file mode 100644 index 000000000..fddf9d05b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 new file mode 100644 index 000000000..cbd987ed7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 new file mode 100644 index 000000000..69735da8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 new file mode 100644 index 000000000..96da977ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 new file mode 100644 index 000000000..7624e06d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 new file mode 100644 index 000000000..74b80e694 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 new file mode 100644 index 000000000..3e2016190 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 new file mode 100644 index 000000000..f49b2d0aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_211.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_211.smt2 new file mode 100644 index 000000000..3571a91cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_211.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 new file mode 100644 index 000000000..42f9508b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 new file mode 100644 index 000000000..b38a48117 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 new file mode 100644 index 000000000..bdffb811a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 new file mode 100644 index 000000000..f3de15ef1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 new file mode 100644 index 000000000..36696f2c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 new file mode 100644 index 000000000..61b0ff564 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 new file mode 100644 index 000000000..c06c93a92 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 new file mode 100644 index 000000000..c64b779f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 new file mode 100644 index 000000000..aab2420ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 new file mode 100644 index 000000000..63e578ad5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_212.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_212.smt2 new file mode 100644 index 000000000..f840f938c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_212.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 new file mode 100644 index 000000000..fc590b65b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 new file mode 100644 index 000000000..97abf8140 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 new file mode 100644 index 000000000..fe038ceb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 new file mode 100644 index 000000000..7322d2b29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 new file mode 100644 index 000000000..2fc729f74 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 new file mode 100644 index 000000000..bbdf8e93f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 new file mode 100644 index 000000000..2d40fc357 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 new file mode 100644 index 000000000..bf4b5cd70 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 new file mode 100644 index 000000000..8c0274711 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 new file mode 100644 index 000000000..b4dd598b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_213.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_213.smt2 new file mode 100644 index 000000000..7bfafac8c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_213.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 new file mode 100644 index 000000000..4dcd87853 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 new file mode 100644 index 000000000..4dcf0d7bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 new file mode 100644 index 000000000..f0afc7c5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 new file mode 100644 index 000000000..0364706c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 new file mode 100644 index 000000000..23f4f1d77 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 new file mode 100644 index 000000000..0a03068f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 new file mode 100644 index 000000000..bbac23321 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 new file mode 100644 index 000000000..d9a1ca84d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 new file mode 100644 index 000000000..45933c36f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 new file mode 100644 index 000000000..2a3ec0459 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_214.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_214.smt2 new file mode 100644 index 000000000..8178571d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_214.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 new file mode 100644 index 000000000..64fd5879f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 new file mode 100644 index 000000000..ddd8b9f74 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 new file mode 100644 index 000000000..33abce3c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 new file mode 100644 index 000000000..f0facc00a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 new file mode 100644 index 000000000..15b191e4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 new file mode 100644 index 000000000..bae519b88 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 new file mode 100644 index 000000000..330e0f430 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 new file mode 100644 index 000000000..b93b81d60 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 new file mode 100644 index 000000000..2b95566e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 new file mode 100644 index 000000000..6f6a7e716 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_215.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_215.smt2 new file mode 100644 index 000000000..7c9ba843c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_215.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 new file mode 100644 index 000000000..9b554c3fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 new file mode 100644 index 000000000..6eb2a77c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 new file mode 100644 index 000000000..eb4304245 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 new file mode 100644 index 000000000..6308de9c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 new file mode 100644 index 000000000..955f6aa8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 new file mode 100644 index 000000000..3088c6ffd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 new file mode 100644 index 000000000..8f7a16ffe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 new file mode 100644 index 000000000..7ad62540c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 new file mode 100644 index 000000000..51a643d49 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 new file mode 100644 index 000000000..0bf7e06e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_216.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_216.smt2 new file mode 100644 index 000000000..f58d41613 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_216.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 new file mode 100644 index 000000000..22d310bfc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 new file mode 100644 index 000000000..c2b9c7b06 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 new file mode 100644 index 000000000..3d8cb4e98 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 new file mode 100644 index 000000000..0da66c999 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 new file mode 100644 index 000000000..ccaac931c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 new file mode 100644 index 000000000..e7e4dda96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 new file mode 100644 index 000000000..1141e06ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 new file mode 100644 index 000000000..05ca8bad5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 new file mode 100644 index 000000000..c21037c9a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 new file mode 100644 index 000000000..bd50b985b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_217.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_217.smt2 new file mode 100644 index 000000000..0a030fa38 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_217.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 new file mode 100644 index 000000000..86184895c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 new file mode 100644 index 000000000..bbcde4ccf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 new file mode 100644 index 000000000..98c17bafc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 new file mode 100644 index 000000000..d28a4f5c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 new file mode 100644 index 000000000..a6439a0e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 new file mode 100644 index 000000000..670c4d674 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 new file mode 100644 index 000000000..07cbf17d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 new file mode 100644 index 000000000..ca55e80fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 new file mode 100644 index 000000000..7aee40c27 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 new file mode 100644 index 000000000..32f0ca235 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_218.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_218.smt2 new file mode 100644 index 000000000..1343a0b13 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_218.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 new file mode 100644 index 000000000..7b52e0864 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 new file mode 100644 index 000000000..9eca9c379 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 new file mode 100644 index 000000000..d002780d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 new file mode 100644 index 000000000..ff44af7c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 new file mode 100644 index 000000000..be018c569 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 new file mode 100644 index 000000000..c0fdbb067 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 new file mode 100644 index 000000000..4bccdd182 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 new file mode 100644 index 000000000..5ca0b33d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 new file mode 100644 index 000000000..2f9203c35 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 new file mode 100644 index 000000000..38582cc96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_219.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_219.smt2 new file mode 100644 index 000000000..53201464b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_219.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 new file mode 100644 index 000000000..6022f09d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 new file mode 100644 index 000000000..c3fd8a7da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 new file mode 100644 index 000000000..fa8efc6eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 new file mode 100644 index 000000000..a77fc1ab7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 new file mode 100644 index 000000000..35c554bf3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 new file mode 100644 index 000000000..209195799 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 new file mode 100644 index 000000000..6318f317a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 new file mode 100644 index 000000000..fcc8648ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 new file mode 100644 index 000000000..79a17c2b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 new file mode 100644 index 000000000..23ccf6cf3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_22.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_22.smt2 new file mode 100644 index 000000000..91c2edf28 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_22.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_220.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_220.smt2 new file mode 100644 index 000000000..9d96daa83 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_220.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 new file mode 100644 index 000000000..572ba1ca2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 new file mode 100644 index 000000000..2107adb27 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 new file mode 100644 index 000000000..4dc6be0bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 new file mode 100644 index 000000000..e101955ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 new file mode 100644 index 000000000..d689a84e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 new file mode 100644 index 000000000..be523cacc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 new file mode 100644 index 000000000..0afecddcb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 new file mode 100644 index 000000000..e8689703e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 new file mode 100644 index 000000000..1f2d6624b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 new file mode 100644 index 000000000..d6b574905 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_221.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_221.smt2 new file mode 100644 index 000000000..1254dabce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_221.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 new file mode 100644 index 000000000..85994a5dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 new file mode 100644 index 000000000..baf52571e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 new file mode 100644 index 000000000..abc07131e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 new file mode 100644 index 000000000..60244c344 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 new file mode 100644 index 000000000..17fffe79d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 new file mode 100644 index 000000000..09508d140 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 new file mode 100644 index 000000000..780394314 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 new file mode 100644 index 000000000..e9bfbdf0f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 new file mode 100644 index 000000000..c066f4238 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 new file mode 100644 index 000000000..0a86ad7c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_222.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_222.smt2 new file mode 100644 index 000000000..a5ca3f3bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_222.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 new file mode 100644 index 000000000..01b93e7f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 new file mode 100644 index 000000000..bef578894 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 new file mode 100644 index 000000000..500f1a801 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 new file mode 100644 index 000000000..5f8e32c5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 new file mode 100644 index 000000000..e477e93cc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 new file mode 100644 index 000000000..755c42ce2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 new file mode 100644 index 000000000..d75f081a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 new file mode 100644 index 000000000..347c66cad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 new file mode 100644 index 000000000..dc2325bd9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 new file mode 100644 index 000000000..44cf96c4f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_223.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_223.smt2 new file mode 100644 index 000000000..6f7867e21 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_223.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 new file mode 100644 index 000000000..9114bc66a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 new file mode 100644 index 000000000..8206a0992 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 new file mode 100644 index 000000000..effb812c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 new file mode 100644 index 000000000..a4c2b026f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 new file mode 100644 index 000000000..0689c6124 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 new file mode 100644 index 000000000..7b3843ea8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 new file mode 100644 index 000000000..53cc6d017 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 new file mode 100644 index 000000000..86b68e905 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 new file mode 100644 index 000000000..fffcaf6d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 new file mode 100644 index 000000000..d6af09ee6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_224.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_224.smt2 new file mode 100644 index 000000000..13648d221 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_224.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 new file mode 100644 index 000000000..ff95c19d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 new file mode 100644 index 000000000..a125fbcf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 new file mode 100644 index 000000000..60c491705 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 new file mode 100644 index 000000000..859e381b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 new file mode 100644 index 000000000..639c527df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 new file mode 100644 index 000000000..375c4b46c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 new file mode 100644 index 000000000..67a9d246d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 new file mode 100644 index 000000000..c5c7a9398 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 new file mode 100644 index 000000000..40487230f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 new file mode 100644 index 000000000..da4c2f6fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_225.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_225.smt2 new file mode 100644 index 000000000..207c8c1b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_225.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 new file mode 100644 index 000000000..f14dbddec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 new file mode 100644 index 000000000..0d67d929b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 new file mode 100644 index 000000000..180fe513e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 new file mode 100644 index 000000000..95c8c1890 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 new file mode 100644 index 000000000..980520fed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 new file mode 100644 index 000000000..b46ac0cb1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 new file mode 100644 index 000000000..e5cd8e2dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 new file mode 100644 index 000000000..e3d17270a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 new file mode 100644 index 000000000..b246f70eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 new file mode 100644 index 000000000..7077cc114 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_226.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_226.smt2 new file mode 100644 index 000000000..8482d0602 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_226.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 new file mode 100644 index 000000000..13bb1f0fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 new file mode 100644 index 000000000..240772af0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 new file mode 100644 index 000000000..963e9b55f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 new file mode 100644 index 000000000..985cacda2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 new file mode 100644 index 000000000..da7c38aef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 new file mode 100644 index 000000000..cdcf0d493 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 new file mode 100644 index 000000000..e4163c578 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 new file mode 100644 index 000000000..19964af89 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 new file mode 100644 index 000000000..77d359673 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 new file mode 100644 index 000000000..07d0e135a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_227.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_227.smt2 new file mode 100644 index 000000000..47a90efec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_227.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 new file mode 100644 index 000000000..268c2f1ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 new file mode 100644 index 000000000..9fa01614b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 new file mode 100644 index 000000000..ec9ca5a57 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 new file mode 100644 index 000000000..c23793202 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 new file mode 100644 index 000000000..99ad71991 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 new file mode 100644 index 000000000..b83397edd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 new file mode 100644 index 000000000..8409b58b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 new file mode 100644 index 000000000..f7aa02539 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 new file mode 100644 index 000000000..194744c5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 new file mode 100644 index 000000000..1e4087456 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_228.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_228.smt2 new file mode 100644 index 000000000..00cf1aafb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_228.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 new file mode 100644 index 000000000..ab8b65cee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 new file mode 100644 index 000000000..7015129be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 new file mode 100644 index 000000000..e1bd5b9d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 new file mode 100644 index 000000000..5804afb0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 new file mode 100644 index 000000000..0a1578a68 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 new file mode 100644 index 000000000..b592c4103 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 new file mode 100644 index 000000000..605e437a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 new file mode 100644 index 000000000..4dc19277d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 new file mode 100644 index 000000000..a9cea4062 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 new file mode 100644 index 000000000..4ec598792 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_229.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_229.smt2 new file mode 100644 index 000000000..96c53be58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_229.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 new file mode 100644 index 000000000..e15ea5084 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 new file mode 100644 index 000000000..eaf63d070 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 new file mode 100644 index 000000000..077e0e6c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 new file mode 100644 index 000000000..1f2aa63bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 new file mode 100644 index 000000000..516fb0441 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 new file mode 100644 index 000000000..8d7e11d2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 new file mode 100644 index 000000000..5c2f90c5b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 new file mode 100644 index 000000000..9279e9897 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 new file mode 100644 index 000000000..22fadaaab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 new file mode 100644 index 000000000..ae0cc3dcf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_23.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_23.smt2 new file mode 100644 index 000000000..2df594345 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_23.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_230.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_230.smt2 new file mode 100644 index 000000000..ff70b760b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_230.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 new file mode 100644 index 000000000..3a98e9b5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 new file mode 100644 index 000000000..430fc6816 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 new file mode 100644 index 000000000..6e1d7d020 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 new file mode 100644 index 000000000..f9d5df163 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 new file mode 100644 index 000000000..857c376d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 new file mode 100644 index 000000000..433733179 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 new file mode 100644 index 000000000..82225f70e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 new file mode 100644 index 000000000..59913d3e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 new file mode 100644 index 000000000..fb8b0d664 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 new file mode 100644 index 000000000..256d0cb92 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_231.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_231.smt2 new file mode 100644 index 000000000..df099be85 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_231.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 new file mode 100644 index 000000000..86579bf9d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 new file mode 100644 index 000000000..96d784e26 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 new file mode 100644 index 000000000..1607b053e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 new file mode 100644 index 000000000..037860a9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 new file mode 100644 index 000000000..e0c83a723 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 new file mode 100644 index 000000000..938d32e4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 new file mode 100644 index 000000000..cf1ae36a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 new file mode 100644 index 000000000..c47cf600c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 new file mode 100644 index 000000000..abfe1cf94 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 new file mode 100644 index 000000000..63028484e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_232.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_232.smt2 new file mode 100644 index 000000000..741841249 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_232.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 new file mode 100644 index 000000000..b95c8367b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 new file mode 100644 index 000000000..b76a6ce2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 new file mode 100644 index 000000000..11f947374 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 new file mode 100644 index 000000000..299a287c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 new file mode 100644 index 000000000..02604f606 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 new file mode 100644 index 000000000..9bd82917f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 new file mode 100644 index 000000000..6cd69a740 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 new file mode 100644 index 000000000..32e64eb74 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 new file mode 100644 index 000000000..fb416ea62 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 new file mode 100644 index 000000000..59f6493d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_233.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_233.smt2 new file mode 100644 index 000000000..57324e2f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_233.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 new file mode 100644 index 000000000..2d4949f72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 new file mode 100644 index 000000000..7ac6e8bac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 new file mode 100644 index 000000000..cb0c7177a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 new file mode 100644 index 000000000..67f7d11d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 new file mode 100644 index 000000000..8353410e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 new file mode 100644 index 000000000..ab919dd30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 new file mode 100644 index 000000000..c8f0587ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 new file mode 100644 index 000000000..98498a724 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 new file mode 100644 index 000000000..5ccd10018 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 new file mode 100644 index 000000000..7aa465a87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_234.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_234.smt2 new file mode 100644 index 000000000..a6e99eaf4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_234.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 new file mode 100644 index 000000000..c77c53d9c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 new file mode 100644 index 000000000..f26339a08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 new file mode 100644 index 000000000..ed1578796 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 new file mode 100644 index 000000000..b0db2c259 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 new file mode 100644 index 000000000..14944c530 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 new file mode 100644 index 000000000..c8d58e931 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 new file mode 100644 index 000000000..4a5535f32 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 new file mode 100644 index 000000000..6d0115b09 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 new file mode 100644 index 000000000..539208b4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 new file mode 100644 index 000000000..27d8412e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_235.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_235.smt2 new file mode 100644 index 000000000..ac01f1d47 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_235.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 new file mode 100644 index 000000000..c7957a896 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 new file mode 100644 index 000000000..3be50dc90 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 new file mode 100644 index 000000000..5ba1645c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 new file mode 100644 index 000000000..b4eac927a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 new file mode 100644 index 000000000..ab8d9de8f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 new file mode 100644 index 000000000..1b6f6c8fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 new file mode 100644 index 000000000..587118b0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 new file mode 100644 index 000000000..8046ca0fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 new file mode 100644 index 000000000..088564fce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 new file mode 100644 index 000000000..c8c694609 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_236.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_236.smt2 new file mode 100644 index 000000000..5587dfa9d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_236.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 new file mode 100644 index 000000000..b1cea9ded --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 new file mode 100644 index 000000000..631ab000d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 new file mode 100644 index 000000000..57e80ac43 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 new file mode 100644 index 000000000..860df716b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 new file mode 100644 index 000000000..3de1ac1ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 new file mode 100644 index 000000000..ec894f193 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 new file mode 100644 index 000000000..7999c2a30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 new file mode 100644 index 000000000..f66aa0d81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 new file mode 100644 index 000000000..367be81a8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 new file mode 100644 index 000000000..efd34e789 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_237.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_237.smt2 new file mode 100644 index 000000000..f326220d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_237.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 new file mode 100644 index 000000000..908096635 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 new file mode 100644 index 000000000..5c15803e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 new file mode 100644 index 000000000..00446ef09 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 new file mode 100644 index 000000000..9d03ee6a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 new file mode 100644 index 000000000..f20479dc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 new file mode 100644 index 000000000..72ba179ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 new file mode 100644 index 000000000..1eb1fb75c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 new file mode 100644 index 000000000..a5e70aba8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 new file mode 100644 index 000000000..3ba2f94ec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 new file mode 100644 index 000000000..92ac7d5db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_238.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_238.smt2 new file mode 100644 index 000000000..a401d1855 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_238.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 new file mode 100644 index 000000000..fd0d4e0e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 new file mode 100644 index 000000000..0a2d913aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 new file mode 100644 index 000000000..c531bc7ad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 new file mode 100644 index 000000000..5e4d845bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 new file mode 100644 index 000000000..6430fe12b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 new file mode 100644 index 000000000..f58bb01c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 new file mode 100644 index 000000000..570a47f9d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 new file mode 100644 index 000000000..67c0eff7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 new file mode 100644 index 000000000..05daccc0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 new file mode 100644 index 000000000..c87e8f73f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_239.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_239.smt2 new file mode 100644 index 000000000..0630638e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_239.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 new file mode 100644 index 000000000..1c8393002 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 new file mode 100644 index 000000000..d34ddc3c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 new file mode 100644 index 000000000..404a6c412 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 new file mode 100644 index 000000000..09f9f560c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 new file mode 100644 index 000000000..6da8a07a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 new file mode 100644 index 000000000..22c9c0859 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 new file mode 100644 index 000000000..aadded745 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 new file mode 100644 index 000000000..a41d4a0c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 new file mode 100644 index 000000000..e60c64d5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 new file mode 100644 index 000000000..e407444fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_24.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_24.smt2 new file mode 100644 index 000000000..f22fcfc95 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_24.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_240.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_240.smt2 new file mode 100644 index 000000000..d65951640 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_240.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 new file mode 100644 index 000000000..650db130a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 new file mode 100644 index 000000000..127a96186 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 new file mode 100644 index 000000000..4d20b84f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 new file mode 100644 index 000000000..5709b87c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 new file mode 100644 index 000000000..f1afdf2c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 new file mode 100644 index 000000000..230c55381 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 new file mode 100644 index 000000000..86f7d4bc5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 new file mode 100644 index 000000000..f402a9ce1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 new file mode 100644 index 000000000..d8bd825f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 new file mode 100644 index 000000000..59d2c30fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_241.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_241.smt2 new file mode 100644 index 000000000..9c86bd0b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_241.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 new file mode 100644 index 000000000..3f25b9362 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 new file mode 100644 index 000000000..269e189dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 new file mode 100644 index 000000000..68fd1e910 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 new file mode 100644 index 000000000..423c10177 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 new file mode 100644 index 000000000..86c522a33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 new file mode 100644 index 000000000..85a156d40 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 new file mode 100644 index 000000000..2b09b9a7e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 new file mode 100644 index 000000000..52cd5086a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 new file mode 100644 index 000000000..654cb19cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 new file mode 100644 index 000000000..7d1511d01 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1101")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_242.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_242.smt2 new file mode 100644 index 000000000..deb0cc9a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_242.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 new file mode 100644 index 000000000..73a92359b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 new file mode 100644 index 000000000..831d34396 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 new file mode 100644 index 000000000..d2fecad3e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 new file mode 100644 index 000000000..85bf2468c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 new file mode 100644 index 000000000..ecda8695b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 new file mode 100644 index 000000000..4c4548704 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 new file mode 100644 index 000000000..d11392a9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 new file mode 100644 index 000000000..ea66c40f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "0011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 new file mode 100644 index 000000000..6fec5f417 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 new file mode 100644 index 000000000..e351df5d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_243.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_243.smt2 new file mode 100644 index 000000000..1c66b72bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_243.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 new file mode 100644 index 000000000..ac4ebfa67 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 new file mode 100644 index 000000000..d403d1e1b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 new file mode 100644 index 000000000..e3d9f1dc3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 new file mode 100644 index 000000000..b873c4d79 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 new file mode 100644 index 000000000..7f6f080d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 new file mode 100644 index 000000000..900331e01 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 new file mode 100644 index 000000000..649d57667 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 new file mode 100644 index 000000000..4c9e6fe4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 new file mode 100644 index 000000000..7e11809ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 new file mode 100644 index 000000000..83a5837e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_244.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_244.smt2 new file mode 100644 index 000000000..0ec81b945 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_244.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 new file mode 100644 index 000000000..caec4d519 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 new file mode 100644 index 000000000..d4821a215 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 new file mode 100644 index 000000000..0a114848d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 new file mode 100644 index 000000000..d6419cd35 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 new file mode 100644 index 000000000..4b890cd02 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 new file mode 100644 index 000000000..17c5813c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 new file mode 100644 index 000000000..4efe2e41e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 new file mode 100644 index 000000000..d7bbf99cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 new file mode 100644 index 000000000..ec707d883 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 new file mode 100644 index 000000000..3e55628b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_245.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_245.smt2 new file mode 100644 index 000000000..8f375c149 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_245.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 new file mode 100644 index 000000000..33afeae69 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 new file mode 100644 index 000000000..fabfd881e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 new file mode 100644 index 000000000..3b23cbf55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 new file mode 100644 index 000000000..77595cbd2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 new file mode 100644 index 000000000..e2db77ea2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 new file mode 100644 index 000000000..519470ddb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 new file mode 100644 index 000000000..01282bf6e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 new file mode 100644 index 000000000..1addcc247 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 new file mode 100644 index 000000000..2d69d1683 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 new file mode 100644 index 000000000..365ea962e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_246.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_246.smt2 new file mode 100644 index 000000000..153b22551 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_246.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 new file mode 100644 index 000000000..5be4079e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 new file mode 100644 index 000000000..b0ffb33f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 new file mode 100644 index 000000000..20db72650 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 new file mode 100644 index 000000000..c6d6d9a34 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 new file mode 100644 index 000000000..8f166804d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 new file mode 100644 index 000000000..72b49db3b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 new file mode 100644 index 000000000..6a3f149af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 new file mode 100644 index 000000000..4e5075ad0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 new file mode 100644 index 000000000..330f10333 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 new file mode 100644 index 000000000..4b937bc78 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_247.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_247.smt2 new file mode 100644 index 000000000..a804d8517 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_247.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 new file mode 100644 index 000000000..f6ecd11fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 new file mode 100644 index 000000000..81b935a08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 new file mode 100644 index 000000000..e00224f3a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 new file mode 100644 index 000000000..e559572b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 new file mode 100644 index 000000000..394632847 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 new file mode 100644 index 000000000..65aa4a7e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 new file mode 100644 index 000000000..3799e6bb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 new file mode 100644 index 000000000..3018b44f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 new file mode 100644 index 000000000..d1417ec43 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 new file mode 100644 index 000000000..1205be703 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_248.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_248.smt2 new file mode 100644 index 000000000..16c60bcee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_248.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 new file mode 100644 index 000000000..bd59be986 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 new file mode 100644 index 000000000..0117fde0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 new file mode 100644 index 000000000..056500880 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 new file mode 100644 index 000000000..ed218089b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 new file mode 100644 index 000000000..2ad965a20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 new file mode 100644 index 000000000..9714b9c19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 new file mode 100644 index 000000000..cd6dc589f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 new file mode 100644 index 000000000..d0d3ad018 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 new file mode 100644 index 000000000..7dfdc584b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 new file mode 100644 index 000000000..77b6fda12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_249.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_249.smt2 new file mode 100644 index 000000000..4fd7c046d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_249.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 new file mode 100644 index 000000000..871b86c4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 new file mode 100644 index 000000000..4ace650c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 new file mode 100644 index 000000000..deb4ea77c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 new file mode 100644 index 000000000..9f78dde22 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 new file mode 100644 index 000000000..c75b8c242 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 new file mode 100644 index 000000000..e60883389 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 new file mode 100644 index 000000000..a366e24a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 new file mode 100644 index 000000000..f5a1a7245 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 new file mode 100644 index 000000000..ed8ba56e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 new file mode 100644 index 000000000..ca6530ffb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_25.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_25.smt2 new file mode 100644 index 000000000..ddfed4abd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_25.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_250.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_250.smt2 new file mode 100644 index 000000000..5b3259d63 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_250.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 new file mode 100644 index 000000000..455bcbfe2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 new file mode 100644 index 000000000..fbfb866d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 new file mode 100644 index 000000000..03c27e2b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 new file mode 100644 index 000000000..cd7a729d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 new file mode 100644 index 000000000..cf059029e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 new file mode 100644 index 000000000..97e41bd03 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 new file mode 100644 index 000000000..16376dddc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 new file mode 100644 index 000000000..4a32246c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 new file mode 100644 index 000000000..8bfcf8550 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 new file mode 100644 index 000000000..538b5137f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_251.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_251.smt2 new file mode 100644 index 000000000..ea48cb293 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_251.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 new file mode 100644 index 000000000..74cac0adf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 new file mode 100644 index 000000000..8fd7b0243 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 new file mode 100644 index 000000000..de5c0a4bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 new file mode 100644 index 000000000..686fae29a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 new file mode 100644 index 000000000..685d1ba44 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 new file mode 100644 index 000000000..66fb8a22d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 new file mode 100644 index 000000000..e4a8ec089 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 new file mode 100644 index 000000000..9f8232ebf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 new file mode 100644 index 000000000..d902c033d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 new file mode 100644 index 000000000..bc3e924c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_252.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_252.smt2 new file mode 100644 index 000000000..d29f575e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_252.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 new file mode 100644 index 000000000..d99332595 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 new file mode 100644 index 000000000..bc82518fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 new file mode 100644 index 000000000..3e3e9c91a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 new file mode 100644 index 000000000..8cc0c97eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 new file mode 100644 index 000000000..0bff8c077 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 new file mode 100644 index 000000000..a4eaab37d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 new file mode 100644 index 000000000..f2ca907e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 new file mode 100644 index 000000000..6d413d061 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 new file mode 100644 index 000000000..c9fcd6ba0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 new file mode 100644 index 000000000..03c08eeb8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_253.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_253.smt2 new file mode 100644 index 000000000..d7c1c472c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_253.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 new file mode 100644 index 000000000..6eebfee1a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 new file mode 100644 index 000000000..bc0d3ebdc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 new file mode 100644 index 000000000..b7e0ddc48 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 new file mode 100644 index 000000000..a60e21626 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 new file mode 100644 index 000000000..643db5579 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 new file mode 100644 index 000000000..7997e2f49 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 new file mode 100644 index 000000000..3c018790b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 new file mode 100644 index 000000000..3d9e32944 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 new file mode 100644 index 000000000..fc917d9ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 new file mode 100644 index 000000000..915324737 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_254.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_254.smt2 new file mode 100644 index 000000000..29e54c02e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_254.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 new file mode 100644 index 000000000..01c573a9c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 new file mode 100644 index 000000000..de3b0eec5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 new file mode 100644 index 000000000..bbb8d7769 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 new file mode 100644 index 000000000..0a51c0ffc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 new file mode 100644 index 000000000..ab2fe5571 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 new file mode 100644 index 000000000..497c7543f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 new file mode 100644 index 000000000..5c6c0846b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 new file mode 100644 index 000000000..536ae182d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 new file mode 100644 index 000000000..188706c34 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 new file mode 100644 index 000000000..8ef70fabb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_255.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_255.smt2 new file mode 100644 index 000000000..84830d22b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_255.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 new file mode 100644 index 000000000..bbaaf9f0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 new file mode 100644 index 000000000..b07868508 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 new file mode 100644 index 000000000..4047806ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 new file mode 100644 index 000000000..ed9d849c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 new file mode 100644 index 000000000..5f5a26776 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 new file mode 100644 index 000000000..ae91c701f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 new file mode 100644 index 000000000..20db5e173 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 new file mode 100644 index 000000000..2e27e82c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 new file mode 100644 index 000000000..2dd78ea85 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 new file mode 100644 index 000000000..b02e837d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_256.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_256.smt2 new file mode 100644 index 000000000..726cd63d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_256.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 new file mode 100644 index 000000000..b436379eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 new file mode 100644 index 000000000..272ad59ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 new file mode 100644 index 000000000..545e70088 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 new file mode 100644 index 000000000..938494a71 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 new file mode 100644 index 000000000..1d5e18ca6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 new file mode 100644 index 000000000..805576e99 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 new file mode 100644 index 000000000..46add993d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 new file mode 100644 index 000000000..789e233fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 new file mode 100644 index 000000000..f6e34098e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 new file mode 100644 index 000000000..1df14e0de --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_257.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_257.smt2 new file mode 100644 index 000000000..a53a71fe0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_257.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 new file mode 100644 index 000000000..7e404e8c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 new file mode 100644 index 000000000..8f3829a54 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 new file mode 100644 index 000000000..554ff8593 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 new file mode 100644 index 000000000..16136cfde --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 new file mode 100644 index 000000000..65d919017 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 new file mode 100644 index 000000000..ad959b83d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 new file mode 100644 index 000000000..26c73d88a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 new file mode 100644 index 000000000..d6b6b3422 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 new file mode 100644 index 000000000..68d671cc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 new file mode 100644 index 000000000..8875453eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_258.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_258.smt2 new file mode 100644 index 000000000..c3a02583c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_258.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 new file mode 100644 index 000000000..18ea62599 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 new file mode 100644 index 000000000..aedc204d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 new file mode 100644 index 000000000..43733a0d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 new file mode 100644 index 000000000..d9ce3db6e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 new file mode 100644 index 000000000..3a5e52eab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 new file mode 100644 index 000000000..673ba5e78 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 new file mode 100644 index 000000000..f6cf3ffab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 new file mode 100644 index 000000000..6566e338c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 new file mode 100644 index 000000000..a637f6d95 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 new file mode 100644 index 000000000..d6303ed6e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_259.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_259.smt2 new file mode 100644 index 000000000..6d28461ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_259.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 new file mode 100644 index 000000000..39be7de4b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 new file mode 100644 index 000000000..2e575607f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 new file mode 100644 index 000000000..13077ec19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 new file mode 100644 index 000000000..c0d08c068 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 new file mode 100644 index 000000000..3cf774635 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 new file mode 100644 index 000000000..b420eb782 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 new file mode 100644 index 000000000..1b7cbfe19 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 new file mode 100644 index 000000000..a80b91c2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 new file mode 100644 index 000000000..e20b93a4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 new file mode 100644 index 000000000..c80d344e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_26.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_26.smt2 new file mode 100644 index 000000000..1cfbf7fe0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_26.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_260.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_260.smt2 new file mode 100644 index 000000000..6f7c1a75d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_260.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 new file mode 100644 index 000000000..8f79cd2ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 new file mode 100644 index 000000000..5f9e1d008 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 new file mode 100644 index 000000000..c8ed21f7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 new file mode 100644 index 000000000..1b753b6ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 new file mode 100644 index 000000000..715778399 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 new file mode 100644 index 000000000..7eec55e2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 new file mode 100644 index 000000000..8f84b5d34 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 new file mode 100644 index 000000000..94f272421 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 new file mode 100644 index 000000000..f8188f5c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 new file mode 100644 index 000000000..e5b988efe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_261.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_261.smt2 new file mode 100644 index 000000000..c258909a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_261.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 new file mode 100644 index 000000000..72af38c1a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 new file mode 100644 index 000000000..963083072 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 new file mode 100644 index 000000000..dc39634d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1100")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 new file mode 100644 index 000000000..1c31421fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 new file mode 100644 index 000000000..a9190d31a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "0101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 new file mode 100644 index 000000000..980990f0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 new file mode 100644 index 000000000..53cc9805d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 new file mode 100644 index 000000000..07acc3e3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 new file mode 100644 index 000000000..78286139d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 new file mode 100644 index 000000000..418fa3e14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_262.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_262.smt2 new file mode 100644 index 000000000..12a612ef5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_262.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 new file mode 100644 index 000000000..1b931529d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 new file mode 100644 index 000000000..4e2d25311 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 new file mode 100644 index 000000000..cb3ccb7c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 new file mode 100644 index 000000000..cd36d28e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 new file mode 100644 index 000000000..f6e4ddd71 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 new file mode 100644 index 000000000..0b57bf2d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 new file mode 100644 index 000000000..732fafe8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 new file mode 100644 index 000000000..ddee7c768 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 new file mode 100644 index 000000000..85f278fe3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 new file mode 100644 index 000000000..3e7afcdc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_263.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_263.smt2 new file mode 100644 index 000000000..041314eb9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_263.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 new file mode 100644 index 000000000..9c66b8a7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 new file mode 100644 index 000000000..88aee65c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 new file mode 100644 index 000000000..149b293e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 new file mode 100644 index 000000000..486d33386 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 new file mode 100644 index 000000000..7b7950cfc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 new file mode 100644 index 000000000..19b2fd5ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 new file mode 100644 index 000000000..d94eec6ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 new file mode 100644 index 000000000..f277f6e98 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 new file mode 100644 index 000000000..acf5545af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 new file mode 100644 index 000000000..4fae99a15 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_264.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_264.smt2 new file mode 100644 index 000000000..f5ba12222 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_264.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 new file mode 100644 index 000000000..d3098385e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 new file mode 100644 index 000000000..f2edf9afd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 new file mode 100644 index 000000000..c41afe3c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 new file mode 100644 index 000000000..8e13f19d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 new file mode 100644 index 000000000..1392110e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 new file mode 100644 index 000000000..82d1f52e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 new file mode 100644 index 000000000..01d931629 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 new file mode 100644 index 000000000..7fdc2cad2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 new file mode 100644 index 000000000..448fef37e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 new file mode 100644 index 000000000..5b7249411 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_265.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_265.smt2 new file mode 100644 index 000000000..c0cce0953 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_265.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 new file mode 100644 index 000000000..348ff7993 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 new file mode 100644 index 000000000..d04fed6be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 new file mode 100644 index 000000000..a39dac555 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 new file mode 100644 index 000000000..4505870da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 new file mode 100644 index 000000000..310d9403a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 new file mode 100644 index 000000000..81a0942a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 new file mode 100644 index 000000000..d795c5eed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 new file mode 100644 index 000000000..a56703910 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 new file mode 100644 index 000000000..ebdf355f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 new file mode 100644 index 000000000..e3dae194e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_266.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_266.smt2 new file mode 100644 index 000000000..6bf44c201 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_266.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 new file mode 100644 index 000000000..bc7f24f2c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 new file mode 100644 index 000000000..e4772d185 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 new file mode 100644 index 000000000..b4b4e113a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 new file mode 100644 index 000000000..43660fbd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 new file mode 100644 index 000000000..9d97e8e45 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 new file mode 100644 index 000000000..e0e92fc4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 new file mode 100644 index 000000000..6a493e34f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 new file mode 100644 index 000000000..4b1d0f99a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 new file mode 100644 index 000000000..8df6af9a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 new file mode 100644 index 000000000..5e88b34b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_267.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_267.smt2 new file mode 100644 index 000000000..78b9f921f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_267.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 new file mode 100644 index 000000000..3ce682e34 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 new file mode 100644 index 000000000..42e7f26de --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 new file mode 100644 index 000000000..d323ea112 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 new file mode 100644 index 000000000..64807a01a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 new file mode 100644 index 000000000..42d434734 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 new file mode 100644 index 000000000..16726e889 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 new file mode 100644 index 000000000..0b462cd77 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 new file mode 100644 index 000000000..d55e08318 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 new file mode 100644 index 000000000..c93e61cf4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 new file mode 100644 index 000000000..ac7381eda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_268.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_268.smt2 new file mode 100644 index 000000000..b37200055 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_268.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 new file mode 100644 index 000000000..d6bd6adf1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 new file mode 100644 index 000000000..c30e758c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 new file mode 100644 index 000000000..b0cd88e14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 new file mode 100644 index 000000000..3b8ed32b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 new file mode 100644 index 000000000..640f5357c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 new file mode 100644 index 000000000..ff81df4a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 new file mode 100644 index 000000000..9e5cfb8ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 new file mode 100644 index 000000000..862154953 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 new file mode 100644 index 000000000..e8f00f237 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 new file mode 100644 index 000000000..f19ffa4d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_269.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_269.smt2 new file mode 100644 index 000000000..80c700722 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_269.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 new file mode 100644 index 000000000..95b0bf96b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 new file mode 100644 index 000000000..f170edc45 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 new file mode 100644 index 000000000..236017e7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 new file mode 100644 index 000000000..dfc218ce1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 new file mode 100644 index 000000000..150416743 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 new file mode 100644 index 000000000..a2ac87b61 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "011")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 new file mode 100644 index 000000000..f96e395f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 new file mode 100644 index 000000000..0d505abf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 new file mode 100644 index 000000000..74a769cc0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 new file mode 100644 index 000000000..d7fcb34f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_27.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_27.smt2 new file mode 100644 index 000000000..11f451b56 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_27.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_270.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_270.smt2 new file mode 100644 index 000000000..f0c3040a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_270.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 new file mode 100644 index 000000000..65614b8a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 new file mode 100644 index 000000000..d9cbc49d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 new file mode 100644 index 000000000..337d592a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 new file mode 100644 index 000000000..22bc77204 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 new file mode 100644 index 000000000..1efe55285 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 new file mode 100644 index 000000000..9c2a50c87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 new file mode 100644 index 000000000..0529f08ad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 new file mode 100644 index 000000000..d9daab2d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 new file mode 100644 index 000000000..0055c0da1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 new file mode 100644 index 000000000..cd77dbc20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_271.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_271.smt2 new file mode 100644 index 000000000..bfeb0c17d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_271.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 new file mode 100644 index 000000000..6cac1554e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 new file mode 100644 index 000000000..347b51f79 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 new file mode 100644 index 000000000..f7f3e5642 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 new file mode 100644 index 000000000..622003b1f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 new file mode 100644 index 000000000..d2d1eb070 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 new file mode 100644 index 000000000..044887e8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 new file mode 100644 index 000000000..291c74206 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 new file mode 100644 index 000000000..1e9eea641 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 new file mode 100644 index 000000000..8f760efc9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 new file mode 100644 index 000000000..6919a9305 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_272.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_272.smt2 new file mode 100644 index 000000000..e9d7d288f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_272.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 new file mode 100644 index 000000000..bad6b8725 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 new file mode 100644 index 000000000..938cc1876 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 new file mode 100644 index 000000000..977abe572 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 new file mode 100644 index 000000000..8514ac03f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 new file mode 100644 index 000000000..c8b632aac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 new file mode 100644 index 000000000..53683a9f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 new file mode 100644 index 000000000..b7071f7cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 new file mode 100644 index 000000000..da257b11e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 new file mode 100644 index 000000000..d3e5dc786 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 new file mode 100644 index 000000000..4b9305aa1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_273.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_273.smt2 new file mode 100644 index 000000000..83343c10f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_273.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 new file mode 100644 index 000000000..408da78d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 new file mode 100644 index 000000000..1468c55d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 new file mode 100644 index 000000000..dac9554e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 new file mode 100644 index 000000000..c18c807b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 new file mode 100644 index 000000000..217783c5a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 new file mode 100644 index 000000000..d7af246b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 new file mode 100644 index 000000000..79a2eccde --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 new file mode 100644 index 000000000..7bd0c9b4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 new file mode 100644 index 000000000..052c0a9a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 new file mode 100644 index 000000000..736ed9ac0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_274.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_274.smt2 new file mode 100644 index 000000000..46d531a74 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_274.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 new file mode 100644 index 000000000..4d57fa837 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 new file mode 100644 index 000000000..59137c285 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 new file mode 100644 index 000000000..8521439c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 new file mode 100644 index 000000000..258f35b20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 new file mode 100644 index 000000000..3c2e24977 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 new file mode 100644 index 000000000..b7c745923 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 new file mode 100644 index 000000000..7eeb3a6e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 new file mode 100644 index 000000000..350c481f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 new file mode 100644 index 000000000..213156e73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 new file mode 100644 index 000000000..062c89aa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_275.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_275.smt2 new file mode 100644 index 000000000..319f177e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_275.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 new file mode 100644 index 000000000..5a8a29a1e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 new file mode 100644 index 000000000..2eb5272f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 new file mode 100644 index 000000000..61e491585 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 new file mode 100644 index 000000000..82701a1be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 new file mode 100644 index 000000000..11f3d63b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 new file mode 100644 index 000000000..ee27c1a77 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 new file mode 100644 index 000000000..eb29ac609 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 new file mode 100644 index 000000000..c74a54ee1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 new file mode 100644 index 000000000..922c1b6f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 new file mode 100644 index 000000000..2719d078b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_276.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_276.smt2 new file mode 100644 index 000000000..e0f7dc8dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_276.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 new file mode 100644 index 000000000..911df6f2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 new file mode 100644 index 000000000..9ee1effdf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 new file mode 100644 index 000000000..18d5bb0ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 new file mode 100644 index 000000000..73794173d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 new file mode 100644 index 000000000..cd212e6f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 new file mode 100644 index 000000000..45d46fc4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 new file mode 100644 index 000000000..040a9c92d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 new file mode 100644 index 000000000..44b77dfcb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 new file mode 100644 index 000000000..e03074f34 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 new file mode 100644 index 000000000..7a97806b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_277.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_277.smt2 new file mode 100644 index 000000000..cba725f48 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_277.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 new file mode 100644 index 000000000..bb94997c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 new file mode 100644 index 000000000..123c21b58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 new file mode 100644 index 000000000..2d9b0d07a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 new file mode 100644 index 000000000..4c278ad32 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 new file mode 100644 index 000000000..7ee89f2e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 new file mode 100644 index 000000000..1c5b63f6e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 new file mode 100644 index 000000000..821ff94a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 new file mode 100644 index 000000000..4960bb91b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 new file mode 100644 index 000000000..30c8781c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 new file mode 100644 index 000000000..e9c9e87dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_278.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_278.smt2 new file mode 100644 index 000000000..8e93300dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_278.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 new file mode 100644 index 000000000..29dd7a418 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 new file mode 100644 index 000000000..8cabc56cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 new file mode 100644 index 000000000..ce5fce671 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 new file mode 100644 index 000000000..f24333752 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 new file mode 100644 index 000000000..eb185b20d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 new file mode 100644 index 000000000..861b104d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 new file mode 100644 index 000000000..e02d7ae63 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 new file mode 100644 index 000000000..9e773910c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 new file mode 100644 index 000000000..071f0573a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 new file mode 100644 index 000000000..71f0cd8bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_279.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_279.smt2 new file mode 100644 index 000000000..d26fb1821 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_279.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 new file mode 100644 index 000000000..f027a361f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 new file mode 100644 index 000000000..5be7b01e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 new file mode 100644 index 000000000..a38871595 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 new file mode 100644 index 000000000..884081cea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 new file mode 100644 index 000000000..a5c66c3be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 new file mode 100644 index 000000000..ed44b5213 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 new file mode 100644 index 000000000..638c28265 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 new file mode 100644 index 000000000..2f1af8f12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 new file mode 100644 index 000000000..3165e0de9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 new file mode 100644 index 000000000..af171d2dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_28.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_28.smt2 new file mode 100644 index 000000000..1151d0380 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_28.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_280.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_280.smt2 new file mode 100644 index 000000000..01c348ddb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_280.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 new file mode 100644 index 000000000..8c65883e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 new file mode 100644 index 000000000..1b9825c73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 new file mode 100644 index 000000000..d2b5806bb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 new file mode 100644 index 000000000..cc43dec4b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 new file mode 100644 index 000000000..7989fe67b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 new file mode 100644 index 000000000..5ab121a32 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 new file mode 100644 index 000000000..1e2ac3b92 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 new file mode 100644 index 000000000..3a55f160f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 new file mode 100644 index 000000000..7fb4db754 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 new file mode 100644 index 000000000..2213ac8ad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_281.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_281.smt2 new file mode 100644 index 000000000..db1e98795 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_281.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 new file mode 100644 index 000000000..9480969c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 new file mode 100644 index 000000000..1b79623b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 new file mode 100644 index 000000000..c50686a6f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 new file mode 100644 index 000000000..2a58c3db2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 new file mode 100644 index 000000000..74d159df5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 new file mode 100644 index 000000000..bbe1347e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 new file mode 100644 index 000000000..494281043 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 new file mode 100644 index 000000000..78ff46b24 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 new file mode 100644 index 000000000..05e6aab78 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 new file mode 100644 index 000000000..8ee643647 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_282.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_282.smt2 new file mode 100644 index 000000000..cadb76108 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_282.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 new file mode 100644 index 000000000..cda9f5036 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 new file mode 100644 index 000000000..d5f19aceb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 new file mode 100644 index 000000000..41fb7b84b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 new file mode 100644 index 000000000..0d80574a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 new file mode 100644 index 000000000..99355dae6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 new file mode 100644 index 000000000..2b7cb6bcf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 new file mode 100644 index 000000000..1d3935187 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 new file mode 100644 index 000000000..9376adba3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 new file mode 100644 index 000000000..a4d996bce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 new file mode 100644 index 000000000..edee350a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_283.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_283.smt2 new file mode 100644 index 000000000..d36bcf75e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_283.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 new file mode 100644 index 000000000..7a20c53bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 new file mode 100644 index 000000000..424682dc9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 new file mode 100644 index 000000000..c91340054 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 new file mode 100644 index 000000000..16cad6a92 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 new file mode 100644 index 000000000..05654d700 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 new file mode 100644 index 000000000..2aaf76acf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 new file mode 100644 index 000000000..95ba2490d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 new file mode 100644 index 000000000..1bf0f3937 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 new file mode 100644 index 000000000..7cb1938dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 new file mode 100644 index 000000000..7e06c7bb8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_284.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_284.smt2 new file mode 100644 index 000000000..15253a166 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_284.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 new file mode 100644 index 000000000..261d15775 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 new file mode 100644 index 000000000..5e1c9df12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 new file mode 100644 index 000000000..8df6e7785 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 new file mode 100644 index 000000000..ec058ecdb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 new file mode 100644 index 000000000..48b3ec054 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 new file mode 100644 index 000000000..b16aa35e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 new file mode 100644 index 000000000..96b812a8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 new file mode 100644 index 000000000..e174e07ac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 new file mode 100644 index 000000000..7abcb3cba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 new file mode 100644 index 000000000..3368f8d3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_285.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_285.smt2 new file mode 100644 index 000000000..94f048b9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_285.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 new file mode 100644 index 000000000..d394c6875 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 new file mode 100644 index 000000000..bdbf29aab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 new file mode 100644 index 000000000..a46b59e5b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 new file mode 100644 index 000000000..929f3f2e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 new file mode 100644 index 000000000..fe86a04b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 new file mode 100644 index 000000000..c2c2dd5ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 new file mode 100644 index 000000000..b385abeb8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 new file mode 100644 index 000000000..3ae8d95f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 new file mode 100644 index 000000000..479cc7f2e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 new file mode 100644 index 000000000..8ac852aff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_286.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_286.smt2 new file mode 100644 index 000000000..60c5c9ee1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_286.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 new file mode 100644 index 000000000..33e56d69b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 new file mode 100644 index 000000000..366be655d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 new file mode 100644 index 000000000..2b2947f13 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 new file mode 100644 index 000000000..18a646f58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 new file mode 100644 index 000000000..788a1b679 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 new file mode 100644 index 000000000..a61ccca5d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 new file mode 100644 index 000000000..2d67c1744 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 new file mode 100644 index 000000000..6acddb633 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 new file mode 100644 index 000000000..81a4798b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 new file mode 100644 index 000000000..f63127280 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_287.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_287.smt2 new file mode 100644 index 000000000..9cffddd12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_287.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 new file mode 100644 index 000000000..4c8266b3b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 new file mode 100644 index 000000000..39dbfacda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 new file mode 100644 index 000000000..65541079c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 new file mode 100644 index 000000000..eceb9057b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 new file mode 100644 index 000000000..a15aff587 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 new file mode 100644 index 000000000..20c5a6953 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 new file mode 100644 index 000000000..92b401c2e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 new file mode 100644 index 000000000..f8f60539c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 new file mode 100644 index 000000000..7f48f704d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 new file mode 100644 index 000000000..c5700fd8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_288.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_288.smt2 new file mode 100644 index 000000000..b4f6ec9ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_288.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 new file mode 100644 index 000000000..1865d0a0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 new file mode 100644 index 000000000..d55e401ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 new file mode 100644 index 000000000..7d2d528f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 new file mode 100644 index 000000000..9a301acf1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 new file mode 100644 index 000000000..1f872b2f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 new file mode 100644 index 000000000..061e9f546 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 new file mode 100644 index 000000000..1f9f7a125 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 new file mode 100644 index 000000000..7c98279b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 new file mode 100644 index 000000000..1ec3dac6b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 new file mode 100644 index 000000000..6eefb7a41 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_289.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_289.smt2 new file mode 100644 index 000000000..e00f88ac8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_289.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 new file mode 100644 index 000000000..7f548c755 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 new file mode 100644 index 000000000..e4e8fdee8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 new file mode 100644 index 000000000..5b62edf6f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 new file mode 100644 index 000000000..132b95d65 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 new file mode 100644 index 000000000..ec99609fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 new file mode 100644 index 000000000..35f46660f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 new file mode 100644 index 000000000..73a1adea2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 new file mode 100644 index 000000000..edfb2c7f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 new file mode 100644 index 000000000..d82756591 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 new file mode 100644 index 000000000..206a1491f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_29.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_29.smt2 new file mode 100644 index 000000000..dab8285d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_29.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_290.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_290.smt2 new file mode 100644 index 000000000..65b1b3fff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_290.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 new file mode 100644 index 000000000..8ce3397cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 new file mode 100644 index 000000000..497711bba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 new file mode 100644 index 000000000..51f86fb8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 new file mode 100644 index 000000000..92d989611 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 new file mode 100644 index 000000000..1e633adb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 new file mode 100644 index 000000000..19a430416 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 new file mode 100644 index 000000000..fad86330c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 new file mode 100644 index 000000000..7ca454ae4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 new file mode 100644 index 000000000..5def8d889 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 new file mode 100644 index 000000000..bd93dea7f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_291.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_291.smt2 new file mode 100644 index 000000000..04ac89543 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_291.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 new file mode 100644 index 000000000..785d19701 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 new file mode 100644 index 000000000..16bd068bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 new file mode 100644 index 000000000..dbdac5260 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 new file mode 100644 index 000000000..127e2b69d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 new file mode 100644 index 000000000..86badfcb2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 new file mode 100644 index 000000000..3d89c1b07 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 new file mode 100644 index 000000000..630b05b26 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 new file mode 100644 index 000000000..2d3927d53 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 new file mode 100644 index 000000000..335de04f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 new file mode 100644 index 000000000..4e54c5900 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_292.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_292.smt2 new file mode 100644 index 000000000..7f5bd367e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_292.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 new file mode 100644 index 000000000..b2916191c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 new file mode 100644 index 000000000..8ea512051 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 new file mode 100644 index 000000000..8304ac8db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 new file mode 100644 index 000000000..7c7a0bba4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 new file mode 100644 index 000000000..fe546b15f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 new file mode 100644 index 000000000..4346d3d9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 new file mode 100644 index 000000000..80693c837 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 new file mode 100644 index 000000000..662f9ef98 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 new file mode 100644 index 000000000..d5cf808b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 new file mode 100644 index 000000000..38074c722 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_293.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_293.smt2 new file mode 100644 index 000000000..27b6486f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_293.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 new file mode 100644 index 000000000..d6affff3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 new file mode 100644 index 000000000..ce694da3e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 new file mode 100644 index 000000000..d869dbb8c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 new file mode 100644 index 000000000..8300dd689 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 new file mode 100644 index 000000000..2f81909f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 new file mode 100644 index 000000000..f48e20fc3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 new file mode 100644 index 000000000..276bd8698 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 new file mode 100644 index 000000000..ddce0365d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 new file mode 100644 index 000000000..18ddcc4a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 new file mode 100644 index 000000000..97b79fe0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_294.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_294.smt2 new file mode 100644 index 000000000..aefe34886 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_294.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 new file mode 100644 index 000000000..3e2729969 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 new file mode 100644 index 000000000..b999f6e0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 new file mode 100644 index 000000000..bc2e0dbe0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 new file mode 100644 index 000000000..1f6d1b769 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 new file mode 100644 index 000000000..50d554f83 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 new file mode 100644 index 000000000..06a0e8894 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 new file mode 100644 index 000000000..a504f3979 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 new file mode 100644 index 000000000..05eabe4b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 new file mode 100644 index 000000000..f9b00d9cc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 new file mode 100644 index 000000000..199a09905 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_295.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_295.smt2 new file mode 100644 index 000000000..a91cf7f78 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_295.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 new file mode 100644 index 000000000..db7a92663 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 new file mode 100644 index 000000000..72919c76f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 new file mode 100644 index 000000000..7b8937db2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 new file mode 100644 index 000000000..a017e5d13 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 new file mode 100644 index 000000000..87b5d6b5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 new file mode 100644 index 000000000..b45403d9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 new file mode 100644 index 000000000..4892214f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 new file mode 100644 index 000000000..2c50f97a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 new file mode 100644 index 000000000..57efc4cb8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 new file mode 100644 index 000000000..b2a035d38 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_296.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_296.smt2 new file mode 100644 index 000000000..922285025 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_296.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 new file mode 100644 index 000000000..05244fb3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 new file mode 100644 index 000000000..3e2a0e265 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 new file mode 100644 index 000000000..0082f24b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 new file mode 100644 index 000000000..408f28476 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 new file mode 100644 index 000000000..2f9e34b7a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 new file mode 100644 index 000000000..604cfa6de --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 new file mode 100644 index 000000000..595e2e7cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 new file mode 100644 index 000000000..f94d23a08 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 new file mode 100644 index 000000000..c5d00999d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 new file mode 100644 index 000000000..1c8a70f61 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_297.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_297.smt2 new file mode 100644 index 000000000..e9b0c19b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_297.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 new file mode 100644 index 000000000..4d48d912a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 new file mode 100644 index 000000000..335f1efa7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 new file mode 100644 index 000000000..aef0c9b35 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 new file mode 100644 index 000000000..093b2890a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 new file mode 100644 index 000000000..3f9b12b11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 new file mode 100644 index 000000000..a51502c67 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 new file mode 100644 index 000000000..0464a63e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 new file mode 100644 index 000000000..8e0618119 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 new file mode 100644 index 000000000..fe43e3bc3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 new file mode 100644 index 000000000..28bae2aa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_298.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_298.smt2 new file mode 100644 index 000000000..4a0edc7a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_298.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 new file mode 100644 index 000000000..de215e588 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 new file mode 100644 index 000000000..80211c65f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 new file mode 100644 index 000000000..808a192ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 new file mode 100644 index 000000000..f7e85b483 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 new file mode 100644 index 000000000..00c0300ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 new file mode 100644 index 000000000..191a1aed1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 new file mode 100644 index 000000000..b511ada67 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 new file mode 100644 index 000000000..61bfb3d0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 new file mode 100644 index 000000000..c191bfe57 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 new file mode 100644 index 000000000..2b71795f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_299.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_299.smt2 new file mode 100644 index 000000000..a30a4168f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_299.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 new file mode 100644 index 000000000..4491bfb16 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 new file mode 100644 index 000000000..032f710d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 new file mode 100644 index 000000000..a364105ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 new file mode 100644 index 000000000..2d6999c8a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 new file mode 100644 index 000000000..6d030f7fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 new file mode 100644 index 000000000..afbe44462 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 new file mode 100644 index 000000000..c67578be6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 new file mode 100644 index 000000000..9ae39eb6a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 new file mode 100644 index 000000000..a3b4c84a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 new file mode 100644 index 000000000..479a88bbe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3.smt2 new file mode 100644 index 000000000..aaed6ae87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_30.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_30.smt2 new file mode 100644 index 000000000..c9eb33e30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_30.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_300.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_300.smt2 new file mode 100644 index 000000000..3be64178b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_300.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 new file mode 100644 index 000000000..6cd0ab10f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 new file mode 100644 index 000000000..b0fe0a754 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 new file mode 100644 index 000000000..fcbd0305d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 new file mode 100644 index 000000000..980a23082 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 new file mode 100644 index 000000000..5a7191676 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 new file mode 100644 index 000000000..ef66c8108 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 new file mode 100644 index 000000000..d0198bcf0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 new file mode 100644 index 000000000..44729269f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 new file mode 100644 index 000000000..4efd2e987 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 new file mode 100644 index 000000000..9a19cbeeb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_301.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_301.smt2 new file mode 100644 index 000000000..b1ece3fed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_301.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 new file mode 100644 index 000000000..477c2235d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 new file mode 100644 index 000000000..5f4825a33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 new file mode 100644 index 000000000..09b9ccb61 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 new file mode 100644 index 000000000..1f98362c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 new file mode 100644 index 000000000..c9f50b4d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 new file mode 100644 index 000000000..19b8940c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 new file mode 100644 index 000000000..e0d760cf3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 new file mode 100644 index 000000000..9d740b692 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 new file mode 100644 index 000000000..4b99e1cd4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 new file mode 100644 index 000000000..14b223876 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_302.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_302.smt2 new file mode 100644 index 000000000..7d8e3f918 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_302.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 new file mode 100644 index 000000000..4d7855edb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 new file mode 100644 index 000000000..26b6fa495 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 new file mode 100644 index 000000000..d9af6e44f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 new file mode 100644 index 000000000..a985cc783 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 new file mode 100644 index 000000000..de73db916 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 new file mode 100644 index 000000000..628e37064 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 new file mode 100644 index 000000000..f849c0b96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 new file mode 100644 index 000000000..6c692e44e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 new file mode 100644 index 000000000..fc90bbbd5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 new file mode 100644 index 000000000..0af81e3da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_303.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_303.smt2 new file mode 100644 index 000000000..1b5e77903 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_303.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 new file mode 100644 index 000000000..54b4133f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 new file mode 100644 index 000000000..ee921c729 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 new file mode 100644 index 000000000..6d78ac0e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 new file mode 100644 index 000000000..e27609773 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 new file mode 100644 index 000000000..e992bca56 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 new file mode 100644 index 000000000..109082663 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 new file mode 100644 index 000000000..36f599d02 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 new file mode 100644 index 000000000..c10a3538b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 new file mode 100644 index 000000000..40a638eb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 new file mode 100644 index 000000000..e6b67c31e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_304.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_304.smt2 new file mode 100644 index 000000000..fdee4497d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_304.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 new file mode 100644 index 000000000..031b7d22d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 new file mode 100644 index 000000000..c5794cec5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 new file mode 100644 index 000000000..7c5f53041 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 new file mode 100644 index 000000000..42b413a20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "01")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 new file mode 100644 index 000000000..3fefe4fdc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 new file mode 100644 index 000000000..9d5db9c4f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 new file mode 100644 index 000000000..fd3b58d94 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 new file mode 100644 index 000000000..ab6a1fb17 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 new file mode 100644 index 000000000..9b8ba2e72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 new file mode 100644 index 000000000..8f73fd6dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_305.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_305.smt2 new file mode 100644 index 000000000..baecddbbc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_305.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 new file mode 100644 index 000000000..1b0a9102b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 new file mode 100644 index 000000000..f8e509d75 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 new file mode 100644 index 000000000..eceb3d8b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 new file mode 100644 index 000000000..0651cb494 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 new file mode 100644 index 000000000..edbefb714 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 new file mode 100644 index 000000000..fc0e28887 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 new file mode 100644 index 000000000..ac481d00f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 new file mode 100644 index 000000000..de890f328 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 new file mode 100644 index 000000000..c180a57ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 new file mode 100644 index 000000000..dde3ecad8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_306.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_306.smt2 new file mode 100644 index 000000000..efa886f65 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_306.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 new file mode 100644 index 000000000..71a67b14c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 new file mode 100644 index 000000000..cc9dc66cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 new file mode 100644 index 000000000..d3599b0a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 new file mode 100644 index 000000000..65eb89d0c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 new file mode 100644 index 000000000..be5f4d774 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 new file mode 100644 index 000000000..7ed31488a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 new file mode 100644 index 000000000..51f08c141 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 new file mode 100644 index 000000000..fe1ea15c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 new file mode 100644 index 000000000..5eb0a86f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 new file mode 100644 index 000000000..0874db601 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_307.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_307.smt2 new file mode 100644 index 000000000..51f40a88b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_307.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 new file mode 100644 index 000000000..fbd969789 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 new file mode 100644 index 000000000..e0cb19c87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 new file mode 100644 index 000000000..a026f578a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 new file mode 100644 index 000000000..0a68daeb6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 new file mode 100644 index 000000000..6e46793d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 new file mode 100644 index 000000000..507ae6a9a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 new file mode 100644 index 000000000..d302af4d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1010")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 new file mode 100644 index 000000000..bd7869f20 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 new file mode 100644 index 000000000..f239adba9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "111")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 new file mode 100644 index 000000000..a98f35086 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_308.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_308.smt2 new file mode 100644 index 000000000..1920005ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_308.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 new file mode 100644 index 000000000..144d68b13 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 new file mode 100644 index 000000000..147630e55 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 new file mode 100644 index 000000000..71cd57347 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 new file mode 100644 index 000000000..7b9bf4af7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 new file mode 100644 index 000000000..b93dd0a15 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 new file mode 100644 index 000000000..36515041f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 new file mode 100644 index 000000000..776ad3948 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 new file mode 100644 index 000000000..b391ef78d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 new file mode 100644 index 000000000..69ee56e64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 new file mode 100644 index 000000000..139301e23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_309.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_309.smt2 new file mode 100644 index 000000000..9fa625469 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_309.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 new file mode 100644 index 000000000..d44b3082e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 new file mode 100644 index 000000000..ccd438fc1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 new file mode 100644 index 000000000..075404af7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 new file mode 100644 index 000000000..33f7a54aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 new file mode 100644 index 000000000..d64b73318 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 new file mode 100644 index 000000000..48286d9d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 new file mode 100644 index 000000000..9660bc1b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 new file mode 100644 index 000000000..3dfef7db8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 new file mode 100644 index 000000000..c987e3a94 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 new file mode 100644 index 000000000..29d21cbd0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_31.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_31.smt2 new file mode 100644 index 000000000..c6d2c31bf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_31.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_310.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_310.smt2 new file mode 100644 index 000000000..e74ad4293 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_310.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 new file mode 100644 index 000000000..a5afa22ec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 new file mode 100644 index 000000000..d08fa3eb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 new file mode 100644 index 000000000..b0a1bceb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 new file mode 100644 index 000000000..6318d7ee6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 new file mode 100644 index 000000000..5e7cab744 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 new file mode 100644 index 000000000..8f0181486 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 new file mode 100644 index 000000000..1b55e6275 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 new file mode 100644 index 000000000..f123f6c16 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 new file mode 100644 index 000000000..862c5ce71 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 new file mode 100644 index 000000000..8d66d312c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_311.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_311.smt2 new file mode 100644 index 000000000..5b42f3325 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_311.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 new file mode 100644 index 000000000..46ad12c2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 new file mode 100644 index 000000000..c6ca73d3d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 new file mode 100644 index 000000000..4bd62d02b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 new file mode 100644 index 000000000..91717fee1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 new file mode 100644 index 000000000..30157ab94 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 new file mode 100644 index 000000000..5bf339671 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 new file mode 100644 index 000000000..3e08da216 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 new file mode 100644 index 000000000..ff015a338 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 new file mode 100644 index 000000000..bb36b37df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 new file mode 100644 index 000000000..a7ff77a58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_312.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_312.smt2 new file mode 100644 index 000000000..19ca905db --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_312.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 new file mode 100644 index 000000000..4c821fcd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 new file mode 100644 index 000000000..8f964c553 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 new file mode 100644 index 000000000..4baa35e5a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 new file mode 100644 index 000000000..70e947708 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 new file mode 100644 index 000000000..a47556ca6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 new file mode 100644 index 000000000..b20bd3504 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 new file mode 100644 index 000000000..c3918551f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 new file mode 100644 index 000000000..70f8aa8bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 new file mode 100644 index 000000000..d239500a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 new file mode 100644 index 000000000..1746c1431 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_313.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_313.smt2 new file mode 100644 index 000000000..a78d174e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_313.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 new file mode 100644 index 000000000..16fd0dc17 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 new file mode 100644 index 000000000..9251ab57e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 new file mode 100644 index 000000000..15c63b06e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 new file mode 100644 index 000000000..40cdf970f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 new file mode 100644 index 000000000..8237eb2b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 new file mode 100644 index 000000000..b884b9b87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 new file mode 100644 index 000000000..6d351687a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 new file mode 100644 index 000000000..6a002288c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 new file mode 100644 index 000000000..a576856c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 new file mode 100644 index 000000000..b8096f3f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_314.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_314.smt2 new file mode 100644 index 000000000..bb49d4312 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_314.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 new file mode 100644 index 000000000..81ed7846a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 new file mode 100644 index 000000000..7776af340 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 new file mode 100644 index 000000000..c1759e1a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 new file mode 100644 index 000000000..a785f01b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 new file mode 100644 index 000000000..f7e1c46d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 new file mode 100644 index 000000000..1039a20d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 new file mode 100644 index 000000000..4361987cb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 new file mode 100644 index 000000000..de37e31fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 new file mode 100644 index 000000000..59b565a2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 new file mode 100644 index 000000000..0d3311c33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_315.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_315.smt2 new file mode 100644 index 000000000..4917576e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_315.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 new file mode 100644 index 000000000..e0daa963b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 new file mode 100644 index 000000000..89217c166 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 new file mode 100644 index 000000000..6e745d85f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 new file mode 100644 index 000000000..34e326e48 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 new file mode 100644 index 000000000..0182b4fe6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 new file mode 100644 index 000000000..18898562b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 new file mode 100644 index 000000000..947b9dfe9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 new file mode 100644 index 000000000..fb7d0ef25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 new file mode 100644 index 000000000..2348b4cc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 new file mode 100644 index 000000000..6709c6375 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_316.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_316.smt2 new file mode 100644 index 000000000..a5d924983 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_316.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 new file mode 100644 index 000000000..7b1a36741 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 new file mode 100644 index 000000000..74828dbd3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 new file mode 100644 index 000000000..836d5fbda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 new file mode 100644 index 000000000..a2e6636d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 new file mode 100644 index 000000000..fb7cfad7b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 new file mode 100644 index 000000000..227b8293a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 new file mode 100644 index 000000000..28caf50dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 new file mode 100644 index 000000000..2d033da84 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 new file mode 100644 index 000000000..18c16b339 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 new file mode 100644 index 000000000..5a3e98797 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1001")) +(assert (= Bottom_0 "0")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_317.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_317.smt2 new file mode 100644 index 000000000..e2b2272e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_317.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_318.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_318.smt2 new file mode 100644 index 000000000..547f55b64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_318.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_319.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_319.smt2 new file mode 100644 index 000000000..bde905980 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_319.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_32.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_32.smt2 new file mode 100644 index 000000000..e080967ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_32.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_320.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_320.smt2 new file mode 100644 index 000000000..d580a2834 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_320.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_321.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_321.smt2 new file mode 100644 index 000000000..036e90e3a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_321.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_322.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_322.smt2 new file mode 100644 index 000000000..daa90ec58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_322.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_323.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_323.smt2 new file mode 100644 index 000000000..afe9e6c97 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_323.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_324.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_324.smt2 new file mode 100644 index 000000000..e735ec0f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_324.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_325.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_325.smt2 new file mode 100644 index 000000000..741a96b06 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_325.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_326.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_326.smt2 new file mode 100644 index 000000000..860de2b23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_326.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_327.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_327.smt2 new file mode 100644 index 000000000..ecf0fe2e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_327.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_328.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_328.smt2 new file mode 100644 index 000000000..4f1f0764d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_328.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_329.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_329.smt2 new file mode 100644 index 000000000..f2423feea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_329.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_33.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_33.smt2 new file mode 100644 index 000000000..1c2724d1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_33.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_330.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_330.smt2 new file mode 100644 index 000000000..87996cbc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_330.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_331.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_331.smt2 new file mode 100644 index 000000000..ca6c18fe2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_331.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_332.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_332.smt2 new file mode 100644 index 000000000..74f34181c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_332.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_333.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_333.smt2 new file mode 100644 index 000000000..a4f7f2fad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_333.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_334.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_334.smt2 new file mode 100644 index 000000000..665d7e7de --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_334.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_335.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_335.smt2 new file mode 100644 index 000000000..45cfa9c0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_335.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_336.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_336.smt2 new file mode 100644 index 000000000..c3df4c068 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_336.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_337.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_337.smt2 new file mode 100644 index 000000000..88d337257 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_337.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_338.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_338.smt2 new file mode 100644 index 000000000..c4fc5e262 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_338.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_339.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_339.smt2 new file mode 100644 index 000000000..2be3b3e9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_339.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_34.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_34.smt2 new file mode 100644 index 000000000..358d00647 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_34.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_340.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_340.smt2 new file mode 100644 index 000000000..a1122bb76 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_340.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_341.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_341.smt2 new file mode 100644 index 000000000..e5882210a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_341.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_342.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_342.smt2 new file mode 100644 index 000000000..8d6cac8e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_342.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_343.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_343.smt2 new file mode 100644 index 000000000..fbd51461c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_343.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_344.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_344.smt2 new file mode 100644 index 000000000..ab90345c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_344.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_345.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_345.smt2 new file mode 100644 index 000000000..f06f9c2d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_345.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_346.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_346.smt2 new file mode 100644 index 000000000..dd07efaad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_346.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_347.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_347.smt2 new file mode 100644 index 000000000..9d251d709 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_347.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_348.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_348.smt2 new file mode 100644 index 000000000..8665bf656 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_348.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_349.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_349.smt2 new file mode 100644 index 000000000..df33010a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_349.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_35.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_35.smt2 new file mode 100644 index 000000000..dfbb379fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_35.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_350.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_350.smt2 new file mode 100644 index 000000000..72b4c7a1b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_350.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_351.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_351.smt2 new file mode 100644 index 000000000..c85f40c96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_351.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_352.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_352.smt2 new file mode 100644 index 000000000..e564df904 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_352.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_353.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_353.smt2 new file mode 100644 index 000000000..d072928a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_353.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_354.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_354.smt2 new file mode 100644 index 000000000..48ad0bdaf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_354.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_355.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_355.smt2 new file mode 100644 index 000000000..6375a9648 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_355.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_356.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_356.smt2 new file mode 100644 index 000000000..d60707656 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_356.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_357.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_357.smt2 new file mode 100644 index 000000000..79f87bc9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_357.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_358.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_358.smt2 new file mode 100644 index 000000000..a5e390c6e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_358.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_359.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_359.smt2 new file mode 100644 index 000000000..5d00ee746 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_359.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_36.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_36.smt2 new file mode 100644 index 000000000..4d77af9ef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_36.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_360.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_360.smt2 new file mode 100644 index 000000000..ce7128c85 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_360.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_361.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_361.smt2 new file mode 100644 index 000000000..c40365534 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_361.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_362.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_362.smt2 new file mode 100644 index 000000000..568dd1874 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_362.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_363.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_363.smt2 new file mode 100644 index 000000000..e7b1a6a1c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_363.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_364.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_364.smt2 new file mode 100644 index 000000000..92c8a361a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_364.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_365.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_365.smt2 new file mode 100644 index 000000000..a8eaf99ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_365.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_366.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_366.smt2 new file mode 100644 index 000000000..bab53be76 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_366.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_367.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_367.smt2 new file mode 100644 index 000000000..abc043cca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_367.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "101")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_368.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_368.smt2 new file mode 100644 index 000000000..7bfcdd0f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_368.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_369.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_369.smt2 new file mode 100644 index 000000000..c7ba4909a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_369.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_37.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_37.smt2 new file mode 100644 index 000000000..5d61d532b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_37.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_370.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_370.smt2 new file mode 100644 index 000000000..2a350191e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_370.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_371.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_371.smt2 new file mode 100644 index 000000000..326c876b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_371.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_372.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_372.smt2 new file mode 100644 index 000000000..993955493 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_372.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_373.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_373.smt2 new file mode 100644 index 000000000..32b399644 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_373.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_374.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_374.smt2 new file mode 100644 index 000000000..fee8e946f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_374.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_375.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_375.smt2 new file mode 100644 index 000000000..52d100a93 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_375.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_376.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_376.smt2 new file mode 100644 index 000000000..4b6816691 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_376.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_377.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_377.smt2 new file mode 100644 index 000000000..1eb6700be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_377.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_378.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_378.smt2 new file mode 100644 index 000000000..5885a04cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_378.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_379.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_379.smt2 new file mode 100644 index 000000000..44b8f0568 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_379.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_38.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_38.smt2 new file mode 100644 index 000000000..140a090fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_38.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_380.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_380.smt2 new file mode 100644 index 000000000..2fd8f3904 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_380.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_381.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_381.smt2 new file mode 100644 index 000000000..03c046168 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_381.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_382.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_382.smt2 new file mode 100644 index 000000000..74fab5d2e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_382.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_383.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_383.smt2 new file mode 100644 index 000000000..8c7f39ee5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_383.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_384.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_384.smt2 new file mode 100644 index 000000000..963b4fde0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_384.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_385.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_385.smt2 new file mode 100644 index 000000000..219c97056 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_385.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_386.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_386.smt2 new file mode 100644 index 000000000..aadece817 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_386.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_387.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_387.smt2 new file mode 100644 index 000000000..96c18131e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_387.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_388.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_388.smt2 new file mode 100644 index 000000000..129c0a87d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_388.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_389.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_389.smt2 new file mode 100644 index 000000000..eb98c3c35 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_389.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_39.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_39.smt2 new file mode 100644 index 000000000..f5c80bbea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_39.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_390.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_390.smt2 new file mode 100644 index 000000000..85f4331b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_390.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_391.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_391.smt2 new file mode 100644 index 000000000..288e8aadb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_391.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_392.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_392.smt2 new file mode 100644 index 000000000..aca4c2495 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_392.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_393.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_393.smt2 new file mode 100644 index 000000000..964d3ddad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_393.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_394.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_394.smt2 new file mode 100644 index 000000000..7e1d993d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_394.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_395.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_395.smt2 new file mode 100644 index 000000000..d49023c7b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_395.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_396.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_396.smt2 new file mode 100644 index 000000000..6c8437fc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_396.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_397.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_397.smt2 new file mode 100644 index 000000000..efb7c3fb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_397.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_398.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_398.smt2 new file mode 100644 index 000000000..ee4f58a23 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_398.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_399.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_399.smt2 new file mode 100644 index 000000000..bc4004476 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_399.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_4.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_4.smt2 new file mode 100644 index 000000000..8e8b9af58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_4.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_40.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_40.smt2 new file mode 100644 index 000000000..690eaadae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_40.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_400.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_400.smt2 new file mode 100644 index 000000000..4d828ad53 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_400.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_401.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_401.smt2 new file mode 100644 index 000000000..606b4dadd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_401.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_402.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_402.smt2 new file mode 100644 index 000000000..c394b865c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_402.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_403.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_403.smt2 new file mode 100644 index 000000000..be4e417bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_403.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_404.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_404.smt2 new file mode 100644 index 000000000..2841c8580 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_404.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_405.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_405.smt2 new file mode 100644 index 000000000..ae8caa2f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_405.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_406.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_406.smt2 new file mode 100644 index 000000000..bee3b98c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_406.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_407.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_407.smt2 new file mode 100644 index 000000000..c5a618354 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_407.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_408.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_408.smt2 new file mode 100644 index 000000000..8651a4b09 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_408.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_409.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_409.smt2 new file mode 100644 index 000000000..6658a00ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_409.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_41.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_41.smt2 new file mode 100644 index 000000000..82157d93f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_41.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_410.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_410.smt2 new file mode 100644 index 000000000..ff7c7ea5f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_410.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_411.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_411.smt2 new file mode 100644 index 000000000..7a57ce111 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_411.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_412.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_412.smt2 new file mode 100644 index 000000000..bbd02b9ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_412.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_413.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_413.smt2 new file mode 100644 index 000000000..0c20dac00 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_413.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_414.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_414.smt2 new file mode 100644 index 000000000..0e65f8f25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_414.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_415.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_415.smt2 new file mode 100644 index 000000000..ed2feb553 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_415.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_416.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_416.smt2 new file mode 100644 index 000000000..93719a9ca --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_416.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_417.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_417.smt2 new file mode 100644 index 000000000..2fdddc4e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_417.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_418.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_418.smt2 new file mode 100644 index 000000000..d4edcb02f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_418.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_419.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_419.smt2 new file mode 100644 index 000000000..983d38d30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_419.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_42.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_42.smt2 new file mode 100644 index 000000000..29dd2fa49 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_42.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_420.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_420.smt2 new file mode 100644 index 000000000..ff184c1f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_420.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_421.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_421.smt2 new file mode 100644 index 000000000..42afde29b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_421.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_422.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_422.smt2 new file mode 100644 index 000000000..99dde77fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_422.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_423.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_423.smt2 new file mode 100644 index 000000000..6963d0a2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_423.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_424.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_424.smt2 new file mode 100644 index 000000000..afe7c90ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_424.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_425.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_425.smt2 new file mode 100644 index 000000000..58b2bedff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_425.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_426.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_426.smt2 new file mode 100644 index 000000000..3e2ea70d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_426.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_427.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_427.smt2 new file mode 100644 index 000000000..d40da7292 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_427.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_428.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_428.smt2 new file mode 100644 index 000000000..ee02c0db3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_428.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_429.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_429.smt2 new file mode 100644 index 000000000..08a53b9b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_429.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_43.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_43.smt2 new file mode 100644 index 000000000..e4c3b6a4d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_43.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_430.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_430.smt2 new file mode 100644 index 000000000..ccc5c00f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_430.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_431.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_431.smt2 new file mode 100644 index 000000000..1be90bcdd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_431.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_432.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_432.smt2 new file mode 100644 index 000000000..f33324227 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_432.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_433.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_433.smt2 new file mode 100644 index 000000000..478a8e266 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_433.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_434.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_434.smt2 new file mode 100644 index 000000000..4fab57b1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_434.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_435.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_435.smt2 new file mode 100644 index 000000000..c12ec4682 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_435.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_436.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_436.smt2 new file mode 100644 index 000000000..552a6e231 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_436.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_437.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_437.smt2 new file mode 100644 index 000000000..726e3d257 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_437.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_438.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_438.smt2 new file mode 100644 index 000000000..10beb7e8f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_438.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_439.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_439.smt2 new file mode 100644 index 000000000..de4e5c15f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_439.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_44.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_44.smt2 new file mode 100644 index 000000000..5c5b04def --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_44.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_440.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_440.smt2 new file mode 100644 index 000000000..4d96efc1e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_440.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_441.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_441.smt2 new file mode 100644 index 000000000..f6e1462d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_441.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_442.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_442.smt2 new file mode 100644 index 000000000..98bee22fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_442.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_443.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_443.smt2 new file mode 100644 index 000000000..63613505f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_443.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_444.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_444.smt2 new file mode 100644 index 000000000..3731fcb99 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_444.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_445.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_445.smt2 new file mode 100644 index 000000000..45a95b79a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_445.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_446.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_446.smt2 new file mode 100644 index 000000000..f384e2fb2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_446.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_447.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_447.smt2 new file mode 100644 index 000000000..d0863a375 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_447.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_448.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_448.smt2 new file mode 100644 index 000000000..ee13657f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_448.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_449.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_449.smt2 new file mode 100644 index 000000000..8d6c81b29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_449.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_45.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_45.smt2 new file mode 100644 index 000000000..0e82d8318 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_45.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_450.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_450.smt2 new file mode 100644 index 000000000..17f08d39b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_450.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_451.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_451.smt2 new file mode 100644 index 000000000..8470fe227 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_451.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_452.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_452.smt2 new file mode 100644 index 000000000..142f2ebc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_452.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_453.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_453.smt2 new file mode 100644 index 000000000..e7f0d4894 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_453.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_454.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_454.smt2 new file mode 100644 index 000000000..2e5a301a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_454.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_455.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_455.smt2 new file mode 100644 index 000000000..393a08640 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_455.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_456.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_456.smt2 new file mode 100644 index 000000000..68ff140e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_456.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_457.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_457.smt2 new file mode 100644 index 000000000..5f9c3dda4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_457.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_458.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_458.smt2 new file mode 100644 index 000000000..e5d3980eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_458.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_459.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_459.smt2 new file mode 100644 index 000000000..6cfd2220e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_459.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_46.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_46.smt2 new file mode 100644 index 000000000..daa2ce537 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_46.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_460.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_460.smt2 new file mode 100644 index 000000000..eeb28c6d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_460.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_461.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_461.smt2 new file mode 100644 index 000000000..80860a8b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_461.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_462.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_462.smt2 new file mode 100644 index 000000000..4e1b9d038 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_462.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_463.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_463.smt2 new file mode 100644 index 000000000..d3e11b735 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_463.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_464.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_464.smt2 new file mode 100644 index 000000000..a24db68e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_464.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_465.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_465.smt2 new file mode 100644 index 000000000..edcd776ad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_465.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_466.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_466.smt2 new file mode 100644 index 000000000..7a29734f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_466.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_467.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_467.smt2 new file mode 100644 index 000000000..eda9ddcb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_467.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_468.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_468.smt2 new file mode 100644 index 000000000..2cc7ab8ea --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_468.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_469.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_469.smt2 new file mode 100644 index 000000000..c2af96f48 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_469.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_47.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_47.smt2 new file mode 100644 index 000000000..8aeb49a0b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_47.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1010")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_470.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_470.smt2 new file mode 100644 index 000000000..3a63e9b9c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_470.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_471.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_471.smt2 new file mode 100644 index 000000000..5b3086c4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_471.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_472.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_472.smt2 new file mode 100644 index 000000000..f0df2857b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_472.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_473.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_473.smt2 new file mode 100644 index 000000000..ef4c5d692 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_473.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_474.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_474.smt2 new file mode 100644 index 000000000..9cfbc6689 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_474.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_475.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_475.smt2 new file mode 100644 index 000000000..25066fb10 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_475.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_476.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_476.smt2 new file mode 100644 index 000000000..f47cff02c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_476.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_477.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_477.smt2 new file mode 100644 index 000000000..16cf98fc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_477.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_478.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_478.smt2 new file mode 100644 index 000000000..e94ffd375 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_478.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_479.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_479.smt2 new file mode 100644 index 000000000..f4f3e0547 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_479.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_48.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_48.smt2 new file mode 100644 index 000000000..6afbbd6d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_48.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_480.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_480.smt2 new file mode 100644 index 000000000..7b90d5669 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_480.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_481.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_481.smt2 new file mode 100644 index 000000000..acc4ad070 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_481.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_482.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_482.smt2 new file mode 100644 index 000000000..09dc42a84 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_482.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_483.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_483.smt2 new file mode 100644 index 000000000..dea8dfd1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_483.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_484.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_484.smt2 new file mode 100644 index 000000000..f26bace91 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_484.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_485.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_485.smt2 new file mode 100644 index 000000000..aa86cb509 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_485.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_486.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_486.smt2 new file mode 100644 index 000000000..93426a072 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_486.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_487.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_487.smt2 new file mode 100644 index 000000000..d6ebfe10b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_487.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_488.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_488.smt2 new file mode 100644 index 000000000..88a6ae771 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_488.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_489.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_489.smt2 new file mode 100644 index 000000000..caba81822 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_489.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_49.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_49.smt2 new file mode 100644 index 000000000..e6c74c1ae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_49.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_490.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_490.smt2 new file mode 100644 index 000000000..6ae84d5c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_490.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_491.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_491.smt2 new file mode 100644 index 000000000..5d597f6aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_491.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_492.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_492.smt2 new file mode 100644 index 000000000..9eeda050a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_492.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_493.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_493.smt2 new file mode 100644 index 000000000..99820208d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_493.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_494.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_494.smt2 new file mode 100644 index 000000000..476f29e4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_494.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_495.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_495.smt2 new file mode 100644 index 000000000..ce58d2e8d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_495.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_496.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_496.smt2 new file mode 100644 index 000000000..083e27841 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_496.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_497.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_497.smt2 new file mode 100644 index 000000000..6e1fff020 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_497.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_498.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_498.smt2 new file mode 100644 index 000000000..8419e5958 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_498.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_499.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_499.smt2 new file mode 100644 index 000000000..0a19b4ce5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_499.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_5.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_5.smt2 new file mode 100644 index 000000000..dd6bb228b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_5.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_50.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_50.smt2 new file mode 100644 index 000000000..f02f92d9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_50.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 new file mode 100644 index 000000000..f1314be73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 new file mode 100644 index 000000000..dc8ccb58c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 new file mode 100644 index 000000000..af47b742f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 new file mode 100644 index 000000000..54b9cef2f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 new file mode 100644 index 000000000..12ab13259 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 new file mode 100644 index 000000000..86cc2c104 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 new file mode 100644 index 000000000..ce1be41d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 new file mode 100644 index 000000000..a3b052249 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 new file mode 100644 index 000000000..6538850e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 new file mode 100644 index 000000000..3f407e100 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_51.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_51.smt2 new file mode 100644 index 000000000..f474d6c9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_51.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1001")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 new file mode 100644 index 000000000..e80cd6f4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 new file mode 100644 index 000000000..5d37deb5f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 new file mode 100644 index 000000000..de9338958 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 new file mode 100644 index 000000000..6ec463b95 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 new file mode 100644 index 000000000..b28958448 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 new file mode 100644 index 000000000..1501ee224 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 new file mode 100644 index 000000000..412f22fef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 new file mode 100644 index 000000000..81c413c97 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 new file mode 100644 index 000000000..1bf32d593 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 new file mode 100644 index 000000000..eed4b58fe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_52.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_52.smt2 new file mode 100644 index 000000000..40aeb776c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_52.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 new file mode 100644 index 000000000..465b19087 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 new file mode 100644 index 000000000..8fea9c241 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 new file mode 100644 index 000000000..f9af10f40 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 new file mode 100644 index 000000000..4bbe0edf4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 new file mode 100644 index 000000000..993e42044 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 new file mode 100644 index 000000000..9b62c627f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 new file mode 100644 index 000000000..eb8e5b448 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 new file mode 100644 index 000000000..31f2010bf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 new file mode 100644 index 000000000..138be6fe9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 new file mode 100644 index 000000000..bb06bc554 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_53.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_53.smt2 new file mode 100644 index 000000000..685054201 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_53.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 new file mode 100644 index 000000000..115bf964a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 new file mode 100644 index 000000000..878bee1fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 new file mode 100644 index 000000000..c27c7a6a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 new file mode 100644 index 000000000..16afa0b94 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 new file mode 100644 index 000000000..9c0eb8eb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 new file mode 100644 index 000000000..9bd267677 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 new file mode 100644 index 000000000..c7eda0d5b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 new file mode 100644 index 000000000..3a0c35862 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 new file mode 100644 index 000000000..b929e643b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 new file mode 100644 index 000000000..975ff5657 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_54.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_54.smt2 new file mode 100644 index 000000000..05bae7be6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_54.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 new file mode 100644 index 000000000..3fba6fd49 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 new file mode 100644 index 000000000..027042a4a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 new file mode 100644 index 000000000..9f9cda43a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 new file mode 100644 index 000000000..39fd639d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 new file mode 100644 index 000000000..02247760e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 new file mode 100644 index 000000000..ccdb963f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 new file mode 100644 index 000000000..b0a247f9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 new file mode 100644 index 000000000..ba5359cee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 new file mode 100644 index 000000000..e88c4fbdd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 new file mode 100644 index 000000000..24ba6c5b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_55.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_55.smt2 new file mode 100644 index 000000000..4e2a3f0cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_55.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 new file mode 100644 index 000000000..f4427795a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 new file mode 100644 index 000000000..c09dcff2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 new file mode 100644 index 000000000..ec8495227 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 new file mode 100644 index 000000000..2fba26c65 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 new file mode 100644 index 000000000..a2229803d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 new file mode 100644 index 000000000..258dc616e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 new file mode 100644 index 000000000..18e0537a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 new file mode 100644 index 000000000..4a085a130 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 new file mode 100644 index 000000000..552de6423 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 new file mode 100644 index 000000000..2167a58ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_56.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_56.smt2 new file mode 100644 index 000000000..365c2d81e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_56.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 new file mode 100644 index 000000000..c3eefd8e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 new file mode 100644 index 000000000..d3a8e828f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 new file mode 100644 index 000000000..70045248f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 new file mode 100644 index 000000000..966d15447 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 new file mode 100644 index 000000000..7650e9e64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 new file mode 100644 index 000000000..41489a9c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 new file mode 100644 index 000000000..a0a2f86c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 new file mode 100644 index 000000000..a908675ee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 new file mode 100644 index 000000000..27056f1af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 new file mode 100644 index 000000000..abcf09d89 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_57.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_57.smt2 new file mode 100644 index 000000000..73e940a0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_57.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 new file mode 100644 index 000000000..6ec05ea74 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 new file mode 100644 index 000000000..8776673d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 new file mode 100644 index 000000000..c42569568 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 new file mode 100644 index 000000000..5e340b6a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 new file mode 100644 index 000000000..ebdc143e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 new file mode 100644 index 000000000..3218e5dfa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 new file mode 100644 index 000000000..f96673b0d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 new file mode 100644 index 000000000..eb38dc23c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 new file mode 100644 index 000000000..08d8e3283 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 new file mode 100644 index 000000000..10af17f5c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_58.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_58.smt2 new file mode 100644 index 000000000..4250073e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_58.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 new file mode 100644 index 000000000..3240e36e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 new file mode 100644 index 000000000..4e1c33598 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 new file mode 100644 index 000000000..c30345acc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 new file mode 100644 index 000000000..21dcce7f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 new file mode 100644 index 000000000..a0c205804 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 new file mode 100644 index 000000000..ae959ff9e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 new file mode 100644 index 000000000..5a39ab82e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 new file mode 100644 index 000000000..81f424aef --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 new file mode 100644 index 000000000..8eab7c958 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 new file mode 100644 index 000000000..39529c83b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_59.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_59.smt2 new file mode 100644 index 000000000..f2cc20cb6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_59.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 new file mode 100644 index 000000000..1cad04a54 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 new file mode 100644 index 000000000..532b222e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 new file mode 100644 index 000000000..569541915 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 new file mode 100644 index 000000000..7205ba725 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 new file mode 100644 index 000000000..1b2057b70 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 new file mode 100644 index 000000000..7fd5bbee8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 new file mode 100644 index 000000000..9ece190bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 new file mode 100644 index 000000000..aff18c4f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 new file mode 100644 index 000000000..56ea0fb0a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 new file mode 100644 index 000000000..f3f2533b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_6.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_6.smt2 new file mode 100644 index 000000000..2d02b3b78 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_6.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_60.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_60.smt2 new file mode 100644 index 000000000..c47b45740 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_60.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 new file mode 100644 index 000000000..f4775e4b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 new file mode 100644 index 000000000..d3372c036 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 new file mode 100644 index 000000000..d7a944665 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 new file mode 100644 index 000000000..ba4485844 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 new file mode 100644 index 000000000..81c802f4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 new file mode 100644 index 000000000..11ac08d9c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 new file mode 100644 index 000000000..a411b95de --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 new file mode 100644 index 000000000..a70119e25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 new file mode 100644 index 000000000..7c9f3aad2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 new file mode 100644 index 000000000..ed0dcdf44 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_61.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_61.smt2 new file mode 100644 index 000000000..80c4a5113 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_61.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 new file mode 100644 index 000000000..db591fe8b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 new file mode 100644 index 000000000..210b99810 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 new file mode 100644 index 000000000..1e3689d8a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 new file mode 100644 index 000000000..c2c3822bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 new file mode 100644 index 000000000..50248438d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 new file mode 100644 index 000000000..82c49637d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 new file mode 100644 index 000000000..4c65592f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 new file mode 100644 index 000000000..8d7b6a254 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 new file mode 100644 index 000000000..cd5e79ea6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 new file mode 100644 index 000000000..610b3f76b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_62.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_62.smt2 new file mode 100644 index 000000000..0c88c3846 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_62.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 new file mode 100644 index 000000000..f4e86d0a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 new file mode 100644 index 000000000..d824b9821 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 new file mode 100644 index 000000000..8cf1d034d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 new file mode 100644 index 000000000..8fc95168d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 new file mode 100644 index 000000000..e3a2dcefa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 new file mode 100644 index 000000000..b92f94dde --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 new file mode 100644 index 000000000..1f7a9c4af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 new file mode 100644 index 000000000..08ee8d368 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 new file mode 100644 index 000000000..f014e57ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 new file mode 100644 index 000000000..90ed11729 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_63.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_63.smt2 new file mode 100644 index 000000000..036e086d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_63.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 new file mode 100644 index 000000000..6da9985f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 new file mode 100644 index 000000000..29b04d065 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 new file mode 100644 index 000000000..ea45632ba --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 new file mode 100644 index 000000000..cf900c567 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 new file mode 100644 index 000000000..e7291cdcb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 new file mode 100644 index 000000000..91397c002 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 new file mode 100644 index 000000000..fff9b28e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 new file mode 100644 index 000000000..7ab159aa7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 new file mode 100644 index 000000000..983e8ed40 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 new file mode 100644 index 000000000..e31950197 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_64.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_64.smt2 new file mode 100644 index 000000000..4811f7ab1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_64.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 new file mode 100644 index 000000000..378ce4f9b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 new file mode 100644 index 000000000..b40f49cbf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 new file mode 100644 index 000000000..1e6db406e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 new file mode 100644 index 000000000..3dc149b1c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 new file mode 100644 index 000000000..27c2363c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 new file mode 100644 index 000000000..5f419fd5d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 new file mode 100644 index 000000000..db87f950d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 new file mode 100644 index 000000000..66b049453 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 new file mode 100644 index 000000000..5020b97d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 new file mode 100644 index 000000000..d56b5594c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_65.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_65.smt2 new file mode 100644 index 000000000..ae091f15e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_65.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 new file mode 100644 index 000000000..9299df8e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 new file mode 100644 index 000000000..20929bc5e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 new file mode 100644 index 000000000..617e16ea1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 new file mode 100644 index 000000000..d51b7753d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 new file mode 100644 index 000000000..e198dcbf5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 new file mode 100644 index 000000000..835ba59b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 new file mode 100644 index 000000000..f3db8cd3c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "0100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 new file mode 100644 index 000000000..8fa359263 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 new file mode 100644 index 000000000..aa2cd241b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 new file mode 100644 index 000000000..98f5c70d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_66.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_66.smt2 new file mode 100644 index 000000000..5c4794573 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_66.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 new file mode 100644 index 000000000..0bb6d34b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 new file mode 100644 index 000000000..88b6c5f1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 new file mode 100644 index 000000000..6125541b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 new file mode 100644 index 000000000..347969faf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 new file mode 100644 index 000000000..74a6f00fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 new file mode 100644 index 000000000..5d139c84f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "11")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0")) +(assert (= Bottom_1 "100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 new file mode 100644 index 000000000..9ae45dcc0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 new file mode 100644 index 000000000..016f93fda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 new file mode 100644 index 000000000..dbd8e76c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 new file mode 100644 index 000000000..09f823dac --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_67.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_67.smt2 new file mode 100644 index 000000000..22f3ac707 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_67.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 new file mode 100644 index 000000000..7d22e06cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 new file mode 100644 index 000000000..40d99aa60 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 new file mode 100644 index 000000000..673b7a2a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 new file mode 100644 index 000000000..1bec93311 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 new file mode 100644 index 000000000..7aee669be --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 new file mode 100644 index 000000000..26469b207 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 new file mode 100644 index 000000000..f0036cd64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 new file mode 100644 index 000000000..650a77a77 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 new file mode 100644 index 000000000..b8aaf957e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 new file mode 100644 index 000000000..4427cc1f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_68.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_68.smt2 new file mode 100644 index 000000000..82b9efab3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_68.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 new file mode 100644 index 000000000..61215fbaa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 new file mode 100644 index 000000000..be2c06aa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 new file mode 100644 index 000000000..2ec789d58 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 new file mode 100644 index 000000000..f7db28559 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 new file mode 100644 index 000000000..5e9f7b737 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 new file mode 100644 index 000000000..e611c9759 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 new file mode 100644 index 000000000..f1fdc159a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0111")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 new file mode 100644 index 000000000..01bac4929 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 new file mode 100644 index 000000000..fdc109223 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 new file mode 100644 index 000000000..bb9d8598d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_69.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_69.smt2 new file mode 100644 index 000000000..7b627c226 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_69.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 new file mode 100644 index 000000000..a7a267504 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 new file mode 100644 index 000000000..7bec1d955 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 new file mode 100644 index 000000000..38735a134 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 new file mode 100644 index 000000000..125cbc6dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 new file mode 100644 index 000000000..dedd3157b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 new file mode 100644 index 000000000..e71d21329 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 new file mode 100644 index 000000000..a098694c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 new file mode 100644 index 000000000..3e3a64dcc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 new file mode 100644 index 000000000..99197209b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 new file mode 100644 index 000000000..2ccdbb521 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_7.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_7.smt2 new file mode 100644 index 000000000..0837e06b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_7.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_70.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_70.smt2 new file mode 100644 index 000000000..b93fff72e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_70.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 new file mode 100644 index 000000000..7ea6dd79c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 new file mode 100644 index 000000000..31a364046 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 new file mode 100644 index 000000000..9cb816dae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 new file mode 100644 index 000000000..8daf96014 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 new file mode 100644 index 000000000..1430c5dd3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 new file mode 100644 index 000000000..88859192f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 new file mode 100644 index 000000000..df6f6ac29 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 new file mode 100644 index 000000000..8d162b9a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 new file mode 100644 index 000000000..2a4b5b844 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 new file mode 100644 index 000000000..9f1cba8da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_71.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_71.smt2 new file mode 100644 index 000000000..a1d706a25 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_71.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 new file mode 100644 index 000000000..0fb6814af --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 new file mode 100644 index 000000000..52499f25c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 new file mode 100644 index 000000000..5385dec1e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 new file mode 100644 index 000000000..2826d680b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 new file mode 100644 index 000000000..59d1caa92 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 new file mode 100644 index 000000000..e84e58f1a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 new file mode 100644 index 000000000..c54eeda8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 new file mode 100644 index 000000000..c4beda998 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 new file mode 100644 index 000000000..5440c0709 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 new file mode 100644 index 000000000..079c5a450 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_72.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_72.smt2 new file mode 100644 index 000000000..f29281627 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_72.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 new file mode 100644 index 000000000..74f33f32d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 new file mode 100644 index 000000000..23b73ded5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 new file mode 100644 index 000000000..957306f6d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "011")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 new file mode 100644 index 000000000..cc91997ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 new file mode 100644 index 000000000..fc2ad9a54 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 new file mode 100644 index 000000000..22bf1ca36 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 new file mode 100644 index 000000000..2a69c799a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 new file mode 100644 index 000000000..34be0ea34 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 new file mode 100644 index 000000000..48da1fb31 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 new file mode 100644 index 000000000..32043251e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_73.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_73.smt2 new file mode 100644 index 000000000..5168f45ab --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_73.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 new file mode 100644 index 000000000..c8739ce33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 new file mode 100644 index 000000000..978a52001 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 new file mode 100644 index 000000000..030597aa2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 new file mode 100644 index 000000000..3f9ace6dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "01")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 new file mode 100644 index 000000000..6c12be5f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 new file mode 100644 index 000000000..01393d39a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "10")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 new file mode 100644 index 000000000..32227d592 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 new file mode 100644 index 000000000..8babfec0e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 new file mode 100644 index 000000000..b129453c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 new file mode 100644 index 000000000..6481f7ccf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_74.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_74.smt2 new file mode 100644 index 000000000..a7dba89a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_74.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 new file mode 100644 index 000000000..b94b6abb1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 new file mode 100644 index 000000000..35b57178b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 new file mode 100644 index 000000000..dc351f8d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 new file mode 100644 index 000000000..795ca3584 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 new file mode 100644 index 000000000..a154da46b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 new file mode 100644 index 000000000..2f812e27f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 new file mode 100644 index 000000000..9fba87d6d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 new file mode 100644 index 000000000..8177066ed --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 new file mode 100644 index 000000000..e2fbc7b14 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "00")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 new file mode 100644 index 000000000..bede7371e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_75.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_75.smt2 new file mode 100644 index 000000000..3ae9db6f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_75.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 new file mode 100644 index 000000000..84b07b00d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 new file mode 100644 index 000000000..0666a1ea9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 new file mode 100644 index 000000000..987fa1a89 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 new file mode 100644 index 000000000..f3961b035 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 new file mode 100644 index 000000000..13b32258e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 new file mode 100644 index 000000000..d71847f40 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 new file mode 100644 index 000000000..6f168a2cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 new file mode 100644 index 000000000..6ce883c72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 new file mode 100644 index 000000000..59071ad61 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 new file mode 100644 index 000000000..3f6ee4cee --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_76.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_76.smt2 new file mode 100644 index 000000000..ee5b80583 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_76.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 new file mode 100644 index 000000000..216defbf7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 new file mode 100644 index 000000000..ad5699cf2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 new file mode 100644 index 000000000..f1bea9d72 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 new file mode 100644 index 000000000..08ae362ce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 new file mode 100644 index 000000000..74ae749a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 new file mode 100644 index 000000000..063bd6938 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 new file mode 100644 index 000000000..8ed84009e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 new file mode 100644 index 000000000..96b89e1a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 new file mode 100644 index 000000000..66c9cef00 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 new file mode 100644 index 000000000..739f880dd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_77.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_77.smt2 new file mode 100644 index 000000000..436a5f01c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_77.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 new file mode 100644 index 000000000..d038a8e36 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 new file mode 100644 index 000000000..c82271f60 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 new file mode 100644 index 000000000..8ed92b1aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 new file mode 100644 index 000000000..932fcd6d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 new file mode 100644 index 000000000..2df6e0c87 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 new file mode 100644 index 000000000..cbaf62a2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 new file mode 100644 index 000000000..d3903639c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 new file mode 100644 index 000000000..efd6a1822 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 new file mode 100644 index 000000000..87be7feb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 new file mode 100644 index 000000000..1f71bec11 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_78.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_78.smt2 new file mode 100644 index 000000000..b8d3c27c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_78.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 new file mode 100644 index 000000000..0e816ea61 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 new file mode 100644 index 000000000..06a135dc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 new file mode 100644 index 000000000..ca754bb67 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 new file mode 100644 index 000000000..1695e17e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 new file mode 100644 index 000000000..2a12020dc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 new file mode 100644 index 000000000..67dea8d79 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 new file mode 100644 index 000000000..84dcabdbe --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 new file mode 100644 index 000000000..eaba606a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 new file mode 100644 index 000000000..4e4611c73 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 new file mode 100644 index 000000000..c97367eaf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_79.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_79.smt2 new file mode 100644 index 000000000..0bf300cd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_79.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 new file mode 100644 index 000000000..67a8a93ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 new file mode 100644 index 000000000..60c351c26 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 new file mode 100644 index 000000000..bc7ba7ae7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 new file mode 100644 index 000000000..9e33ca3bf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 new file mode 100644 index 000000000..4df1c11f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 new file mode 100644 index 000000000..c3f75bd46 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 new file mode 100644 index 000000000..5741f8f1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "00")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 new file mode 100644 index 000000000..962c82a4f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 new file mode 100644 index 000000000..992f79fd5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 new file mode 100644 index 000000000..e8aaf2179 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_8.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_8.smt2 new file mode 100644 index 000000000..bc5e64b38 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_8.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_80.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_80.smt2 new file mode 100644 index 000000000..71831c474 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_80.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 new file mode 100644 index 000000000..a35337de1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 new file mode 100644 index 000000000..60d4e3f1e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 new file mode 100644 index 000000000..fd44d5754 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 new file mode 100644 index 000000000..9566b8016 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 new file mode 100644 index 000000000..cf50b104f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 new file mode 100644 index 000000000..0de55b47e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 new file mode 100644 index 000000000..eb9f671e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 new file mode 100644 index 000000000..586d4a361 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 new file mode 100644 index 000000000..5c9cbbf1b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 new file mode 100644 index 000000000..98a6d210e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_81.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_81.smt2 new file mode 100644 index 000000000..efe42a324 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_81.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 new file mode 100644 index 000000000..e9b96cb90 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 new file mode 100644 index 000000000..f9b2526ad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 new file mode 100644 index 000000000..d9f49aee4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "110")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 new file mode 100644 index 000000000..9f209d059 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 new file mode 100644 index 000000000..6bfbb0d3f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 new file mode 100644 index 000000000..5d49afe1d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 new file mode 100644 index 000000000..57439bfce --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 new file mode 100644 index 000000000..3014c280c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 new file mode 100644 index 000000000..c3b04c15b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 new file mode 100644 index 000000000..9c411c2fa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_82.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_82.smt2 new file mode 100644 index 000000000..8c54b2954 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_82.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 new file mode 100644 index 000000000..840aaea7c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 new file mode 100644 index 000000000..30adab347 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 new file mode 100644 index 000000000..fcf1ff29d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 new file mode 100644 index 000000000..aa562ba4e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 new file mode 100644 index 000000000..f20588615 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 new file mode 100644 index 000000000..037b12e09 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "011")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 new file mode 100644 index 000000000..7789772f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 new file mode 100644 index 000000000..060ef373e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 new file mode 100644 index 000000000..162494d33 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 new file mode 100644 index 000000000..923175f51 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_83.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_83.smt2 new file mode 100644 index 000000000..d1222f857 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_83.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 new file mode 100644 index 000000000..f04b91785 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 new file mode 100644 index 000000000..039b7eef9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 new file mode 100644 index 000000000..97519769b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 new file mode 100644 index 000000000..17dac2947 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 new file mode 100644 index 000000000..883a8ea5a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 new file mode 100644 index 000000000..cea63cbae --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 new file mode 100644 index 000000000..4151925f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 new file mode 100644 index 000000000..fde12a0d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 new file mode 100644 index 000000000..b13152463 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 new file mode 100644 index 000000000..89862354f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_84.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_84.smt2 new file mode 100644 index 000000000..a4b42fc8e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_84.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1010")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 new file mode 100644 index 000000000..cc749def2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 new file mode 100644 index 000000000..79df445d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 new file mode 100644 index 000000000..5d1060d83 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 new file mode 100644 index 000000000..f542b406e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "110")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 new file mode 100644 index 000000000..e848e8072 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "101")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 new file mode 100644 index 000000000..a3fe4897e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 new file mode 100644 index 000000000..f9bf9155a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 new file mode 100644 index 000000000..1944055a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 new file mode 100644 index 000000000..ac3619d82 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 new file mode 100644 index 000000000..4924aea4d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_85.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_85.smt2 new file mode 100644 index 000000000..7760de8fb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_85.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 new file mode 100644 index 000000000..ca3422a89 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 new file mode 100644 index 000000000..487d5a5b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 new file mode 100644 index 000000000..1f7674d2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 new file mode 100644 index 000000000..02989b67f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 new file mode 100644 index 000000000..094ddb0fd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 new file mode 100644 index 000000000..2ddaff47d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 new file mode 100644 index 000000000..e68b6c7a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 new file mode 100644 index 000000000..7869e8130 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 new file mode 100644 index 000000000..ac97923b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 new file mode 100644 index 000000000..e8e89eb2b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_86.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_86.smt2 new file mode 100644 index 000000000..37738c00f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_86.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 new file mode 100644 index 000000000..7e3dbf07b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "101")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 new file mode 100644 index 000000000..177116242 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "100")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 new file mode 100644 index 000000000..d32c40fd4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 new file mode 100644 index 000000000..379e8e093 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 new file mode 100644 index 000000000..c84b0ed93 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 new file mode 100644 index 000000000..b8ebcece1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 new file mode 100644 index 000000000..9622fbff4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 new file mode 100644 index 000000000..2eff2f6ec --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 new file mode 100644 index 000000000..c5dadcf9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 new file mode 100644 index 000000000..b3a4cf81f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_87.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_87.smt2 new file mode 100644 index 000000000..c45e11d65 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_87.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 new file mode 100644 index 000000000..4323add10 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "001")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 new file mode 100644 index 000000000..85c44fc9a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 new file mode 100644 index 000000000..8be642721 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 new file mode 100644 index 000000000..1e6b41a5b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 new file mode 100644 index 000000000..86ba00f37 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 new file mode 100644 index 000000000..2b978cc32 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1001")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 new file mode 100644 index 000000000..b1507d207 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 new file mode 100644 index 000000000..bd8fe386f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 new file mode 100644 index 000000000..cc7ea6d96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 new file mode 100644 index 000000000..6eb46a1e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_88.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_88.smt2 new file mode 100644 index 000000000..ba8bc7567 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_88.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 new file mode 100644 index 000000000..8bfb405fc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 new file mode 100644 index 000000000..bb28e5eda --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 new file mode 100644 index 000000000..1ffe6ed2a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 new file mode 100644 index 000000000..56b2bcaf9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 new file mode 100644 index 000000000..016760d21 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 new file mode 100644 index 000000000..e8bafafa1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 new file mode 100644 index 000000000..c0b3c3dcf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 new file mode 100644 index 000000000..57856cadc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 new file mode 100644 index 000000000..519747123 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 new file mode 100644 index 000000000..645916bcf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_89.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_89.smt2 new file mode 100644 index 000000000..cd45538c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_89.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0101")) +(assert (= Bottom_1 "01")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 new file mode 100644 index 000000000..b2de78fa6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "010")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 new file mode 100644 index 000000000..6c9d851b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 new file mode 100644 index 000000000..329299a9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 new file mode 100644 index 000000000..519ead27b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 new file mode 100644 index 000000000..151bbf17f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 new file mode 100644 index 000000000..e49f95949 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 new file mode 100644 index 000000000..797f62a22 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 new file mode 100644 index 000000000..f6be899bd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 new file mode 100644 index 000000000..803769aa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 new file mode 100644 index 000000000..8fc968ddc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_9.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_9.smt2 new file mode 100644 index 000000000..f8df6b13d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_9.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1110")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_90.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_90.smt2 new file mode 100644 index 000000000..a600b76df --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_90.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0011")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 new file mode 100644 index 000000000..72e84880f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 new file mode 100644 index 000000000..a008a9c85 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 new file mode 100644 index 000000000..415509887 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 new file mode 100644 index 000000000..74e5babfd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 new file mode 100644 index 000000000..030caccd1 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 new file mode 100644 index 000000000..df137103f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 new file mode 100644 index 000000000..54d7682a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 new file mode 100644 index 000000000..2ad6c74c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 new file mode 100644 index 000000000..2e3cd32f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "0101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 new file mode 100644 index 000000000..66659a336 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_91.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_91.smt2 new file mode 100644 index 000000000..cf779dde8 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_91.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "111")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 new file mode 100644 index 000000000..775239003 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 new file mode 100644 index 000000000..590acdb64 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 new file mode 100644 index 000000000..f1ab5e372 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "010")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 new file mode 100644 index 000000000..2ea88a048 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 new file mode 100644 index 000000000..339fdf222 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 new file mode 100644 index 000000000..0cd685141 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 new file mode 100644 index 000000000..84d215b2d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 new file mode 100644 index 000000000..2a3249ce4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 new file mode 100644 index 000000000..67b570cf2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 new file mode 100644 index 000000000..ce58e64cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_92.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_92.smt2 new file mode 100644 index 000000000..62cf7edd7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_92.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 new file mode 100644 index 000000000..7885cd915 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 new file mode 100644 index 000000000..ffc2bf916 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 new file mode 100644 index 000000000..553aefb4c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "10")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 new file mode 100644 index 000000000..d3cf9d1bc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 new file mode 100644 index 000000000..9f892f6da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 new file mode 100644 index 000000000..843afd10f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 new file mode 100644 index 000000000..14b62236f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 new file mode 100644 index 000000000..f84a41f61 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 new file mode 100644 index 000000000..a28bd5ca5 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 new file mode 100644 index 000000000..8209e533c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_93.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_93.smt2 new file mode 100644 index 000000000..0d1bfa11a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_93.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "0001")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 new file mode 100644 index 000000000..94c69bfa0 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 new file mode 100644 index 000000000..73711d7ff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 new file mode 100644 index 000000000..550ca8f17 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "11")) +(assert (= Bottom_1 "0110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 new file mode 100644 index 000000000..cfdcfd9a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 new file mode 100644 index 000000000..ad3791fb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 new file mode 100644 index 000000000..6392730da --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 new file mode 100644 index 000000000..4afb16155 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 new file mode 100644 index 000000000..de9bc872f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 new file mode 100644 index 000000000..8f6ea136a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 new file mode 100644 index 000000000..fe7546f75 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_94.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_94.smt2 new file mode 100644 index 000000000..c28c7c5ad --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_94.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "111")) +(assert (= Bottom_1 "1111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "000")) +(assert (= Bottom_2 "0")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 new file mode 100644 index 000000000..db5c18096 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 new file mode 100644 index 000000000..2219322cc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 new file mode 100644 index 000000000..175cb3383 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 new file mode 100644 index 000000000..cea61c536 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "1100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 new file mode 100644 index 000000000..08110b612 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1011")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 new file mode 100644 index 000000000..27228b621 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 new file mode 100644 index 000000000..38b295738 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 new file mode 100644 index 000000000..27a1fad12 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 new file mode 100644 index 000000000..b79e49474 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 new file mode 100644 index 000000000..bbf339991 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_95.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_95.smt2 new file mode 100644 index 000000000..09cccb9eb --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_95.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "11")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 new file mode 100644 index 000000000..da04c07cd --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1010")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 new file mode 100644 index 000000000..8f1655f82 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 new file mode 100644 index 000000000..f5e620d9f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 new file mode 100644 index 000000000..9c812be75 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 new file mode 100644 index 000000000..177540499 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 new file mode 100644 index 000000000..38c49535e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 new file mode 100644 index 000000000..4d73f3544 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 new file mode 100644 index 000000000..754efd30a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 new file mode 100644 index 000000000..62fd04f88 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 new file mode 100644 index 000000000..371aa5042 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_96.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_96.smt2 new file mode 100644 index 000000000..77e814bdc --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_96.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 new file mode 100644 index 000000000..00fdafd5f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "0100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 new file mode 100644 index 000000000..f779c7dff --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 new file mode 100644 index 000000000..5888b1f48 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 new file mode 100644 index 000000000..4770c943a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 new file mode 100644 index 000000000..768e1e5b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 new file mode 100644 index 000000000..043db6eb6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 new file mode 100644 index 000000000..6102ee310 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 new file mode 100644 index 000000000..160a7c8d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 new file mode 100644 index 000000000..973cdfd81 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 new file mode 100644 index 000000000..24796223a --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "0001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_97.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_97.smt2 new file mode 100644 index 000000000..8d75f0265 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_97.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "000")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 new file mode 100644 index 000000000..3cb569b8d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 new file mode 100644 index 000000000..edbadd38d --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 new file mode 100644 index 000000000..ea198fea6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "00")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 new file mode 100644 index 000000000..44873cd6c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "10")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 new file mode 100644 index 000000000..a6bf27e52 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 new file mode 100644 index 000000000..c0c8f089e --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "001")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 new file mode 100644 index 000000000..7e52b26c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "110")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "01")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 new file mode 100644 index 000000000..27e63802c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "01")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 new file mode 100644 index 000000000..99b7796b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "100")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 new file mode 100644 index 000000000..e6c5281cf --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "101")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "10")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_98.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_98.smt2 new file mode 100644 index 000000000..f78e4b41b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_98.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0100")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 new file mode 100644 index 000000000..aadd75588 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 new file mode 100644 index 000000000..4fb6ba1d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 new file mode 100644 index 000000000..e912c5484 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 new file mode 100644 index 000000000..9c897832b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 new file mode 100644 index 000000000..3974ebaa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 new file mode 100644 index 000000000..ad4edc4aa --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "11")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 new file mode 100644 index 000000000..e84356f99 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 new file mode 100644 index 000000000..33ddb2056 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 new file mode 100644 index 000000000..853698e96 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "1011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 new file mode 100644 index 000000000..afa9cda99 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "0111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_99.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_99.smt2 new file mode 100644 index 000000000..bbd7ff0e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_99.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "0000")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "1100")) +(assert (= Bottom_1 "0")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "11")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 new file mode 100644 index 000000000..00d7f50c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "110")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 new file mode 100644 index 000000000..af5486c2c --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "101")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 new file mode 100644 index 000000000..cf15d809b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "1")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 new file mode 100644 index 000000000..0b3e78d30 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "10")) +(assert (= Bottom_1 "1")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1010")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 new file mode 100644 index 000000000..1453bc55f --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "00")) +(assert (= Bottom_2 "0011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 new file mode 100644 index 000000000..4ed7b8637 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1100")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "011")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 new file mode 100644 index 000000000..d947da94b --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 new file mode 100644 index 000000000..cb0c320e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "111")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 new file mode 100644 index 000000000..83bb7f3f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "1000")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 new file mode 100644 index 000000000..4d4e74009 --- /dev/null +++ b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 @@ -0,0 +1,57 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of String Solvers on PCP +Target solver: cvc5,Z3,OSTRICH +Time limit: 60.0 +Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper +'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different +techniques like Parikh Automata and Model Checking but String Solvers have not been tested. +Most benchmarks expected to be unsat. +Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and +Proof Generation +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unknown) + +(declare-fun TopStr () String) +(declare-fun BottomStr () String) + +(declare-fun Top_0 () String) +(declare-fun Bottom_0 () String) +(assert (= Top_0 "1111")) +(assert (= Bottom_0 "1")) +(declare-fun Top_1 () String) +(declare-fun Bottom_1 () String) +(assert (= Top_1 "00")) +(assert (= Bottom_1 "111")) +(declare-fun Top_2 () String) +(declare-fun Bottom_2 () String) +(assert (= Top_2 "0")) +(assert (= Bottom_2 "1000")) +(declare-fun replace () String) +(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) + +(declare-fun x () String) +(declare-fun y () String) +(declare-fun x_0 () String) +(declare-fun y_0 () String) +(declare-fun x_1 () String) +(declare-fun y_1 () String) +(declare-fun x_2 () String) +(declare-fun y_2 () String) +(assert (= x_1 (str.replace_all x_0 "2" Top_0))) +(assert (= x_2 (str.replace_all x_1 "3" Top_1))) +(assert (= x (str.replace_all x_2 "4" Top_2))) +(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) +(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) +(assert (= y (str.replace_all y_2 "4" Bottom_2))) +(assert (= x_0 replace)) +(assert (= y_0 replace)) + +(assert (= x y)) +(check-sat) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 new file mode 100644 index 000000000..9179aa8e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGCCCCCAGCCTCTAAACGTAGATCATCCTATAAGTCGTTTCTAACCTTCGCTTCGAATCGAGTAGAGAAACAACGAATGCTCGAGAAGCCTGACGTACTAACTTCTAAGTCCGCGACGCGATTGCCCTCTACGCAGGCGCTGATCCCTTGTGCGACGGCAATATGACTACACCTACTCCGGCGAACGATTACTTCCTA")) +(assert (= z "ucucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 new file mode 100644 index 000000000..9992bce9d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCCCTGCCAGTGGACAAGCTTGGCCGCTGCGTTACTATACTCTGCTACGTGACAGGGGACTAGAAGTAGGCTGAAGCTACTTGAAGATGGGCGGGAACCGGGAAGTTTCAACCGCCGGGGACTGCTCGGACTATTTACCTTCCTTCTTCCTAGGTAGACCTCTGCAACCCACACATCACCATGGCTCGCATCGTCTTCG")) +(assert (= z "agaaggauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 new file mode 100644 index 000000000..d0ccfa409 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATAGGACTAAGGTCCGGACTGCTGCCAGGGAACCTCGAAGTGACTTGAGTATGGCTGTGACGCCTTAGGGGCCCCTGAGGGGCGTTTAAGTTGAGGTGAAGAGAGACAGTCATTGGCGACCTACTACATGTAGTACAATTTCTCCTCATAACGACACTGGCCATCCGCAAACTAATGCGCGCCAAATGGCAACAGGGCT")) +(assert (= z "guauug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 new file mode 100644 index 000000000..b1569cc08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGTAATAGAAAGTCCAACTCTTCAAACCAGAGGAAAAACAGTGCGAACCGATCAGAGTTTATGCGCTCGTTCGGGTTGAAGGACATAGGTTGGGTTAGATAGGGAAGGGACGTGAGTGCCACGTTCCCGCCCTTCACTAAGTATCCTTGTACGACTCTTGTAGCTTCGGGTGAGCAGTCCGTCACGTCTTGGGGCGTAA")) +(assert (= z "cccug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 new file mode 100644 index 000000000..1de8463ff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGGGCATCTTGGTATCCAATGTGCTAAAAGGCTGCGTTCATATAAGTACCACTCCCCTAGTGGTCAGGAACTCTGATCTACTAAGGTTGTGACGCCCAGAGCAGGTTAGATAGAGGATATCCATAACGATGTTGGTCGAGGTAATGCACTACGATGTACGGCCCCAGCTGTCGAAGCCCACCGTTTGCGTGAAGATAG")) +(assert (= z "gccgggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 new file mode 100644 index 000000000..61e6b794d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCCGAACAAAATCACGAAAACGGCACGGGTAGGGCGCAACGCAAACAGGTAGTCGATGTTCATATGTCCTGTTTCCGCAATATACATGAATAATCGGCCGTATCAAAACGATTTCATGGTGATGTCTTCGGAGCGCACCTGTGCGTCTTCCACTTGGTAGTGAGTTTGCCCCGCACGACTGAGGCGCTCCAACTTATTC")) +(assert (= z "acuuauuagccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 new file mode 100644 index 000000000..30b9f646b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTTCCGTACCGGGAGTGCTTCCGCCAGGACACCCAACGTGGAGTTTATGAAGGCTCTGGGAATTAAGGCCTAGTTCATAGGCAGGGCGTAAAACCAGACTGTCGTCTCCCCATACAATGAGCTCGAATAAACTTGCTTAGCGACGTTGAATTTACCGAGTAACGTCACGTAAACCGACAGGTGACCGTACCTACTTCCA")) +(assert (= z "guccuguggguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 new file mode 100644 index 000000000..fad8d93f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGATCAGACTGCATTAGTTTGGTGGACCATGGTAGGGATATGTTGCACCACGGGATAGATAGAAACATGACACGCCTAGGGCTCAATGGGAATGCAGTGGAGGCGTCCAGAGAAAAATTACCTGATAGCTCTGGCTCTTTATGTCTCTTCGGCCCCCCGTAAACCCGTTACAATCCAACACCTCACGGATCACAATCAA")) +(assert (= z "uacaacguggugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 new file mode 100644 index 000000000..312a6edd5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACACAATCGGAGTATGATCTATAGCCATCCACGGACCAAGATAGTTTTTTGACCACGTATAATTCTGAGGTAACAATTTCGCCCCGAGCTATTTAGATTGTTGCTTTCGGAATGGTTTATTGTACGTTGCAACCAACTCACGGTATCACCAACCTACCTTCTAGTCATGGAATTGTCAGGCAGCTACTCTCGCCTTGATA")) +(assert (= z "gauggaagauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 new file mode 100644 index 000000000..12b57cafe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAGAATCTAGGCACGAAACTACCCTAGGGCTGAGCGACCCTCCTGCTAGCACAAACAGGGGAGGCTTGCTATAAAAACGTGAACGCTCTCCCGGCACTGGCGCCAGTTTTCTTTTTGGCCGCCCGAAAATATACTAAGACCGATGGGATACCACCTTGGATAAGGCGCACGGAATCACTCGCACACCTGTCTAATAGGT")) +(assert (= z "uggacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 new file mode 100644 index 000000000..43710b751 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCACAATTCTTGCATGCATAGTTAACTGTTCCGTATTCTGTTGAGATGTTGCTTTGTGAACGCATGAACTAGCGAGTGCATACCGACAGGCCGTACACTATACAGACCGAATTAGAAATTGAGGCCTCCCCCCGGAGCGATTTTCAAGTATTCAGGGCCCGCATCTCGGGGGTGCCTCCGCTATAGACATATCCGTTCGT")) +(assert (= z "uggcuuaaucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 new file mode 100644 index 000000000..e980392c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGAGGTTCATGCAGCACAACGATAAATTCGAGCCCTTCTTTGCCTGGCGGTCATACCTCGGCTCGAGCAGACCATATGCACCTTGAGAGTTCCCATTGGTAACGAAAAAAGACAAGTGGATTGAGAGACAGAGACGGTACTACTAAGAACTATGTACGAGTTGAAATATCGACTACCGAGTTATCGTTTCCTCGGGTACG")) +(assert (= z "uugcuuuuuuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 new file mode 100644 index 000000000..da19c217f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAAAATGTCCTTCATAGTAACGATATCCGGAGTAGCGGCTAGACGGCGCTATCTCAAGAACTAAGTCACTACGTGCGACGATGTAGAATGACTACGAACCAATTCTCATCGGTATGCACTCCGTCTCTTTTAGTTCTGCTAGTACGTTCGAGATGCCTCATGATGCCAGAGTGTCACACGAATAGTACTGAGACCAGGT")) +(assert (= z "cuacggaguacuacggucuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 new file mode 100644 index 000000000..15e296768 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTGTCCTCTAGACCTGGTTATCTCCATAGCTTAATTCCTGTTACCCTCGCCTCCCCTGAGTCTTTAGGGAGCTTGCATAGAATTCTAAGTCAACGGGTCGCACTGGCAAGCCGGTTCTTCCCTAGTCCTATTTCATGTGTAAAGATTGTCTATAGCAAGTCAGTTTTCTGTAGAATGCTATCCTTTGTCGTCTCAGCG")) +(assert (= z "cuuacga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 new file mode 100644 index 000000000..58671068f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGTAACCCGTGCCTATACCTAATGGAGCCTGGTATTCGAACGGCTTCGTACCATGGCAATGTATACCGCGTTTTTAGAAGGACTGTCTTTCCGGGCGAGGTAAGGTATGCATTCGCTAAGTGCTCGGTAGGATAGAAGGCTGTCAGGTACGATACATTTTCTACTATGCCCCTGCTTTGGGTTCGCCCCCAAGTGAGCG")) +(assert (= z "aaaucuuccugac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 new file mode 100644 index 000000000..e66ddd8d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCATATTAATACTTCATGGGCTGTTACTACCTATTACCTCCCCTAAGTGCCCTTACGTGCGCGGTCTTCTCTCCGTAGAAAAGCAGTTATAGATTCGCGGGAAGTCTCGCCCAGCAAACTATTACTCTTCCTTTGTCTTATGGCTGACGAAATCCCCCGTCCGTGGTAGAGACTTCAACCGCTTTGGGACCCATCGTGA")) +(assert (= z "auaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 new file mode 100644 index 000000000..4bd468c68 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTTTGTAGATGAATGTAACTGGTATAGGATCTCAGCTTGCCCCCAGGAGGTTCTATGACTATTAAGTTATCCTCGACAGCGCTCGTTAGTTTGCCAGAGTTTGTGGGCACTTTAGGAAAAAGGTCAAGACGTGCAGACTGTATTAGTAGGATAAGAAGCTGTATAATCACCAACGTTACAAGGATTTAGGAGATAGAT")) +(assert (= z "ccgugaaauccuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 new file mode 100644 index 000000000..cd92e9d4e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGATTAATTATTAGACAGTAATATTGATCCGTGGGCACAGAAATACGCACGTTTAAACCGTGAGCTTCAGGGGTATCCCCAAATTGGGCCCGCCCTGAAACGGCTCGATCAGGGCAATGCTTGACCGCACAGCTAAGAAGCTAATGGAGCTCTTCGGCCAGACGCTATGAACCGAAGCCTACTGAGCGGAACCCGTAGA")) +(assert (= z "ucccguua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 new file mode 100644 index 000000000..008e9a0dd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAATCTGTACGGCGACTTTATTTAGACCGGACACTAGTAACACTCCCTTACCGTTGATACCCATCAAACGGGGTATGCGCAGTGGTTACAAAACTCATTGTAACACGACTAAGAGCCCCGACCCACAATTTACGTCATAATTACCACAACGCCTTCTACTTAAAACAGTCGAATGACCTAGCGAGGTCGTCAGAACCTGC")) +(assert (= z "aauguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 new file mode 100644 index 000000000..fd807599a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGCGAGACGGCGGGTTTGTGCATAGTCACTGATTTATAGGTCAGCAGAGCCGGCCAAAGATGGTGCACCTATTCCCCCGATTTAACAACCGATATGATTTTCCTCATGAAGTGTGTTCGCATCCGTTTTGAAATATCAGCGCGGCGCCTTATAACAGCGCGTAGTCTAATGCCAACGAGAACGAGTACTGGGAGCAGC")) +(assert (= z "gcucaugacccucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 new file mode 100644 index 000000000..17a63618a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCCAATGTTCGCCTAGCACACCATACCATTCCTTTTGAGACTTTAGCAGCTCGCAGGTGAAGGAGGTTTTTATACGGCCAGTTTTCCGGTATAGAGCAAACCCATAAGACCTTCTATGCATTGAATGGCGTCTTATTATGAGGAGAGTCGACTGTCCCCCGTAATGGTTTGCTCTGACGTATTCGTATGATGCCTCCA")) +(assert (= z "aaaacuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 new file mode 100644 index 000000000..181a3f9e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTACTCTCTTTTACCAATGCCCACGCCGCCCGTGGTGCCAAACTAATCCGAATCCCCCTAGCGACCGGTGGGGTTCTCAAATTAGTTTTTACCGCATGCGCGAGTATCAATTGCTATATTGTACCACGTAAAAAGGATAGTTTCCAACAGGCAATGCGCTGATTGGACCCATGCGCTGGGCCAATGTTTCTTGCCTAC")) +(assert (= z "aaaugguuacgggugcggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 new file mode 100644 index 000000000..93cec9234 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTAGTGACTGTCGTGAAGCCTGCTAAGAACCGGGTAACCTACCGAACGAACGGGCACATTGCCGACTGTCTCTTAGTCAGAGGGTCCGAAAGAGATCAGCTACCGCGTCCGTCGCGCACTGGCCGGCGAACCTCACGAGTGGTCAGCTAGCGTGCAAGCCGTCATAAAATCCGTGCTAGAGACGTGTCACACATAAGCAG")) +(assert (= z "gcccauuggauggcuugcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 new file mode 100644 index 000000000..b742f8b6b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATGCACTCCTAGGCCGCATCCATCGCATACGAGCCGTCATTAGGTAGAAACTAAGAGCGCGCACCTTACAGCGGCACAATCCGCATAATTGCAGTACGGGAACCGAGTTAGTAAACTTAGCCCCCCTACGTACGGCGTCCATGCACAACCACAAGAATACTACATATAATGTGCTCTGTTGTTGCCAGGGCCTATGA")) +(assert (= z "ugaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 new file mode 100644 index 000000000..305da28f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGAAGATTTGCTCTTGTTTTACGGTGGCTCAAACTCGCACAGGATAATCGAACGATCTTACGCTGTAGATCTCATTATGCTGATCAAGTTATCAAATCGTTTGAAGTTTGAATTGTGTGTTAGGTTAATAAGGAGCGAAGTCGGACCTTCGTCCGCAGGTTTTATTTGTCTGATCCCCTGAATAAGGTACCCGTCTAAG")) +(assert (= z "uauuagcuugcuagaaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 new file mode 100644 index 000000000..5a7690d38 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTAGCAGAGACAGTGTAAGCTCTCATGGTACATGTCCACTATTGGGTGAGTCCTTCTACCCGTACGAATGAAGGTAAGTAGAATGTACGGTAAACGGATGACGGGGCGGTCGAACTAAAACTGGAGGACATTAGATCCACCAGTAAATAACAACGCGGCTATTCTAAAGGACTAAAGGGTCATTCACCACCTTGCTCGG")) +(assert (= z "cauuuauuguugcgccga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 new file mode 100644 index 000000000..a20a33358 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTCACCTAACTCACATTGTGGTCACAACCTACTTAAATATCAGACGACCGATCGAATACAGCTGTGTACTTATAACCTGCCTTCTCCTACTGGCGATACCCACCCCATGTAGTCACTGGCCGTTCAGTTGCACGGAACTGGCAAACCTCACACGCTCTCCGACATGAACGGCTAGATCTTATCAAGCGCTCACTATCT")) +(assert (= z "gugggguaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 new file mode 100644 index 000000000..313507e6f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGTTTGTCAGCGCGCTTAATAAAACCTCGACCCTAGAGCTATGACTATTGATTAACCTACGGGATTACCATCATTTGTTCTTATACCCCTATATTAGAAATATTGTGCGCAGGCCTATACGAACGAATTGGAAAAATATATCGTCTGTCCGGACCTGGACAAGTCAAGGACCGAAAGGGTTCTTAGAATCGCGGCACCA")) +(assert (= z "uuugga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 new file mode 100644 index 000000000..b4292d609 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATACTTTCCCCGGTCATTCCGGTAGTCTAAAGGAACAAGGTGTGTCACCACCTCTGGGTGACTCGCGCGTTGGACATCACGCCAAGTGCATCAATTTGCCCCAAGCCGTTTGCATTAGTTTTCTTCATGACTAAGATGTTTGCCGCAAACCAGTAACTAATGCGCTTCCACGCTGTGGTTACCATCGCGCTGCCAGG")) +(assert (= z "auuuccuuguuccacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 new file mode 100644 index 000000000..546b719e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCTTACTGAGTTCAACCTGGGATGCGGACAGGTGCGAAATTACTTAACACAACCTAAGCAAAAACCCAAAAGAGACCAGATAAAAGGTAGATTTGCATAACCTTCTACATTGCCGCCTGAAGTTGGCAAAATAAAATACCCTATTTTTGAGAAAAGTCAACGATCACTACATTCTTGCAAGGGCGTACATCAAACTGG")) +(assert (= z "uuuuauggga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 new file mode 100644 index 000000000..99703a09a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCTTTCACTGAACACAGATCGAAGATTTTAAGTGAGCGTATCGACAGAATGTCACTGCACTTCAAAGTTGGGGAGCCGAGCGCTAGTTCGATTTTGGCACGAGTCGTCCGCTCTTTTCACGGACTGTTGGCTCCCCACAACTGCTCTACGCTGTCAACCGTGCGAATAATAGTGCAAATTGTCCACATGCCTTGAACTC")) +(assert (= z "cccuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 new file mode 100644 index 000000000..32d724cbc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGAGTTGGGAATTTTAGGCTTCCCTGAGCTGCTCGAGTCACTAGTGGGATTTTTTCGCAGAAATATTACGGCAACAAATGCGATGGCGGGTCACTGGTATATTCACCCGACCCTTAAAAGATTGCCGAGCAGGTCTTGTGGTAGATCTGTCTGGAGGGCGGAATTACGAGCATGCGACCCTTGTAACTCTCGTTCTTAGT")) +(assert (= z "uuucuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 new file mode 100644 index 000000000..d961f1657 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCCCGTGCGTCCGGCTTCTCCCCATGCTGAAGTATGGTATTTGGTAAGCAGCATAACCGGGTTGAGTCAAACATCTTAAACTATTCAACTCTCCAGCTACTTTAGTATTTGTGTCTTCCGTATCTTTTTCCCTTGCCATTTCTCAACAGGAAAGCACCTCGGGATACCCCTGTCCCGATATAAACACAGAATGGAAATG")) +(assert (= z "cguauuggcccaacucag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 new file mode 100644 index 000000000..daf7e9d30 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACATCCCTCTGCTAGTCCATCATAGGTCGTTCTGGTTGCTCTAAGGCATATCTGCTCTCCCTCTTCCCAAAACCATCCGAAATATCAGGCTACGTGATGGGCTACCAAATAGCAGTCTTTTACTGAGAGAGACGATGTGTGATATAACCACGGAATAACTCACGCCTCTTGTGTCGATGGACACATTTCTCTAAAACAG")) +(assert (= z "aaugacucucucugcuaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 new file mode 100644 index 000000000..d4e62d396 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTATCTGTGTGATCACCAGCACACTCGAGTCTAAGAGATCTGGTAAATACCAGCGGTAGGTCAATCATGAGATGGCGCTCACACCAGAACCGGTTTTGGACAGCGACAACAGGCGCTCCCCTAATTGATGTTATACCCGAAACAAGACCATGGCTTTAAGTAATCGTAATGTCCGAACACGGAGGAGGTTTGGTTAGTGC")) +(assert (= z "cuagaccauuuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 new file mode 100644 index 000000000..d835fb88e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCTGCCGGTAAAAAGTTGTGTGGGTCAGCAGTTTATTCGTGTACTATTCAAGGACAGTGACTCAGTGTCCTGTGATAGTTGCACCCGATAAGATCCATCTGCGATCGTGTTTCAACCTGTAACAGGACTACCCCGAGTTCCGTGTAGGCCTCTAGTAATTCAACCAACGGTGCATCCCTCAGCCGATGTCAGGAGAGA")) +(assert (= z "uuggacauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 new file mode 100644 index 000000000..95e7c20a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTATGTTCCTAAAGAGACGACGATTGCCGAACGACTTTGAAAACACTGACTTTAACCGACTGGCCGCAATGTAGAGACCATTATGAGGATCACGTACCTATATGAGGCAGAACATTTACGCTATCGCTTCCATGGCGTTTGTGATATGGTTTTAGCTTAGTCATAAATGCACGCGAGCGATGAGCAGAGCTGTAAGGTG")) +(assert (= z "cgucucgacau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 new file mode 100644 index 000000000..7c403d9b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCGTCGCGTTGCTAGAGTAACTTGAACGTAGCTCAGGAAGGTAAGGGACGAGTGTCGTCTTCGCCCGTGCTTGCATCTTTCCGGCTGTGGCCTCTAAAATCTTTGTCACAAGCTTTGCGTCTTTTTTCTGGATCAGCAAATAACCAGTTCCTCACGTAGCAGCTTCCGGTTAGTAATTATTACTATGGTTTGGCAGAAT")) +(assert (= z "ggccgacaccgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 new file mode 100644 index 000000000..e922a55ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGATTTAGTCTCTGCCATTCTACGGAGAACTAGGCGTGGGGGATAGTGTAATAGCGCCGATTCGGGGAGTCGGCTAACGGGAGCTGAGGGTGAAGACGGTCGCAAGTTCAATGGTCAGTTTATCACTGGTCTTAGGCGTCGATACTACGTACTTCAGAATGAGGTGGTATTATTTTACTAGAAGCCTCTAGGTAGCGGAG")) +(assert (= z "cugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 new file mode 100644 index 000000000..d9becf05b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCACGCGCTGGAACTAACGCCACGATCTTATCGGACAAGTTTGAAGACAAGTCAGGCGCGTTCGTCACGCATACATCGAGTGCCGGCACCGTGCCCTAGGGCGCAACACCGCAATTCGTTGGGTGGGAAGCTGACTACTCACACGGGATTGGGGCGGATTACCACCACTCCAAACTGCCTATTTGTGTCGAATGCGCAT")) +(assert (= z "accuugauugcggug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 new file mode 100644 index 000000000..31d59ffc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGCGGGCAGTGACGGGCATCACTCGAGCTAAAAGATACGGAGTAAGGGTGGATAGGGTTCTCAGTCACGTTCCCTCAACCTACATCCGGGATGTTGATCATCGAAATAGGCACCTAAGAACGCGGGAGGGATGCCGTTTGATATTCGGATGAGCCTTGTGGCGGGTCAACATACAGGGGGGTGTACGGCATTTTCACC")) +(assert (= z "uacaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 new file mode 100644 index 000000000..5e6afbaf4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCAAATACGGATCATCCCTTTACTAAGTCCCGGATGGTGGACCCGGGATACAGCAATCAAAGGGGTTCATATAACAGGGCGGCTCTATCGTATTGAGGAAATCCCATTACTGGATGTCTACTCTCGAGCGATGAGTCAGACTGTTTAGGCGGATGCCCACCGCGCGGAAGACAATTAACAAACGGGTATTGTGCGATCAG")) +(assert (= z "cgcuaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 new file mode 100644 index 000000000..3a94e0139 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCGCTTTCCGCCGATTCTGGGTAGTTAGGGCTAAGCTCACTGGTACCACCCTTAGGGTATGCGTCACTTGTGCACACGTATGTTATCAACATACTTCGCATATAGTTCTTGAACCATTACTGCACAAATATTACAAGGTGGTGGTCTTGGAGATTAAACGCCCGGCACTCAATGCACGCAGGCGATTCTAACTCAAGGT")) +(assert (= z "auucgagugaccauggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 new file mode 100644 index 000000000..91abdc2ac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTGTTCCTTGCGCCACAACAGCGCCTGATTATCTGGGCTATCAGCAATTTTATAAGGTGTCAAACGGGCTACATCCGGGGCGGACGTAGCCTAATGGGCGCCTGTCTCGCTCGAGAAGGCACGACATAATCCCCTCATCTGCAGCCAAGGCAATGATAAACGCTCGTCTGACTTGGTCAGGGAACAAGAGCTGAAGAT")) +(assert (= z "uccacaguuugcccgaugua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 new file mode 100644 index 000000000..9a08383a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCAGTACCGGTTTTGAGCCTGTAGGATTGTGGGGTCACCTACGACCGCACCCACCCAGTTCGACGATTCCTTCGCCAGGGCCTCGATCCCACTACCCATCAGGCGCGACAATCTTTTAGAGCACATTAAACTGCCCAGGGCTCCCATCGTCGTCCAGCGATTGCCCGAGTAAAAGGGCACTGCGAATGTCAAGATGTCT")) +(assert (= z "gugacgcuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 new file mode 100644 index 000000000..c064a03a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTAGCCTTCTGCGTGAGGTCACACATCCGCGGGGTGCTCGGCCACGGAGCCCCCGCCTCCGGGAGAACCCCGGTTTCCGCGTGACAAAGCCGGATAGTGTTTAGGTGGCTGACCCTAATTAGTCCTCAACAACAACTCGGTCGGAGTATACTACCCCGAAGTAAGTTTATCTGTTAGACTGTTAGCAGACGATATTCA")) +(assert (= z "gacugggauuaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 new file mode 100644 index 000000000..e514205fc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCTGTGTTACCGGCTTCGCACTACACATCAAACAAGGATGTTTATGTGACTTTTGATCGCTACTATGCAACACTCTCTCTCTCGCGCGTTCCTACCACAAAGCGTCTGATTCATACCGTCCATCGTAGGAATCGGTTGTCTCCCTGACCCAACACAGGGTACCAGGCAAAGTTCTTCCTTCCGACTATAACCGGCTCT")) +(assert (= z "ugauauuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 new file mode 100644 index 000000000..b00bf0363 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGCTGACCTATTAGCTTTTTCAGGATCTAACAAACTCGATCCGTCCGGGATCAATTGGACTCGGCAAGTCCATGCCTCGTACTGCGACACGCCAATAACCAAGCACTAACAGGATCACCTTGGGAGCGCATTACGGTCTGTAGGTTGTATCACATGCCAGTTACCTTTCGATTGACCAATCCCTATCGGGTTTTTCGT")) +(assert (= z "auuguuugagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 new file mode 100644 index 000000000..7002a5f95 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTTGAGGTAGCCTGGATCGAGGAGGATTGGTGCAGTGTGCTATTGTTTTTCATTTCCCAGCGCAGCGGACCTTGCCGAATACTCAAGCACGGGTACCACATGGGCATGGGGGGGTTAAGACTACTAGCGCTAGTACCTCGAGGAGGTGTACCCGGGCTTCATAAAATTAGAGAAACTATTTTGGAGGTCACTTCCATTA")) +(assert (= z "cccccaauucuga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 new file mode 100644 index 000000000..a8aa09ebc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTGTGTAACAAACACAATTATGGCTACCTTCCTGTCGTTCTCGTCTAGAGAGGAGCTTATGTGTCCATAGCGCTCCAAGATCTACCTAATGCTCGTTAGCTACAGGAGAGCTGATGGCGGCCTTCTTATTGATCCAATACGATAATCATAAGCGAATAAGTACAAGTTACATGGATTACGGTAAATAGTAAGGATCCG")) +(assert (= z "uacacaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 new file mode 100644 index 000000000..994a9da0f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGGTAGCCTAGGCGTGCCATGGCATGGATGCTGGCGATACATCGTTTCTGCGCCGCGGGGGGAAAGGGGAGTCCTAGCTTAACTTGCGGACTATCCACGACCCAGGTCACCAGTTTCCACACCGGACAGCGCTATCACTGGCTAAAACGCCGCTTAATTATCTCTGGGCAGAAGAGATTCCAGGGTAAGTCGTAATAA")) +(assert (= z "cccauucagcauua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 new file mode 100644 index 000000000..f236a8303 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCTTTTGATGTGTTTAAGTTAACTAATTGGCATCGTGGCATCGCGTTAAGAAAATTGTCCAACTCTATTGAGTGTCTCTATGAGAAAAGATGAATTCTACAATTCTCTAGGAGGTCGCCCTAAGAGCCAAAATAGTGCGGTTGAAGTTCCGCATTCTCTATGCCTGTCTACGAAGAAAAGGGTTGCTGGAAGTAAGCA")) +(assert (= z "gcaauucuuuuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 new file mode 100644 index 000000000..49f1fb200 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCGGCTGCGCGTTGTTTAAAGTCTAAATAAAGACGCGGTTCGAAGAAGAGTTCGCAACGATTGCAGTAACGATGAGATGCTCCTAACTGCCCCACGATATACGGTGTACATAGAAGTCGAATATCTTCCAGAGTTTCCCCGCTGAAAATACACCTCAGGGGCCTCGAGCTGGGCATCCAGTGCGATGGCCTGGACACC")) +(assert (= z "cgcuaccggaccug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 new file mode 100644 index 000000000..762dfdfe6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGATGTGCGGGCCTGTGTATGTCACTAATGGCAGTCTATGAGACATATTTGTTATGGTAAGTATGCTCACCTAGCCATAAGTCGGCACCTCCGCGGGGTTCGAAATACTGCGTGGGCCTACAAATCTAGTTGACTAATAACTAATTGGGACCAGCCTGCGAGATAAGATTACGGACTCTTAATCGGTCTTGAGGAGCCAT")) +(assert (= z "acgcccggacacauacagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 new file mode 100644 index 000000000..e01ba9566 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGAGGTGCCCACCCCAACCCTCATTCCAGCCATATTACAGCGACCTGGCCGCAACGGTGGCGACAGTCTCAACAGCCGGGCTGGGCGCGGCCTTGGCTAAGCTTTTTCTGTCGGTTTTAACTCGAAAGGGGCCGGCCTATGGAGTCTGGAGCTGGAGAATACCCCGTTAGCCGGCCAAATCAGCTTTAAAAATATCTGAG")) +(assert (= z "cacgggugggguugggagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 new file mode 100644 index 000000000..c5fcbe6f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTTGGCCAGTGACGTATCATTGGTAACCCCATTGGGAGCCCAAGTCAGAAATCGCTGCCACAGCTGTTGGTTCGGCGGCTTAACGCTACCCGCTCCCGGCTTGCTAATTATTTGAGGTGTTGGTAACTTTATCTGCTGACGGCCGCCCATAGGGACCGCGGTATGCGCTTCAAGGTCGAAGCGGCCTTTACTCTATAA")) +(assert (= z "gucacugcaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 new file mode 100644 index 000000000..31ad09474 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCGGTCCCACTTGGCCTCAAAACGCACGGCATGAAATGTCAATACGAGATTGGACGCCTGGGTTACCGACGAACTTTGGGGTTATGCGTCGCCATGGTTAAGTTCCAGTTTTGTCCCAAGGTGAATTATTCATTCACGGGTGAGACTTCTCAATGCTTCCCACGTACTTTATCGTCTTTAGGGTGGTATGCTGTTAAAG")) +(assert (= z "ccacuuaauaaguaagug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 new file mode 100644 index 000000000..9c39e98f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGGGGCTTATTGTTTGCCAGCACTTAATGGTCGGCTGCTCGGTCGTCTACAGCTTTGACGGATAATTGAATGTGTAGATCAAAGCCTCCGCCGGAAGTAGAGACTCATAGTCAGGGGTATAGCGCATTTCGGACTTCACAAACTATTGGGTTAGTAACGGAGGTATAACCTCTTATATGTCACCGGTCGACTCTCTAA")) +(assert (= z "ucugaguauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 new file mode 100644 index 000000000..6466f3e1b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCAACCCTATCTACTTATTCAGCTAAATCTTTCTAACATGGAAGAGGTCGATCATGTACCATATGTCAGATTGAAAGCGCAACCACGCCGGTTCAAGGGTAAGGAAATACGATCACTGTGCGGGGTCGATATTTGAGCCCGACAAAATGTCGGGTCAGCTCCCGTCTAGTCACGAATCGCCTAGGAGCAAGGCAAGCTC")) +(assert (= z "uagaugaauaagucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 new file mode 100644 index 000000000..c59704888 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATCCATAATGAGCCTTAGGTATTTCGGTACTTCAAGGTGCGAACCATTAACGGCGGAAATAAATTAGAACTTCATTGTCATCCCGCCAGATAGTCAGTAGTCAACGACCTCGACGCGCGATCCCCATGAAGGGACGCAGGGGCGCCTACTGATTAACATTGAATTCAATGATTATCCAGAGGGAGCCGGTCCGAAGCCC")) +(assert (= z "gucucccucggccaggcuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 new file mode 100644 index 000000000..bfd1edcfc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCAAGGACCATCCAGCTATCGCTCTCACACGCTCATAGTCGACCATCTCCTCGTAAAGGCCCGGTATATTTGCTACGCTCCCCCGTGCGCCTGCTATTGAATAGGTAACCGGCCACGATCAGCATAATGCCTTAAGTAATAGATTACAAGCACCGTGGGGTACATTCAACACCGAGCGCAAGACGTTGTATCGAGACGTT")) +(assert (= z "uaaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 new file mode 100644 index 000000000..756cd3933 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTAGCACGTGTCAGCAATAGGCAATATGGTACTTTACCGACAGATTCTAGAGGCAACCGGTAACCCTATTATGTTGGTATAGTGCTCTATTCGGTTTAGTAACGCGCGTAGCTACCGTCCCCAAAGCGATATAACTACGCCACAACTTCGACCGACACGCATCGAGAAACCAGCGTTAGCCCCGCAGCTTGTGGAATGT")) +(assert (= z "aagccaaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 new file mode 100644 index 000000000..f6748dc09 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTACCTGTATTACTGATGTTATAGTTGTGTATGCGTCGGGCGGGTCCTCCGCGCTCCCCTGGGCCATACCAATGAGCAGATACAAAGGCTTTACTACGAAAAATGCAGACCTTAACGAGTAGGTCGGCAGTATCATTGCTTTAAAAAACTTACAGCTAGACAATCAGGATCGCTGTCACCGCTTTGAACTGGCCTGGACC")) +(assert (= z "uggcgaaacuugac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 new file mode 100644 index 000000000..cde30bb8e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCTAGGCCAAAGTTGCTCTACCCCATTCACTGTGAGTGCGTGGGTGGGTCTTATCATGCGAGTGTAATATCATGTCCTAATGTTAATCTGCTTAGCGATCGGGGCTGTAACAGGTCACCAACAATCGAACTAATATGGACATCCTGAGATTTGTTTGCTCGGACTCTCTCTTTGTTGACTCGAAGTTTGGGATTCATG")) +(assert (= z "aguacgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 new file mode 100644 index 000000000..979f1d555 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGCATTGGATATCAGTCGGCGTTCCCTCATTGTACAATACGGCGTCGGGACGACAGGTTGTCAGTTGAGACGAGGCTACGCGTTTTAGAGTCCATTAATATCAATAAGACACACTCGGATATCCTTGAGCGACCCCGTGCTTTGGGATTCTCCGCAATCAAGGGGCTTAGCGTTTCATAGTGGTCTGCTCGTTATCAG")) +(assert (= z "auagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 new file mode 100644 index 000000000..81091b54f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTTGTTCGCATACACAGATAGTTGAGCTGGGTTCGTCAAGGGATAGTCTTCTTACGTCCAACAGGGGCACATACTGCGCTTTCAGAGCCTTTGATGATTGTCCTGGTGATGGACGTGGAAACCAGTATCCTTCCTTCCAGCACTAATTAACACTGCCGCCCCGGCCCGCCTAGGTCGATGTCCCACCGGGATCGACGAC")) +(assert (= z "ccaagcaguucccuauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 new file mode 100644 index 000000000..6a846ec16 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCGACTGGCCCCAACCAAAAAATGCAGCTTAGTAGCTCCGGAAAAAACCGGCAGTCCTCCTAATACCTCCCCACATGCAGTGTGGGCCTATCTATAAGCCCACGGACACCGACACAAGACGATGTTGCGTAACGAGTGCATCCACTCCTCAGAGGTGTCGGCAACGGGGTCAGACTGTGTGTTCACTTCCTGATACGAG")) +(assert (= z "ggauagauauucgggugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 new file mode 100644 index 000000000..76092637a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCATTCGAGCGCAGATGCACGTGTGATCCAACATGTGTAGACCAGACGCGGGCGCCAATAATGTGCACTGGGCCATTAAGAGGGTAATTGCTCGTTCACACGAGCTTGCTCGTAGCATTAGTCATGTGGGCTTTGTTCGATCACTCATGTTTGCCTTCTTGATCCACAGCTGTACGAAGTTTATGATCCCTACAGCCGAC")) +(assert (= z "caaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 new file mode 100644 index 000000000..c66d0146e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCCTGCGAAAACGTCCACGAAACAAGCCAAACTGACATCGCAATAATCCTCGACTGTACGTCCAGGAGGAGTGACGCTCTGTGCGTCCGAGAGAGTCTCAGAAAGACCTTCGTAACGTGAACAACATACCCGATCAATTGTAATAGATCCGGCCCTGTGGCGCTTCGCATCCCAGTTCACCTCTTGCTCGGGTGTACAA")) +(assert (= z "ggugcuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 new file mode 100644 index 000000000..74820e178 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCTATGACCAGCTTGTCCGCTTGTCCACCAGCCCCACACGCAAGCTACCCGTGAGTACTGCGAAGGATAAGAGAACAGGCGGGGGAGGTTGAAGTTACCATGCTGATAATTGTGATAGTGCCCATTCGAAATACATATCGCTAAGAGCACCACCAGCGACCGGGTTAAGTCCAGTTAGGTGCGAGCTATCCTGCGCCC")) +(assert (= z "uucgauggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 new file mode 100644 index 000000000..87539e0a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCTATCCGCACGGCAGCCCTCGAACTGGCCCAATACTATCTGGTCCCGCTTCCGTACCCACGTCCCTAAATCATACATCTAACATACCCTCAAGCTGAGCTCTACAATTGAAAAGGTGGCCTGCGATTATCCCTCTAAGTGGTCATAGGAAGGGTATTGATCTCCAAGGTCTGACCGTTTTGGATTTGCGCTCGGGCG")) +(assert (= z "cgugccgucggga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 new file mode 100644 index 000000000..fa8c5cfeb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATGTGCATGGATTCCTTACGTCAGCCAGCAACAACTACTAAGTGCTGCTGGTTTGTCATACGTATTAGTCATCGCAGAATGGTACAACCAGTAGTAAGCTGTGCGCTAATCTGCCGTCTGTCCAGACGGGGTGTTGCTACTTTGGGCTTTGGTTTCCAATTTACGTGTCCCGGCACTTGTTCCTGTGCCAGAGATTTCT")) +(assert (= z "augcagucggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 new file mode 100644 index 000000000..ff2c5bb7a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTTCTAAATCGGCTTCTGAGGTAGATCGTACCCCCATGTCATCACGTACGAGACGAGGTGAGTGACCGTCACAGTTGCGAAACCGTGCTTCTCAGCAGATTCAGTAGCATCCGTCACATTCCTAGTACGGTTCATTGGCTGAGCGCGGCCGTCATGCCAAGACTGGCTCAGATGCAACGTAGTAATGAATAATGTAACC")) +(assert (= z "ucgucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 new file mode 100644 index 000000000..051a12af6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCAATATCGTTCGGGCTACGGAAATTTGGTGCCAAGCCGTACGACCGCCAGCCTTGCGATAGCGTCGGCGCGCACCGCGGTACGGCCGTATGGGTATACCTTGAGTACGTCCTGCCGGGCGGCATAGAAGGCACTGTTACACCACCATAAACAGGAGCCTTATATAGAATCAAGGTAGGTACATTTCTAGCGAATTGGT")) +(assert (= z "ccauccaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 new file mode 100644 index 000000000..914deef8a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGGTGATGCCAGGTGGACTGAGTGACGGGACCTGGGTCACAATACCAGAGGCCTGTCCGAATGCGCGAAGGACAAGGTTTAATCTTATCAATTCTACGTCTACCTGTTCTCGTGCTCCCATCCGACATCCTTGCATTAGTCCGCGTATTAAGGCGCCATACGCTACAACACGCCAGTGCGGATTGGGTAGTAATTTCG")) +(assert (= z "guuauggucuccggacaggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 new file mode 100644 index 000000000..45eb9e50e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTCCGGTTTTGGGACTGAGCCGTCCCTCGCTTAAATATGCTTTTGAGAAACAGATCTTCGTTGAGTCGAACGCACGCAGGAGCAAAGGAACCGCCCTTGCTCTAGGTACGCGTAATTGGCCAGAGCGACCCCCTTTAACCACGGCTGCTATGTCAAGGTCTAAATAGCTGCGGCCCGCAGGGTGTCAGCCTCCCGTCA")) +(assert (= z "gucuagaagcaacuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 new file mode 100644 index 000000000..4986bcb41 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGACACCGTAGTAAATTCTACGCGTCTAGGAGTGGCTTTACGAACAAGGGGAAGACCTTCAGATCTTCACAAACGATGAGTTGATGACGCCTCCGCTAATGATGCTAGCTGACGAGGCAACCTGCCTTTCACACAATTAAAGAACACATTCTTCCCGTCTTTTAAACCGGCGACGATCCTGTACGTAGTCAATGATTGA")) +(assert (= z "cggaaaguguguuaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 new file mode 100644 index 000000000..aad3a5172 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCATATGTCGTTAAAGCGGCATAAATAGAATCTGCACAGTGCACGTAACTCAGAGAGTGCTATCCCTGGCGGGGAAGAAGGGCCGTTGAGTAAGGAGTACAGAACGGCTCGATACGGACAGTCCTGCCCAGCAAGTGCTTTTACGAACAGACTCCAATAAAGATGCTTCATTAGTGTGTGCCATTTGACGTTTCCCGAA")) +(assert (= z "cgggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 new file mode 100644 index 000000000..1a73af903 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGGGACGTAGGCCCTCCCTCGGCACTTTAGCGAGCATGCTCAGGTCCCATTGGCCTACTAAGATAACACCTGGGTCCTCGGGTGACTCTTGTCGGTCTAACTTCAGCAGGTCGTGCGGCAGAGCGGAAATGATATAAATATTATACGTACCTGCTTGATAAGCAGACTTCCCCCACTTGCTAAGGCACGTACGCACCT")) +(assert (= z "acuauucgucugaagggggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 new file mode 100644 index 000000000..7834bde3a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCTTTGGCTGAAGTGCGGTATTGCGCGCCCAACTGCTCTGCTATAACATGCTTCGTCCGCCGGACGACTCCATTGAGACGAAAGGGCTAGACTGCGCTGCACACCAAGTGGGGTACACCCTGATCACGCGGTAAGATTTAAGAAGGGTGGTACGTACTGTGTATTACTCGAAGGTACAATCGTCACCATAGTTACCTCA")) +(assert (= z "uuagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 new file mode 100644 index 000000000..dda16b908 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTCCGTAAGTCTTTAGATCTGCTCGCTAATTTCGCAATAGCCAGAACACGCACTGGACGAGCTGTCATTAGCATGCATCGCTCAAGTGTTATGTTCTAGACGATTAGTCGGGGATCACCATTCCTCCTCGAGTAACCACTCCGAGCGGGCTAGGCGCTTAGATGACATTCGATCCACCGTTCCCCGGCCGTTATTAAGC")) +(assert (= z "ggcucgcccgauccgcgaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 new file mode 100644 index 000000000..55860dc24 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAAGGCGTGGTACCCGCGGGAACACGGCGTAATTGACTGAAAATGGCCCGGTTTTGGCCTTGTTAGTGCATGAATTCACGTGAACAATACTCGCGCAAGGATACCGAACTTGTCATACCGTAATAAAACAAGAAGGCCGCGCTGATGTTTTTCCTTGTTCTTGTAGTGTTCAATTTCATAGGAAGGAACCCGAGACTCG")) +(assert (= z "uggcauuauuuuguucuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 new file mode 100644 index 000000000..e5be8c2a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTAAAGTACGGTGCGTGGTATCATACTCCTGGGCATGTCCATTAGGACTGACGGCAAGCCACACGTCGCGCAGCCAATCAATTCCGTTTAAAATGAGCGCGACAACCACTTTCGCATACGGTCACGTCCAAGGATGTATGTGTTAAAACGTGTATGCTATAGAAAGCCTCGGACACTATCACGCTCTGCTTCGTGATTT")) +(assert (= z "cuaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 new file mode 100644 index 000000000..5cb472859 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTTCGATTTTGTGTACGCAGCCAGATGGACTTACTGAATGGGAAACCGGGGGCAGCAAGCGGCACTGTAAGGTTCTCTCGAGTGTGGGAGTAACGTGGACATAGGTTGTAGGGCACATCGAGAGACTTAATCGGGCCTTCGTTCTTATGTCTGCACGCTAGCGTATGTATAGAAATTCGTCTCCACTTTGCCTCTACCG")) +(assert (= z "cauugcaccugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 new file mode 100644 index 000000000..0f2352bf5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGGAGGGTAGTCGAGAGATTGGCATCAGGTACAAACGGTCTATCTCCGGCGAGCGCCACGACTGGTGTTTATATGCGACAGTTGGTATGTACACTAGACGCGTGACATCCGATTAGTTTACAACTACTATATGAGCCTCGATCGTCCTCCATATTTAGATTATAACTGTATACACGACCGTCCATTCCTTTCTCAACGC")) +(assert (= z "guugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 new file mode 100644 index 000000000..c5ad0410c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTTTTTCGATAGTTTACAAAAAAAACCCCCGTCGAAACTATGCGACTGGTCTTAGGTAGCGACGCTTAGACGAGAACTCGTCATCCCAGAAACGAGCTCTTCAATAGGGCAACATCTGACTCACCCAAGGATCTCGTAATACCAACCAGGTAATCCCGAGCCATTTGCCCACGATTAAGCGAAGTTCTTCCGTACATGT")) +(assert (= z "cuaucaaauguuuuuuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 new file mode 100644 index 000000000..b31e7cc8d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCGACAGCCGTTATGTTTAGGCATGCGTTGTAAGGGCCCCGGAGTACCCACTACACCCCAGAGGTTTACCTACGTTATGTTTCCATGAGATAAACCATGAAGCCGGGGGCTATAGTCGACCACGTGCTTGCTCCTGTCCGATGTGGGGGCCTCAGAGACAGCCGGAAGCTTTTTCGGATACTACCAACTGAAACCTCC")) +(assert (= z "cuuuggagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 new file mode 100644 index 000000000..af6623f05 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGATCAACACTCCCCAGACCCGTCAAGGTGCCTTCTTGCCGCAATGCTGAGCCTAAGAGGCGAGTAATCTTGATTTATTTCTCACTGGACAGCTAGGTCGCCCACACGCGTCAGACCAACTCTCTTCAAATCCTGGTCGCCGCTCTCCTAAGGCAACCCCCGGTGAGACTGAAGGTTCATGGTTTTCAGGTGTAAGCCTC")) +(assert (= z "cggcguuacgacuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 new file mode 100644 index 000000000..1e8bd79dc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGTGACCTCCTCGAAGGGGCATGAGAGGACACCATGGTTAAAGTTCGCTCTTCTGCCCCGCTTGTCACATCTGTGCCTTACGCCCATATACACAGGCTAAAGTCGCCCTAACGAATTATCCTTTTACGAAACAGAATCCGAGGGGCCGACTGGATATTTACCTCTCCAGATTTACCACGTATTGTCTGAGAAAAATGC")) +(assert (= z "caauuucaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 new file mode 100644 index 000000000..e47f0e342 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTATCAGTTGTATTGCATGGGCAGGCTCAGCCCTCGGTGCTAACCTGCCTCAGCACAGGGTGGACGACAGTCCGAACTGGCGCTGGGGTAGTGTCTTAGTGGTACAATGCCTCGAGAGCTAGCAACCAGTCTTGCCTGGCGCGTTCTCTTACGAGCTCGTTATATATTCCAGCCGCATAATTAATTTACCGGATGCACAC")) +(assert (= z "uggacggagucguguccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 new file mode 100644 index 000000000..b163a0830 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTATCTGTGAATCCCCCCGACCTGCATAAACCACCTACTCTGCCCCGCCAGCATGGACATCCCCACAAGCTTCGGTACGCTTTCACAATCTGAAGATTTATCGGCAACGACCGCATTGCAGTTAGAGGAACGCTGCGTGGCCCCTCAACATATTATGCAGACGGGGCTGGGGCGCCGCCATTAAATCCCCACTCACCA")) +(assert (= z "cgcggcgguaauuuagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 new file mode 100644 index 000000000..f68aa2eaa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGAAGAGCCGATGTTAATTTGTTACGCGTTCTTTGCTCGTCGCCCGCAACACGGTACCTGGGCGGACCAAGGGACGTCTCCCGGGATGTACTACCGGCATAGACGGCGGTCAAGCAGCCGATCCGGACTCTGGAAGACGTCGTTTTCTCGTTCAAAAACTGAAATTGTAGCTGTATGGCGATGTCAAGTCCGGACGCA")) +(assert (= z "ccgccugguucccugcagag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 new file mode 100644 index 000000000..c7198844d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCAGTTGGACTCATCACCTGATGCACTCTTACAGCGCGGAGCAGTGCTGATGCTGCGGAAGTGGTGTGATCTTAATTGATCGGGAGTGCTGTCGCAGTAGGTCGATAAACGCGACCCCCTCTTAGTTTGCCGTAAACCATCAAGACTGGGTGACCGATAGGCCGCCATAACCGTTGGTAGAGCTAAGGGGCGTCAGCCC")) +(assert (= z "ccacuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 new file mode 100644 index 000000000..a9e405167 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCCTACCAACCGAACATTTTGCTCTTTAACTACTATCGGAGATGCAAGCTGTGTTCGACGAGACTGACAGAATCCTTTCATACACACGGCAAAGGCTTTTCCTTAATCCTGACATGAATTTTACAAACTTCCTAATCAATACGTTTCACGTAGCCCGCGGCCCCTGGACGCTTGTTTGTGGTATCACGAGGGTGCAAT")) +(assert (= z "acgagaaauugauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 new file mode 100644 index 000000000..416dbbd12 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAAGGCCTCACCGTTCCTTCTTCCGGCGACTGTCGATGACAATGTTGTACACTGCCTGCAGGTTGTGGAGTTACGGGAGTGTGAAATGATGCGCGCTTCCTATGTGTTTGTCACCAGGACTATCAAGGTGCGTTAAGGTCTAGTCGATATTGTCACTTCTGTAAGTTTCATTAGACTTTGTTGAATTTGAATATCCGTC")) +(assert (= z "cacgcaauuccagau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 new file mode 100644 index 000000000..1b4fdb4f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCTTCGTGGCGTCCGGTACAAGCAACCTCTATACCTTGCATTGGCTTTGAGTTACATACGAATTTGTAATATTGGTGTCAAACTAGTAACTAGGACGCTAACAGTCCATACGGCTGTACGATGATAGCCTATGGGTTAAAACTCGGGGGGAGATGCTCTCGACACGTTCAAACTTTTGGAGCGCGTGACTCGACGATT")) +(assert (= z "uugucagguaugccgacau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 new file mode 100644 index 000000000..caf506fc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGAATCCGAAGCGTACATTTCATCAGCAATTTCAACACCTCAGCCCCTGGCGCCAAAGTGTCTTTTCCTGAGCCTGGCGGGACGGACTCGGTATTTTACATCTCGAGGCTTCATAGCTGTCAATCGGTACCACCGAAGAAACGCCTAACCTATGTTGTACCAACAACTTAGTCACAGTCCTGGGATGACGTCGCGCGATT")) +(assert (= z "gacccuacugca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 new file mode 100644 index 000000000..4bc5fe510 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTATGTACCCGAGGCCTTAGTTCATTTGGGCTCGCGCCCGGCGGACAACACACGAAGTCATGTTATTCGCATCAAGTACGTTGCTACCCGTATAGTTCCTCCGTCACCGCTAGGCAACGGAGATAGTGCCGGGAAGTCGACGGGACCTCCGGAGTGCACACCGCGCCAGAGCGGCGGATTCCTCATTAAGCGGTAAGC")) +(assert (= z "aaacccgagcgcgggccgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 new file mode 100644 index 000000000..76cd2c067 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAATTTGACAGTGAGCTCCGCAGGCAGCTTATTACGTGCAACCCGAAGCCATCTATCCGCAATTTACGCCATTATAACATCCCATTAGTACGCTCCAACTTGGTATCCCGGAGCTGGAGACGGTGGAAATTGACCCCAAAAATCGTTGATTAATTCTCATTCTAGCCGGCAAGAAGTAGTTTTTTATATGAGTGGTGTC")) +(assert (= z "uaagaguaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 new file mode 100644 index 000000000..edb892a9f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCTCTAACGAGCCTTACGCAAAGACCTGATCCCCAGCTTCGGGGCGCACTAGGACACTCCGATTGGCAAACCCCTATGGGCAATAGTTGCAAATCAGCCTCGGTTGCGTACGATTTCCTGTGCCGGGAAAGCTTAAGTTTTTGGCTTGTTGCCTAGATGTAATTGGGACCCATTCTAGTTCGTTAATCGTATTCTACG")) +(assert (= z "aaaccgaacaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 new file mode 100644 index 000000000..68388ce53 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCCTATCACGCTCTAGACGGCTTTAATGGGGGCGCTTCCTGTCAGAGCGTCTTGATGTATACATCCGTGGTTACGATTAGTAATGAATCGGGCACAAGTTGAGTGCGGTCCCTGCAGGCTATTTCCGTTGAGAAATCATAGAGCTTAGCGTAAGCAAAAGTCGGGAACCAGGATGCATGTGGGATTGTTGGAAGCCGCC")) +(assert (= z "agaucugccgaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 new file mode 100644 index 000000000..a6eb23ff9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTACATATCGCCAGTTACCACCACTGTCGAATTCGGACAGCATCACTTCCGAGACAAGTCGGGTGTGCTCGGGCGGTCGGAAACGTAAGGCCCAGGGCCGCACGCGGTAGAAAGAGCTGACCGTAAGTACGTAGTTACGTGAGCCTTACTCTACCTTCATGAAATACAACCCACTCTCATTACTGTAGTTCGCTAGTCGT")) +(assert (= z "gaaggcucuguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 new file mode 100644 index 000000000..fba77783e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGACGAAGGAACCTTAAGTATCGGAAGTGACGTCGTGGTCCAGGCACATTAGCTGACACACCTCGCCGGCATTCCAACTGTAGCCGCGAATATTGTACAGTACTGAACTATATCCATCTATGATAAGTCACCAATTGCGGAGACCCAACTGCGCTGCAAAATGTAACTGGGTGTAGGCGCATACAGTCGCCCTGGGAGGG")) +(assert (= z "ucgacugug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 new file mode 100644 index 000000000..a28d70765 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCAGTGAACGTTAGGTACTTGTGACTGTCGTCTATCCGGGGACCAGGCCAACTCATCTCAGTTTGGGGACTGCTAGGACCCTCCTTGACTGGATTCGTTTCCCAGCCGTTGCGGTGCGGGGGAGGCTGTCGCCCAGAAAGGGTGATGCCCAACGAGCGCTTCGAATTGTGTCGACTATTGGGTTCCTTACACGTTGTGGG")) +(assert (= z "gcucgcga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 new file mode 100644 index 000000000..d4ad6cb2e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACGCCGCTTTAACTAGTGAATATTTTCGTAGTCTCGAGTCAGACCCCCCCTTGCAAAGCGAATACGCCTAATTTGGGATACTTTACGCCCCTATAACTGACTGCGAGCGAGCCTTACGAACGCTCCAAGTCCGCCACCCGTAGTGTTCAGATATGGCCCCCCATACTACCTCATACCCTTGTCAGCACCATGTGGCCG")) +(assert (= z "ugaugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 new file mode 100644 index 000000000..0209140ff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATGTCTCAACGATTGCGCAGGGTGCCGTAGCCGGTGTTTTGTCAGTGGGATTAAACCTCGATCATGACAATCATAAGGCTAAACGGGTTTGCTAACCATTCTATATTATGGTGACTTTCCAACACATGCATTGGCTCTTTCGCAGGTCCGTGATATGAACTGGTGTATGACCGTATACCCGACTTGAATCTGCAAATCC")) +(assert (= z "uuggagcuag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 new file mode 100644 index 000000000..f6c0c67e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGATTAGACGCGCTTGCGGTGCGAGGCATAGGGCTGAGAGTGTACGGGGCGGTTTACTCGGATGATACTTTGGAGACCTCGATCTTAGGTATTCCCCTTTCCCGGCCGGCTTGTAAGCGCACCGCGCGATTGTGCCGAAATCACACACTCGGTATCGCGTAAGACTCTAGTCAACGCCCATCGCTGAGAGATTCATAGGT")) +(assert (= z "gccuacuaugaaaccucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 new file mode 100644 index 000000000..0bffa571e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAGTTCTCTTAAGTTAGCGGATTATTTTGCTGCAGGTGCGGGTTTGTCGGGTCATTCAGACTCCGCATCCGGTGTGTTATAGACTACGTAAGAGGCCAACTGTCAAGAGGGTAAGTGATAAAGTTCCTTTATTTACCTTCCGAACTGGGATGTCAATAGCAAAAACGCGCCATATGACCCATGGAGCACCCCTTCTAAT")) +(assert (= z "auaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 new file mode 100644 index 000000000..4763545a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTTGGTATCGTTCTGGGCGCCGAGAGGGTCAAACATGCGTTATGTAATGATATATACCAATATGGATTATTTCGCGGGTGTATCCAACAGTCGTTGGCGTCCTATCACGGTCTATTTGACTAACTGTCAGGAGTCAAGTCTTCTGACAAGCCGTCGAAGTGACCAAAATGCTCAGCACCTTCCTATAGACCGGAAGCT")) +(assert (= z "uaccuaauaaagcgccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 new file mode 100644 index 000000000..9083e7af4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTCGAGTCTGTCGATTGGTTCGCTCATACCAGTACGGAACTCGGTCCCAAGTATTAGACTGCCACAGCGGATCAAGCGGGCATTCGGGACCTGCCAGTTGGTTTGTCTCTGTATACGACAGATTGTAAGCTCGGCTACCATTAAACTGGCGATTAGACACGGGGTTTTGCCGTCTGCGAAGCCACTTTGGGATGGATA")) +(assert (= z "agccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 new file mode 100644 index 000000000..bd1a1d8be --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCGCTCCCTGACAACGTTGGAAAGTTCCTAGCGAACCAGATTCAGGCGCCGATGGAGAGTCTATGGCTACCCAACGGATTATATCCACATTTGTCGTATCACTAACATGCGATCCAATACGTTTAGGTCCCTGACGCTCACCACCTGATCTCTGAGGGCCCTGTGCGCACCAGCGTCCTCAATGGCCGCGTACCGTAC")) +(assert (= z "aucgcuuggucua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 new file mode 100644 index 000000000..dd752ace0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACTAGGTGACCTCGGGCTCATTCCATGCTGAAGTTCACAAAACCTGTTTGCATCGGAGAAACGCACGCGAGTGAACGCACGTCTTCTGCTGCCCATATTCTGGACGCAAGTTTCCAGATATCCTAATGACCTATGCCCAACACTTCAGCTCGCACTAAAACCAATTAGCGTTAAGCGCATAGTCGCTCAAGCTCATCTA")) +(assert (= z "guauaagaccugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 new file mode 100644 index 000000000..1364bc224 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACCGTAAGGCAATTCCTAGTTACAGCGAATTGGTCAATTATGACGTTGGCCCAACGCGAACCCGCGATAGGCGTGTTCGGCCGCTTCGCTGGATAGGGATCTCAGTCCTGGGCTTAAACGAGAAAGAAGACGTAGTCCGGGCGCCTTCCATTATAGAATCTCTTGAGGATAGAGTAGAGAAAGTTGTTTAATGGGAGAG")) +(assert (= z "gcccgcggaaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 new file mode 100644 index 000000000..d17126df0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTACGTTCTACCGAGAACTCCGGTACTGAGCAGGCTGAAGACGTCTTCCTCCGACTTATGCGGATACTTACTATCACCCGCTCACTCTGCCCTATTAGGCCCATTCGGTCCAAAGTAAGTGCTGGAGGATTCAAGTAACATCTGATTGCACTGTTTGATATTAGACTGGGCTGCCCTTATGTTTTGAAGAATTCCAACCT")) +(assert (= z "guaagccagguuuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 new file mode 100644 index 000000000..3cbb62c3b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTAATCCTTTATCTGCACAGCTAAGTCTACCACGTTGATGAGCAATGACGCATTACCACACGCCAGCAGACTATCCAATCCTGTGTTAATCAGGGGTATTTACCTGGGGAGCAACTGTTTACCAGGTGGCGGTGAGAATCCTGTACTCCGACATATGCAGGGCCCGTGGCGGCAGATCCGTAGACTTTTAAGAACTTCAG")) +(assert (= z "gucgauucagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 new file mode 100644 index 000000000..368ca5b30 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACGGCGGCACCGATCCTCCGAGGCCCAATACCTCCGCTCGATCTGGGATTCCATCACAGACAGAATTAAGGAGCAGGTCCCGTGGTGGCGGTGGTAAGATAGTGACCTGCAACACTGCAAACGATGGCTGTATGCTCCTATATAAGAACGTATTCGGGCAACATAACACTAGACAGCTGTATGGCCTCGCGAGTCCCGG")) +(assert (= z "cgcucagggcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 new file mode 100644 index 000000000..33f7b5578 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATATGGGCGGAAACCAGTTATCGGCCTTTAGAACGAACGCTGCTTTCGGCTTGCGACGTGTTACGTCGCGCCCGTCAGATGTTTTATAGCTGAAGTGCCGTTCCCAGCTTGGGACGGGCCACATCGTAAACCATGTCAGCTGTGTATCACCATCTAGAGAAGCTAACATAGAAAGCGTGACCACCTGCGGATCAAGTAC")) +(assert (= z "cgacgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 new file mode 100644 index 000000000..13502d90f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGATTAAAGCTGGATAAGGCCGTCCGTAGAGAGTATACCGTCCACACCGGAATAGTGTTTGAAATGGGCCTCCCGTGGTCTGTGAATGATTTGCTATATTTCTGACCAACTGACTTCAACGGCCCACGCATTCCCTTCCTGATGGGCGGCTTCCTATTGAATCCTCAGCGTGAGGAATTCCTGTTTCTATGCCTAGAC")) +(assert (= z "ggacuacccgccgaaggaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 new file mode 100644 index 000000000..34f5a5e18 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGCTCGCCGCCCCCGGGAATCTTTTTCAGGAAACCTAGGATCAGACGGACGAGGATATATAAAAGCGAGACGACATTACTGCATGATTTTGTGACCGCGTTGTGGTTTATATGTACGTGTCGACCGATCGCTGAGTACGCTCGGAGTTCTTAGACGTAGACTCTGTTATCGGTTTGCAGCGTTTTATCCAAGTGTCGC")) +(assert (= z "gcaucugagacaauagcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 new file mode 100644 index 000000000..16bdf8396 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGCTAGTAACCGGGGGACGTCAACCTCTGTACACTGACGTGGCTCAAAATAAGGTCGACTGCTCTGGGTCCCAGGTAGTAGGGCAAGTCTGAGTCATTCGGTTTATACAGGAGTCTGTAGACGGAGGATATATGATTCGGTTTCGCCAGCGGTGGGGAGAAACATCAGCGTCGTTCTGGAACCAAACGTGGTTTCCTCT")) +(assert (= z "augug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 new file mode 100644 index 000000000..6bec39848 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCAACACCGACGGTGGGTATTAAGTTGGGCTTAATGGTGCTTAGTTGGAATCCACTAACATATACCTTATGAAGTCTCCCGTTCACGCCTGATCAATAAGCTTCACGCAAAAGGCGACGAAATCCTTCTCCAAACGGCTTGTCTGAATAAGACCGTTAACGTGGCGAGCGGGACAAACCAAACGCAAGATAACGATCCTG")) +(assert (= z "gcaccgcucgcccugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 new file mode 100644 index 000000000..c32f763ae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACCAACCCAAGTGTAAAGTGTATGAAACGCTCTGGGCAGTCGGCTGCGTTTGAGCCGTTACTTATCGATCAACTTAATTATCGCCACTCCTTGGGGTTTTACCGGGTAGCGCACAAATGGGGGAAACGGTAGGAAGATTAGACAGTTGAGGGTTCTGTATATAGGGCGTCCTGTATAGGTCGAGACAAAGACAATTGAAG")) +(assert (= z "caucgcguguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 new file mode 100644 index 000000000..6759a7115 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATAGCGTTGCTTCACTCACGTTATCCCGGTGGCTCCCTCAATTGCGTTTACGATGGGGTGACTGGAACGTTCAGAGAAGGGAAGAAAGACACCTAATGCAAGAGGCCTTTCCGCCTGGAGCCTCGGTGTAGATGGCCCAGATTCTAGCCGACTCAGGATGGCCCTTGCGCTCCCCGTCGCACGTGGATCAGGCAACGAC")) +(assert (= z "gcaacgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 new file mode 100644 index 000000000..93001584f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGACGGTTCAGGGATTCGGGAGTCTCATTTTAAACGCTGGCGTTATAGTCTGGTATATCCGACTATTCATAGTTTGCCTGATAAGTTCAAGGCATCTTGCGAGCTTACCGGAAGATAGATGCTACTCTTGGATCAGTAAAGGGGCGCATACTACGATATGTAGTAAAGGATGTAACGCGTCGTCTGATGATCTATCATA")) +(assert (= z "acgaugagaaccuagucauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 new file mode 100644 index 000000000..81c559e25 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGAACATGAATCAAAAGGTAATTAGTCGGCTCTTCGAGTCACCAATTATCTCCGTTGCCCATTGAGCAATAAATTAATACGCCGGGTTGTGGACTCTAAAGGCACCATCTGATACAGCGTAACGGAGCGCATTCGAACGTCAAATGGGAATGTGGGTACCGCTCGGCTGGTCCATGTATGTCTAGCCGATCCCAGTATA")) +(assert (= z "auagaggcaacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 new file mode 100644 index 000000000..c50871e08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTAAAAGTGTTCCATGGAACGCGGGCATTGACGAGCGCCAGTCGCGAGCACTTATCCGAAACTTGAGTAAACCCTGGGATAACAGCCGTGCGAACTCTACCCTGATGCGTGCCCACTATGCCTCTTCAATTTATGCAGTTCCTAATTTACATTGGAAGTTGAGCTGCACGCGCCGAGGCCTTTTCGGAGCATATTGAAT")) +(assert (= z "ugcgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 new file mode 100644 index 000000000..1df1cfa06 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCTCGTTTGACAGCAGAGTAGAAAAATAGGAGGAAGCGCGGCCTCTGCACTCGATTTCTTTCCGGATGAGGAGCGCTTCGTCGAGCTGGTCTCGGCTACCGAGGTTGAGGGCAGTTTTGAGATAACAATCATGTCTCGCGGGTTAGCTTTCACATACTAATACGGATGCTTAGCAGTTTCCCGCATCGACGTTGTTAG")) +(assert (= z "ucgaaaguguaugauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 new file mode 100644 index 000000000..110568386 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTTCATTCATAGTGCTGGTGACTACGACTGTTGTGTGGGGGACTCTACAGGCTTAAAAAAAAGCGATGACATAAGATCATGAACCTCAGATAGCTGAGTCCACATATAGTGGTGTCACACAACTTGATTTCGAGCACGGCCCCACTTCTGACACCGCCGCACCACACATGTCTGCCATATACAACCACCAGCTTAAGAT")) +(assert (= z "cugagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 new file mode 100644 index 000000000..08da652f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTATGTCATCCTGCTAGCCGATTTACAACTAGGGCTTCGCGGTTGGGTGCCATAAGCATAAAATATTAGTGAACTGAAAGTCCATCAGTCATTAGTTCTTTATACCGACAGTCGCCTGTCGCACGGACGAGTACGACCGTAACAGATCCCACAACATTTACTTATGTAGTACGACTTCTGCGTGCCAGGGGACAACGTA")) +(assert (= z "ggcauugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 new file mode 100644 index 000000000..91e568e7e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGCGTGTTTGCGACATTGTCCGACTTAGCATCGGCTTAAACTTGGCCGGTTGATGTCGTAACCGCCCCCCCATCAACAGAGCCTTACGGAGCTTCGTAAGACATCCTGGCACACCCATGAACGACATGCGGGTCAAACAAAAAAAGGGCTTAAACAGCTCAGCGTTTCCGCCACGTTTTCGTGTTCACTACGACGTTT")) +(assert (= z "acagcauuggcgggggggua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 new file mode 100644 index 000000000..dc17cd32e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAACCTCTAGCACGGCGACTAGGGCTCCAGGGGGACATTGATCTCGATACGTAAGCGCCCGTTCGCTCTGGCAGGCTTCCTCATAGATTCCACGATCTGCTTTGCTCTAATACCGGGGAAACTTTCTTTAATTGCACAACGCCATTTTGACGACTGGATCAATACGGGGATAATAGTACTAAAGTCCGAGGAAAGTTTT")) +(assert (= z "gaccguccgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 new file mode 100644 index 000000000..e8f585e83 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCACTTCGCTTGAACCGGACAGCCGTCCGCTCCAATGATCTAGCAGTTGGAATCTCAAAGGCCAAAAGTTACTACCCACAGGTCGAAACTGTACAAACCTAGGTTTCCGCAATAACAGTCTAAGGTGAGGCATTCGGTGGCAATCACGCGATCTTGCAAATAATAGACCGATGCAAAAATCTGTGTACGACCTGTGGC")) +(assert (= z "agaucgucaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 new file mode 100644 index 000000000..4f9f35c60 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCGACTAACCGCGTAATAACAAAAGTTATATACGAGGACTTGCACACAACGGCTCCTAGAGGAAACTAATTTGCTTAGGAGGCTATGAAAGGACCCAGAAAGTCCAGAAAGTGCTTCCCATTCTAGCCGGATTACAACCTGGACCGGCTTTCAACGGCGGATGCTAAACACTGAGCACATCTTTCAACCTAGTGGGTGG")) +(assert (= z "uaugcuccugaacgugug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 new file mode 100644 index 000000000..f9d1f0dbd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCTCGTGCTCTCTCCCCCTAACCACGATCCGAACCCCTGGAGGGCGCTTCCTATGAACGTAGGAAGCGGGCTTTGCACAGGTTCGGTTGTGAGTAGGTGGGACCCCAGCCCGACACGAGTCCAATACGCCGTACCAGTATGTCGTGCTATACGTCGGCAAGCTTGAGAAGCTGCTCGTACAGGGTCCGCCGCATAGTA")) +(assert (= z "gggggauuggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 new file mode 100644 index 000000000..fcbfaafcc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAGTGGCGTGGCCCTATTCCTCACTAACATAGGTACTTGGCGGTGGCCGTCGGCTAATGGAAGCAGGAGCTCGAACGAAAGGTATTGACATCTGATGTAGACACGTAAGACCGGCCTACCCTCTCTAAACAATGGTCTGAGTGACCATCGGAACGTTATTGCTGCCAACTGTTCATCAGAAGCGAGAAGATGTCCATGG")) +(assert (= z "ggaugggagagauuuguua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 new file mode 100644 index 000000000..2c7eb115d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGCCAATGGATTGATGGAAGAAGCTTCTGTGAATGTGGTACCTCACTGTCTACGAGAATCTCTAAAATTTAATTTCCAGGGGAGTACTGGAGTTTATTGACTGGAGCAAAACATGCCTTGCTACGCTCGACTTGGGACCATTTATTTACCTAGTGTATGCTCCGGCAGGTACTCTCTGATTAGCTCCTAACGCATGGTT")) +(assert (= z "uggua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 new file mode 100644 index 000000000..a7a906354 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCGCATATATATCCGCATCCGCTATACCTGAATTTAGGTTCCGCGTCGGTGCGTACTTCTATACGTGTCTAAGCACTGCCCGCCGCTGGCTAATGGGAAGGCCCTTTCTGCCGTCGTATTAGGCGGTTGCCCGAGCTCTGACTGAGGATGCGTTCGCATAGCCGTGGCATCTGATTTCAAGCTAATCGCTTCATAACCC")) +(assert (= z "gacuuaaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 new file mode 100644 index 000000000..da5db3fe7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACTTAGGGGAGACAATCACGCTGACCTAATAACCGGTGGGGAATGTAACGCGTGTTACGGCCTGTAGTCAATCCAGGAACGCGAATACTTGTAGGTGTAAGCTAGATAGACGGCGCCTGGAATTTAAAGGTGCAGTAAACAGCTCAGAGCGTCTTCTGCTACCGGTTTCGCATGGTCACTATGACTCGTGTGTGAGCCC")) +(assert (= z "ugaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 new file mode 100644 index 000000000..2f23993a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGACCAACGAGCCGCGATCTTTTCACTTTAGGCCGCCCAAAGTTCAGGAGTCGCACGCAGGACAGTACCTGTTCGTAGCACGCAAAGGATTTACTTGTAACGTGCTGGATCAAGTGGTGGTACCGCTATTCAGTACACTCGGTTTAGCGGAGTGCGGACAAAGTTGGCCCCAGTGCCAGGGACTCTAGGCGATTAACG")) +(assert (= z "augugagccaaaucgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 new file mode 100644 index 000000000..528235144 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCGTTCTCCGACGAACTCTGAGAAGACCGAGAGGGTACTCTGCGGACCGGCGTTGTTTTGATGGACACAGGCCAAATTCGTAGGACGATCTACGGCGACCCAGGAGGTAATCAAAAACGACAAGGTTAGCCAACGCTCTACTCCAACACGCCTTTGCTCTAAGCGGCATTCCAGGATATTGTGCTTCTTTGTCTGAGG")) +(assert (= z "ggcucucccaugagacgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 new file mode 100644 index 000000000..4e32ad32c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAACGTCGTACGCGATGCTACATGTTCGGTGACTAAACTATCAGGGATTAATATGTAAAATTTGGGACATCAATAGGATGTTCCAAACGTTGTAGATAATACCTGTGCGGGCCGCTACATCTTGAACCGCTGATGTTGGCATGCGCAGTTTCACTTCATACAGTCTACGGGGTCTACTTACATGGCTCGCTTGGCGTGT")) +(assert (= z "cgcaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 new file mode 100644 index 000000000..0470d33c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTAACAAGTCTCGACTTGCACCCTTGTAAAGGTACATAACATTACGAAGATGCAAACGACGCCACAGAATCTAGTAGGTCAACGAGAGGAGAGCGCAAGACGGCGTAAACAGAGGATGGGCCAGTTGCTCGGTTACAAATAACAGTTAATCGACCTTGGTATTACTGGCAACGTCCCGTGGCGAATACATCGCTCTCC")) +(assert (= z "uguaaugcuucuacgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 new file mode 100644 index 000000000..5321eee2b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCGCAGCGGACCAGGCTGAGATATCTTATTTATCTACGGTCACAATACTTTGAAATAGGAAGACTACTCCCATTTTGATGATATTATTCCGCGCCCTTTCACCGACTATCTACGTCTGGCTCACCGGTTGACATCACACTAGTTCTTATCAGGCCTCCGTAATTGCCCTAGCCGTTCTGACACTGGTGTGTCACCGGC")) +(assert (= z "aggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 new file mode 100644 index 000000000..378727c5f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATTGGCCTTGGGCCAACGCACCTCCACTTCACAAGCTACCATGTATACTCACGAATCGAATTGTATCGCCCGGTCGAACCAACAATCCTGTGTCCGGGTTCCGTTTCACAGACCTCCCTGCCTCTTTCTGTAGTTAGTCACAGTCTGCGACTCGTGTTGGTCCCGATCCTCTATAACTAATGAGGCACAACACTCGACA")) +(assert (= z "gacaucaaucag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 new file mode 100644 index 000000000..c16d0dbfc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTGCAAATTGTGTAGTATGGGTATCGGATGGCCCTATGTAGGATTTCTTTTCCGTGAGTCTTTAAACGCTCCACAAATTGCCCTGGACTCCGGCAGTACCGTCCCCGACTACGCACCCGACTAGCGCGTGTCGGACCTAGTGTGGAGCGGACTGAGATATCGTAAACTCAGTGCGGAACGGCTACGCTAAGACGGGTC")) +(assert (= z "acguuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 new file mode 100644 index 000000000..8a1aaca39 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACCGAATTTTCCCATTGTCCACCTGTGTTAGCTCGGTCCAATTTGAAAAAAAGAGTTTCCAAACCTTGCGCCGCGTTCGAAACGCGCTTTGGTGTCTTCCTTGGATCGGCTCGTTACCTATATCATGTTCTTCTTGCCTGGCAAGTGCGGTATTACTTACGGATTGTTCAGGACGGTCTTTTCGCGAGAGAGCAGTCAG")) +(assert (= z "ugaaugccuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 new file mode 100644 index 000000000..64e3549f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGATTATCCTACTGCGCAGTTACGTTGTCAAGCGGGTGTATCTGAACGGATTCTCACCTCTACCATGGACGGGCATACGTCCTGTCCCTGTAGTGTGTGACAATAAGTGAATGAATATGCTTGGATCTACGGGAGTTCGACTATTAGCACAGGCGACGCGTTGTTGACACCGGGATAAATAGTCCTTTTGCGATTTCCA")) +(assert (= z "uaaaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 new file mode 100644 index 000000000..f7c16e8fb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCACGGTATGAGGGCCGTATGATAGTGTTGCCGCTTAGTTCTGAGTCCACCGAGCGTAGCTGGCATTGCTTGGTGAACAACATTGAGTAGCAAGGGATAGACGCACTCGGCCATGGAAAACACGTACGTCATGGCAATATTACGTTCCTCACCAACTATTCTTTCTGTGGAGTGAGAGGTCGCTTTGGTTGACGTACATA")) +(assert (= z "gaacca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 new file mode 100644 index 000000000..8bcd6b2fa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTCAACTGGTCGACGAGTGTCAACCGGGGGCGCCTTGCTCGTGGACGCCCGTCGGTCCCATTGTTCACACGTTGGCATAGACGCCGACCGTTCTAAATAAAATATAGCCTAAATTACAGAATCGTTACGCGGTAAACCCCGGTCTGCCCAACGACGTCTAGAAGACCGGACACCAGATATTCCCGATCTGAGTACTAA")) +(assert (= z "uuagcaaugcgccau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 new file mode 100644 index 000000000..72f7977cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGAGCGTTACTGGGAGGGTACTAGTTTTATATTCAAGACAACGACCATATCGCCGGTATACACCTTTATGGGGGAGCTTAGTTTGCTCAATCATGAACGCGTTTGCATCTGGATTATTCAAGACAAGGGGGATGGCCCGAAACACTGCATCTTAAACGAATATCCATTCGTATATGGTCCCTGGAGGATTTATTGCGCG")) +(assert (= z "uaccagggaccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 new file mode 100644 index 000000000..6d61b02e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACGAAGGCAGAAACGCTCCCGTATGACGAATTGGACGTTGGTTAGGGTTCCCTTTCATGACCAGTTTGACGGACTACTGGTCACGATACTTTGGGTTAGATTTGCGTCTGAACTGTGAAAAGCTAGAAATGTTAGACGGCCGTATTAATGGCGAGACAAAGCTGATCACCTCTGACCGTATACAGGACCCCGATAAGCT")) +(assert (= z "ugcaacca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 new file mode 100644 index 000000000..538fb5b7f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCACTGACGGGGCCGGTGGTTCTACTGGCTGCCAAAGGGTTCCGTCTGCGGAAGAGGCCTGCCAGACCAGGCAAGCGCCTCCTACGCGGTGGCGGTAAAGCCGATCGCGTCTTCGGGTCATTTCGACGAGCAGAACAAGTATTTTAAGGAGAAAGACCTCAGAGCGTTGTCACGGGCTGATGCGGCCACAGCATCGCCC")) +(assert (= z "acuacgccggugucguagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 new file mode 100644 index 000000000..969cbef7f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCTGGTCTCTGTGGCGGAACAGTTTCGCTCACCTATCGGATAACTTTGCTAAAGACCAACCCCTTCCCTGCAAGGGTAAACGGGCGTATGCTCCTTACAAACAGTCGTATAGGGTCGGGGAGCAACTAATCAAGAACAGCAATGCCTTAGAATCCATTACATACGAGGTAAGTTGACGTACGGTTTCTCAAAGACTTCG")) +(assert (= z "gaggaauguuug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 new file mode 100644 index 000000000..cddb878eb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGTCCTCTAACGCGCTGCTAAAGACGTAGATACTACTTTCTTTGGGTGAACCTCGGAACTACAGTACCTACCCAGTTAGTTTTGTGATTTCTTGTGTTCTTGTCTTGAGCATTTAGCCGCCCTTTAGGTTAAGAGGCTCTCCAAATGGCTGATAAAATGACGCGACCTGCGGCTGCTCTCGTAAATTAAGGAGAAACA")) +(assert (= z "acuauuuuacugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 new file mode 100644 index 000000000..ce7e3ef2f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGTACGCCAAGCTGGCTGCACGACCACTAAATTTTCCGTGGCTGGTATGTTGTTGCTCCCTTCGCATGCGTTATAAGCCCCTTCAATTCCGTGGAGCACGTGCTGATGCTCGTTACCGAGACATCTAAAGACTTTCGGCTACTTTGTAGCTCACAACTTAACTTTAGAGCCTACTAGGCGCGAATTGGCAGTGGGATC")) +(assert (= z "gcuuaaccgucacccua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 new file mode 100644 index 000000000..1756630b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGAACAGTAATGGGCCTCGAGCACCTCAGCACTACGGCGCACATCAGTATCCTGTCACTCTTCAAAGAGCAGGGGGCCAAGCTGCTGGCGGCGTTCGGGGAATTACGGGATTCGCCGGAGATCCCACTAAGCATGCCAGTCGTTGCCCAGTGTCTCCGGTGAGACCGGTGCCCTCATACTGCTGGTCGTCTAGATGGT")) +(assert (= z "cgugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 new file mode 100644 index 000000000..583458653 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGTTTACTTTGTTGCACACACACCCATAACTGAGGAGCTCTGGTCGCTTACCCTCGTCCTCGGAACGCTATGCGTTCCGTTGGGCTTGACTAGGAAACCGACCCTTCGCTCCGTACATCATGGTCGTAATTCGCGCCGTACACTCAGGCCAAGCACGGTCTTCTGGAGAACTGAAATCTCCTTTCCAATCGACTCGTAT")) +(assert (= z "ugggagcaggagccuug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 new file mode 100644 index 000000000..bb85efcb4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGTGATTCTCTAACTAAACCGCCGGGCCCAAGTGTTGAGCGAGGATCCTACGGTTTAACCTACTAGTATCCTGCAATGGTCTCTCGACTACTTCAACACATATGGATATATATAGCTGGTCCCTCAGTTCTGCGACCCCAGATCACCCACGGTGCGAACCTTATCTAAGCCGGACCATCATCTAAGTGTTTACTATCTA")) +(assert (= z "uagauucacaaaugauaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 new file mode 100644 index 000000000..534b7df27 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTCCCGGCAGTCTTCGTAGAGCGTCCTCAATAGGGTGAAATTGATGTCTACATCAGTAATGCAGTCTGTTAAGGTGAACTCGATCCCTCACCACGAGACGAAGGACTGGCGATAGCTAGAACGGGGCCCGTTAATCCGATCGCTTCTAGGGCAGAGCAATACTTCGCTATCAAGGGCGTCGTTACGGCAGAATGTTAGA")) +(assert (= z "cucugcuuccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 new file mode 100644 index 000000000..e57ffd51f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTGCCGCCAACCTATGACCTAATAACTATCGCAGTTTAAGAGGGGCGGGGTTCTCATCCCGGGCGATAATTGCGACTATCGTAGCCCTTTAGTCAAGTTCGATTGAAAGGCGATATGCCTCAGTGCCCCGTCGCCGACCCGCGCTGTAATTGAGCCCAAGGCTCGGACTGTGTAAGGTCGGTACCGATAATATGGCTCT")) +(assert (= z "cuccccgcccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 new file mode 100644 index 000000000..e4de19ac5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACGTTCACTGATGAGCTCATGGTACGTTCAGATAAGTAGCGCAGCACGCCCAAAAATTCTTTTCCACTTATAAGATTGCATACGATTCGAGCTAGATTTGGAATGTTAACTAATATCCAATGCATGCAGCAAGTATCTGTTCTAACGTAATAGGTAAGATAGAACGCTTGTACTTGGATGGTTTCGGCTCCTTCTACTT")) +(assert (= z "ugcaaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 new file mode 100644 index 000000000..893c8d522 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCGCAGTGAGTAAAGGGCAACTAAGTCATACGGCCAAGTAAAGTATCTTGGATCTCGCATATGTGATATTTTCCAGCAGACACAGGCGTATATAACGAGTCCGTCGGGGCCTTCGCACCCCTATATATCGAGCTGCGCAAACGGCCTAAGACTCGAGAGGCGCGGCCGAGTCATACAACTATCTACGACATGCACCTAT")) +(assert (= z "cccggaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 new file mode 100644 index 000000000..67c51d852 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTTCGATAATCCGGTTGAATGACATGACTGTATGTGCGGTTCTGAACTGTGTACGACGTCTCAGCTTGCGTTTTAAAAATGACTCAAGGTCGCGTAGAGGTAGGTCAAACTCGTCGGAGGCTGCTTCTGCGCGTTATTCCGAATCGTCGGAATTCATCCACTTTAGGAACTTTTTGGATATATCGACTGTCTTGCGAA")) +(assert (= z "auuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 new file mode 100644 index 000000000..dfebe0ff8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGTCCAATGCTCTGTGGGGCGTCCGACTGACCTGCTGAGTGAGTATCGGCCGGCTTTCTCGCGGGCTATGCCCTCAGTACTGCCGCGTTCATCCATAGTGCTAGACAGTCCGTGGGCCGCGCTCTAGAACCTCGGCAGTTTCAAACTCCACGCCCTTCTAGGATAACAACCTTTGTCCTAATTTGAGCCAAGACGTGA")) +(assert (= z "cccgauacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 new file mode 100644 index 000000000..c2b74a5e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGCGGGTATGGATATTGTTATATAGTCACTTGACGTGGGATGTTCAGGTAACGCGAGTCAGGTCTCAGTAATCCTGCGCCAGCAATTGAGAGATCTTCCCATCGTCGCGCTCGCCATCCCCAATGGGGGCGCTGGCTACACGAGATTTTGCATTCAAACGACGAGGTTCGCAAAATTGCCCCGGTGCTTTAGAGGGGT")) +(assert (= z "gguagcagcgcgagcgguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 new file mode 100644 index 000000000..d633fd689 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGATTTAACGCCCACATGATGAGGGTGCGCTAGCCTCGTGCTTCGTCACCGCAAATATTTCTGGGACAAAAACTGCACGAGAAGCTCCTTCCGTTCCTATGAGGATGTGTTGCTTCCCCTTTCAGAAATTCACACTATGTTAAAATGAATCCCTGTCACCGTTATTTGCCTGTCGCCACTGTTACGGTCATTCTTCCG")) +(assert (= z "uacuccuacacaacgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 new file mode 100644 index 000000000..30272f6e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGCGATCGCTTCGGAGACAGTAGTAGCATTGGGTGGAGTGTAGGTCCGTGGGCGGTTGATAGAGGGAGGGTAAGGTCACCTAGCTTGCCCTGAATTTGTTGGATTTAACGCGTTGTCCTTATCCTGTGGCAACTCCCGATCTCGTTCTACGTCCGAAATATGGAGATATGGCTAAGGCAGTGTCGCGAACATCCTAAA")) +(assert (= z "uugcgcaacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 new file mode 100644 index 000000000..438e30eac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCCCGTCAGGCACAAAACTTATAATCCGCGCGCCTGGAGTATCCACGCAGGTCTTTACGAACTCCATCCCTACAATTCGAGGATACTTGGTCAATCGATCCATATAATGGGATTCCAGTTGATTGGATCTCCATCCATTGACCTTTGTTCCAGTCTTTTTCAATCACTGAGTTTACCATAGCAGCACTACTCAATGCTG")) +(assert (= z "ugaacca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 new file mode 100644 index 000000000..1697e371d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTGTGATAACGGATGAGGCGCTGTTCTGGACCTGCCCATTAGAACTACGTTTGGCCGGTAAAATAAAAAATCGAGGCTCCTCACACCCTTCACGTGGATTCCTGATAGTCTGCCGATTTTATTAGAGGCTGATTGATACTATAAACTGTGTCACGCTTATTACCTGATAAAAGGTGTGGGCGCGGATATAACACCCTT")) +(assert (= z "gacacagugcgaauaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 new file mode 100644 index 000000000..6e9fbe8c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGAGGTACGAAACCTGTCACGGTAAGACACTTAGCTCAAGTACGACGTAGCGTAATGTTCCGGATCGATTTCATGTCAGGACGCGCTTAATTGGTGAAGCTCGCCTTACTTTACGTCGCTCCGTGTATGCGGTCGCGGTACGGGAAACGCTCTCGAGGCGGTAGTTCGTTTAAGTCAGGAGCGGTGTAGGCCAAACCAG")) +(assert (= z "uaaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 new file mode 100644 index 000000000..0b8c947b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGACATCTATAATACTACAGGAACATTACCGAACGTTCACTGACCAAAGGCCAACGGGATAATTGGGATCGCATGCTGGGGCCCATGATCAAGCCCGACGCATGGTCCTTATAGTTGGGAATGTGTCTTGCCGGACAAGGGGCCTATAAGTAGCTCAATTGAGCGCCATAACTGGAGGGATTATTTGTGCTGGCCCGGA")) +(assert (= z "acggccuguuccccggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 new file mode 100644 index 000000000..bc5ce6ade --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGTTATGACCCTATGTGTCGCCGATATTTGGCGCCGTAAAAAATAGGATACAGAACTCAGCTAGGAGAAGAAAGGGCTTGCCAGCGATCCACATCTGTAACTTGGGGGCGCAGGACGACAGGCCATAATCTTTTCGTGGGAACGGTAATCACTCCGTATGGTATCTGTTAGGTGATCGCTTTAATGACGGAGCTATGCG")) +(assert (= z "ugucuugagucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 new file mode 100644 index 000000000..7f12f9fb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGTGGTCGATATGTGTCATGATCCACCCTCCGCTCGTTTTCGTCCTGGCTTCGTAAGGGTTCTAATTCCAAGATCTTTAGAATTAACAGGATTCAAATCGGGGGAACCCTCAAGGATCTGGAAATGCTACTGCACTACCGGTATCCTCACTACGGGGGATACTCAACATGCAGTATACACACGTCACCGTATGCCTCTG")) +(assert (= z "aagcagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 new file mode 100644 index 000000000..330da18c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGCCACAGGTTCTGCTGAAGACAAGAGGCTGGTCTGACTAAGTGGATAAATCGTAAGAAAGCCACGCCAAATGCACTGTCAGACCGTTATAGCCATTGATGCCGCGGAACGCCGGAAGAAAGCCCAGCATTAAAGTCGTACTTCCTGGACAGGCGATCGATCGTTCTGTTCCTAGCCCCGTAATCTATAAGTCCGTTT")) +(assert (= z "uaauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 new file mode 100644 index 000000000..5ecf621f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCACGGATTTACGTCCAGGCACAGTGCGGCTCTTTGTAACCACTTATACAACCTCCCTTTGTGCCGCTCCGACCCGTTCTTGCAAGATATCCTGGAAGCATTTGACTTCCGATAAGATGTTCGTATAACTTCAGCATGGCACATTCAGACCACCGTCTTGGATGTGCCGCGACGAGAGGTATCACCTATTCCACGTCACT")) +(assert (= z "uuggagggaaacacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 new file mode 100644 index 000000000..e7e8b1c7f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCGGGTGACGCAGCTTCAAGCTGACCGCGGCTAATATAATGTCGGAGATCGGATTATGTTCACTATGGCTTCTGCCCTTGATTCATAACCTGTTTAGGTTGTAAACCGCAGGGGTATGATCTTAGAGTTACGGCCGCGCACATGCACAGCCCTCAGGCCCACAGTCTCTGTTACTCGAGACCTGTCACTCATGAGAAC")) +(assert (= z "uuuggcguccccau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 new file mode 100644 index 000000000..7815bc37c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGTCAAAGATTGTCAAGGAACCTCACTGAACTCGCAACTAACTCCGCGTTATGCTCATCCGAGACTACAGCAGAAATCAATCAACTCGAAATACAGGTAGCCCCCTTCAGACAGCTTTTCCCTGTGATGAGAGGTACCACATGAGACGCAGGGTATATGTGTATACAGTTGAGCCGTGTTCCTGAGTATATGCGGTGCA")) +(assert (= z "ggagugacuugagcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 new file mode 100644 index 000000000..c89b67316 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAGCAGTACCACGCCGGCGAGCCAGTACAAGGTAAGCCTTCCTCGATAGTCTGCGAATAAAAGATCGCCCAACAGAGTCTACGGTCTGTATTCCGGTGTCTATAAACATGGTCTTGATAGTGACGCAGGTCATCGCGAAGCCCAAAGTACATCTGGAGGCTCGAGCATGCTTGACCTAGACTAGCATTGTTGGCGCTGT")) +(assert (= z "guaacaaccgcgaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 new file mode 100644 index 000000000..aec1f15b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACTACAACCCCCGAGTCATCGAATGTACCATAGGGGCAGGCTTTCTTATCACTTGCCGGTAGGGAAAGGCCGCTTAGCAGCCGCTGTTAGGGCATACTTGTCGTACGTTCCGCGGCACTTGTTCACGATAGACACTTCGTGAGGTCTTTCATTCGGGCTATGACGCAACACATCGACGTCGCGGAGGGCGGATGTCCAG")) +(assert (= z "gaaaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 new file mode 100644 index 000000000..862dc6bcb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGACTGTCAGAGACTGCATCTACTTGACTTCGCCCTATAGAACAAAAGTTGTGCCGATACCACGCGTAGACCGTCGTGATTGACGAGACCTTCAGACCGATCTGTAGTGTCCAATCCTGCTGCTAGTGAACGCGGTATAATGCCCCCAAGTGGCTTCGGATGCAGATGAAACGCTCAGGCGTACGGATGTAAGCTCCGCC")) +(assert (= z "ggaagucuggcuagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 new file mode 100644 index 000000000..b6501e12c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTGTAAGCAACCTATGAGACTGTATGTCGCTCTCTTCACGTATGTACGGATGATTAGTACAAGTAGTTTACTGTCTAACTCTCCTATAGCCTAACTACTGTGGTCATGCGGTGCACATTTTGGGTAGCAATGACCTGGGCCGGAAGCGCCCACCCGGTCCCTAGCGTGTACAATTAGAGGCGGACATTGCGGTCGTCCG")) +(assert (= z "ugaugacaccaguacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 new file mode 100644 index 000000000..eba83e0d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTATAACTCTGCTCAGTGCCTCATTGGGCGCTTCACAGGAGCCTCTAAGTGGGTGCTTCTATCAGAAAATCAAACAACGTAAGGACGCCGGATGATTTGGGATGCGCCCTCGCCCGGGGAGGCGTTGACTAAAGCACCCCCCGAATTCTAACTGGGTCAATCCCCGCGTTAAAGGACCTATAGCTCCGATAGATGGCC")) +(assert (= z "uuuguugcauuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 new file mode 100644 index 000000000..0e83a824d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACGTCACGCGACAAAAGAAGCGTCAGCACTCCGTGAGACTAGATAGGTGGAACGCTAGGGATTTAATTCGAGGTAGACGTGAGAAAGAATACCTTCGGGCGATTCTGTTCGGGCAAGAAACTGCTGTAAGCAGTGAACACTGCATCCCTTGGTCTGGGTATATCTGAACTTTTCCTGCCCTGTTAACCCGACGAATAGC")) +(assert (= z "acaauugggcugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 new file mode 100644 index 000000000..e26d16c3e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTATATCAGCCTGGCAACAACAGGGTGTTCGGGGGGCAGTCTACTGTATTATGTGGTTGCGCAGGCGAGTATCAACACGGAGAGCGTCCCTAGGTTTTGGAACACATCACGTTTAGCAGGTAGAGATATAGGTATATGCTTTGCAGATCTCGAATAGAAGCCATCGCGCTCGATAACCTATCCGACATCATAGGGGGAC")) +(assert (= z "gcuuaucuucggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 new file mode 100644 index 000000000..342d4a1e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCTAAAAAGACTCCGAAGAGTTTTACGCTAGTCTATATATTGTTGCACCCCCGCTCCGGGCTACGGAGTCTATTCAACCATCAGGAGACCACGTTACAGTCGACCTACGCTTGTGCAGTAATATGCCACAGAGGGACGGTTCCGATAGACATAAAAACAGGGAAGTTTTAACGAGAATATCCGGCGTAGTCTGCGGGAC")) +(assert (= z "uguau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 new file mode 100644 index 000000000..b67ea0976 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCGATAACGTCAGGTCGAGTGCCGTACAGTTTTCTAGGCCCGTCTTGATTAGAATTCAGTGGGGAGTATCAGACTATCGAGCGTTAGGGGCACGGTTATCTGCTCTCAGTCTCTCCTTTCGATGGACTACTTCTATACAAGAACAGAGCACAACCATATCTTGTTGACAACCTCCGCGTGCCAATAGCAACCTCTTTAG")) +(assert (= z "uugguauagaacaacuguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 new file mode 100644 index 000000000..dde521991 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTGCGCACAAATGTCGTTGTGGTTGTACTAAAGGTTAGAGAGCGTGAATCGGGGTCTTCTCCTAGTATGTTACCACAGTGACATTCCAAAGTACCGCCGCAGGTTTCGAACCATGTGATTGTAGGCTGGGGTCGGCGTCTCTCCCGCCATCATGCAAAAAGCTTTGGCCGACATCGTATATCGTCCGCAGCAAGCTATG")) +(assert (= z "cacgcguguuuaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 new file mode 100644 index 000000000..73d2edebf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGTTATAGTGCTTTATAAACCCCGCGAAAGGGTCAGAACTAAGGCGCCAGGTTATTGAATTAGTTTCAGCCGTTTTAGGGTACCCCAAGTGGTGCGACGAGTACGAATCCTAGTGTGCATTAAGCTGGGACGGGTTCCTTGCATCGAAGAACCGGACGCTCGCAAAGGAGGAGAAGCGAGGTCGGTAAGCTTCAACGTA")) +(assert (= z "uccucuucgcuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 new file mode 100644 index 000000000..5c408b9b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGTGGATATGGAAGAAAGCGCATCGTGACGGACACCCGGGCTAACGCAGCAAGATACTAGTTCCCCTGGAAATACAGATCCCTCGTTAACCTTCAATGTCGTTCATCTAAGAGGAAACCCTTGAAGAGGAGCTAGTACATCCTCTGCGCGGGATTTTTCGGGGTAGGCTGTACCATGGAGAACACAAGCCTTAACACTA")) +(assert (= z "ggaaguuacagcaaguagau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 new file mode 100644 index 000000000..bfebb27f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTAATTTATTTGTTATCCGATCCTTGTGTCGTGTTCAGACGCGGACGAGGATGATATTTAGTCGACAATGGGCCATTATGTTGTATTAAAGGGGCCCTGAGCCACTGGTATTCAGATCTTCTTCTCCGGTCCCAATCTAAGGACCCGCGTACGATTACGCGTGCCGAGTGGTTGCGACTCGTCTGGCCTATAGTATCGT")) +(assert (= z "aaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 new file mode 100644 index 000000000..f041be788 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAACGTGCCTGCAAATTACTCAATAGCCACGGCTATGACTGGGCGTGGGAAGAAAGCTTGGTAGTAAACCGGGTGCGAACGAATTTAAGCTTCGGAAAATCAACCGCGATCGTCCAGTAAGGGGTCACTGGCACTACCACTCCTCACCTTATCGACCAAAAAATCACAAGTATGCATGTCGGCAACTACCGCAGAAAACC")) +(assert (= z "cuuucgaaccaucau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 new file mode 100644 index 000000000..871c851f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCCTAAAACGCATAGGTATGGGTAACCATGCACAGGATGTGGTTGTAATCTGCGCCTTTGCCGTTCACACTGGCTACCGCTTCCAACCCGAGTTATCGTCGCCCGACCGCGACCCTCCCAGCAGCGGTTGCAGCTTGCGGGCCATTTTAATTCGGCTTTGATGAGTCCGATTTGTCTCACATAACCAAGCCGGCGCGT")) +(assert (= z "cgcugggagggucgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 new file mode 100644 index 000000000..4f798fa83 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACAGAGACTCGTCAGTTTGCAGGCAGCTCCGAGTTGAGTGGACCAGACCGACAAAATTAGTGATGTACTTTAAAGTTAATGAGGAGGTCGCCAGCTCAGAAAGTATTAGTTTCAAGGTCATTGCAGTGTGCGATGCATGAGATGAGTCCGGCTGGCACATCACACTGACACCCACCCTAGATTCGCTTGGGCAAATTGA")) +(assert (= z "guuccaguaacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 new file mode 100644 index 000000000..452895ab6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTGCACTCCTACATGTCACAGAGCCTTTATTACCTCATTCACTAAGTGTGTGGGGGTACACCAGCATCAACTAGCGTAGCATTAGCTAACCTACGGAACCTGACCTAAATATAGACCTCTCCTATGAACTTAGTTAATTTAAAACTGTAGCCGACCCGTTGTTCGCGGAAGTTCCATTGACAGCAAACTGATAATGAAC")) +(assert (= z "ucuggagaggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 new file mode 100644 index 000000000..ddf3ac03c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACTTTATCCTTTCGACGCGGCCTGAGCAGTACGACGGAAGCAACTTGGTCCAAAAGCTTGTACTTCTTCGACCGGCTGCCTCACTCCCCGCAGATGGGTGAGCTCGACTTCTTCAGAGCTCGGATGTGCTGGTCTCCCCCAGAAATACAATTCTCAACCAATAAAGTAAGGGTAAGGCGTTGGCCCAAGCCGCTACCTA")) +(assert (= z "agaggggguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 new file mode 100644 index 000000000..0d6d6de47 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCAGTCTGGAAGGTTCTCTCTCTGGCAAGTAACTTATACAATGAGAGGTCCATAGCAGGACAATTTAAATCAGCATGCCTTAAAAAAACGACGACTCTGAGCTGGCTCTTGAATCATCCTCAGTAGCAGAGCCCTTCTCAGGTAGCAAAATGCTTACCTGCATAAGTCTCACTTACTCTGAACAGTGTACAAAGGAAAC")) +(assert (= z "ggaagaguccaucguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 new file mode 100644 index 000000000..190ebe041 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCCAATCTACCTTGTTCGACAGGGCTTACGGAACTCCCTCTTCTGTCCTGAACTGAGCGGAGGCTTCCTTCGCGATATCACCGTTCTGTCGCGTCTGTTCACGGTCTGACGTCGGCCGCACAAATTCATGGCTCTTCGTTTTTCCAGACACTGAAGCGGCGTCCGCAAGGTAAGGTGGTCTGGAGGTTGACAGTCTCTC")) +(assert (= z "uccaacugucagagag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 new file mode 100644 index 000000000..67a72c0d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACTCAACCAGTGTCACACTGATCAAAGCGTCGTTGGGAAGGTCAACACGGGCAAATAACCGTGGTTCACGCACGCCTGAGACCTGTCCTACGACCGTACCCGACTGCGTTGGTGAATCTATGGCGATGCAATGACAACAGAGGTTGAGCCATAATGTAAAATAAGGCTTTGAGGTCCCATAGTGGCGAATCACGCTAG")) +(assert (= z "ucuggacaggaugcuggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 new file mode 100644 index 000000000..e6536b47b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGGTCTCCGATGGACACAGCCCATGCTTGCTATACACGGTGGAGGGTGTGTCACCCAGCTCCGGGAGTCGATTAGCAGATTCGTGGAACAGGCCACTCAATATTGAGCCCCTTAAATGCCTATCCCTGCAATACCGTAGTTCTCGACTCCGGAGCGACGAATCGAACGGCTGTGCTCCCGGTGGAATTCAAAGCTCAG")) +(assert (= z "ccgacacgaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 new file mode 100644 index 000000000..ab297fcae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAGGCTCGAATTGTAGACGGCTGAGCGACCTTACCTTTAAGGTTTTAGCTGGTGAAAATACTAGGGTCATACGTTGTTCTAGTGTCAGGGCGGGTATACAACCAATTCCATCCCTTAATGGCTGAGCGTACGGGGGAAGGTGCCCACGCAGTTCTCGTCATCGGACGATGAATGTGCAAGTAGGTGCATGTACACGCCC")) +(assert (= z "gcaugcccccuuccacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 new file mode 100644 index 000000000..3cb6cc9a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCCAAGGCCGAACCGGTGAGCGGGCTTACAGTAGTCACCTTAGTCAGGTCTTGTGTCCTCACCCTCAGCTGCAAAGTTCCCCTCCCGGACAGTTAATGGCCTATTTATTCCGGGGTATCAGACGTCTCTTTTTTAAGTTCTCTACGACTAAGCTTTAGAAAAAGTGACGAAAAACGTATGACTCATGGCCATTGAATAT")) +(assert (= z "gaugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 new file mode 100644 index 000000000..6b7f72c5f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTGTAAAACCCGGGCGCCACCCTACCTATGTCACATTTCGTGCGAATTAGTGCCATCCCGGCCTTTAGCCAGCCGAAGGTGAGCGCCAGGTGGTGGGCGTGTCACCAGGAGCAACTGTGCAAAGGCAATAGTATAATAACAGAGCTCGCCTTGTAAAAGCTACCCCTACCAAGTAGCGACACTTGCTGAGTGGGGACA")) +(assert (= z "acgcuuaaucacgguagggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 new file mode 100644 index 000000000..064214574 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCGACAAAGGTTTGGGAGAAAACTGGGTCCCAAAACTTGGCCTAGTAGTTAAAATGTATTATAAAGCAAGTGTCGTGAAATAGCCACGTAACCAAGACCCGCCATACTGCTGGACGCGTTTATTACGTTGGTTTAGGAGTTGCTATGCTTGCCCGGAACCTTCGACAGTCTCTTCCTCGTAGAACGGGAGACTATTCTG")) +(assert (= z "acgac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 new file mode 100644 index 000000000..93353f9a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTTCCCTCCACTGAGGGGAGTCCTGAACTGGACGGACACAGCGTTACGAAGTTGAGATCAATTCAAAAGCCGGAAAGCTCGCGCGCTGGAGCTCGAACCGATCTACAAGGAGTTACTGGAAGGCCCGGACACTACCAGTATCCGTGTTGAGGGCAGGTGGCATACAGTAGTGTTGTGATCCGGGGTAGGGCTACCCGAA")) +(assert (= z "cccgauggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 new file mode 100644 index 000000000..6ba6f8677 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTGCGAACATCGGACTGGGACAAGGATCTGCCCCGCCCCACGGCCGTAACTGCCACCTTATAGTGGCGCAGATACTTGGCTAATCTGAGAGGTTCACGACCTCCTCTTTAGATTCAAACCTATGATACCAGGAACGATCTGCGATCACCTGTGCTGGACGGCGTCGGACCTCCCCCAGAAGTGGAGCTCTGGAGTAGA")) +(assert (= z "agaaaucuaaguuuggauac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 new file mode 100644 index 000000000..2758a1dee --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCATCGCCGAGCAACATCTTACGAGGTCACTTGTCCGGAACCCGTGAGGTATAGCCCGGTGCGGTTGTATCGATAATCACAACGCATTCACGCACGTGTCAGTCATCTACGGTTTCATCCCCTGGCAGGTAGCGCCCAAAGCCCGCGGTAGAAGTGGCGGTCCGCTTACTTTTTTCTAAACCGGCTGACCGATCGTAATC")) +(assert (= z "guagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 new file mode 100644 index 000000000..2667ff77f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCTGTCTCCGAAATGCGTGTGCATCTCCCCATCGTGTTAGTTCCTAAGACCCGGTGACAAGTAGACGCCATTGGAAACGAACGTGCTAGGACCAAGATAGTTACGTCATCTCACTACCATCCATACCCATGCAAATCAACCTGAACGAGAGTGCTTAATTCACACTTGTCGTGTTAGTCTTAGGCGACGCTGCTCTGGA")) +(assert (= z "ucaaggauucuggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 new file mode 100644 index 000000000..c7adddf56 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCAGTACCGGAAGTGTTGCAGGCTTCAAAGCTACACCGCCTATTTCAGCGCCTTAGGCAAAGGATGTGACTGCTAGGTAAGGGCAAGAGTAGAGTCATTACTGACGATCTCTCACGTATCGCGATATCTAGGCCCCGCGAGACCGTTGTCTTCTGTACCCATCTACTGATGGAAATTGATGTTCAGTGGCTATGGCGCT")) +(assert (= z "augacugcuagagagugca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 new file mode 100644 index 000000000..e6c0fcb3e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCGCCCATGAAGAAAGAAAGGCGCGCGTCCCTCGGTTGAACGTCAATCAGAACGGTAGATTGATTCCGAATCTGTTCCTATGAACTCCTTTATATGACGGTCGGCCATTGCCGCTGTCATGACGTGATTAATCTTATAATAGTAAATAGCGCTACTAATACCAGTATCGGCTCTTAAGTCTTTACAGAGCCGCACCAT")) +(assert (= z "uggucauagccgagaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 new file mode 100644 index 000000000..409d6706a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGTGTTCCTTCTGTCAATTACTTGCGCGAGTGAATCAATTCCGTAGTATGATCTACTTCAATTTGCAACAAGCTACACGTATTCAGTAGGGAATACCACACTACCGAGGACTGACGTAGTGTCAAACCTCACTGGATATCATACTTCTAACGCTAAATTGGCTACCCACCAAGGGCTCGCAAATATGGGTTGGGGGATC")) +(assert (= z "caucauacuagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 new file mode 100644 index 000000000..d6c3c62ca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATATGCGACGATGGGTATGTAGCATGTGGTAACTTCGATATTAATCAGAGTGAAACCCATAAATGTAAATAATGATTACGCGCGATTAAGCGAAATTATAGAATGAGGCGCGCAATCGCGTGCAGGATGGTTAACCAACTCTGCTCTTAAATTGCTGATATCAATTCCTGTCAAGATTTTAATGACGGGTGAGGGTTCA")) +(assert (= z "gacuaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 new file mode 100644 index 000000000..9123df7ad --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTCGCGGCCTGTTTAGCACTCGACGAACAAGCGTTGTCTCTACCCATGGCGTCCATGATGCAAAGGACCTATCGCCTAAGATACAGGGCGTAATGTCATCTTAGCATTGTTCACTATAACCGATTACTGTTTAGTAATCTCTGGCCAGACGCTACCACTCTGGGTGTTCTATTGGTAACTAGTGGCGCTTGATCTAAAC")) +(assert (= z "ggucugcgauggugag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 new file mode 100644 index 000000000..bf977e2cf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTAGTCCGCCATGATACATTTCCTGAGCAGTTACTAACAGTTTGTAGCTGTTCTTGTCCAATGGAGGCCTCGACCCCGTGCGGGAAATGCCGAGCTCAGGCCTCGATGAGCGTAGCGTTACGGTTAGTTGTTCGAAGGTAGCCCAAAAGGCATGGAACACGTGCCTCTCGCTTAACTCAAGGTTAGCGAAGTACCGTA")) +(assert (= z "caacaagcuuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 new file mode 100644 index 000000000..baf4d78de --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGAAGAATGGTATAGCCTGTAGGGCATCCCGGCTCCAGTGTAGGATAGGGAGGAGTTCAGCTACTCAATGTCCGGCCGTGCGCAGGGCAGGGAGCACCGCTTTGCCCTTAGTTATGCCTTACGACAATTATGGGCTGATGACCCTCAATCCATCGCACCGAACTTCGAGCCTCACCTGTCCTTAGTGTGCTCGGGAAG")) +(assert (= z "cgggaaucaaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 new file mode 100644 index 000000000..d0f6d2911 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACTTAATTAGGCCCCTGCTATGGACCCACATCACTACGTATTCCGGCCCTCCCCAGCATATGTCTAAACATCCAAATACGCGCATTTGTGCGGCGTATACCTCAGGGACCATTCGAAACACAACCACAAGCTTACTCGCTCCAACCGTTAAGTATACCCTATTTTCTGAGAGGACTCACAGCAGATGACTGACACTAA")) +(assert (= z "ucgaauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 new file mode 100644 index 000000000..cb73ad616 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGACTTGACCTGACTTACATTAACTGTCCGGTTACAATAGAAATAGGCACCAGAATACCGCGTGTCTGGCAATGCAATGGCCTTAACGAGTTACTCCTGTCGTCCAGTAGGAAAGGTAAGCTGGGCAAACCTAGCCAACCAAGATTTTACTATGGGGAGCAATCGTCTTTAGCCGGATGGTCTCACGATGCTGAAACGAC")) +(assert (= z "uugcucaaugaggac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 new file mode 100644 index 000000000..b03dcb9a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAACTAAACGTTTACCGATGGCAAAGGCTGACCCATCGTTGTCTAGACAGTTCAGCACTTAGGACCAGAACCCATCGTCAGTCCACACTATCGGTCACCATGAGTGGTGCAATTCTACAATAGAACGTTTGATGAAACGCCGTATTGGCCGGGCCCTTATGGTCCCGTGGACTCGAGGGCGGAGCTAGTTCTAACAGAG")) +(assert (= z "uggucuug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 new file mode 100644 index 000000000..5bba2b92a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGGAATTCCAGAGACACCATGAGACCGCCGCTCACACTGTTTGCAGGTACACATGTTTCGGGTTCAGCATTGTGCGCATAAATATCTTTAAATACTGCAATGAGTTGTGAGCTAATCAACAGGCGCCTCGCGACCGTATTCTGTAACGATGCGTGTGCATTAGGTTGTGTTGTCTTTCCACCAGCCCGGCTCCCTTTGA")) +(assert (= z "cuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 new file mode 100644 index 000000000..c6a413171 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCGCAGTTGAATGTTGTCCGTGCCTGCATGTACGCCCAAAATGGGTTTGCTACGCGATTCGTAAGCGACCGTGAGTCGGTCCGGGTAAGTAACTGTCGCTCACATTATAGCGCACTGCTTTAGGGGGAGTGTGCAGCGAATTTGGAGCAGACTCAGATTCACAAGCCGGCGACACCCCGGATGAGTGACGTAGTAGAGG")) +(assert (= z "acgaugcgcuaagcauuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 new file mode 100644 index 000000000..7a29d1891 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCACGATCCAAATTAATTCCGCCGACGACAGCAGACTGCCAAATAGAAGACGAAGTTCCATTCGCGGTGACGCCTCGTCATGGTCGGAAGATCATACTTGCTGCCCCGAGTCACTTCTACTGGTGCAATCGGGTGCACTGAAACGCTCATGCCGTGATAAGATTTTACAGCGGATATTTGCTCCCGCCTAGCGAGGGCA")) +(assert (= z "uaaacgagggcggaucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 new file mode 100644 index 000000000..7c41571b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGTGCTCGGTACGGCACCTGGAAGATTCTGATGTTCTCACTTGTATAAAAACAGCAGACCTGCTCGCTAACACCAGGTCAAAGGAAGGTCATAATTCTTTCCGGCGCAAGGAGCGGGCCGAAGCCGTTACTTCAGCATCCACATTCCTGCCGATAAAGACGTATCAGAAGCCAGAATTGCCTTCACTGCACCACTAGGT")) +(assert (= z "cggcuauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 new file mode 100644 index 000000000..c45ee054d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCTCGTAAGTTACAGCTATGTGATGCGAGCTGATGTGTAACTATTAGGCAGCGCTGTTGACGCAAAAACCTGGAGGTGGGACACCCCTAGCTTTTACCCTGGTAAGGCCCAGATTGTACCAAGTCGAGGCGACGGAAAGCCTGTTTTCTCTCGAAGGGTTGACGCTAGATTACACCCCGGTTCCGTGTGCGGGTTGTG")) +(assert (= z "aauccgucgcgacaacug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 new file mode 100644 index 000000000..6bca89baf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACCTCATGAGGCGTGTGTGTTCTTTCACATGTCTCTTTTCGTCCCCACAACGCTCTGAGTCTCGGGCCGATACTTGTCGAATAAGCCAGCCCTGAAGAGGCTGTAACCGGTATGGCCAGCTCGCATCGACAGCGGTCCTAGCAATACTGCCATCTTGCTAGGACAGTGTCAAAGATTATGATCCAGCAGATATATCGTC")) +(assert (= z "gaaaagcaggggug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 new file mode 100644 index 000000000..f7f74e6e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATATATCGAAATTTACGTCCGTCACGCCCAGCAGCTTGGCCATTAAGCCCTCCCTGCTCACCGGTTGGTAACCCGGAATTGCACGAATAATCCTAAGAGGATCTTGGACTCGCAGTATTGGCAACTCGTGGCTCCGAATTTGGAATTAAAGACCGAGAATCCAAAGGCACTAAGCATAAAAATCATTTTACGAGCTCTC")) +(assert (= z "auuucuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 new file mode 100644 index 000000000..1f5d5a20a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGCCTGCTACATTCACTCACTACAAGTATCCACCGAACTTTTAGGGGTCGGAGGGTCTCAACGAGTAATTATCCCTCCCCACGTTTATGAACGACTCCGTGTGGGCACGATCCACGGGTCCACTGGAGCGAGATACCATTCTGCCGCCTTTACGGCAGACGGACTTCCGGTGCGAATCTAGGGGCACTCATCCGAATGA")) +(assert (= z "guggcuugaaaauccccagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 new file mode 100644 index 000000000..f319c70e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTTGTGTGGTCCCGAAAACAAACACCGAAGCGCCGGCAGTCTGAATGGCGAAGCCCCTCTCACTTCTTGCTAGTTGAGATATGTGGATCGGACGGGGATTAGTAAACACGGTCATTTAGGGCCGCCGTCTACGAGTGGCTTTTTAGGCCTGGGCCGTCTGTTCACCACACGGTGATTACTAGCATGCTCTTCACAAGT")) +(assert (= z "ccacuaauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 new file mode 100644 index 000000000..2c74027e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTATCCTACAGTCCGGAGCTCAGCTCTCAGGCATTTGCCTTATAGAGGACTTTCAGTTAACGTAAATTACAGGATCAGCGTGGACTTGCATTTCTTCCCGATATGGCCATCCGAAAGCTAGGTTAAAGAATCGTAAAACTTTGGTTGGGTAGTGCTCTTGGACAGTTGTTGAGCTCATACCGCTTGAGAATCGGACCGG")) +(assert (= z "uaauguccuaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 new file mode 100644 index 000000000..f0cc46570 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGATTTCTTTGCACTGGGTACAGCAGTAGGAGTGCAAAGGCGCACCAGACAGCAGAGCGGGTCCCAGGGATTGAAAGACCGGCTGGCAAGTACTTGCGCATCCGCTGTATTGTCTGCTGGACCGTTGCCGTTGGAGTGCTATGCGTAGGCTAATCGGAGGTAAAACTAGTGACTCCTCTACCTTCAGATTACGATACACA")) +(assert (= z "agacgaccuggcaacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 new file mode 100644 index 000000000..cb3d8bd76 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTCGGACAGGACTTTTTATCTTTGTGCTGAATCTGTGCAACTTAACGGTTCGGAGCGGAAAAATCGTCAAGCTATGAGGTACAGCTAGCTTGGGGTTGCCGGTGAGGGGAATAAGAGTGCTGTACACTCTGAGTCTACCCTGGCTCAGCGTGCTGAGGAGAAGTTCTTTTCATTAGTGCCTGAACCTAAGTTGGTCTG")) +(assert (= z "uagaaaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 new file mode 100644 index 000000000..037b80770 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGGTCAATCATCTATACACACGAATTGATCAGCCAACATGGTATCCTGGTTCAGGTAATCGTAAGAATGATCATCATCATCTGTCTTTAAAGCTGGGTTTACGACTCTGCTCACCAGAAGTGGTAGGGATTATTTACCGTGTGCTAGTTACCATTCTCGGGCTGTCCCGAGACACACTGTTCTAGCAATTCCCTATCAA")) +(assert (= z "cacgauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 new file mode 100644 index 000000000..634ad988a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCCAGGCGTCAGTGGCGTGTATCGGTCTATAATCTTCGGAACTCCAACTTGATGAGCTCAAGGGGGTGAAGAATCCATACGCCGAATGGGTTTTGGAGTCGTCTACTGCTGGAATATATTCCCCCTGCAAAGGTCTCAGGACTGAGGCATATCGGCCAGTATTGCACAAATTGCAAGGCATTGGCCTCACCTCGCAGGG")) +(assert (= z "ccucagcagaugac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 new file mode 100644 index 000000000..51323d110 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCACATTTGGGATTTGCTATTGCTCGTCAGCCAGCGGATCGCAAGATCACTACGAGCCGGTCTCGATGCTGTGGGATGATGATACGTGCCTAAGTCGCGTAGATGCGTGTTCTTGATAGATTTAACCCGGCGTGTCCTCAGCTCACCATATATCGTGGGCACAGCGTCCGCATATTCGAATGTGCCGTACAGCCAAAGAA")) +(assert (= z "acuacuaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 new file mode 100644 index 000000000..3a42e7095 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAGTGCAACAACATCCAGCGCGGCACCACCAGATTTGTTTTAGGGAATCGCAGCTTTCTAAATGCTGAGGATCGTGCAAACAATATTTTAGGACTTACGTCCCGTAGCTCACTGCCATCTCAGGCGTCTATGTGGCATTTAGACTTGCTACGATTCAGTCTATAGCGTGAGTGGTGTACTGATGAAGCAGGGCCCTGAA")) +(assert (= z "guagaguccgcagauacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 new file mode 100644 index 000000000..ae3e17011 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGTCCGGTTTGTGCCTTGACCTATCAACGCCAGGGGTCCAGAGGTTTATAAAGGATTAATTAGCACCCAAACGATGAGGAACAGGACGCAGACGGTTGCGGGCAGCCGCTCATTTGGCGTCTACTGAGTATATAGGTGTATGTGCTTGAGGATGAACTGCAACTGAAAGACGAGGACCCTCCCTTCCGTCCCGGCCGCT")) +(assert (= z "ggguuugcuacuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 new file mode 100644 index 000000000..6ef976e4b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCTCTTCTATTACGGGATCAGCACACAAGGACATGATTCGAGCTTTTACGTTCGTAAGCCCTGGTATAGTGGACATAGGAGTTATATAGGGACCGCTCCCTAATCAGGCCGAATAAACACGAAAATTAGGCTTCAGAGACGAGTGAGAGCATCTTGATCTCTCTTTAACTATAGCAGGGGGAGCGCGAAATGTCATCGC")) +(assert (= z "uagagagaaauugauauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 new file mode 100644 index 000000000..178d422c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTTTGTGCTTATCCCTGCTCCGGGGAGGGATACTGGAGACCCGCTGCGAGCCACCATAACGGTCCCGCTTTAGGTCCTTAATCATAATTATCGGGCCCCAGTCCTCCACGCTCTGATCCATTTCTCGGCTATAGTGGTACTGAGTCCTAGCTTGCAAGCTACTGGACGCTAAGCCGCCTTGACAAGGTATAGACTTCG")) +(assert (= z "ggggucaggaggugcga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 new file mode 100644 index 000000000..2cd4924c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTAAGTTGAACTAATCCCGCTGGCTGGGATGCTAGGAACATAAGCCACGAGTTGGATCAGACAGCAACTTCTGGTCATGTCAGGCTATGTAAGTTACTACCTGATCCAGAGGAGCCGCAAAAATGGACATTACCAAGCAAAGCCGATGTCTTTCAGCAACCAGAAATATACATGTGCGGCCTTCAGAAGGTAAGACGTTG")) +(assert (= z "agaccagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 new file mode 100644 index 000000000..bcff60b54 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCTTTCGGAGAAGCGAGTTGAGTATTAAATGCTTACCTATACCAGAGGTAATCTGAATAGGGGTTTATGTGCTCCCAGAAGCCGTGTTCATTGCCGGCCGTTTTGCCTGGCGGCAACTCGTTCTGCATGGTAGCAGATCCATGCGCAAGTCTGCCACGAGCAGCTGTAAGCGAATTCATACTCTTTGGGCCGAGTCAA")) +(assert (= z "cauuagacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 new file mode 100644 index 000000000..f625cf5f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCCAGTGGCGGTGATTGGCCACCCATTCTGACTCGATAAGCAACCGTTTGAGATTGGTCTAGAAGAGAGGTCCACGCCCGCCTGTATAGCGCGATACTGAAACCCGCGCCACGCAGCTCGGGGATATTTGCATAGAGACCCTTGAGTCCGCGGGTTGGACTGGTTCCCTTCAACGCTACCATGAGGCTTGGTCCCCCGG")) +(assert (= z "gcgcuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 new file mode 100644 index 000000000..8edf1d464 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCGAAGGGCGAGGGCATAATGGTTGCAGGGTACCTAACAAAGGCAATAAGCAGTTGCGACCACAACCAATATTGGCAATTCCCAATGCGAGATCCCCCGGGTGTGGATAGTTGTACCGGATAGCTGACCAAACAATTGGGTCGTATAAAATCTCAGTACATATACTGTCGTGGATAACTCGCACCTTTTGTTGGCGATG")) +(assert (= z "caaccgcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 new file mode 100644 index 000000000..b90cf0d06 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGTGAATTATGGAGCTGATTGTCAGGCCCAGGCAGATGTGGGGCAACCCTTTATAGGGAGGCGTATTCATGTGGCCGGGCGAATCTCTTAACCGAAGTACCAAGGCCCACAGAATAGCTTCGATCTTATTCGACTAGCTGGTTACTGAGCTTGACATTAACACACTTATAGGCTATTGGTCGATACCTTTACACATTC")) +(assert (= z "uggcuucauggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 new file mode 100644 index 000000000..93396862c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTAGGCATTCAGACGCCGGCGTGTCACGAAGTGAGCGAGCATGATTCAACTCAAGGGCCTAACTTGGGAGATTGTTTATGCTCCTGTCGAACTCGTAAGGTTAAGTACCTCCAGCGGACTCTCGCCCTATGCAACACCATTTAAATAGTCAGATTGATCTTAGTCCCACTCGGCTGAGAGGACAAAGGGCTAGCAGATG")) +(assert (= z "gggauacguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 new file mode 100644 index 000000000..001411be3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAATCATGATGCACGGTATTTCGAGTCTGTTACTTTGATCGCGACTGACATCTTCAATCGGATGGTGATTTTAAATCGCAAGAATTTCCAGAAGTACGCGAATATAATCTGGTTTCGACCGGACGAGCTCGAAGCGAAACGCCGGATCAGCAAGCGGTCGAATTTCTGAGAGAGCGCCATTCTTCCGGGACGAATAATA")) +(assert (= z "cugcuuauuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 new file mode 100644 index 000000000..4932eb452 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTACTATCAAGCCGACCAATCACTCACGCACTTGTGGATTGGCAAGAACTACTTGAATAGCTCTATAATGAATACATAAAGCATGTTCGTGAATCTTGAACTTTTTGTAAAATCCGGCCTAGCGCATCGGCCCGTCCAGGGCTACAACAACTAAACTACCTAGCAGGTTGCCGATCGGTATGGGTCTGCGAAGTACTTGG")) +(assert (= z "ugaacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 new file mode 100644 index 000000000..3f5e89969 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGATAAGTCCCCCAAATACTTTCTTAACAATAAATCGGCTACTATACTCCGCAGCCCATAAGTACACGTATATTGCCCATCTATTTTCGCCAGCGTATCTTGGCGCCGGACTTCTAGTGGTGCAAGCCGGCTGAGAGAGTGTCGCATGAACCTCGCAGCTCTTTTCTGCGTAATCAGAACGGCACGTTCCTATAGTCAA")) +(assert (= z "uauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 new file mode 100644 index 000000000..02212a9e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGCAAGCATTGCGAAATTGGGGTCGTGTGTTAGAGTGTCTACCGTGATCGTGCATATTGAATCTGTCCTGCCGTATGTATGAGTCGGTGGGCTCAGAAGGGCGACAGAAGCGCCTTGATCATTATGGTAAGCATTCCCACAATCCCCATAGGAAGACCTCCGCGCTCCATCCGCTCTACCTTATAAGGTAAACGTTCA")) +(assert (= z "cacuagcacguauaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 new file mode 100644 index 000000000..db1b924dc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGCGCAAAAGTGACTCGAACCATTTGTTTAAACCCGCTACGCATTCTTCACTGAAGATGGCGGCCTGTGCCACGGGGAACAATGCATTATCAAACAAACAGTACACCCGTTATCCGATAGGGCCTCGGAACACTGCATGCGCGGTGGCCAAATTCCTACGAGTTCAACTCGGCTAGGGTCGACCGATTTCGAGCGATAC")) +(assert (= z "ugacguacgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 new file mode 100644 index 000000000..8d8a076cd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAATCTCCGACGTAGATTTTTAGCAGACATGCTCCCTGGCAGTAGTGTCATGGCTGGCCAAATTTTTAGCTTCCTAGCGCTGTGATCTGCAGGCCACCGCCCTGGTCGCTCCCCCTACTTCCGCCTGTAAATCTTCTTGGCTACAAGTACACGGACTGATGTTAGAAATTTAAAGGCCGCGGGCAACCTTGCGCCGACCT")) +(assert (= z "ggaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 new file mode 100644 index 000000000..b09fa66c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCTGACTGTACGCGTTCGACTGGAAGGGCAGGGACTAGTCGTGCACCGGCCCTGTCCGACTCGTTCACCCCCTTTGAAGCATCCGACTTATCGATGTTGCACGTCCGGTGGACTATATTGATTAGCGTGAGGCACATGTACAAAAAATGATGACATACCAACGGTCAAAAGCTCGTTGACATTTCCAGACTCTTGCTT")) +(assert (= z "agcacguggccgggacaggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 new file mode 100644 index 000000000..35a6337bf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACGTTTGCGACTTGATCGACCGTTCAAACCGTGGCCCCGGACTCAAAGTCTTCGCCCGTCTATTAGACCCCAACTTGAACACCTCAGAGACTCCACGATCATGTAATCGAGGGCCCAGTTCCCGCTGCAGGCACCTCATCTGCTGTGAGCTATGCGCTGGAAGGGTCTCATGTTGAGTCTTGACGTTGCCGTACTAGGA")) +(assert (= z "cgcgaccuuccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 new file mode 100644 index 000000000..ad2c6f7e2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCTCACGCTTTTACACGGTCTGGTCAATTTCTTCGTCGCCCCCTGCATGCCAGCCTCACAGTCGTTGATACCACGTAGTATTGCCAGACCTCTAGTCAAATAATATAAGTTATTTTGAAGCATGACTTTCCGTTCGGTCATATGGCGCAACGCTTCGGCCCGTGACTAGTAGGCAAACTGTTCCATCGTAGACAAATGT")) +(assert (= z "caagccaguauaccgcguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 new file mode 100644 index 000000000..b3c5cecdc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATCATCCTGTCCAGGGAGTAGTAGTAGCGTTTCACACCGTCTGTGTAACATATGATCGGGCATGGCCAGATGATATATTCCTCTAAGAGGAGCGAGGCACTAGCCACTCTCAATGCTGACTAGAGCCAGGCGTTAGCGGTCCCGTAAAGGGTTCTCTAAGTAGAATGAAGTACACAATAATATGCCAATATCTTATGCT")) +(assert (= z "cggugagaguua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 new file mode 100644 index 000000000..25b4eec4e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGTATCAACGACAACGCTAGTGGCCAGGCCTTACTAGGGACCGATAGTGAAGTAGTTAATGTCGAACTAAATTTTTAGGTCAACAAGAACGCCGGGAGTGTTAGTGTGTTGCGTACATAGCTGTGCTTACAGTTACGGGAAGATGGGTGGACAGGTCGATGCCGAATCAGACTACGGAGATCAACCGCGCGGAGCGACG")) +(assert (= z "cagcuugauuuaaaaaucc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 new file mode 100644 index 000000000..0526893ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCAGGCTGCAGACTCGAGTATTGTCAATGGCTCTTATGTTGAAGAGGAATGGCAGACGGACTGGACCGGGGTTAACGTTCTCGTGACACGCACAGTAGCGTTGCCGTAATTCTGAGGCAAAGTTAGCTACTTAAGCAACTGATGTATCGCTGGGCAGTGACAGAGCTCTCTTCTGTTTACTGAATGGAAAAAAATATCCC")) +(assert (= z "gagcucauaacaguuacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 new file mode 100644 index 000000000..629c142f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCGTAATTTGGTATGAATCATTGGACCGTTCCATGTTGCGAGTAGATAAATTATTTTGGCCACGTCAGAGCGAGGACCCCATGCAACGCAACCGTCGTTCCGCAGCCAAGCCAAGTCTAACCCTTCAGACATAATTGGAGTATCCTGTCTGAACAAACTCTTGAATCCCACTCTGTTAAGCACGTATATATACAAACA")) +(assert (= z "ucuguauuaaccucauagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 new file mode 100644 index 000000000..2cd944ea3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCGCCAGCGTCGTTGCTGCAGATGTTTAATTTTATGAGGGTTACTTCCTTCACTGGGAAACTTCCAATCCGTCATTCAGTCCCTACGATCCGTCAGCGGCCGCAGGTCGGAGACACACCAAGAGCACGATCCCCGGGACATGCAACCTGCGTTCTCATAAAACGTTTGTATAGGAGTTACTCCCAACTTACAACACCA")) +(assert (= z "gucuacaaauuaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 new file mode 100644 index 000000000..7d58c19b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATTGGTGTGTGCTGTTGCCCCGCACCGGTGAGCACGTTCTATACTTGTACAGGATTCTCGCACATTACTGACGTTTATCGTAAACCAACCCGTGAAACGCGCGTAGCACAATGCTGAGTCATAGAGGCTAAGGTAGATACCCACACTTCTCAAATAAGGGGCAGTCAGATTAAGCAGCGGTCCAAGCCCAAGGCCTTAC")) +(assert (= z "gggcacuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 new file mode 100644 index 000000000..65aa90b7b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCAAGAGAGACGAGCAGATCACTGAACTAAAAGATGTAGGGCCGCCGCGGAGAGACGCTGTTTCATGCAATAGAACGGGCACGCCCGGGGGGGCAGAAATAAGCGCTCCAGGGCGCAATGCTCAAGGGGACTTGCCGTAATGGGCCGTTGGCCTGAAGATATATCTTGCGCGCCTACAACCGCTAGTCGGACGTTCTGG")) +(assert (= z "caagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 new file mode 100644 index 000000000..2b952f82b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACAGGCAGGAGTGGACCTGCATCGACGGTAAGCAAACGTACCGCATGAAGTTGGCATCCTTAAGACTAGCTAATGCTCTAACCTTGAGGCGCTTGACCTTGTTTGGAGAACTTTTCTTCCTAGCCGCAATAAATGTAAGTGGGAAGCTGGAAGAGTGCTTTTCCACGACATGTTCCAGTCCAAATCGCGGAGCGACTGG")) +(assert (= z "uuugcauggcguacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 new file mode 100644 index 000000000..72e471720 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCCGAACTCCACGAACCTAACTCGTTCGAACATCGCGGCGCTCGCATGCACTGTGAAGATGCTAAACTGGCATGAGAGATTCTGAAAGTCCAGAGTGTAGAGCAAAATCTATTCGAGCACCGCCTTTCGTTTATTATGCAATCGCCATTCAAATACACTGCTATATTTTCCCGCTTTTTTTATAGGGACGCTTCCGCTT")) +(assert (= z "ucacau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 new file mode 100644 index 000000000..a07106325 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCATCTGGTCTATGTCTGTCTATTCAGGCTAGGTTATTAGTGGCGTTGGTCCTGAGTAAACACGGTCAGCGGCTCCACAGGTGATGTCATCCAAATCGCGCCAACCTAGCTCGAGAAGCCAAACGTGCGGGGTTTAGCACGCCGGACTGGACTAGACCATCTTCGAGTGCAGCAGTACTGCTCGTGCACGAACGCGAA")) +(assert (= z "acgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 new file mode 100644 index 000000000..0c06901df --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCTGCAGTTCGGGGCCTCCGGAAATTAGATGACCCATTTTTCTTCACTATTCTAGGACGTACAATATCTCGGTCTCATAAAACACTGAACTTTCATCTGACCCCGTTCAAATCTGAAAAGTTCCTTTCTGTTCCATCCACATACGTTAGAAAGCTGGGGTGGTTACGTGCATAAAGCACCGGTTATTTCAGTGGACTA")) +(assert (= z "cggaggccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 new file mode 100644 index 000000000..878663b6c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGAGCTGTTAAGATAGTTTCCACGAGCCGAGGATTTTGATCAAGTTGATTCACAGCTGTCTTAAGTGCATCCAGGTGCAGTTCACTCACTCTTACCAACTAAGGTGCCACATTAGCGCTAGCTGGGACATGCACTTTTACGGTGCGAACCAGGATAGCACCACGATACAACCGCATACAACGGGAACTCTTGGTATAT")) +(assert (= z "agaaugguugauuccac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 new file mode 100644 index 000000000..42ec0ee99 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTTTGTCCCCTTGAACACGCGCGTGGCCATGTCGTACTGTCCATTATAGAGACTCCCGCAGAAGCAAGAGATTTGGTATTCCTGCTTTTGGCTCTCAAACACCTAATTCCCGAATGGTTCCCTAGCGTGTTTAGCAACCCCGGTGGCGATTGACTATATCCTTGATTGACTCAATGGGGGAGACCCCCGAATAGCTGTG")) +(assert (= z "accgguacagcaugacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 new file mode 100644 index 000000000..98a5e5245 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATTTTCTCACAATGAGGCATGCTAAGGAATCAGAGACTCTTTGCGTCGCCGCTGGGACTCCTAAGGTCCAAAGAAATCGAGCACATGCAGCGGCCCTGGCGAGAAAGACACAGCTGTAGCGGTGGAACCACGGTTGACAATGATAGGTCAAGACTCTGCTTATATACGCAGCCGGCCTGCCATGATGCAGACGACCCCC")) +(assert (= z "uauaugcgucggccgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 new file mode 100644 index 000000000..afbb8754a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATAACAATGGAAGTAAGATTGGCTGCCAGGCTCTATCCAAACGGGTGCCGGAGTTGAGGATTAATACCTTTATGGTACGGAACGGAGCAATGTAAGTCGGCAAATAGCATTGCATGAGGAAGGGGTTTTCGAACTCATATAATTGTAGATAGATTCATGAAGCGCATCTCGGGCCCTTCATTAAATACCCGGTAGGAAG")) +(assert (= z "accaugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 new file mode 100644 index 000000000..68185ffeb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGCTGCTTTCCATATGTTGTTAGTCTCATCCTGTTCTGTGCCTGTGTATTGTGCATGGACATCTTGTCAGCTCGATTTGACTAGATCATGCACTACATTCATTTTGTGACGGATTGCTGCTTGGGAGGTGCGTGGGATGTCACACTGAGGCTGGCAGCACACCACGCGTAGATGTTCGCCTGGCCAGGGCGGCAACGTC")) +(assert (= z "acgaaagguauacaacaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 new file mode 100644 index 000000000..c92abd1b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGATATCTTGTTGAATTGATAAGCAAGACAAATTCGGATTGGGATATACCAACAACGCAGGAAGAATTGGTCTGAGCTAAAAACGCGTAAGGTGCTCCCGGTTTTACGCATGGCATAAGCCTTGAGGGTTTATCAAACGCAGACGCCAGAGGGCGTTGGACCAACTCTGTACAGCTTTATTCAAGCGAGGTAGTAGAACC")) +(assert (= z "cgaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 new file mode 100644 index 000000000..88e49deb1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCCGCACAAAGACACTAACCCCACAGCATCCTGGCTCCCTAATTGCCTTAAGTTTCTGTCTTGGAAACCCATGGGCTATTGTGGACGTACATTATTGATGCTGCGCTCGATATTGAAGGGCCCGCTAGTTGAACAACTCTTGGGCTCGGCAGCATTAGTGTTATATAAGAAATAATAGAATAACACTAGCCAACCCTTG")) +(assert (= z "cacaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 new file mode 100644 index 000000000..c6c198406 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTTATTGCAGCTGGCGGTTATCCACGCAGGCCCACTTTTTGCTTCGACTGTTTGGCCATCTAATAGCTTCCCCATTTCGTATCAGACAGCCGCCCAAACCTGAATCCCGATCGAACAAAATTTAATTCGTGCCCCGATGTCCGCAATCTGCTTTGTATTACGTTCGCCTGGTCGATCGGGGGCATACGACTAGCAAATT")) +(assert (= z "aucguuuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 new file mode 100644 index 000000000..74375d18f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACCAGATGTTAATGGGTGCGCCGACATAATCCAAGCAAGTACGTTGGTTCCACGGATACTGTGTTGCCTTGGATTGGGAGCCGAGCTTTGAGATATGCCTGTGACGTTGCGGGCACCCGTTTCAAAAGAGGAGGGGCTGCCTGTGCCTGTCTCACACTTAAGACGTGGTCTATGAATTCTGTTAAGCCAGTGTTTTTT")) +(assert (= z "cccgug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 new file mode 100644 index 000000000..a21754643 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGTCGGGGTTGTACGGCCCCGGGGGTCTAAGTGATTACATCTACAGTACAATGTTAGGGCGGATCCGTACACCTTGCACAGCAATCATACCCGGATTGCAAGTTATTATAGCGAAGAGGCCAGGAGTATGCGCATAACGACCTATCAACGGTCAACCCTACTCAATTGAGCTATGTAACGTCCCAGTACCACCCAATGG")) +(assert (= z "cggggccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 new file mode 100644 index 000000000..40c2d3504 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGCGTCCCTCCCGACTCACCTAACCACACTCGGAACCGCAGAAGGGAAGAGTCTGTGGACTGTATAACGATGCAGTAGTCTCCCGGCAGCGAGAGAGCCGTACGCATCGCTCGCACGGACACTGATGAGAAGACCGAGGGTGATTTGTTGTTCCCCGGTTACATCGGGTCCCCTAAAGGATGAGGCTTATCAATCTAGC")) +(assert (= z "ugacauauugcuacgucauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 new file mode 100644 index 000000000..faf766798 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAAGCGCATTAACCTATGTCTTGCTCCCTAGTCACTGGATCGTTCGCCTGCCATAGGCGAGCGGATGCAGCTCAGCTTCCTTGGTGTATTACCTGAGGGCGTTGCATTCTTTTGTCATCCCGATCTCGGATCATCGGGCCGTCTTTTCTCGCACGTAGTATGGTAGCAAGATCTTCTCACTCGAACTGCTAGAAATTTC")) +(assert (= z "guucuagaagagugagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 new file mode 100644 index 000000000..f22365d9e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAATTACTCCTGCAAACCCTATGATGAGTCAAAAGATCCCAACGTGTGATGGGTGTGCTGCTCACCGAACTAGCCATCGTCATGGCACTGGAAATAGCGGGTTACACAGGTATGGTCCCATTTGTCCTTATAATGTGGGACTACGGGATGTGGATCCCATAAGGGCCGTTCCCCAACCTTTGCGAAACGTCTGGACCATG")) +(assert (= z "gguugcaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 new file mode 100644 index 000000000..b1674ceff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACACGCACGTCCGGTCATACGGGCGGCGTCAGGCCACGAAACGTTGGACGGCTAATGAACTTGCCGTGGTTTTAGGTTGCTGGAATATCCTCACAACCAAACGCTTTGCGATTATATCGTCGGTCCGTTTTATTGACGCTCACATAATACTCTGCTAGGACGTTCGCGCAAGGTCCCGATTTAATTGTCCCAATGTAT")) +(assert (= z "augagacgauccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 new file mode 100644 index 000000000..5e7da9e09 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGAATGTTTCGAGGACATAAAGCAAGAGAAGCCCGATTCAAGTACACCCCTCGCCAGACTTCGTAAATACAAAATCGTCCTCAACAAAGGAACTAGAGGCCGTGGTTTCCAGGGCCTATCCAAGGCTAAGGCACAGCACGGACGCGAAGCAGCACCAATTGGGCGCCTGTGGTCTCATGGGGAGGCGTATGGGTGAGTC")) +(assert (= z "ggcaccaaaggucccggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 new file mode 100644 index 000000000..c69c8921a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGCTACGTCTTACTAGTTGAAAAGCATCCTTATTATGCGGCATAATCCGGGTAAAGCTAAAATGCCCAGCGATTGTAGGTAGTGTACACTCTCGTGCGCCCTATTGGTATATCTTAGCTCCAGCCACTTCCATATCTTATATATCTCGTAATACCAATGAGTTTCCATAGTTGGGATTGGTTGAAGACCGGGCAGGGA")) +(assert (= z "cgaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 new file mode 100644 index 000000000..95f9e0d61 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCACGTCGCCCCGTTCGACGGTTTTTGTGGGTCCGCTTCGCTCGCCGTGTGAACCAGGGGGGCATAAGCGCTATGTTGCCGCACCGCTCGCGACTCCCGAAAGGATACCGCGTGGTCACAGCTGTAGACTAATTAAACGGATCGGGTCACTCACAAGCTGAATTTCCGTTTCGCCACGTGGTTCGCGACAACGCGTTTC")) +(assert (= z "gcagcgggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 new file mode 100644 index 000000000..9ad224731 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAACTTTCCTCCACAGCAGAGTGTAGGGGAGCATTTACACAACTTCCTGCTGTAGCGAATGGGAGTCCTGCTGACCGGGTACGTGGCCAGTGCGATGCCACTCATTGAGTGTAAACTCGTACATTCGGTGAACACTCCGCTTGCATAAGTCGCTTTCAATTGACTAGTGTCACTCTTGGAGTATTGAGTGTAAGGAATT")) +(assert (= z "uacccucagga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 new file mode 100644 index 000000000..82eb7c640 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAGACGTGCCGCACAGAAGTCTCAGCATAAGAACGGATGAGAAATACTAGCAGTGACTTGTGAATTCTGTTCCCCCCGGCGACTGAGATGTATGTGTGCAAATCCTTCAGAGTCTTCCTTGACTACACAGCGGAGGGGACCTCCTTTGCCCCCAGCTACACTTCCGGAGAGTACCTACTAGCGCCTAAGGCAGGGGGAG")) +(assert (= z "cguuuaggaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 new file mode 100644 index 000000000..56109a165 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATGCTTGCCCTGGTTCGACGCTAGCAACGGGTTGAATTGGGCCCCGAGATCATGTTTAGCGTGCTACCTTACGTACCACTTACTGTGTCGCAGCGTTGGATATATTGCTTATGCACATATATCGTGCAGACCGAATAGTAACCCTTAGTCATGGATGTGGTACATCCTCTCTCACTCTTGGTAGAAAGACGGATCTCTT")) +(assert (= z "aucauugggaaucagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 new file mode 100644 index 000000000..16ea639c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGGCTCACACGTTCATCTTCCCCTTTGGTAGGTGCGCAAATCCGAATGTCGGGTCCGTGAACATTGGGTAGCCTGGTCCCGATGAAGTCTCACAGAGAACATCGGTCCTCGATGACTTAAATTAAAACTATGCATGATTACTACTTACCCCAAACGTACCAGTCCGGTAGGTCAAGCACGTTAGACGACGGAAGTGGC")) +(assert (= z "ggcuua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 new file mode 100644 index 000000000..43ccaa271 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGCACGATCCATAGATTACGTAAATGGACGGTCTGGGGGCAGGCCGGGCTGAGTAATTAGGATACACGATGCTCAGAGTTGCACTTGCAGACTTCGTGGGGTTGTCAATCAGAGACAGCCATTGTCTGCAGGAAAACAGAAGTCCATAAGTTGAGAAGGTGCTCGCAAGCACCACCGACGAAAATCAATAAGCCTCTAG")) +(assert (= z "ccugccaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 new file mode 100644 index 000000000..838cb60d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCAAGAAGATGTCAGCACCAGCCACGAGCGCGACCGGTTAGGATGGGCACTCGTCCCCCACCTTCAAGCCTGCACGACGTCCGGATTCCGGACCTCATACTGGAGTGCGGACACAGTTTTTAACGGTAAATCAAGGCCGGACAAGAACTAGTGCCGCGAACTGACTAAAATGTAACTGGTTGGTGGAGCGGCTGATGAT")) +(assert (= z "uuacauuga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 new file mode 100644 index 000000000..7ebd3675f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTTGAACATTGACAGTGCCGAGGTCCAGCTCGTAGTCGGTTTTGCGTGAGTGGTCTTCCCGGAGTTTAACCTTAATACAGTTCCACACTCGCGACGACGTTAAAGAGTGAGACTAATGAGAGCGGCCTCTAGAGGTTGTGAACTGGACCAGCAAGTGGGTTCGCGACTCTATGGCCCTCTAGAACTGCGTCATTGCTAG")) +(assert (= z "auuucucacucugau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 new file mode 100644 index 000000000..14b1ab6b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCAGGTGACCACTTAAGACACCCACGTAGCCGCGAGCAGCATATCTGAAGGACCATAGCGTGAACCCGATGCCACCTCCAGTTTCACTCCGCTTGTTCGCTAGCGTCGCGTGAAATTCTTGCAGGCAGGTCTTTGTCGGTCCGAACTTTCAATAATGAGCGGTATGGTACGAGTTCCAGAAATATAGTTCGCTTCGCGT")) +(assert (= z "auucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 new file mode 100644 index 000000000..2c0e9a379 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGCCTGCAATGGACACTTGCACTTTCTTCTAGGAGCGCGCTTCAACCCTAATGCATCGTTGGAAGCGCCAAGAGCACCAAGTTCCGTTCAGCTAAATCCGACTAGTGCACGTTCCCAGGTCGCGTCGACTTCGTACAGGGGTGCCATGATGAATGCCGCGTTAAAACTCTTACCCGAGTATCATCGCATGTAACGTAC")) +(assert (= z "aggcaagucgauuuaggcug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 new file mode 100644 index 000000000..3bbc353d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTCCTTGGTTCGATCATATCTACATCGGGATTATGGGCTGAGTATTCGAACGTGTTGTGTAGATCAAAGGGGATCCTATATACGCGCATGTGTAATGATGGCAGGAGTCAGTGCTGCTTAGTCCAATAACCCACTTGCTGCGGGATGCACCCGCAACCAGACCATTTCCCTTAGGCGCGCACAGATCTGATCAAGCTC")) +(assert (= z "ugcacaacacauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 new file mode 100644 index 000000000..5069b1719 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATCACCTGTAAGAGCTACCTGGAAAAGTCAACCACACATATCAACTACTCTTCCGTCTAAATTACGTATGGCGAGACAGGAAAGTTAAGAGAATGGACCTGCCTGGCCAACAAGTATTCGGGGGGACGTAGACACATCGTCGTCCAATGGTTGCGCGAAGACGATCACCTAGTGATAATAATTATGTGCAACGGACT")) +(assert (= z "uuuaguggacauuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 new file mode 100644 index 000000000..16d35521c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAACTTAGGCTTAGTTGGAAGATAGATTACATGTGCCTCCTGAATCAGAAATGTTTGCGTGGCCTGTTTCCATGCAGGCGTCGTCGTAAGCTTAAACGCACGCGGCGAAAGCTATATCTATGAGATGCCGACGTGCGTCCTATTATATGCACATTCGAGTATGGTGGGTTCGCAAGAAGTTAAATGGCATACGTGTTTCA")) +(assert (= z "cuuagucuuuacaaacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 new file mode 100644 index 000000000..36ae2fde7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCAAACTTAATGGGGCGATAACGTCTGTACTTAACACAACCGGCGGTACGTGTCATCCCCGTCAGACTTTTTGACTCCATGCCTTACGATCTCCTTTGCCGACAGTTCACTTATGGCCCAGCACCGAAGCCCGTAGTAACGGCGGATTGAGTTATTAGGATGAAATATCCATTCGATGGTCTACTGGGGCGGTGCAACG")) +(assert (= z "agguaagcuaccagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 new file mode 100644 index 000000000..d50faf050 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATCGGGACAACACGCTCACATGTACCTTTCCGCGGCCGAACAGTTGTGCGAGGTTCCGTTTGACACAGCGGCGTTAAACCTGCGGGTAAAGTTTCCCGGGCTGTGGAGAAGCTTGACACTCGTCTGAAACGGTGGCACAATTGCCCGACCCTTTGCCCTAGGAGGCGTCTGAGCCAGGAGAGCCACTCTGGTGATTGCG")) +(assert (= z "gucgccgcaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 new file mode 100644 index 000000000..77e37ae86 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGTTGAAGAGGGACATATAGGACCTAGAGCCAGTGCTGACACGGGAATGGTGGAGGTTGGATAATCGAGTCTGTCGTCCGCCAGGATTAGTTGGATGCTTGGTACGTTCATGAAAGCAGGGTCCCGTGCTCTGGACATCATGTGTGGCACCACGGGAGTATTAGATCCGCTCCGGCTTACCGGTGTCCGTGAGGCCACC")) +(assert (= z "ggcgguccuaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 new file mode 100644 index 000000000..1d22ca518 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGACCGTTGTTTACGAACTGTGGGAGTTTCTCCTTGGGTCGATAGGCTGTTCATACCCGCCCTGATAGAATGGGTTCTAATGTTAACACTCAAGGGAAGGTCACAGCTGAGCCCGAAAAAAATACATATACACATGGCTGGTCCCCCGCGCGAACCATGGTACCCGCGAATTATAAGCCGAGAGTGTTTTGGGGAGTTC")) +(assert (= z "acccuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 new file mode 100644 index 000000000..4a6c17db9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTACAGGTTTCATATGGTAGGGTCCGGGAATCCTCCTACGAATGCGCGTTCGGCTTAGTCACACCTGACCACTTTTGTAAGATTAGGCAAGTTTCGTACGGTCGACTTACAGCTAATCGCAGCCAAGTACATGTCTGTCTAGGCGCCCAAATACTGAAGTTTCGGCGACGCAGTAAATATGCATAAACCGACTCAGTATT")) +(assert (= z "aagccgcugcgucauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 new file mode 100644 index 000000000..a59b0255b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGCATGACACGGGAAGACTATGCACCTAGCTGAGCGAAATGTGCCGTCCGTCTAGCCCGACGGGACATGGTGCTGTCCGAGATCCGGTTACGCAAGAAAGTGACGGTCGGAAGTCCGGTCATCGGCGCAGAGTATCCTTCTGGGGGCCTTGTCCATTGACCCCAACCTAAAGCTGTACATATTGGCATCTTTACGCAG")) +(assert (= z "ugcgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 new file mode 100644 index 000000000..6eda17e35 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTATTCGAGTGAGGACCACAGAGGGGCACGGGGTCTTTAGAAATCGGTGCGGTAAATAAATGGAGATAGCCCGGTTAGTGCCACGACCTCTTTAAGGAAACTACCTGAGTCTCCCATTGTGCAGGGTGCCATGGGTACCGTTCCGCCATCTAACTGTAACTATGGATACCGATAAGTTTGTCGCGGGCGTTCTTGGTA")) +(assert (= z "ugucuccccgugccccag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 new file mode 100644 index 000000000..b11006314 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTAGTACACGAAGCGAAATCTGCCTACTATCCAAACCGCCCAATATTGTGTTCCCAAACCTAGTCTTACGTTGCTATGGTTCATCAAGACTCGAAAGGCGCAGCCCTATAAAGCAATCAAGAGTACACACGTCACCGGCGAACCAGCGTTGCCCCCGGAGTGTGACGCCGGCTGCCCGTCTACTATGATAAGCGGTGCGG")) +(assert (= z "gugcagug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 new file mode 100644 index 000000000..d37d97774 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGAAAACTGTATTCATTAGCTGGCGTCGAGTTGCCGTGCATTGCCTCCACAAACAGTGGAGCTGCTAATAAGACATACATGTGGCAGGGTGATTCATCAGAAGGGTTCATTGTGTTTCTTACCCTGCTGTTCCCGGGCACTCAGAGGCCTGGTACTTACCTGACGTGACCGCGGACCATGGCGAGCCCGCGTGAATAT")) +(assert (= z "gucuccggaccaugaaugga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 new file mode 100644 index 000000000..90f323dc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTTCAGCTAGTTGGGGGTACCACTACTAGTCGAGTAAAGCTCGCGCCACGCGAACTCTACCAGGAGTAGCACCACCAGCTTGACTAAATTCAAAGATACTAAGCACCGGTAACCATTCAGCCATAAATGGCTTTTAATGCCGGCTCCTATGCCATCTCTCTTATGGTCGGCGTGCAAGGAGGATGCACGGCACCAATA")) +(assert (= z "guuccuccuacgugccgugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 new file mode 100644 index 000000000..4e289d2f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCTTAATTACCCATCTTAAGCGGTCTGATCAGGATTCTGCCCAGGGGATGGGAACGTCCATGCAAATTAGGTAGTTGGTTCTGCGGGATTTGTATGTCGTGTTCGTTCAAGCCCAATGGGCTTCACACATCACAATCGCAAAAGGTCGTAAGCTTCAGAAATCCTGTTCATCAAATTGAGCGTAGGCTCCAGATAGATG")) +(assert (= z "cgcccuaaaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 new file mode 100644 index 000000000..b69146a3e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTAACTTCCGGTTACGTTAGATGGACGGTTTAAGATAGAGATATTACTCCGTCCTGCTGGACTATCTACGGAGTCGAGGCGCCATGCGGTCCCGTCGCAAGCACCTAATCTCACTCGTATTTCATCATCGTCTGCCACCCAGGTGCATGGCCGAATGTGGAGCGTTCACCGGGACTGTACTTCACTGCGCTACCAATGCC")) +(assert (= z "ucgcaaguggcccugacaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 new file mode 100644 index 000000000..6fc675637 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTGGAACGACGGGCACATCCCGTGAAATCGACTCAGGCTGAAGTAGTCATGAGCTAGAGTTGTTCACCCCGTTTGTCCCCGTGTACGGGGTTGTTAGCTACGGACGAATATTGGAAAGAACTTTATGCCTCAGTCTAACGTATGCCATTACTGGCCGCAGGGCTGGCACTAGTCATGAACCTGGAGCGGGTTCTCTGCT")) +(assert (= z "acaaucgaugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 new file mode 100644 index 000000000..a6ea81eba --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCCTTAATATAGACTGATGCTATTTCAAAATGGCAAATGCCTTAGTTGATATTATAGTGGATTGATGGATCTGTTGCAGGATATTATGATGTTCGATTAATGGGTGGGCTTTCCGCATTTCATGGCGTCCGATTCCTGGAACGGTATAACATAAAGAGGGATACGATAGAGTGGCTGATAAATGAGAATTGAACGGAA")) +(assert (= z "agacaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 new file mode 100644 index 000000000..839faca9d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGACCGTGGCACATGTGTCTCGGTGAGGCACCGATAGGGTAATTTACATGATCCATGCAGCTACCAGCCATAACGTAACGTGTAACCGAGAGGTCCCATCTCTAACTATCCATGTGGAGTGTTGCTACGCACAATTCGATAGTCTTGCATGGGGCATGTGGAATCATGAGGAATCATTAGGTCACAATGGCCAAAGGGA")) +(assert (= z "uccaguguuaccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 new file mode 100644 index 000000000..1b4594931 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCGATACCTTTGCCTGCCCCGTTCTCCTTCTAGCTGTACCCTAGTTTGTTTGCATAGAACAAACGCTGGCCCGGGGAAGTTGGTTCTGTACTAAGTAGTCTTTCACATCGCGTTACTGGGTGAGTCAGCCCCAATGATTCACAGTATAGCAGGGACCTTGCAGGGTACTACGGTTTAGCAAGAATGCAAAAATGATCC")) +(assert (= z "acguaucuuguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 new file mode 100644 index 000000000..c67115127 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCAAAGACATGATCGGGCTGGTGTCAGTGCCTTGTTAGAGTCTGAAAAACGAGGTGAGTGCAGTCCCAAACTTCATCCCTAGGTACTCCAGTGGTTTTTAATGGCTCGTTGACGAACAACGAGGAGCTGCGAACCGGCTCACGCGGCTTGGGCGGGTAAGGTCGTTAGGGCTGCAACTGTTAGACCCTGTTACGAGCTA")) +(assert (= z "cuuuuugcuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 new file mode 100644 index 000000000..c9227b18d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTATTCCTCTTTACTTTGAGCCCGGCGCTCGCGGTGATCATTCCTAGGACTCATCTCCAGGGCCAGTAAGTGGAAACCGGGATCGACTGTCGTATACTGTGGCTTCCTTCGTCCAATGTGCTCAGTAATACTTATCCCAATCCATTAAAAATGGCAGGGCTCGTCCCATTCTGTATCTTGCCTTTACAGCGTCCGTCTA")) +(assert (= z "guaaggauccugaguaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 new file mode 100644 index 000000000..15d5158b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAAGGCGTCCAATAATAGTGGATGGAGAGCAACTGTCGCGCCCAAATGTGGGTAGGCATAAAAAGCTACCTTGCATTAAGATTTTATAACAACAATCCAGAAAATGTTGCAGTGTGGGACCCTAACTCCACATGAATTTTTCCATTCCGTAAATACGGGAATGTTAAACAGACTATATGGTTAGTGGCGACAGTCAAGG")) +(assert (= z "caguucc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 new file mode 100644 index 000000000..21f922e91 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTAGTGGCAATCTGAGAGCCTGTCAGCCAACTCCGAGATTCTAAACGAGAGTGAGGGACAGACTAGGCTTATTTCTCCTCCCGCTTTATGGCCAGTAGGGGCGCACGAAGCCACGATTCGTCTAAGGATTTAAAATTTCCATACACGCTTTCAGAGGCGTTTAGGTAAACATGCTGCTAAAACATGTTCAACGAAATGTT")) +(assert (= z "uguacgacga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 new file mode 100644 index 000000000..1464d22a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGTAAGAAGGAACGGCGTAACAGTGGTGCGTGGAAGAACCTCCTGAATTACAGTGGCGAAGAACATAAGTAGGATTTCGCGCGGACTTTTTTCAAAGACATCATTTGTCATTCCCACTGTGAATCAGCCGATTGGATAACCCTTAGTTTATTATCAGATTCAGAGCATCGGGAGAGAAGGAAGAGTGTGGGAGCCGCG")) +(assert (= z "aaauaauagucuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 new file mode 100644 index 000000000..ad82a39df --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCCTCCCACCGCCCTCGGACAGCACGGCCCAGACCTCCTCACCGTGGCTCCCCTTTCGTGACTAGCTCTCCCACCATCGGGTCACTAACTCTATGTAGCAAGTTTACGAATTGTACCCCTACACTAGTAGCAGCCACGTTAAGTGACAGAGCGGAAAGATCCCGCTAGCACCTTAAAGTCGTCAATGCGTCCCTGAGCA")) +(assert (= z "cucgccuuucuaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 new file mode 100644 index 000000000..4ec312a6e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGTTTTTTTGGAACAGAGACTGCAATTTACGCTAGATAGGTACTAGATATCGGATGCGAAAATTACAGCCTCTTCGATGCCGCTGAGTGGCGAGGAGGAACTCGCCCCTGTGTGCAAACGTGTCCGTTAACAATGCGTGCAGATGTACCCGCAGCAACTGATGCGTTCTAGCCTCCGACATAGCATACTCGCGGTTCAT")) +(assert (= z "uugucucug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 new file mode 100644 index 000000000..b53246f9f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACAAAGGGCTCATTCCGTCACCCAGGTAGGCTCTGGCAACATTCCTCAGCAAAGGCGACAGCTGCCCTCCGTGTCTTCGCCAATGGTAACATTCCTGGGGCGAACGCTGCCGTTACCATCAGTAGACGTACCAACTAGTATTCTAACTCAAAAACCCCGCGTTTTTGGGACCCCTACGCGCATCGAGCTTTTTTACCTT")) +(assert (= z "gcgguuaccauugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 new file mode 100644 index 000000000..5e29164cb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCTGGGTCGGACGCGCTAGGATCGTCGATAGCGAGCACTGTCGCTGCTGAAGAGCTCGCGTGGCCCGACGACCCGCGAATCGTTCACGTGAGTCATCTCACAAATGATACACCAGGTTATGGGATCGCGTAACGAAGGGAAACCTACGACCACCTTTCCCAAAAGTAGAACCGAATCACCCCGCGTGGGTCCGATAATT")) +(assert (= z "gaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 new file mode 100644 index 000000000..5c6271aa5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGGTGCGCCGATATTCGGTCCAGCTACGGGGACTTAAGTTTCTTGTAAGAGAGGGGACATAATTTCCCTTCCGCTGCGGGCGGCTTATACTGCCAGACCAAAAAGTATCCAATACTGCTTTAAAGGGCTTAAGTATTCTCAGTAGTTTTGCGATCAGACCGACGGTCACACCCAAGCATGGGACGCGACTCCTTACCA")) +(assert (= z "gcgacgccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 new file mode 100644 index 000000000..d767a286a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGGGGCCTACAATCCATAATAAATCGCCGTGCTTGACCGAACAAGGTCGGCCGGCAAACAATGGGAGCTATCGCTTTGCCGGCAACTAAAGGAACACCAAGTCCCGACTATAGATATGTCCGTCAAGGTATAGGAATCTGGCACGGCGCTCCAATACCCCCCGTGCTGGAGAACTTAAGGGAAGACTGAGGCAGTGGTG")) +(assert (= z "auguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 new file mode 100644 index 000000000..5d4f92b98 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCTCGAGCCACCCAGACGGGGTTTCTCAAGTCGTGAACGCTCATTGCTGCGTGCGTGTAGAAACATTCACCTTGGCACCGGGCTCGCCGGTGGGTCGCAGTACGGCACAAAATTCGGGCCATTAATAGCTATGGGGCGAGGGGACTAAGGAGTCTCCGAAGCGTTTAGCTTTACTCGTATCGACCATAAAGGTTTATC")) +(assert (= z "ccgcuccccugau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 new file mode 100644 index 000000000..4cdb9349c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACGCGGGCCTGGTCGTATGATTTTGACCATGCTTCAGTCGAAGTCCGGAGTCAATCGACCAACGTTCGTGACCTAACACGTTGCGACCCGGCACGTGTACACATTTGAGGTGCAGAGCTGAGGTGAATGCTTGATACCAAATGCGCGTAGATGAGGCCGGTCCTACTAAGGTCCGTGCGCCTGCTGTCCCGAGTAATT")) +(assert (= z "ccacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 new file mode 100644 index 000000000..bacb3f69e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCACGAGTCAGGGTCGTGAAAAAGCCGAGCCGCCCCATAACGGCGTTTATGTACCAACATTTTAGTATCAGGGCCAAGAGACTATCTAAGCGCCCTATTCCCAGACGGCCATGCTGCCCGCACTGCTGCGGTACGTTTTCGTTCCCAATATTGGACTCCACCCTCTTTTCCAGTTTATCTGTGGGTATCCACAGGCCC")) +(assert (= z "acgggcgugacgac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 new file mode 100644 index 000000000..d13a79e12 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTCGACGCATATTCTGATATTCGTTTCCAGTGGCACAATTCTATTAGTAGGAATGCACGTACACCATCAATGGGGTGCTATCCACTCATTAGGATCACATCTGTGTGAGTCTCCGGCGGTTGTAGGTTAGCGCACAATCGATGCCGAGCGTAGTCGACATGGACCAGCAAAACGCGGAGCATCCCAATGAATCAGCCA")) +(assert (= z "gauaggugaguaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 new file mode 100644 index 000000000..71c438384 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACAGCAGACTTACAGGATTCGAAGGTGCCATGCCCCTTGCCGGTAAAATTTGGGTTTTCACGTTTGATGCGGGAGCTAAGTAAGCGTTGGAGTGCCTCCGATGTACCCGCTGACCTCCCTCTAGACAAGTGGATCTGACGTCAAGAAAACCAACGACATTCGTTCATGGGGTTCGCAGTCATACAATCGGGCCCTTTC")) +(assert (= z "gaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 new file mode 100644 index 000000000..0b1e4000f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACTAAGCCACATTTTAGATGTGGACAGTCTACTTTTTCCTGACACCTACCTAGATTATATGTTCAGGAATAGTTGTTATCTTCGCATCCCACAGTGTTCTGCACAGTCTATCCGAGCGCGCATCTCGCCGACATGGTGTCTAAGGCAATGACAGTCTAACCACTTCGCTTAAGTCTCACCCTAGCTGCTCTCTCGTGGG")) +(assert (= z "ucgguguaaaaucua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 new file mode 100644 index 000000000..81408ddbc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATATGACAATTCGACCGCCAACTCTGGTCTGCGTGTTACCCAGGGCCGGGGTAGGAGCCTGGCTTCTGTGTTTATGAGACGGACATACTCTGTTCCTTCCCTTAACCTCCAAAGTGGGCCCCCCCTAAAAACTTCAGTGCGGTGTCGTCGTCTAAAGGCATGTCCCCTAAGTGAAATGGGAGTGAGATTGATTTGTCAT")) +(assert (= z "uggcgguugagaccagacgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 new file mode 100644 index 000000000..7ed6c6d37 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAGTTCAAGATAGGACAAGCGCCACCATTAATCCTCTGGCCGCAGCATATGGACAGGAAGAAATACCCGTGTAAGAGCGCTGTTCTCGGAATAACTCTAATTAGCAAATAGACCTACGTGCCCTGGTAGAAAACGTGGATGGGGACATTTGCTGTCCCTAAGGGCGAAAGCGTGATTTCCTCCATTGCTATTCAAGGGG")) +(assert (= z "guauacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 new file mode 100644 index 000000000..eb98e2a0b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGGGAATTAGTCCGGGGGACAGAAATAGCCAATGCATGAACCAGTCTCCGCAGCCTCAGGCCATAGCTCGTACACGCTAATTCAATCTCCAACATTCCGATGGGCTTGCTGTATGCATTATTGTTGTAAATGAGGATTAGATTGTAGAATTATCAACTTGCAGGAGCAAGTCTCGAAACGAGGCTGAGGAGCACCTCA")) +(assert (= z "cguggagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 new file mode 100644 index 000000000..f1cc86038 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTTCGCCCAAGGTTCTTCCACTAATGCAGCTCGTTAGGGAGGACGCCCGGGAGTATCGGGGCTGTGCTACCGGGCATGTTGTTTCTGCGACATGGGATGCAGGTACTATAGGATGATCGACCTAACGGTATCTGCGCCTTCGATGAACGAGCCCCGCCTGATTAATCCACCACCATTTCATCACGATTCCGGAATTACC")) +(assert (= z "uugcucggggcggacuaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 new file mode 100644 index 000000000..d3dc84489 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGTGGAAAGGCGTTTCTTATCTATATCCCTATATAGGGCCACTGGAGTGAATGCTGGCCCCTACCTCGCAGACTATAGCGTTTCTACAAGTGCCGTCTCAGGTAAAGTCAAGCCAGCCAGAGATCTGTCATTCACCGCAGTGCTGATCTGTTCTTATCGATATATTTTTAGATGCTATGCTCCGTTTTTATTCGGCTT")) +(assert (= z "aguggcgucacgacuag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 new file mode 100644 index 000000000..96abe2751 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACACGTGTGTGTACACAGTCCCGTACAGTGAGACGGGATAAATAATAGGAACTACTTACCTTGCGTTCCATTCAAAGTGGCGGCAGAGTGACCACTAGAAGTGCGGAACGCAATATCCCGATGATGGGTCCCCGCGTATGAACAGCGCGTCGAAAATACAGTCAGTCTGTTCCCACCTTTCCCGTTGGAACGCTATGCAA")) +(assert (= z "ugucac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 new file mode 100644 index 000000000..1d58a9e08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACTAAACCAATAGTTGGTTACTGCGTAGGGACTCGGAGCCGCAATTTAAAGCCGACTTTGGACGCCCTGTGTGATCCCGCCGCGCCCTGGTGGCTCAAAATTCGATGCGCGCTGTACCCAATTCCTCGCGGTGACGATCAAAATCAGCTGCTGGATGAGGTTACCTGGTTAGCACACCAGATGAAGGCTTTTCTGTCCC")) +(assert (= z "ccucggcguuaaauuucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 new file mode 100644 index 000000000..4881c34a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTAATGCTGCCGCGGTAATACTCCTTTTGTTCGCGCTCATAGGACATTGAGTAGTTAGTCAGAGTAAGCGAACGTTTTATACCTGTATGCGTATTGCTGGGCCCGGAGTATGGGTAGAAGTCTGACCGCGGACGTTCGTGCACAACCTGGTAGCAAACCCGTCCTAAGTAAAGTCGGTCATTTATAACAAACGTACTCGC")) +(assert (= z "caaaauauggacauac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 new file mode 100644 index 000000000..584eb64a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCGAGAATTCCTCCTTTCTCATCTTTTATCACTCTCTCGGCGCGGTCGACTTGTGCACCATCACGGCGCGACGAGACGCATAAGATTCGAGGATCCTAGGGACCATGGAATTTGTTTGTATAAGAGTCATGCCTAATCCGATATCAGACTCATTCTGGCGTCCGCACGCAAGAATACGGTTTAGGCTCGTATGTGATA")) +(assert (= z "uaaacaaaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 new file mode 100644 index 000000000..d067b456d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTATATTCGTGCAGTGGGTGAGCCCAAGGAATTACACGACTCTGGGCCTGCCCTTTATTGAGACAGTTTACTGAATATGGTCATATAAAACTTGTGGTTTACGTTCAGAAGTGCTTCAGGTATCTAGGTGGCAGTCAATGGCGCCAGAGGGCACGGACAGCTGGTATTGTCGCGAAGTCTCTGGTTCCCATCGTATTTC")) +(assert (= z "accaguauauuuugaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 new file mode 100644 index 000000000..6765cbb92 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGGTCCAGTGACGAAGCGACTAATGATCCCCCTGCTTCCAGCGATTGTAAATAACACCATGGGCGATAACCCGCTATGATGATGAGACTATGACCCCTATACTGCGGGGGGAAGTCAAGCAGTCGCTGAGTGTTAGCCTGCGATTGAATAATATGCGGCCACGGCACTAACCCCGCCCCCCGGTTATAATCGCTCGTCA")) +(assert (= z "uugggcgauacuacuacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 new file mode 100644 index 000000000..f39e784ac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTGCAGTCAACTAGAACGCCCTTGTTAACCTCCACCGTTTCTTCTGCAGATCGTATGTGGTGTTTCGTTTCACGTAGAGTCTATAGTGCCAGATGGTGATGCACCCTTCCAACCGGCGGTAGTACGTAAGGTAATTCTGAGGACGAGTTTCTTGGTCTTAATAGGGCATGTTCTCGCTCCCAGACCATTCTTAAAAAT")) +(assert (= z "uggag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 new file mode 100644 index 000000000..3a4fd9c7d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACCTAAGCAACTCTTCGAGCGTGGGTTCATAGGCATGTACGCAGTCTGCCCTAGCATCCTCTTGACATTTGGGGCATCGCCTGCTTACGATGGTAGGTCCATTTGAACAGCTACGAAGGGCTTGCCTTTATCTGGCATTGATCGCGACCCCACAGCTACTGTATCGTCCCAGGCTACACTAGTTACGACAAGGTATCAC")) +(assert (= z "gagaagcucgcacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 new file mode 100644 index 000000000..a3c091bbf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGATAGGGGAATCATACGTTATACACACGCAGGCTCGCGAGTACGGCGACGAGGCATATGTAACTACGATCATCATAATGCCATCGTTGAACAAATTACAGAATTGGTCATGAACCACAGTCGGGCGCCCAATAGGGAGGTAGATGCTCGTGCTCCGCACGCGTACCCATCGGACTACCTGTTGGGTCGTGACCTGTGAC")) +(assert (= z "aguaugcaauaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 new file mode 100644 index 000000000..80171e6cb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGATGTATCACACAGCTCGTCAAACATGGGGCATCGAGCAGAATCAGGCTAACCTTCCTCTGGATCCTTCACAGCAGGTTGATCTAGGAAGCTATGACTCTTTGGTGTTTAACTCGATCGGGAAATCGTACGGAACAGTTCACAAAAGGTAAAATTCGTCGTTACGTAGGTCGAATGTTGCGATTGAGGGTTGTTTGAT")) +(assert (= z "cgcuaacucccaacaaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 new file mode 100644 index 000000000..cd873545a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGGTTTAGTTCGCTTATATTCGCGATAGTCCGGTAGTTCGACGACATCCAGTTGTGGCTGAGTTGATACTAGTGCCAACGAAGTGTTAAGTCAACTGGCGAATAGAATGGCTCGGGTAATTGAGAGCCATTTACCACTCCTGGAACACTCGGTTCCGGGAGGACATGCTCCCCGTCACATAAAGTGCCTACCAGGGGTA")) +(assert (= z "uccuguacgaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 new file mode 100644 index 000000000..784e2cda4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCTGAACGAATAATACGCGCAGGTAAGTACTCACCTAAAGGTTATGATCATAATTGGACGAGTAAAACCGTCACTAGATCTGGTGGACACCCCCAGTAGTTCGTAATGCGATAGCCAAGTATTCGACATTATTTTTCCTTTTGATACTCATTCGTTCGACATGGAATACTCTCCTAAAAGCGGCCTGAAGTCCTCGAC")) +(assert (= z "caucaagcauuacgcuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 new file mode 100644 index 000000000..a9248c131 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTACGAAACAATAACTCAAATCTAGGAGATTACGGAACCCAGACTAACTTATAACACTATGCCTAAGCAGGACCCGGGTGTTATCCTGGCGGTCATAACCTAAGCCGGGGGGTAACGTAGGTACTCCTACAACTCGATAAATCAACCTGGATAGCGTCTAAACCGGAATCGTCGGAAGGTATATACCTAATCCAATAGC")) +(assert (= z "ccaguauugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 new file mode 100644 index 000000000..9b0b7807f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTCGTTAACAGGCCGGACCGAGTACGGATTACCACGGTATAATCTCTCTGGTCCACCCCTCGCATCGGAATGGCAGAGCTGAGCGGTCTTTGCCTTGCGGGGTTTCCAGGACCATTAACAGAGCAGGTCAATGTTCCTTGCGCCATCACGCGACGATATACCCTTTTAGGGTAATTTTGTTGTTCAGGACTTAGAATAT")) +(assert (= z "ucaugccuaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 new file mode 100644 index 000000000..c26b2b28b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGGAGCTAGACTACTCTATAACACCAGTGCAGTCCTTTAATCCGTTTGCCTCACTATACTGGGCCGAACAGGGTCCTTTACATACACAGGATCCATCTTGGTCCTCAGCAGTCACAGGTTTCATTCCAACCACGCTAGAAGAATGACACAAACCTTTGTGCAAGAGCGTGTGAGCGATGCGGTCGGTTGACTGTAACCA")) +(assert (= z "ucagug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 new file mode 100644 index 000000000..b54713038 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTCATCAGTGGATTAGTTCAAGCACCCGTAGCTCAACGTTGTGTATTTAGTAGGGATAGACTTACTAGTCATATCTAACTTCCGTGGTCTCCCCAATGGGTTAAGATTCGAGGCCGGATTGCCTTTGAGGCACCAAAGATCGCGCTCTTCACCGTCAAGCTCTGTACTTCATATCCCAAACCAAATTGAAGAAGGGCCT")) +(assert (= z "cgcgagaaguggcaguucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 new file mode 100644 index 000000000..3bc0a91b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGACGTCAACACTTGATCGTGCAGCCAGCCTGTCGGAAGCAACGTGATCAAGGTGCTTTTGGATTTGTGAAAGGCAGCGCTCACTGTGTATTTTTGAGGCCGGAGAATTACAGCAAAATGTAGAATGATGCTCGTCGAACTTTATTCAAGTCACATCTCCAGCTTTTGATTGCACAATGGTTACAACCGTGCCAACTGTA")) +(assert (= z "accaauguuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 new file mode 100644 index 000000000..8eba8e09d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCCTGGGCGTGGCGGGATAGCGTACGCGCTGGGGGCCCCTACAGCCCCTTCGTGTTGGACTCCCGCCTGCATTACCGCAAGTGGCCCAAACCGCAAGTTTGGGACGAGACATAGGGTGAACGACCCTTCGAACTACAGCTGCACGCCTTACTATTCAGTGGCACGTATTTAGCACATTAGCGTTTTTCGCGCATTCGTT")) +(assert (= z "guguaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 new file mode 100644 index 000000000..79adfa3db --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTGCCCTTAAACCTGACACGCTTTCAATGGAGTCAGAAAGTCTCACTGGATTGCCACTGATCTCATTCCTCCAACCTACCAGTAACTGAAAGGCAGGCTGGCCCCGGTTGAGTGTTGAGATTATCAGATTACTAAGCCTGCGTCATTTATGGGTAGTTAGGTTATGGGGTGGGAGGCTGCGTCTAACTGTATGGCTAGC")) +(assert (= z "gugacuagagua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 new file mode 100644 index 000000000..481494c2c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTACGCAAGTAAATCGCTCTACACATGTGATAAGGTCGACATGGAACGCCCACTTATTGCACACGCCATCCCCCCAACTGGCATAACAGTTTCGTCTGTAATGATCATAGGTGCGTTCTCATCGCAATTGGGCTGATTTTTCGGGGTTACTCCAACTGTAACACAAAGGAAGCGTAATCCTCCATCGCCGAGACCCGAG")) +(assert (= z "gcaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 new file mode 100644 index 000000000..f898fe4fd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGGTTGACAAATCGACGTAGAGGGTTGGCGCTAGGGTCCCACTGAGCGAGGCATGTTTGTCCACGACGGATTGCAATCACTGTTAGGCACTCCGTCGTCACGATTGCGTGCACAGAAGTCAACTGCTGATCACGGTTGATACAAGGATAATATACCGGGCGAATGAAGTGGGTCGTACTTTCAAGCTTCCGCGACGTAC")) +(assert (= z "uccuauuauaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 new file mode 100644 index 000000000..da476aa38 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTAGGTAGAAGGTATCCAGGTTACCTGACGGGGTGTCCAAGGAGCTTACTGTCGTGCCATCGCATGCCAGTGTTGCCATGCTCTTCTAACGGACATATCACGAGAGAGACCAATGGACGATCCAGTTAGTGTTTCGTACTGGGTCGGGCTCGGAGGACTCGCCTACGCATAGTGTAGAAACCGTTAGGACATTTGGAGG")) +(assert (= z "aaagcaugacccagcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 new file mode 100644 index 000000000..2d9809ae7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCATCGCTCGTGGTAATGTGCAATGATTGTTGCAGAATCTAGGGTAATCTCCAATTAGCGTTCTCCCCGCAATTCGAACTAACTTTGCATTAGCGGTCCGTTCTATAGGGTGAATAGGCTTACCCCTTAGTTTGTTATGGTGTGAATACCGTCTTCGCCTGACACGTGGTTCCCGGCGCTAATCGTGCGTACTCCCCTAA")) +(assert (= z "ucccauuagagguuaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 new file mode 100644 index 000000000..0c889d586 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTAAGGAGGTAGGCTCAGGAGGGTGCGTGCTGTTTCCCTCGGGGGTAAGAGGACCTATGGCAGTATCCGTGCTTAGTGATTCTCCGGACAGAGCCTATTGGGAAGTCTACTATACGTGAACCTTTATATCTCCGCGTGCCATGCCCGATTAGGGACCTCAAGCTTGGATTGATGCTGCGTCAAACGATCTGACGTTCGG")) +(assert (= z "gucauaggcacgaaucacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 new file mode 100644 index 000000000..e22dc496a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCAATTTCAAGGGATTCACGAATACGGATTCGACAAAAATGCATGACCTGACACCCGATCATCCAAGACGTGAGTATCCAACGGTACGGAGGTCGGGACCGGGCATTCCCCCCCAGACGGCCTGTAACGGGGTTGTGTACTACTACCTAGCGCTGAGTCCGCGCACTTAGTATGACTTCTTAGGCGCCGGACGCTATGG")) +(assert (= z "cccguaagggggggucug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 new file mode 100644 index 000000000..83856b3be --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGTGATCGGCTGGGACTTTTACGAGTATGACATAACGTTCCACTGGCGCCCCGTGTTAGCTAGACCTTCGTTAACGGATCGTACTCAGTAGTAATAGGTGTCTCTAGGGCGATTATGTTACGAATTAGTCAGGATAGGGGGTGTGACTTATCTCTTGAAGGTGGCGGCCCATGGTGGAGACGTCCTATCACTGGCACTA")) +(assert (= z "guaccacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 new file mode 100644 index 000000000..db1750ef9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCGCGCTCTCGGTGTTGGCTTTAAATTCTTTCGGCTAAGCGGGAGTCGGGCTTCGGTAAAGAATAGCGGTATGTCGCCGTTCCCATCAGCTTGGAATAGCCGGCGGAATTCGAGCTCCGTCCCGGTACACGCTTCGGCCGATCAGCGACATGGAGTCGGATTACTTTGACAAGTTGTTACGCTTTTTGGAGATCCCTG")) +(assert (= z "caugugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 new file mode 100644 index 000000000..2b4ec0a9f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACAGCTTCCTTGGGCGAGCAAGAGGACACTCTACACCTCCGATTTTTACTAGGGTTACTGGTGCCAGGGCAGCATGATCCCCCTGTTGCAAGTAATTCTTAAGTGTAACAGAGGGCGACCTCGTCTAGGTCCTAGCGCATGACAGGGTACGGGACGATCCAGCTAGTTTGAGACCGGTAATCTTATATCTGCGACAGCA")) +(assert (= z "caaacucuggccauuaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 new file mode 100644 index 000000000..2889843ff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAGAGCAATATTGTCACGGCAGGCTCCCTTCGCTTGTGTATTTAACGAACGATGCTGGTACGGTTTTGACGCGGTATACAAAAACTGGGCCAGACAGCCTCTTCATCAAAGGTAACATTTAGGTGATAAAAACTGCGCAGTCACTATCAGTTCTCGCAGATTCGTCTAGATAGCGCGGACTTTCTTGAAGCGACACTGA")) +(assert (= z "gccuga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 new file mode 100644 index 000000000..485b27dac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAGCTCCGCAAGAGTGGTCGGTGGGCCGTATTTCTGTCTATACTTACTAGCCCCGGGAGCAACCACGATCTCCACCGGATCCCGCCACCATGGAACTTCTGGAAGGGAGCTCGACGCGAGTCGCCCCCTGGGAAGGTGAAAGCGTCCCCTGGTTACTCGCCAAGTCGCCTCTTGTATGATTTCCTTGAGTGCTCACGCT")) +(assert (= z "gugcga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 new file mode 100644 index 000000000..a1ca61714 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTGCGCTCTCGAAGGATAAATCATCCCTAGCGGATTATTTTGCATATGATTGAGGCGCGAAAATCCGTCAAGTCAAATCCGATATAGACAAGATAGAGGGAAACGAACTTTGGTTTAACCGTTGAGGCTCATGTGATCTCCGACTGTACGGGGAGATACAAGAACAGATAGTTTTGGGAACGTCTACTGTGGACAGGCC")) +(assert (= z "gaggcugacaugccccuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 new file mode 100644 index 000000000..6a39fbab9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTCCTGGGCCGGTGGAGTGTCGGCACAAGATCGATCAATGCACCCTCGTCAAAATCACAATTCCATGTATTTGCCGGCCAATTTCCATCTGCATTTCTTCGGCCCCTGGACGTATGAAGGGTCACCCTCTATTCTGAACTCACGGACTCGTCGCATTTGCCTGTCCAGCGGGGGGTCCGCGGCTGCACGTTGTGTCTC")) +(assert (= z "agacguaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 new file mode 100644 index 000000000..ec4afd98a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGCCCTGGGCTGTTTCCGGGCAAGACGGTGACGATTAATTTAACGAAGTGCATTCGACCAGACTCACGCCTTGTTTATATTTGTGTGATAGGTGCTCTGGCTTAAGAGTCAGAGATTTGTGCTAACTGACGGCGTGTTGCACTTGTTCGTAGGGTCAGGAATAAACTTGCTACCTCGATGTCCCACGAGTACAAACAAC")) +(assert (= z "gcccguucugccacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 new file mode 100644 index 000000000..8142c7a56 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAATACGTGACAATTAGTACAGTTCCGATAGGGCTACGCTCTTCTGTTGTCAATCTAAGGATGATTTTGGTATGGGTTGTCTCACCACGGACCCTATTGATGTTGCATTAATTTTTCCTATTCAGTTGTTAGGCTAATTCAACCAGAAGTGGGCAGGCCAACACGACGCTTCTGCCGACGGCAAGTAAACCAAACTGGTG")) +(assert (= z "uugaccac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 new file mode 100644 index 000000000..e1d7186f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATGATCTGTGCACCATAGCATTGACCATCGGATCCCCCGGCACGAATCGACGTGACGGCAAAAGATTATAAGCAAGCATTCTTCACATCATAGTCGGGTATGCGAGCATTGATAGTAATGACTCGTTATGTCCTTTAGTCCTCCGTATGTCTGTAACGATTGTTTTGCTCTCGTCGACCCTTATTTTTAACCAATAGCG")) +(assert (= z "cuaucauuacugagca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 new file mode 100644 index 000000000..450e3d245 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTACTTAAGTTGCGGCATGCAGAAGTTTTAAGCGTGATGTACAGTGCCGACATTAAGTTGTCCCAAACTCTCTCGGCAACGTCCGCCAGACCCTGTGGCTGCGCACTCAAATCCGACTGCCCGCTCAACTGGTCCTAACAGGTGTAACCGTTTTGCTCTCTGCTACTGTATAGTCCGGTTACGCTATACTCACGATATG")) +(assert (= z "acggcuguaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 new file mode 100644 index 000000000..4302f9de1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTACCCTCTGGCGCCAGCCTGCTCACTGACTAGGCATTCATTAAGTAAACCCGCGATTGGCCTTGCGGACGAGCAAGCTTAGGTTCTCGTCCCTTAGTTTTATAGTATCAGATGTAACCGTCCTGACCATCTCCGGACTGCGTATATCAACCTTTAAAGTATGGTTCGCACAGGGCCTTTACGGGGTCGTGGTAATCAC")) +(assert (= z "augccccagcaccauua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 new file mode 100644 index 000000000..82fc38907 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTTCCAGCAGTCGGACGACCGAAGATAGCGCGCCCCTCAGAAGACCCCTGGTACCCACTCCACCGGCCTAGTCGCACGAAGTCTCGTGCACTTTTCGGTGGGTAGTTGGTGACCACCAATGCGTACTCTACTTTGTAGGCAATTACAATATTTAGGTGGGCTATATTTTGCAACTCAATAGAAATCTGGATCGTACTTC")) +(assert (= z "acguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 new file mode 100644 index 000000000..a47b171dc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTATATCGGTACGCTGGAATCCCTCGGAGGAGTATGTACGCGTAAGACCGCTGGTTAAATGAAAAAGTGCACGGTTGTTTCGCTTGCTCAACACAGAGTAAAGTTAGCTCTTGCCTATGCAGACAGTTGTAGGCCTGGCTGGCTAGGCTGGCTCCCATCGCCGACGCGTGCAATTTGGCGTGGTTAGTGCCCGGCCCCTG")) +(assert (= z "cgaguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 new file mode 100644 index 000000000..b0d7c6b88 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTTACTCCCGCGATTCACAGACAACCCTCCAGGGGGGACCTTATAGATTGGGAGCCGTCGAAAGGAGAGGTACTTCGCACGTTCTCGCGAGGTTGTACTGAACATAAAGCTGCGTCCTGTCAGCGGTTAAATTGGTTTGACCTCCTGCCTAGGTTTTGAACGTAGTGTCTCCCACTCGGAATGTTGCTCGCAGCCGATC")) +(assert (= z "caucacagagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 new file mode 100644 index 000000000..bfec305b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAATGAGTGGCTCGGGCAGAATACCGTGTATGACCACTGAAGAACTAGTCTCAGAGCCAACGCGAAGTTCGAATTGTAGTCACACGATGCGAGGATGGTCGGGCCGGGAGCCTTACCGCATGATCCGGCAGTAATTACTTGAAGTATATTCTTATGGTACATCTGTTCGCTATCGGAACAGTCAGGCCAAGTTTACCGGC")) +(assert (= z "auagcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 new file mode 100644 index 000000000..fc5c344f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGACCGGGCACACAGGAAGTCTCGCTGATTAATTCGGAACTCGTTAGTAATAAAATGCTAGAAGCTGTTCCGTTACCTTCGAATTAAGCCACCGCACTACCAAAGAAGTTTGTCTTATCAGCTGCGCCAGAAATAAGTCGCCGTTATGACCTGGACATAGAGTGCGTCAGTAGGGTCCCAGGGGCGGCGCTGGCTTGCGC")) +(assert (= z "guuucuucaaacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 new file mode 100644 index 000000000..3929cfd8b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCGGACTGTATCTCGCTTTGGGTAGGCATAGTAGACGCGAGCGGGGGTAGACCACCAGCCTACATCCGGAGGAGCCAAGTGGGAAGGTTGAGCTGCACCGCACACTAATGATTCCTGCCCCCTTGGTCGGAGTATATCACTCGATCGAACGGATTATCTTACTGAAGTTAGCCCACCACTTCGGATTCGGAGCCTGTC")) +(assert (= z "uggcgugugauuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 new file mode 100644 index 000000000..457defc10 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAGTCAAATTCGGCCCGCCGCTAACGACTCGATGAAGGCCAGCGTCGTCGGGCCGTAGTTGTGTCCAGCCCAGGAACCATCAATATATACGTAGACGCGTGTTGCCGATCCGGAAAGGGGCCACGTCCGCAAACTTATCCGTCGGGTACTTAGCTCGCAACATCATACTACAGGTTGGTTGTAACACACACTTCTGACG")) +(assert (= z "uuccccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 new file mode 100644 index 000000000..e00ef6c55 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGATACGCGTATTAGTGTGACCTTTGGGAAGACCTCCTTCACCGCACCCGCTGTACGCACTGGGCGATTGCCATCGTCTTCTCGTCGAGAATGGGAAATGATGGACTGGTGGAGTGATTTATGCTACCAAGCTTGACCCGTTGCAGCAGTCATATTCATTACCTGCCCCTCTGAAGACCAGATCGATCCCGGTAGTCA")) +(assert (= z "cgguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 new file mode 100644 index 000000000..62cae87c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCAGAACCTCCTGGTTTTCCGTACGATCACACTACAATGCATCATAGAACACCCAGTCTTGAGCGGATGAAAATCAACCGCGCGCCTAGCCTCGCGCAGTCGGCGCGAAAGTCGCAACAGGTAGAAAGTCGAGACTGCATATGGACGAGAGCCGACCGAAAATCGTGCCACCAGCTGGGATAGTGGAGATCACCAGGT")) +(assert (= z "ugacguau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 new file mode 100644 index 000000000..5a97de86c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATCGGTTTCACCTTCTAGCAGCGATGATGTAAGGTGCACTGCGGCCCGTTAGATACGCGCGAGAGACGGTAGAACGGCCCCAGGGGAATACAGGGATTTGGGGGAATCTCCTCCAAGGCACGCTACAAGTTTCGCACCCGGTCGATAAGGCCCCTCGGGGAAGGTCTCTCGCTACATAGCCCGTGAGGTATTATATC")) +(assert (= z "gcacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 new file mode 100644 index 000000000..0dd3a8f6c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTCGAAAGGACGGATGGGGAATCTGTTTAGCTGGAATCTGATGTAGCAGGCGCACGGACCTCGGAAAAGTGTAAATCAATGAGCAGTTTTTGCTTCATTTACAAGTTCGTGACAAACACGTCCTACTCTAAAAGACCTATTATCATCACTCACACAAATCCCATATTGATACAGGGCTAACTGCCCCTCTGTCGGATAA")) +(assert (= z "guuugugcagga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 new file mode 100644 index 000000000..72f5193e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGGGACACAATACCTGCTAATTACCGCATGGCACTAACCTTCCTAACTTACAGGTGGCAAATAAACTCATAACCTGAGAAGGGTACAGTCAGAGAATATAGGGGCACACCGACAAATATTTCATTCACACGTCCCGGTATCCAAACCCCGGATCATTCTGGTCCCTCGGGCAGTTTCACCGAGTGATGAAGAGCAGAGC")) +(assert (= z "ggaagga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 new file mode 100644 index 000000000..530499885 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATAGCCTAACTTGATCCGCAGCCACTGACCCATGAGTTAAGGAGGCAAAAATACAGGGCAGCACTCGTGCTAATGAACTCCGAATCATCCCCTCGATACTATGGAGAGGCGTTTTAATTTTTAATGTTGAGTAACAGGCCACGTCCGTGGGTAGATGTCAGATCATAATCTGGTGTTTCACGTGAAGATTGGTCTCTAC")) +(assert (= z "gauugaacuag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 new file mode 100644 index 000000000..5d56c9cc6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGGATTAGATCGGGATGAGCATAAGAATGGAGTCGCGTTCTAGGTGATACATCAGGGACCACTTGTTTTAGAACGTGCAATCTCAAACACGCGTGGGCATAATCCACACGCGCGTAAAGGAGCAATGTGCTCGATTTGGAGCAGTTTGGGGAGGAGAGCGCGTTGGGTGGCAATCGACTACCATTGTCTGGCATTTTTT")) +(assert (= z "ccuaaucuagcccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 new file mode 100644 index 000000000..a810e7291 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGGACCGAGCTGAGGTTACTGGCTTGATTAGGGCGATGCCGGTCATGGCCGCATACCAACGTGTTAGATGTAAACAGACTCGCGGGTGTCCGCGTAAACTCTTATCTACCATACGTCACGGCGAGGGCCATTGCCAGGTACTGCTAGTGTAAGAAATTTCTTACCGCCTGGCTCCTCCAAGGCCCGGCGCGAGCTCGCG")) +(assert (= z "gcucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 new file mode 100644 index 000000000..977572643 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACCGTCATACACCGGCATTGTGGATGACTATACAAAGAGGGCCGCGCGGTTGTATGTCAAGTTTCCCCAATGGCTCACCCAATAAAGGCTAACCTCGGATATTATCATTGAACTATAAACGGGCTGACTATGAATTATTTCCTGCAGAGGCGTGGAAAGGTGATCTGCACGGACTATGAGGTATTCACTGAGAGGTCC")) +(assert (= z "gauauuugcccga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 new file mode 100644 index 000000000..c57f2ccdf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCTTCCCCGAAGTTCGATCAAACCAGCCCGGCGAAATCCTACCCTTCTTTATTATCCTTAGCAACCAGCCTATAGGTTGAATCTAAGGTTGTGTTCGGCATCAGTAACAAGTTGAGAACATCAGCATCGTCGTCTTATATCATTCGAGCAGGCTCGGCTAAACCTCATTGGGCAAATGGGGCCGCTTCCAGCAACTGGT")) +(assert (= z "aguaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 new file mode 100644 index 000000000..effe24cb0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTTCATACTAAGCAGACTGGATACCTGCCATCACTTCTGAGGCCACAGTGGCCCCCTGGAAATGCCAGAAAGTACGCTCCGGAAGGTCATTGGAAGCGACAGATTTCATACCCAGACACAGCTATACAAGGGAGAGGTCGTGAGCTCTGAGGCTTTGAGAGTCTGACTTCCCCAAAGTTGTACCTTGGTTGAAGGACT")) +(assert (= z "aguauggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 new file mode 100644 index 000000000..3217859be --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTAACCCTACAAATGGATGAGGTTAAGGACACACGGAATGTGCGATACACCATGGTCAGCCCGGATATTCGGGGGACACAAGGTGTTTGCTGGGGGGTCTGGATAGCTCGTTGCTCACGACTGTTCAGCGCATCCATCAGGTTCTGCTTCTACATCCAAATACGCGCAAGAGCCTGCTTAATTACAAGACGTTGCCTTTC")) +(assert (= z "guucugcaacggaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 new file mode 100644 index 000000000..fec756c5e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGCTCAAACGCCTATTAATGTGCTAAGGACCCGGTTTTCGACCAAAGGCGACACGCCTAATGGCCCTCCTCGGTCCGAAATCGCACTATTCCACTGCGGCAGGAAGACGAGGCGATTAATCGAGTAGTCTGTCTTATTGGCCTATGGTACAGCGGAAAGAGGTATAATGAGGGTAGAGGAGACCTCACTGCGGCAACG")) +(assert (= z "cgccguugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 new file mode 100644 index 000000000..5aacaed3b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTGTACCAAGTCCCGGGGGTTTTCAATGAAGGAGAAGCGGATTCTCAGGTCTCGAAGGAGTGGATAGTACCCACCAACCCGCACCGCTTGTGCTTTATTTAAACAACATCGGATCTGTCGAAGCTTAAATCTATGCGTGAATTCGATAGGATTGCAGCATCCCGTGATAAAGGGTCACTTATCAGTAGCCGAGTTCGTG")) +(assert (= z "cagggccccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 new file mode 100644 index 000000000..f0109aaeb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCTAACAGAGAAACCCGTTCAGCACCAACGACGTCCTGCGTAGTTAGAAGTGAATACAAAGCGAATATATCATAGCTCTTAACTTATATTTACGTTGCATGGATGATTCTCAGTACGACTTGCTCTCAGATTGAGTCCACAAGTAACCCCTACCTTGGGGGGTGCATGGCGGTGAAGATGGACGGGTAGTGCATACAG")) +(assert (= z "ugcugaacgagagucua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 new file mode 100644 index 000000000..8133cd8e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGCGGGATAAAAAAGCGGTTTCCGTTTCCACCTGGGGGCATATATTGCATCGGATCTGAAAAAGCCCGGCGTCCTTTTGGTAATGGACAACTATGTCCCCAGGCTACAACCATAGAGGCGTTGGTCACTGTCCTTAGGTGCGAGCCCCACCCGGAAACCTTCCACGGCTCTTATTACTCCCGCAGAGGGCGTTTTGGGA")) +(assert (= z "ugauacagggguccgaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 new file mode 100644 index 000000000..3cfc4d7b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGAGTAATAGCCGCACTTTTCCAGTGGCAGGAGGGAATGCGTATTTGATGGGACAGTGAAGAGGGATGCTGGTAGACGGTCGAAATGATTGCGGGATGGGACGGCTGCGTATTTCGACTGTCTTTAGTCGATGATTGGCGGAACGACGACAACACCGTTGCGATAACGTAGAATGTCCAGGTAGTCAAAGGAGGCAAGG")) +(assert (= z "aacuacccugucacuucucc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 new file mode 100644 index 000000000..22fcce197 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACGGGTCCGACCTTTGCTTGTGGGCGGGTAGAGTAGTTTGTGGCATCACTACAGACAGATTCTGACAAACGGGGAGCTTGAGTCTCACATGTATATCGTAAGTTCAAAAATCTGCGCGCGAGGTAAGAAAGCACGTATGCGATGCTAATAAAGCTCGTAGCAACTCGGAGGCCGACCAATAAAATCCGCGTTGACCCAT")) +(assert (= z "aaguuuuuagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 new file mode 100644 index 000000000..8d1a1df77 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAATTCAAGGACCCAGGCGTCGCACGCTCCAACTCGAATCATTATGGTTTATCGATTTAAGCACCAGCTTGGAATAGGAGGGAATCCATCAGAACCTAGGCTTTTTCGAGTTTTACAAGCGGGCCCTAAGTCGTGGTGCTGGCTTCGATGTGGTAAGATAACTCACCGAAGCCGTTGGCCTAGGTATACTTTCATCGGTA")) +(assert (= z "uagcuaaauucguggucgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 new file mode 100644 index 000000000..9d1af680d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGTGCCCCTTTAACGACGAGTGAAGGACGCAGACACTCCACCCTTAGGGTCCTGTAAGCAACTTAGCCAGACCTCACCTGTTTATAGCCATTTGTTATTTTAGCAGTAGGGCCGGGCTCCGGGAGATTAGTCACGCACTGAATCAAACACTTCGCCTACTTAAATAATCCCCTAGAGCAATATCAGTGCGCTCGTTACT")) +(assert (= z "aggccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 new file mode 100644 index 000000000..b686cbaba --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTACTTCCCAAGAGGGGCCCCTTGAGATAGATGGCCAGGAATATTATGCACTGCCGTCGATATTGCCCTAGTTCCGTTCTTCCCCGACACTGGCCCCACTTCACTCATGAACTATATCTGATTGGGCACTAGGGAGATCTCGTGATTCTCCGAATAGAATCACCTAATCCATTGATCATGATTAAAGCATTACCAGTGTT")) +(assert (= z "gucac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 new file mode 100644 index 000000000..ae368f224 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATCTCCAGAGACGGGCAGCGAGCCATCTGACATTATGCTAGTCAGGGGGCAGGACTATCTTAGGGGTTAAGCCGCTCGACGGCTCTTTAGTCAGATACGGCGAGTGGTAGGTATGGATTACCGGCCCTGGTCGTATACACCGCCTTTAGCCACCGGTACTTCCGATTCGCGCAACATGGTATGTGATTTTACACGGCCC")) +(assert (= z "guuguaccauacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 new file mode 100644 index 000000000..f73cc398e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTCACCAGGTCCGCAACGTTGGCTAAAGTCATATGAGTGCGCGTCATGCCTCTTCACGCGATCTCCACAACGAGAGGGCTGTTTAGCGAGATATCACGAATGCTGTTGAGCTATCGGCCGAGTAAAGCGGAGGCAGCTTTCAATTAGCGAGCTTTTGCCGAACTGGGCATGCCTGAAGTGAAAAAGTAGCAGGGCCCGC")) +(assert (= z "aacucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 new file mode 100644 index 000000000..e0ae19a5c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCCGCTCCTGTAAGTAAGCTCTAGGAATTACACTTCTTTGGACACCATGTGGGTGTGCCCCAGGGCAGGGATGCCTCCGTGGCTGAATCGGTCGGCGTGTTTTCAGATTCACCATAACGGCCGTTTTACTGGTTCCCCATGACGATGAGAGTAATCCAGCTTGCGAGTTACTAATCTAAGTTACGGAGTCGTGATTGAA")) +(assert (= z "guauugccggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 new file mode 100644 index 000000000..e8c4821c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAGCAACAGGCGAGAACGATGTCGTTACCCGATTCAGGAAACGCAGGACATTCAGTTGCCCCCCCCCGGATGTAGTATATGGCCTTCCCCCGTCTGAAGCTCAAGTAGGCCAAGCGCCCCCATAGAACGCCTGGTCCGCTCTCGCGTTTCTTGTGTCGTATAGGTAGCGAGACGACGAGCGCACTTTCCGTACCCAAGT")) +(assert (= z "aucguuguccgcucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 new file mode 100644 index 000000000..407338195 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCTGTGCAGAGGCACCATGTGCTAGCCACGGTTCTTAGCGTATGTCCCTTGCCTCATACGATTCCTCATGCATTGTACGCATACGGAGGGAACGTATCCTCCCCCAGAGTGGCGCGTCGGCCAGGTTTAACCATGATCGACCCTTTTTTCGTTGTAACCGTGCTAATTCGCCTTGCAGCGTATCAAACCTTGAAACCGA")) +(assert (= z "auuaagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 new file mode 100644 index 000000000..84391abf2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGTGTCACGAATATCTGCGCGAACTTGCAACGCGATCACACCTCACTGTCTACCCCGTCAATTAGATGGAAGAGTATGCGATGGGATAGATTATGAAGCCCGTACGCTATAGAACTGGGGGCAAGAAGAAGATCTGCCCTCGACATTTCAAAGTTCCAATGCATTTTCAATCTGCCTAGCATTGGTATGGATGGTTATC")) +(assert (= z "ucgggcaugcgaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 new file mode 100644 index 000000000..712b3d5e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACTACGAAATCGGTAGCAGCCGATGAATCCGCTATTCATGGCGTATCCTTGATTTGCAGCTCTCAGAAGAACTTGACATTTGCGCTGAGTCCCACAACGGCGCCGCGTATCCAATGGTCGTTTCTGATTCCAAGCCCTGAACCGAAGGGGACCACAGATAATGTCCGATAAACCATGCTATCAAAGAGGCCTGGGGAGG")) +(assert (= z "ggcuuccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 new file mode 100644 index 000000000..75fd80826 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGGCGTATTTGGTTCGCGACGGGGCCGGTCTCCACTCCTAATCACAGTTTAGATCGGTGGGAAGCAGTGCAGGATACTAAAGAGGCCCGTCCTCATCTCGCTCAAAGGGGATGGACATTGGACACTTGAACCTAATGTAATTCATGTCAGCTGTCCTCCCCATTGGCGAAAGTAGGGTATGGTTCTGAAGAGTGACGA")) +(assert (= z "uagagcgaguuuccccua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 new file mode 100644 index 000000000..29324e959 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTACAGGGTTAAACGCTCCGTGTAAGCCAAGTAGTTTTCGGCACAGGACCCTGAGGTCATGAATTCGTCCCGTCCTTCGGGTGGGTATATACAACAGCGGACATTAGCGGACAAAGGTTGTGACACGGCAGTTTTGAGGTACTGCGGCAGGGATATTTAATCTACCAGGCCCGCGCTGCGGTTGTTGTGTAAGATTCGT")) +(assert (= z "aagcag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 new file mode 100644 index 000000000..6f10ec28e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTCAGTACTGAGGAGCATGGCTACTCACATCCAAGTGTGTGCACAAAAAATGCTTCATGGACTGGGCATCCATTCGTTAACGCACACTCCTCTATCCCTTACTAGCATATTCGAAACCCATCGAATATACAGAATCGATATAGAGCTTTATCAGAGTTGCCCTAGTTAGGAATGATATGGGGGGTGCCACGTACTTAG")) +(assert (= z "ugacccguagguaagcaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 new file mode 100644 index 000000000..1a742f0d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTGAGCCCTTTTCAATTATAGTCCAGGGGGTGCGGTACACTACCTCGCGCGACCTAACAGGATATCTCATGTAGGCTTTGAGACCGGTATCGAAAAGTTTTTAATAAGCTGCAGCTACTGTTCCACAGATATCCTGTGTGAAGGTAGCTAGCATCGACAGCTATATCTGCATGTCCTCTCATTGCGTCTGAAGAACATC")) +(assert (= z "ccaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 new file mode 100644 index 000000000..906468600 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAACTGAGACACAGAGGTGCGTACCCTAGTTACTGCAGATGGCCCACTCATTGCATATGCCGTCGAGCTCAGCGGCCTTATATACAGAATTCGTACACGCAAAGTAAGGACTTCACTGGAGTGTACCGTCAACCTGATCATGTTTATAGACTGTAAGCCTGTTTCTCTCATCTATGCTCTGCGTATACGCGTGTATGCGT")) +(assert (= z "aguacaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 new file mode 100644 index 000000000..14c1f9c86 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAATCACTTTGGTCTCATGTCGGGTCCTAGCTTAGCGTCAATTATCCATCGGTTTTAAGTCAGCGACGTATCCGTTGCTGCGGACGAGGGTGCCCACGAAGTAATCATAGTACCTATTCGGCATTCGTCGGGCTTTGACGCAGACAGCCCCTACAACCTGTGGCGGGTCTTACGAAGTTCGCTGAAGTCCGTGCAGTCCG")) +(assert (= z "uaucauggauaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 new file mode 100644 index 000000000..32d227857 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTCAGGTGAAAGGCTATGCAATTCTTGTATGTATTCACGAAGTCAGAGATAGACAGCTTTCTAAAACTACACAAATAGATAGTCGGGCGAGACGCAGTATGAACCTAATGACATCAGTATTAGACAGTTCCATCCGCAACGCTCTTTCATCTGTAAAAGTGCTTGCATCAGGTAAGGTTATACTATCTGACACAGTGCC")) +(assert (= z "guugcgagaaaguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 new file mode 100644 index 000000000..fdc601f7a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACAGACATGCGGGTACTGGGTAAGACAAGTAAGGGAAGACTGCGGGGCAGTGTGCTTGTGCTTGCATGGTTCAGGCATACTGCACCCGCTAACCGGGACCCACCTCGCACTAGTAGATAAGTCTTAACGGCTCAAATCGTTGTTATAGCTCACCAGTCCGTAAACGCTCCCAACGCTCCAGCTGATTCAGACTCTCAA")) +(assert (= z "aucuauucagaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 new file mode 100644 index 000000000..6ec1966b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACTGTTAAAGTGCTAGGCGCTTTGATACCCCTGTGAATTTCCCCACTCTGCACGACCTTGACATCGCAATTGCTTCAAGCTGTAGAACGGGATAGCTTCCACCGAGTACAATCCTAATTTGTAATGACCGTATTCGCGAAGGCACGTATTGTCGCTAGCACAGTGGGAGACGAACTCGAAGAACGCTGCCGAAGGTGGC")) +(assert (= z "ugcauaacagcgaucguguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 new file mode 100644 index 000000000..effb52c00 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCACTAGAGCCATGTTTGCCCTTGACGGTGTAAGGGAAATGGAAGCAGTATGAATGTCACACCGGAGGAAAACTTAAGTAGGGAGAGAGCGCGTAGATCAGGTCTTTTTAGATTGACTTTTAACTTCCCGGGTCTACCATAATTTCTTTAGAATACGATTTCATTTCGGTGTTTGCTTCAGGGTTCGGGAGTATTCACG")) +(assert (= z "ugaauucaucccucucucgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 new file mode 100644 index 000000000..a4905c4f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTCTTCCTGACGGCTACATAGATATGCTACTCAGGCCATACGTTTATGCACAAGGTCATAAAGCGTCAATGTGTACTAGTGGGTCGAGTTATAGCGGGCTTAGGTACTATGTTACAACGAGCGCCACGGCCGTTACACAGGTCGCGCATCCCGACTTAGTCCTCAATCGCCAGAGTCAGCGATCGCAGCTGGCCCGAGA")) +(assert (= z "gaaucaggagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 new file mode 100644 index 000000000..15638240b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGTTGGACTTACAAGGCTTGAACGTTGGCTATGTATTACTGAGCGTTCATTCTACTAGTCTCGAGTATGACACAGGGGAGCGGGCAAGTCGACTATTGGGGTGCGTCTTCAATACCCACTGGTGACGACGGAGTGTCCTGCTAACAACGTTGCCTAACGCTAGATCTAATGAGGTCACGCACGTTTCAGGAACCCGACT")) +(assert (= z "uguccccucgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 new file mode 100644 index 000000000..78bf527b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGTTCCAAACTCAAACGAGGATTCTTCCCGAGGCGTAGTCTAGGCGAATGGCTTGATATAGGGACCAGTTAATGCCTGCCGACGCGAAACTATATCCCCAAAACCTTATGTGGCTGAACGTCACTCGGTCGTGTGTTAAAGGAGCCATTCAGATGCGCTTAAAGGACTTTTGGACTTCCTTATCGAATAAGAGAGCTCA")) +(assert (= z "uaagaagggcuccgcauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 new file mode 100644 index 000000000..d2af780ae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGATGTAACACTGTTCATCCCTCGTGATACTATGTAGCCGTAGCTCCTACCGGCAGGCATTTTTATACCCTTGGGGCAGAATGATTTACCGACACGCACAGACCAATCACGGCTTTGCATTCTCCGCCGATGGTATACCATCTTGGCTATCCTTAACGACCGCTGAAAATACATCACACGATATCGTGCATTCCAGGTC")) +(assert (= z "uaugauacaucggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 new file mode 100644 index 000000000..68aee7494 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAAATGAGAGGGTTCCTATACGATGTGTGGATGGCGCCTTGCTCAACACCATCGCTCGTACGTTCCGGGAGCGCGAATACAGCTGCAGATATCACCAAAATACACTCGTCGGTATCCCTGCGTAACATCAAGTAATCGGGGTAGGGGTAGGCAAACATATGGTCCCATTGTACATTGATCGGTGCAGTTTGTTTGTGTA")) +(assert (= z "agcaugcaaggcccucgcgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 new file mode 100644 index 000000000..eb7ae2ba0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATACACATAGGGCGCCTGAGTGGCTAACCCAGATATTCAAAGATCCAGCGTTTTCGGGCAATAGTGTCTGTCGTTTTCGAGGTACAGTAGGATGTGGGGCAGGGAAACATGAGCCAACCGCAGTTGCGTAGGGTTAGGCCCTAATTTGACGATGAGGAAGTGATGAAGTTGTCTGCCTGTTCTACGCTAGTGTGGACCG")) +(assert (= z "acuucaacagacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 new file mode 100644 index 000000000..1bc6171f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGGTGAAGTCAAATGAACGTAGCCGGACACTTAGTACCCGATTAATTTTAGACAGTCCATGTCGAATACCTTCCATCTCTGATTACGCCGTTTTATGGCCCCGCCGTCCTATATTTAGGATGTTTTCACCCGTGTGGTCTAAACGATCGTACTACCGAAATTGTATAGAAGTGTGGCAATACCGGAGATCTGGCACTTG")) +(assert (= z "ggccucuaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 new file mode 100644 index 000000000..d0ef6e59d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTATTCTTTGAACCGATTTTCATGACTGGGAGCCGACAAAAGTCCTCCTATACGCCTCGGTATCAGACGTAGCGCATGGCAACCGAGGCCGAGAGCCCCGCGCCCGCCCAGACTGCCTATGGTAGCTAATGTCCAAGGGGGTAGGAATGCACTGCCGTACGAGGAGTCAGCTTTCTAAAAGTACTGTGCTATCTAATTA")) +(assert (= z "ccccauccuuacgugacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 new file mode 100644 index 000000000..fa5e17fa1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAATATGTAGATAAGTTCAAGTGAAAGCGCCGTCGGAGGCGGACCATATATCGGAAACATACCACATGAGTTAGGTGCGGAGATCAACTCGGACAATCTTAATTAAAACTGAGACTTTCCAGAGCCTTGCTTTCGCAGCCAATCCCTCGCACGCCTACGGACAAAAACCTTAACCGTTTTACTTACAAAAGCAAATTGAG")) +(assert (= z "aaauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 new file mode 100644 index 000000000..65f593868 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTCATGTTTAGACCATGTGAGTTTCCCCTACGGTCCGACTCCAGTCTGCCATGCGGTTTTCAGCCACGTGGTGGCGATATTACTGTACCGATGTCCACTCGGCTGACCTAATCAGCATGTATCGTTAGTTTTTTGGTGACTGTGTACTCACTATAAGGTCTTCACCCGAGGGAGTGGAGATAGCACGATTTACACCGC")) +(assert (= z "uuccagaagugggcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 new file mode 100644 index 000000000..d4496846a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTAATCCACACCTGGCCAGTACGCACGTCAATATTAATAACGTTTTCTATAATCACCAGAAGACGTTCTGGGGAGTCTTCTAACTCCTTGGAGTGGGCCTCTACGGTGGTATGGGTACTCAGATCAGTCGGGTCCATTGAGCGGTCTCGCTTTTAATTCCGACATCATGGTTCGTCGTCTCCAAGCTGTACATGGAGTT")) +(assert (= z "uagugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 new file mode 100644 index 000000000..4432e0e34 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGACTGAGGCCATGCGCTTAACGACTCGTCCAGGCGGGGAACCCCCTACTTGAGGATAGGACCGCTATCCTAGCCCCGGCAGGAAAGTGATCCGAGGTGACATATCCTGCAGGTGGCGAATGCGCACAGATTCACTACTGCAGTCGGGAAGACATCCGATACCAAAGTCCTCTCTGGCAAGGAATCAGTCGGGCGCCGG")) +(assert (= z "acuaggcuccacugua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 new file mode 100644 index 000000000..607c10d42 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACTATATGACTCGTCTCACATGCAGTAAACACGCCTTCTTATGGGGCGGAAGGTGGACCTATATTAAAATCAGGGTCAAAGCGCAACATTTATAAAAAGCCTTGTCTTCGCTACGTACGTACTTCGACGACAATGTCCTATAATCCACCAGTAAATGATAGTTGGGAAGGGGACTCTACGGGCGATTCAGATTGGGCGA")) +(assert (= z "uggauauaauuuuaguccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 new file mode 100644 index 000000000..6a4c55a87 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTCAGAGGAACAACATTCCCTGGTTGAGCGCGGTCCCCCCTACTGAAAGCTTTCCAGGGTAGAAGCAGGCGCACACTCAAAGCCGAAGTTCCTCAAACCGTGGCCTTCAGTGCGGCTTCGTGTTATGCGAGAGAGTTCCTGGAGGCTTGCAGATCGCTCGCTGCTATGATTGATACTCGGAGTATCGCGCTGGAATAAA")) +(assert (= z "gcgacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 new file mode 100644 index 000000000..61abfcffd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCCATGCATTCTAAGGAGTTTACGACATAAAACGCTCCATTGTTAAAAGTGCAGATCATGCACGGCGATGATGAGGTTCCCAAACTTGCCTCTCTTTCAGATCCGGGTCGTCCCGGGCGGGCAGTTCATCTGAGCATCCGATAGTGAGCCTAGGCAAGGTTGTTCCATGAAAATAAGGAATTACCCGCAAATCACGTGT")) +(assert (= z "agguacguaagauuccuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 new file mode 100644 index 000000000..438b6ceb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGCGAGCTAGACGTCGGCATTATGCGTGGCCACCCCACCCGCGAAAAATCCAGTCATATGTTTGTTTGTAGCCAGAGAGTGTCCTGGAGCGCTACAGTCTGGTAGCGCCATCCTTAAGAATTGCTAATAGCGCTGACGTGATCCCCGTTTGAAAACTGATACATCTTCCGCACCGGCATGGTAACAATATAGCACATC")) +(assert (= z "cauuguuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 new file mode 100644 index 000000000..b9f3b267b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCAGGTACTAAAGCATTCATTTTTGCCCCGACTCGGATTTTTCTTGAACTTGCTTGTAGTAGGTACGTCCGATAAGTGGTCATCTAATCATGATGATGGCGAGTTCCGGTGGACGAAGCCTCGAGATTGGTGTGGTTTCCTTGGATCCCGTGTCTAGAACGGCGCCTCGCGCATATTAAAAAGGATTAAACCAATTTCT")) +(assert (= z "guaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 new file mode 100644 index 000000000..8ede87c71 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATATCCGCATGTTGTTGTTTACGTGCGACGGGTCCTGAGTTTTGACATGGTATTGGTATGAGAACTATTCCGTAAACCTGCTTAATCGAAACCTCCAGGCATCAGGTATCGGGCATTGATACGGACAACAGTAGCACACGTATTGACCCTCCGCCGCGTACGTCTCTGGCTCGGAGTCAGCACCGGGCCATGCCCAGAGC")) +(assert (= z "accgagccuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 new file mode 100644 index 000000000..e543e38f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCACCGAGAATCAGCCCAACGTCCCACCGGGCACTGAGAACCGACATACTCAGCGATCTGCGAGATCCAAGGTTAGTGGCCACTTATTTCTTTCGCAGGTTCCCGACAATTTCTTTGCTTGCTTGCCTGCTAGTTGGGACGGTTCGGTCGGCAAGGAGCTCTTATGCCTACGGCCACATTGTTGTTTCATACTTGCCAC")) +(assert (= z "uuccaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 new file mode 100644 index 000000000..126f4ff6d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGTGACCTCAGTAAACTAGTCGGTTATCATACGAGACCCAGTTCAAAGTGTGCAAAGAGGCAGTCGTCCAATTGCACTATAGAATGTATCTCTGCTTCTAACACCTTGGCGGAGCCGTTATCCCGGGCCCCGACAGAGTTAATAGTATTTCTACGGGCATTTGGCTGTCAGGCGAGTTGGGTACTATAGCAGTATCTCC")) +(assert (= z "cugggucaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 new file mode 100644 index 000000000..2ed962b7e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATACGCCCCGATGCGTGCCTTGCATTGTGGACACAACGACTCGACTCCGAGACGCCAAGTATACACTTTCACCGGTACTCGACAGTTGGTATAAGCCCGTTAGACCGGGGATAGCGGCGTCCAGGCATCCACCACCTTTACGGACGATGCGCATCCAAAGAAGCATCCCAAATTACAGGGACCTTATGAGCCTACGATA")) +(assert (= z "cgguucauau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 new file mode 100644 index 000000000..35928c7b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCATAACACGAGTGACCTGGTTCCCTCGATCCCCTGTTACACCCGTACCTACTCGTTGGATAGCAGGAAAACTTCAATATGGGTCGTCCTCCCGACGTGACAAAGTGGGCTGACGCCATTCCGGTGTTCGAGTACATGTCTTTTTGCGTTAGCATGTTAGCGCCGGAGCAGATGACTGCATGTAATGCGCTCTAGTACA")) +(assert (= z "gccacaagcucauguaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 new file mode 100644 index 000000000..87d6b4bb2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAGGGTTAGTAAGCGTTCACGTGCGGTCCGTATTAGCGATCGACATCAGGGGAGAAACCAAATCCTGATTGCGGTAAACATTACGGGTCAAGCTCTACTGTGCGTGAGAATAAATTTGCAAGAGAAACATACACGCCAGCCACTGCGTGAAGGGTGTTAAAATCTCAAAGATAGCCCGACGTCGTGCTACTTTGTACAG")) +(assert (= z "uuuggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 new file mode 100644 index 000000000..a94937117 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGTGTGTAGCTTGGTTATACCTGTAATTCAATTATTGCTGCCGATGTGACGTGCCAAACTACTCTTTATTTAGCTTGGAGCAGGCAGCCTCTATACGACGATCCTTTCGTCCGGAAAGTATGATAAGTCCTGGCTATAAATTGAAACCCATAGAATGCAAATCCGATCCCCATGGGAAGACCAGAATGGAAGGGGCGC")) +(assert (= z "aucuuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 new file mode 100644 index 000000000..33c690b75 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAACAAAAGGTCACGGGCGCCTCACGGAGCGGGAAGACTACAGGCCTGGGCTCCTTACTGGCTATGGTCGGCTGAGGGAGGGCCATGGATATAAAACTCCCCTTTTTGTCTGCATTTGTGATTGTGCGTACATTGAGAAGGCTTGCTGTATAACACGCTGAACCTGGGGAAATAGAGCAGCCTTGCGGGTGCCATCGGA")) +(assert (= z "cgcau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 new file mode 100644 index 000000000..6c2c2c295 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGGGCGGCTTGATTACGGCTGTCTCGACCGATGGTTCGGAAAGCAAATTCGGATGTGGAAGTTGGGGCGGAAGAATGCTCTCACATCCCTGCCTGCATTTACTCCACGGAGTAGAGTCCGAACAGTCACCACACGCAGCTGGCACCCACTCGGGTGGCCCCTTCATAATCAGTGATTCGGTCTTTCATTAGACCCCCCA")) +(assert (= z "aguggugugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 new file mode 100644 index 000000000..0a366ddf9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATCGCACAGTCTGGCAAATCGGCAAACGTTCTATGATGGAGTAATTCAACCCACAAGGTGTATTTATTAGGGTAGGATAACGCAAACCCTTGTCCTGTCAATATGCGTGTGAGCCTCAACAGGCCCGAGTAGTGAAATGGGCCCTCGACTCAAGGTTAGGGGCCTGAGTCTCCATCACGCATGGGATACGCCTGAGACA")) +(assert (= z "ccgggagcugagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 new file mode 100644 index 000000000..91fdffa97 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTCGACGAGAGATACACTCCCTGCTAATACCCATTTCGAATGTTACCACGCGTATACCCGGAGGATCGAGATTTCTCGAGCTCTTCCTGTTCTCGCGGGGGACCGGTACAGTATGGGACTGGAGGGCGAGCAACCGAAGGCCTCCGTGTTGGTACGCATTGCAGTTCTATTCACCGTCAAATCGCCAAACTTCCGACC")) +(assert (= z "aauggugcgcauaugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 new file mode 100644 index 000000000..2828c11b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCCTAAAGGCCTTGGAGACACGCGACTTCCCACGGTCCTCGTTGCTGAAAAGCACATTTCGCCTTGCGCTACTGGGATAACAAGCGGGGTGAATGTTTAAGAATCTCATCAACTGGTCCGCTACCACACGGATAATCCGTGTATCAGACAACCGTTATCGATTTTGCCAGTACGGATTGTCTTGGCAGTTTTGTTAAG")) +(assert (= z "ggagcaacgacuuuucgug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 new file mode 100644 index 000000000..ffba896ca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCAACTGCGCCGGAGCCTGATGATCCTTACCCCTCGTAAGCTCTCTGGGTTGAGGGGGATTGCCGATTATACCACACAAGCTTCCGGGTCCTACGAGCAAGTACGAAGTAACTAGCGGTCCTGTAACTAAAGAGAAAGAAGTACTGTATCCGTCGACAATAAACGTCGTTGATTCATAAATCATCTCCAGAGCTGGGCC")) +(assert (= z "uuauuugcagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 new file mode 100644 index 000000000..b9c087965 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCATCTAGTTGCTAGAGATTTATCGAACCCTATGGCTAATCTAATTTAGTGCCAGTAGTTGTTTATGCAGCGTGATGCGGACCTCCAGAAGGTCCCCCAGGTCAGACCCACACATAGCCTACTGATGGAACCGATGGCATAGAGGCATGACGGGGTAATAATCGAGGGGTTACAAACGCGCCGCTAAGTTGGTTCTGAC")) +(assert (= z "aucggaugacuaccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 new file mode 100644 index 000000000..1287cd174 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCTCTTCGGCACTCATATACAAGACGCCCCGGTTCACTCTATACGGTCATAAACGAATGTCCTATTGGTCGATAGCGAAGCTCGTGGCCATGGCTCTGCTAGTCCAACAAGATCGATTCGTCCGGGTCAGTAGCCCGGGAGGTTTGCCCCACATGGCCTACGTGCAGATACTGTGCAGTCAAACCTAAGAGTCTGGAC")) +(assert (= z "ucaguuuggauucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 new file mode 100644 index 000000000..8698a1adf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTAGCACCGGACTACTCGCGGGATGAGCAATGACGAAGGGAATCCGGGGATAGCTGCCATAACAATGGGTGGGACAGTCTCGTGTTGCTGGCACGTAATGCATTGGGGTTTCAGTTCTTGGAGGCTCCCGATTTTATAACTTGCTCCCACATGGTCCGTGCCCCCAGTAGCCTTCGTTAGTCTTTCCATGCAGCCTCCG")) +(assert (= z "cauuacguaaccccaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 new file mode 100644 index 000000000..dd45efba3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAGTTGCGGCACCTGCAAGTCCTCATAGCATGTAGAACTCCCAACCTCCGAAACGTCTCTTTATGCGATTTTAGATTACCGGTTTTCCGCCACCCGAGCGGCGGCGCTCAGGTGATAACAAGTGGGCAATGAGAAAATAATGGTAACCTGTGTACAAGGCGCTCGGAACTGGATTATTTAGGGGTTCACCCAATAGGAC")) +(assert (= z "guuacucuuuuauuacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 new file mode 100644 index 000000000..f14409bfc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCCATTCGTCATTGAACACAAGCTTGTTGGATCCAGGGAGGCAGTAGAATTCGGTGTCAAGCAAGCTGATGATCCTCGGGTAAGCACCGGTTAGCGAACAGACTTTGAGGCTAGGTATCAGCACTGGAAGTTCATTGCAACTACCCTCATGTACGACGAGTCCCGAGGGACTCGTAAGGGGACCATATATAAACGTAG")) +(assert (= z "ugcuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 new file mode 100644 index 000000000..b1b5a7b55 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTGCACATGTGCCTAGGTTGGCGTAACGGTTATTCAGGACAAGGGGTCTACGGTTCTTCTCGCAGGGCGCGCTTCACGCAATATTCCTGTCCTCGGCAGTCTTTGTTGCTCGGTGTCAAGTTGAGGGAGGGTTGGTGGACGGCAATGCCGAAAATGGTTGCGTATCGTGGCTTACCTACGCATCGCGGTGTATGTGGCG")) +(assert (= z "caagaagagcgucccgcgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 new file mode 100644 index 000000000..992f5ea88 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACCAGCTTGCAGGGGCTTCTAACAAAAATCTATTCTGTTTGCGTGCTCCGTCCCAACTTCATGAGCTTTTCCGATGAGGTTTCATGAATGAGACCGGTACTTGCCAATCTCGGGAATCGCAGCTTAGACGATGCTTCGGGGTCAGGTAATAATCCTCTAAATCAGAGCGGTGGCCCGTTGGTGCAACTCGAGCGACAAC")) +(assert (= z "ccaugaacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 new file mode 100644 index 000000000..26be61494 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCTGATACGACAACACCTTACGCAAAACGTGTTAGTTGACTCGGGCGATCCAGGTCTTTCAGTATTCGAAATGAAGAACCGGAGTAATCGAACAGCCAATCACCTGATCTGTCAATGTAATGGTCTATTTACGGCCCCCTCGCAGGAATAACGGAGAGCTAGGTTCGACATAGCCACTTTCACCGTCCGTAAATTGCT")) +(assert (= z "agucauaagcuuuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 new file mode 100644 index 000000000..00fd10777 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTTATGGCCGTTGACGCCTCGGCTCGCTGGTTCATAGCCGCAGCAACAAGAATGCGTGCTACCCCAATCATTGGCACAGGCATTGAAACGTCAAGTCCTTGCGCTTCGACATGTGCGATGCAAGCATTGGTGCATATCGCACTCTCTCCAGGTCGATCCAGAGCCCACATGCCGGGCGCCTTCGTTATGAGTAATAGAA")) +(assert (= z "agcguga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 new file mode 100644 index 000000000..9203f2933 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCTGCGTGTTAACCAGGGTATGCAGACTCGTACTAATTCGTTTAGGATCCTCGAATTGGGTGGAACAACGTAGATCACGTGAAAAGCTGTGGGTGCTGACTACAGTTGCCGTCCATGGATAGACCATCAATTTGAAAACAGGTGATTAGTCATAATAGATAGGACCTATAAGTTGCTGCAACCTGGTTAAGGCATGCG")) +(assert (= z "gauuaagcaaauccuagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 new file mode 100644 index 000000000..d71fa9c0b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCAAACAGAATGACGCCCTATAGGCTGTCATAGCTAGTTTGCAGCCAAACCAGCCAATCGTTAATTTGACGGAAGACCAAAGGTACCTACCACAGTCACCTTTGCTTACCGCGTGTATTAAACAAGGGATTAAGTTGGAGATCTAACAAATCATGTACAAATACCTGCCGGAGGAACGCATGTCATACTACGACCTCA")) +(assert (= z "guuuaguacauguuuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 new file mode 100644 index 000000000..ae6a532a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTATGATTCACCACGCCTACAAGTGAGCTCGTCGGCAACCGAAAAGTGATTTACCTAATCCTCTACGTACTTATCAGTAGCACATAGCCGGACTTGCGCATCTCGGACGAGATCTGCGCCTCAGGGTTCATGGTCGAGATACAGGTACTTACTTAACGGCTCTCCGCCTAGCTTCAGCATCCTTTGAACCAGATCTATC")) +(assert (= z "gcggauguuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 new file mode 100644 index 000000000..420316a7c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCCTGATGCATCCTTGGGACGGCGTTAGGAATGTAGATACCCCATCGGTGTGTGGACGGCAGAGTTAATACAATCATCGGAATTATACGTGGCTGTATACATTCACATCAGCTTACCTCTCCATGGGGTTTTCGGCGCTACCCAAGTGCTCCAAACACCTAGACCAATTCGTAGTGCCTTGGGGAGACCCTTACAATTT")) +(assert (= z "acgagguuuguggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 new file mode 100644 index 000000000..44d44dda5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACACGTCCCCCTATGTGACGGGGGGTGCTTCCCACAAAACAGTATCCGATACGAGAGTTGGGTCCATTGTGCGTCAGATGAAGCTAACGGGAAACTAAATCTCAACCGCTAGACTACGGTGCAAGTAAGTGAATTTCAACGCATATCGACTTTGACATGCAGCTAGGCCATCACTGAGCGGAACTGACCAGGAGGCCAC")) +(assert (= z "guaacacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 new file mode 100644 index 000000000..8da67b5a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCTCCAGATCGCATGGCACTAAGTTAATCAGCTAAACGGCTCGCACTAGGTAGTCTAGGTTAAATTCATGAGAGCCGCGAATGAGCCATAATACATAACCGAGGATATCCCCTCTTCTACACGTCCGATCCCCAGCGGGATAATCCATGTAGGACTGTCGACTGGGACTGGCGATATCTTACGACGCAAGCATATAGCT")) +(assert (= z "gcugacccug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 new file mode 100644 index 000000000..b76904467 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCAACCCACAGTTACAAGCGTTCCCATCGGTCTGAGTTGCAGATTGAGGCGGTAAGGCGTTGGTACATGCCAGCTAAACGGACCCTCCTGCATATTTAACCTGTTACGGTAATACTGTTCTGTGATTGCATGACATTCGAGGAGGAAGAGTGACTCTCAGACTGAGGAGGCATACAGAGGCATCACGTGAAGTTCCCGT")) +(assert (= z "guauaaauuggacaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 new file mode 100644 index 000000000..4d0672198 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGACTTATTATGTCCTCTCATTCTGTAATTGCGGTGGTCCAACGCACTCATACTCGGTTCTAACTCTACTGGCCTCTACGTAAATAGGGACGCCCCGGCTACTTGAAGGAGGGGTTCTCGCAACACCCGGTCCGTAAGACGTAAGCATAGCCCAGACCAGCGGCGTAGTTTACGGGGAATTGGCACGAGCCAGTCCCACC")) +(assert (= z "agagcguugugggccag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 new file mode 100644 index 000000000..d22bd7c01 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTCAGCTTGTTGTGGTTCCACAATCATCCATTGATACATAGCCAGCCATTCTGCTCACTACACTTGGCCTGCTGCGTGACAACCAGTCTGTGGGTCCATACCCCCATAGTGTGTTCGAAATTAATCCAAATCCCCCGAGCCACGTTAGTGTTCAAAGGTTTCTGCTAACAATTGAAGTATTGCCAGAGGGACCCAAGCA")) +(assert (= z "caaguuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 new file mode 100644 index 000000000..02361b9b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAACCATGAGAAGTATCGATTCATTTTGGATACTTGTATGCGGCAAGCCCCGAGCGCACGGTGTGAACAATCCAGTTTTTCACACTCGCCATGGGGAGCCGCAACTCTCGGGAGCCAATACTTTGTGTTGACTAGCCCTATATAGACTGGCGTATGGAATGTATTAATCAAGGACTACACCCCGTAAGTCGCTAGCATG")) +(assert (= z "cugauguggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 new file mode 100644 index 000000000..b65371885 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGCGCACTTCCTCATTCAATGGACTTCTAAGAAAGAATGAGGAAAGAGCCGAATTACTAAAGTGACCTAACGACCTATCATTGGCTTACCCCATTATCAATTTAGGTGCATCGCGGCATCGTTTCTCACGGCGTTATGTCCGTCCGTTAGGGCGCTCCCTGGCGAAACGAAACTTAAAGGTCCGGCTACCGAGACTCAG")) +(assert (= z "aaggaguaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 new file mode 100644 index 000000000..91b32e6ab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGAATTTGATGCTCAGCTTAGCAATGCCGAACGAGCTACGTAATGCACTGCGGAAATATAAACTCTCCGTTTGTTACTTGGGCGGTCGACGTCTAGTCACTTAAATTATATAGAGTGTCTATATCACGGATTTAATCAAGGCGTTAAACACCCCCCCACGAAAAGAACCGGCGGCGTAGAATACAGGTGCAAATGCCTT")) +(assert (= z "uuaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 new file mode 100644 index 000000000..63374ad66 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCCGCGGCGCCAATATAGGGTTTGGGTCTTATGTAAGGGCTTATAGAGAACGGTGTATCCCAATCGTCTCAGCCACTATAGGTGATTGACTAGTAATCTTAGGGGGTTCATCGTGGTACCTTCTATGGTTGGCATCCACGATGGGGCCGACTAATAACTATTTTCCTCGAAAGACCGCGAGCATTAGGAACACAGTTA")) +(assert (= z "ccacuaacug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 new file mode 100644 index 000000000..a325b55f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCGCGGCAGAACCATACAAACCCGACCTCATGAACAGAAGCGTGTCATGACTTGCAAATAGCTTGGGTTGTGGCTTGTGTGCGCTGACACACGTTAGTCGCTTGAAAGTAATGTTCATGCGTTCGCTAGGCCGATATATACTCTCAGTTGGCGGTCGAAAAAGCATGCGTGCCATATCGTCCAATGATTGGACCGCGA")) +(assert (= z "acguuuaucgaacccaacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 new file mode 100644 index 000000000..810302f4a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCTGCGCGCGTACTGCCACCCTGTCTCGGATCCAATGCGGGAATCACTGGGACCAATGAGCCCGCGCCCTCTTCTGCCGAAGCAGTCCCGTATGTAGTTATCACCCTCGAATGGGAAGCGCCCCTTCTCGGATCGTGCCCAAATGCCTACGGGTTTGAAACTAAAACCGACTCTTAAGAGCCATGGTATGAGTCCAAGA")) +(assert (= z "gacgcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 new file mode 100644 index 000000000..31477493e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCATCGACTCCACACTTGCAATGAAGCACCTCACAGATGTCATCCGTCATTCGTTATGCGGATACATTGTACATAGACCGTGCATCCCAACTAAGGCCCACTTGTACTTCCTTGTACCGCCTAAGCTGCACGACAACGTGGGCCGGGCGACGAAGAGTGGATTGGATTTAGACCCCGCACCACGGGTATACCCCGTGTGC")) +(assert (= z "ggagugucuaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 new file mode 100644 index 000000000..e3aabba9a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTAGCGCAACTAGACGTTCATATGTGGCGCCATCGCTCAGTAGAACGTAGATAATAGATTACTCCGAAACAGTTCATAACTAATGGTCCAGGACTGCAACGCGAGCGCCACGAACCACTTCAGAGGCGCTCGGAACGTAGGCCTGGGGACACAGCAATGCGCCGGTAAACGGGGGCTCTAGGTTAACCATATCATTGCA")) +(assert (= z "cuccgcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 new file mode 100644 index 000000000..ac0a04f62 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGGCGCAGGTGTGCGGTGGAAAAGCTCTTTGCTAAAAAGTCCCGCACTAGACGGCCGCGTAGAGTGGTAAGAGACAGCCCAAGATGCACCATTTGTTGTCACTAGGGTCATTACAGTCACGAATGGTAGTCCTGCCAGGACGACCTTCATACATTATCATGAGACATCTGGCGTGGAACTCACCCGATCACGGTCGATT")) +(assert (= z "accaucaggacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 new file mode 100644 index 000000000..abf015bef --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAACGTCCAATGGATCCTGGCAAAACGCGCCTCGATCACCTTCACCGACAGATGGGCAAACCAGCAGGTGCAAAGACAACATATCCCTACCAGGATTAAAACGGTCAAGTGTAGTTTGCGTAGGTGTTGTTTTATTCTGGAGCGTTTACAGATGTAGACCGCATTCGCTAAAACCTCTGTCTGACGATTAGCCCAGCGCA")) +(assert (= z "aaauaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 new file mode 100644 index 000000000..2986037cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGCGCTATAGGCTACATCTTACTTCCCGGGTCCTCTAAGGCGTCGTATTGTCGACTTCGCGGCAACGCAAGTACCCTCTGTGTGTAACACGTCAAGGTAGTGCACAACGGCGCGGAAAGAGTTGCCCCAAAAGGCAAAGGCAGTGACCATATCTGTCCGAAAGCTCTGGGTACATAATTCGCAAGGTCTCAAGTAACCT")) +(assert (= z "gugcaguuccaucacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 new file mode 100644 index 000000000..f208a6c3a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGTAGCTCGCGAAATTGTCTAAATATCCAATGCTCGACCAAATATAGACTGCGAGCTGGAGGAGTGATAACAGTAACTCTATGCTAAAGTCAGCAGTCGCAGCATCTTGTGGGCGAAAGATCCACTTGGCGGTAACCGAGGCCTGAGTCTGCAATGCGACCTAGACCTTTAGAAAGTTTTATTAACTGCCCGTTTTAC")) +(assert (= z "agauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 new file mode 100644 index 000000000..a3cd1ebdd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTATGTAGGTTCAGGGATTGGAAGCTAGCGTCGCCATAGAGCGATGTCCTTTGCACCAACCCTCGGCCTTAACCGATGAGAGTGATCCACCCGAACAATATTTTTGATAAGATTAATTCTAACTTTTTATGGCCCCGTAACTACTGGGAGCCCTCCCGGCAGAGGACAATGGGACGTGATGAAACGGACGCTGGGTGGTC")) +(assert (= z "uauucuaauua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 new file mode 100644 index 000000000..a3a5f7017 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGAGATGTTAAACAAATCCTACTCATCTCGAGGGGACAGTTAGAAGTTGTATTATTTCGAGATTACAGCCTTCTAGGGACCTATGTTACGTGTGGGAACTACAGAATACGTTGTATTAGCATACGAATCTTAAGCTAGTCGATATCATGCTTGCGTTCTGACCAGGATGGAGTTAAAAGGACCCAGAAATTTAATATCCC")) +(assert (= z "ucuaaugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 new file mode 100644 index 000000000..0d8746330 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACCAAGGTAAGTTGTGCCCCCGTGCGGCCAGCAAGATTCGTGAGAGGTATGATCGCAGTCGAGCTCAATCTGTACCAAGGCTATACTTCGACAGGCACATCTGCAGCGTACAATCAGTCGGGTTCCTAAGACTAACGTGGCCCGTCCCCCCCAAGGTACTATGTCTCCCGGTTATATAACTCGAACCCGTAAAGATGTGG")) +(assert (= z "augauacagagggccaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 new file mode 100644 index 000000000..b25dfd547 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTATTTGGTAACCGCAAGTGGTAGGGTAGGAACATTCATCCAATTGTCGACCAAACACTTTACGGGAGTTTTTGTACCATGGCCGCATCATGCAAGACACATGGCTAGTAGTGAGAAGGTCTGCCTTTCATGAGCTTAAACGCACTCCTACACCCCCACTTGCTCGAGATCGACGACACCCTGCGAGTCACACACTCG")) +(assert (= z "aucccauccuuguaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 new file mode 100644 index 000000000..b3e734902 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCAGATCGGGAGAACGCCTTACTCGCACGACCGTCGATTGGGAAACGCTGACCTATGACGTCCCCTAAGTAATAAGTAAAAAGGGCTGTCGCGTTGCGACGCCTTTCAATAGCTAGTAAGGATTTGCGCTCTTCCTGCCCTGATCGTCGTTATCCCTGGGGGCCAGGCTGATAGACACGGAGTAGGGTATTTCCTATGG")) +(assert (= z "uagcccucuugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 new file mode 100644 index 000000000..003aaeb77 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCCATGTGTAACAGGCGTGGATTGAGCACAGCTTACTCCGCGCCTCACCACCGCTTTATCTGACTAGAGGATGCAACGACACATGCCTTTATATAGGCATCAATAGCATAGAAAGAGCCTGGGCGAAAGTGACGCTAGAATCTGTTGAATACATCTAGTCGCAGGCGGCCTGCGGTTTTTCACTCACATGTTCTCGGC")) +(assert (= z "agacaacuuaugua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 new file mode 100644 index 000000000..debcae70f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACCCGGGAACGGTCCCCATGGCTTGACACCGACACGCGCACCCTGTCATGCTTTAGTTTTTTGTGCAGACCCAGCAGTTAATGAGATTGCCCTTCCTCACGGCTGCATTTGAACGCATGGCCTCCTCAAGTTCCCCGCTGAGGTATCTTCTTTCACACCGAGATAACCCGTCGCATGACGGGGGAGTGCATGACTAGCCC")) +(assert (= z "aggaguucaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 new file mode 100644 index 000000000..ad661870d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGACGATGAGTTGCGTGCGTGTACGGGGCCCCAGTTGCCTTCAAGAACCGTTTGGTCGATCATTAAAAAAAGTTTCCAGGCGCATACTAATCAACTTACCTATGGTCGATCCCTGATATGACAGGGGTCCAACATTCTCACGCCGAAGGCGTCTGGTCGCCCACTGAGAGTGTAGGACAGCAGCGTTTGCCTAAAGCAC")) +(assert (= z "uucaaaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 new file mode 100644 index 000000000..b728b527b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACAGCTGTGAAGACACAATTGTGGCGTTTTCGTGGCGGGCTCCGCGCAACCGCTCGGCTGATGACCGGGTCCGTTTTACCCCTCCTCCATGCGTCTGACTTGTTCAGGTAACCAATGGTCCTCCGACTTTCTAGCCGGTCTGCTCAGAGCGTGATGGTCTTAACTCGCCTCGAAATAGAGGTTCCTGTACACGTGGAAA")) +(assert (= z "guacgcagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 new file mode 100644 index 000000000..b6b39ae10 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTCCTGCAAACTCACGGATCGCATTGGGCCATAATCAGACAAACACACCGGGGGACAGGCCGCTTCAGATCGGTTGGGAAGAATGTGTGCTACCCCTTAGCGCGCAACAGGGTCTTACAGGCTAGCACGCCTTGCCTCCATGCATTGGCATTTGTGGATGGTGCCGACGCCGGCCTAGATGCGATTGCGGGAAGGCGG")) +(assert (= z "ugccuagcguaacccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 new file mode 100644 index 000000000..c49637517 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCAGCTTCTGGCGTGAACATGTGACAACCCTTGCTACGGAGACCTATCGCACGTATGTAATATGACTGTGATTGGCAAGAAGGCACAGACCTGGCTTGCTTGATGTAATACCTATCTCGCGCGCCTTCTTGTGTGTGTGAACACTATGGCTTTTAGGAATGGCAAACCTACTTAAGCTGCGATCTCTCCCTGACCGCAA")) +(assert (= z "gugauaccgaaaauccuuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 new file mode 100644 index 000000000..d90655422 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCGTTCTCGTCAGCCAGAACTCTAGAGACGGGGTAGTATACCTTAGTACTAGATTAACAAGCGGAGCTACGTACCAGCCCCAATATCGAGTAAAGTCGAGTTGTTACTAATAAAATTCATATGCCAGCTCATTACAGGAGATTTAGGCCTCGCAGGTCAGTAAGATAATAGGAACAGAGAGGTTCTATCACTATCCGAT")) +(assert (= z "caacaaugau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 new file mode 100644 index 000000000..dda758bf8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTAAACTTCCCACAACCCTACACAAAAGCTTAGGCCCCTTGGATCACGCTACCAGTTGAAGCCCAATCTTCTCCTTACCCTATCCAACCACAAATCAACACCATTGAGCTCCTCCGATGTCTGCCCCTTAACTATACACGTCCCTGTAGCCTTGATGACAGAATCCCAAGGAAAAGCAATCTTTCCTTCTAGCACTCTAT")) +(assert (= z "uuggugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 new file mode 100644 index 000000000..57819e5e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAAATAGGCGGGGACTCGGGTACTTCGCGCCGTACAGCTTTATGATAGCTGGAACCCGATCAAATAGATTCGGTACATTTTTACGCACTGTCGACTCAGCACTATGCATTCGACACACCTTACATAACCTGGGTTAACAATAAGGGTCAATGAGACTCTTTGCTAATTTTCTGTGCAGCCATGGGATTGTAGGATCTAG")) +(assert (= z "uaaaaaugcgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 new file mode 100644 index 000000000..94f19c20e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAAGCGAGACCCATGCGGGGTCCAAACTAGACAGAGCTTTGTACGGGCGGCAGCAGTGACCGTCCGTTGGTCGAAAGGCCTTGATTCCGAGATGAGAGCCCTTTATATTAGTTCGATGGAAATAAACTAACCGGAGGTCGTCCCCCTTTGTCACACAGAGCATCCGAACACGGTTACGCAACGTGACATTGATAACCGG")) +(assert (= z "cgcucuggguacgcccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 new file mode 100644 index 000000000..06fdd0f51 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCTGGTCATTGCCTACATATACTCGAGTTACGTGTGTCGCTTGCTAGACTAGAACGTCTGCATTCCTGTGACTACTTCAATACCTCGGAGTCCATTTCATTCCCCGAGTGCTGCTCATCGTATACTATAAAGCCACTTTAAGGCAGTAGGTGACTGTCTAATACCTAGGACAAATAGGGAGTACGCCTGTGTATAGAT")) +(assert (= z "ggagccuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 new file mode 100644 index 000000000..c3c8eb86d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGGATTAGTGTGCTGGCAAGTGCCAGATTCTAGCTTGTGTTTAGCTTGCCCAAACCTCTGTATCAGTAGCGTCAGTGTATATTCACCTGTCCGTCAGTGCCTGCGAACAGTCTCCAGGTAACTCGACCTGGCAATCACTGACTCTAACGCAACGCTGCGGTGTATTGCTTTCGCTCAGGCAACAACTGAAACCACCGTA")) +(assert (= z "uucacggucuaagaucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 new file mode 100644 index 000000000..a2979ddfd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCGCCAGCCCCCAACCACCGGCCCCGCGCCAGCTGATAGTGCCGAAAAGTGGCCCGCGCGCAAAGTAACGCGCGGACGTCTTAAATGCCCAAACCTCTCAAAATATAAGTACAGGATTGATCGTGGGATCTGTGTGTCGGTGCTATATCCCGCCAGGATGCGAAGCCGCTAAGGGGTGGGGGTAGGCGACCCTTAGGG")) +(assert (= z "uaacuagcacccuagacaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 new file mode 100644 index 000000000..e0befc928 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTCCGTCACCCTCCTGCCTTATACCTAGAGATGTCTCAACCCCGTCAAGGCGATTCTGTAATCACACTTCAAGCTACTAGTGTAGTGTGTCAAGTAAATCCTAGACCACCGCGCTGGAGCCTTCAGCGTCCTGGCAGCCGCGACGTCGTCGCCATTAGGGGAATTCTCCCGTAAAGGTTGTGCTGGGTGCGTATTCGGA")) +(assert (= z "guucgaugaucacaucacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 new file mode 100644 index 000000000..2f81590ac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAACGGAGCACGATTCTCGAGGCTCTACCTCTGGACTGCATCACGTAGCCAGATCCATTGGCCTAGTATGCAAACGAGGATGTCGAGACCTACGGATTGTTCACCGTATACCATGTCGCGCCCGACGCTAAATAGAAAGTAACAAATTACGCGATCTGATGCTAAACTGGGCTTTGCACTGTACTGTCCTTGAGCCTCG")) +(assert (= z "cuuucauuguuuaaugcgcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 new file mode 100644 index 000000000..5f9d826b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGATCCAGGCGATGAAATAGGGTCGGTAGGCTAGGTCCCGGCTTGTACCCATCCTCCGCGCTGGTTCGTAGTCTACACAGTATTTGACGTGTATTGTAACGACGATTGCCAGAAATCCCATCGCAGGACAAAGTTAGAATAGACCATGCGATTGGTACTCTGATACCGACTTTGATAAAAACGGGTCTCCTATCATTCG")) +(assert (= z "gagacuauggcugaaacuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 new file mode 100644 index 000000000..fd0a209f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTCAGGAACCATAACCATCTCTAGGCCCAAAGTCCGTGTTTATTTTATGATTTTACACTAGGTCTCCGATAGTACTCTAGTTGCGACATGATCAGTACTGGCGGGTCAAATGCTCCTCTTGCTAAGTGGTATGGGGACGTTCATCAAAGTGTTTCAGCCCGGGATCTATATGTAGGCGAAGAGTCCTAACCATCTACGA")) +(assert (= z "ucaggcacaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 new file mode 100644 index 000000000..13984740f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGGGCCGCCGACGACCGGTTTTACTGGGAACTTGAGGGAGGTGAGATGACACTAACCTGAAGATCCTTGAATGCATGGATAGTAATCGGGTGATTCCAGATGATGAGTCCTCGTTAGAGTTGAAGGCGCCGATTGTAACTAGTACGACGGCCGACTCGTCTCGTGCCTTTTTCGAGGAAGAGCCCCAGGCAGGTAGGAA")) +(assert (= z "ggcugcuggccaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 new file mode 100644 index 000000000..c87cc9f43 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCACAGCACGGAAATCTCTCGGTGCTGACGCGATTGCCTAACCGCGGCTCCGTTTCAGGCTTTCAAGACTCTGGGGCTGGTTTAATAGGAAGCGGGGCGTGGTGCTGGGACCGATGGTCCATCAGACTGCGGCCCCTGATATACTAGGCGGACGTGCAGACCTGGGCAGGGTCGTTGGCACTTACATAGGGGTGGGGATG")) +(assert (= z "ugccuuua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 new file mode 100644 index 000000000..f3639ce5d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGGGCACGCAAGGTTGTACAGAGACGCCCTATCCCTGACACGCCCGCTGAGAATCACAACTTACCCAGTGTAGGGTGAAACGCTGGGCATACGCTGCGTATCATGGGCCCCAACGAGTTGTGATGACAAGAGGCTCTGCGAGCATAGGCATGATCGTTTACTTAACTTCATACACTCCGCACGTGCAACTAAGCATCGA")) +(assert (= z "caacacuacuguucuccga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 new file mode 100644 index 000000000..e2643a0d2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCGGTTGCACATCGCCGCAAAACAAGTCATAACAAGTTGGGCGCCCCCGACGGCGCGCTCCCTCTGGATTAACGATCAACACTGGTTTCAGGTGTGGATCTGGGGATTCAGTCCCTCAGTCCATTTCAGTCGGGGATTCCCAAAGCTAATCCGCTTTCGAACAGGGATGTAGCCTTTAATTGGTCATCGGAGTGCGTT")) +(assert (= z "auuaaccaguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 new file mode 100644 index 000000000..1b1edaab3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATAAGTGTGGTCGTGGGCTATGGGATTGACGAGACACTCGTAGTGTCCTATTTTAAATTAGCTCCCCCGTTGAACTACCCTTCCATGACTTATGTGAAGCCTTAGGAGTGGGTTGACTCTGCGTATATGACAGTTTACACCTTGCGCAAGACCTACTCACATCCCTACCAACCCTTCTGATCCGTTATTGATACTTGTG")) +(assert (= z "ggaacgcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 new file mode 100644 index 000000000..ef030a56c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATACCCAAAACTTTCAATCCTGCTCGGTTTGTATTGTGGCAAGCTGTCATGATCATCTTGAAAAGGCTCCACCACTTGTGAGTCCGCCGATCTGGTGGTACAGACCCTATGTTGAGGACGTAGGCCTCTGTTGTGAGTATAAGGGGTCTTGCAAGTAACTACGCCCGCTTAGCGAACACGAGGGGCAGCCTGGATCACG")) +(assert (= z "cuuuuccgagguggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 new file mode 100644 index 000000000..2d7c8f8f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACCAAGACGAACAGTTGGGTCTGGGTAAGTGAGACCTCTCAACCAGGTGGGAGGTCCCTTCAAAGCGTCTCTCGCGGATATGGCTATGGTAATCTCCCGATTGTGAAGACAAACAAACTATATGCTATACTCTATCATCCCCAGGCACGCTGGAAAAGTCCCCCTTCCACACGAGAATAAATTGGTGCGTGGACTATGG")) +(assert (= z "uguuugauaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 new file mode 100644 index 000000000..88074d403 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTGACATCATCTGTACCATGGAGTGTGTACCGTCTGAGACCATTACAGTTTATCTGAAGTATAAAAGGTCTCCATGCAGTTGCGGCGAAACTCACTATGTTAGTGATTAATCTCTCTGCGCACGCATGACTCAATGAAAAAGTGAATCGTATCACTGGCAGCACATGAACCCTGATTCGGATAAGTAAAGGACGATAC")) +(assert (= z "gccgugaccgcuuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 new file mode 100644 index 000000000..4493d8768 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTATATAAAATTTGGATTACGTAGGCAACTTGCTGAAATCACCGGCCTCCTCCTGTCGCTCCATCCTCCCCTCTGGATCAGGGCCTTGACCTTGCCTTTCTACCGTAAGTACTCATGCAGGGAGTTCTACTGCCCAAGGCCCCCATCGTAATTGGTTCCGAAGCTCTGGTATAGCACCGCGCTCACCCGTACACTACATT")) +(assert (= z "gggacugauuuuuau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 new file mode 100644 index 000000000..4a7d3aff2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCTGTGGGCAGTGTGCTACCCCGCGCCATTGTAACTCAACGGATTACTGGGATGGGTGGGAGTCATCGCGCGATACCTAGTTAGACTGTTTTTTGGGGTACCCTGTGCCATTACTCATAGGCGCCCCGAATCAATGATTTGGCAACCCAAACGGATCCTTCGGCCCGGCCCCCAATCACCCGAGATATGGGCGCACGTG")) +(assert (= z "cccgugccuacgacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 new file mode 100644 index 000000000..271c61d73 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTGAGGGCGACATCTAGGACCAAGCACGTTTGTTGCTGTGGTGAGCCTGTACACCGGAAGTAAAATTGCACGACGGTTTTACGATCGAGAATTAGAGGCCAGGCGCAAAGGGTATCGATGGTGTCTCCAGCAACTGCACGTAACGCCTCCATTTTTCAGTCCAGAGTCTAAGCTCTTTCCGATTAAGGGCTAACCCTG")) +(assert (= z "uaggaucuacauaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 new file mode 100644 index 000000000..a07526bcc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCTATATACTAGTTGTGCAGGGGAGAAATACCCATGCTTTGCGTTCACAGCTGTGGCCGCAAAACGATAAAAGCAGTAGGTATCAATTATCCGTTAAAACCTTGAGGTGTCACGCAAGCCGTGGAGAGGGCCGGCAGCTATTCCGATAGACATCATGCTGAACAATTAGGTGCCAGAGCGATTGGTGAATGGGGCGCAT")) +(assert (= z "uauaaauagaguuga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 new file mode 100644 index 000000000..d5c3dab08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTACTGCAAAATGTGAGCATCCGACCCGTACAGTGACGTCAAGCTGAAACAGACGTCCATGGGGAGTCCTTTTCCAGTGACCTAGTAATTCTTGGACGCGTAATATCCAGCTGCAGTTGTCGAAAGGATCTGTTGGGAGGAAAAACCAGATTTTCGTAAAAATAATCGAACCGGAGCGCGTGCTAATTGCCATTGCCTAG")) +(assert (= z "cuagggcguauuguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 new file mode 100644 index 000000000..76b46a877 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATACCCTACGGACATGGAAGCCCTCTCGACCAGGTGAGAGTGCGCGGGTAGAGTAGCTAACGCTCGTGATTCCGCGCCACATATGCCCGGACGGGCAATGGCCCGCTGCAAGACTGAACTAGAGGCGCTTTTCGTTACGGTTTCTACCATCACTAGGTTCCAGTAAATTTCACCCCTTAATGAGCCATGACTAACTGTTT")) +(assert (= z "cugagcgugcucggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 new file mode 100644 index 000000000..371c8daaf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTAATACCCCAGGCGATATTGGGTACACATCCACGTCATACATCTGACTTATAATAGTTTCATATGGTCACCACATCATCACTCTTAGAGAAAGGACCGCTAGAATAGGTCTCACGCCTAGCTAACGTAAACAAGTCTGACGCTTTGAAAAGGTTGAAAAGCAAATCCCCTTTATCTGGCCAGAAGGTCCACTAGACG")) +(assert (= z "acaguuugucaugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 new file mode 100644 index 000000000..fbc364d68 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTGTATTATCATGTCTAACGTCTGGCCGGCAGTAGTCTTGACTAAGTGCATCAGTTAACCGGGTTACGTAATAATGTTAATTGAGAGTAGCTGGCACTATCCCCCCTTTGGTGTTGTTATACACGGTTCGCTGTCGACGCCATTCAGATCGCGATGGCCCTCACCGAGGCCCATACCGCGCATTGCCGGCAGCTGCGGA")) +(assert (= z "augagucccugacaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 new file mode 100644 index 000000000..eb47d0051 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAAGACGACCTAACATCCTACAACAGGCACCTGATTGGACGTAGGCAAGTGCGTAATCCCGATCTGCTGTCTGCCCCTACGAAGAAAACGGGCCTCTGCAGACAAGGCTGAACGTCAGCTATTCTGCAGAGACAAGGTCACGTGCGTAGAATGTGGCCAGAGTGTAACGGAAAGACGTGGCCATTATGATAAGTAAGCA")) +(assert (= z "uagucuugggggcca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 new file mode 100644 index 000000000..8afe22661 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGACCTCGAGTATTTCAGCGCCTCGGAAACCAAGTAAGGTGGGTAATTTTTTGCTTACAATCGTTAATCACTGAGTCAGTTTCTGAGGCGTAGGCGTTCGGAATATCGAAAGCATGGAACCCCGCGAGATCAACTCTTGGTTCTAAAACTTTGTCTCGGGATAGACCGAAGTAAAGGATCTAATTGTCGACAACACCTGT")) +(assert (= z "agcuagugcgggugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 new file mode 100644 index 000000000..b12651b80 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGCAAGTCATGAGTTTGTACCATAACTCGACGATCTCGTTAATCTCCTCGGAAAGAGAACACGCGAAAAGCACAATCGGTGGTTGGGGCCACAAACACTAAACAAACCCCTCCATATACCTGTCATAGAGGCCTGCCCTATCATAAAGATAGTCGCAAGAGCTTCTGCAGGTTTCTTTCACAGCGATGGGCAGCCGCGA")) +(assert (= z "aggugguaaucccgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 new file mode 100644 index 000000000..1875e2f33 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTATCCGTCGGACGTACACTTTTCGTATAGAGCAACGGCTTACGAGTCTACACTATGAAATATGAATCGTCCTGGTATCCCCTATGTATGTAACCCAGGGTCGTAGCGGGGTTTCCGCCCGCGAATAAGGGTCTACGACACGGACACTCTTGCCCGGCGACTGATTCCAACTCTGGTTGACAGGCCAAAAAAGTTTGTAA")) +(assert (= z "gccaacuugccgcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 new file mode 100644 index 000000000..fb6c1bcd9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTTGTTAAGATGGTTGACCCGGCGTCGGCCCTGTATCAAGAGTAGATAAGGATAACACCCCCGCATAGGTGGCGCTCCAAACATAGACGGGAGGCCGGGCGACGCCACAATATCGCCATGCGGAGCTCAGGCTAGGAACCGTAACCTGGGTGCTCACTACCCTCGCGTTACGAGATTCCTGCACGATTCACTGAGAGC")) +(assert (= z "uguucacagcucgga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 new file mode 100644 index 000000000..9f61c3e82 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTATCACGAGTGTGAAGCAGTCCCAAACTGTTCTACAGTTTGCGATAACCTCCGCCTATTCTCTATCGCAAGTGACGTGGTAGGGGCCGCTGTAGAAGGACGGGGGTGACGAACTGAGACTACGATTTTTTAAGACGCTCTAAGACCGCTGAGACGCTCTGCTGACCTACCGACTTCATTAAGATACGCAGTCAACTCA")) +(assert (= z "gcucugagaggccgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 new file mode 100644 index 000000000..bc05676d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGTGGTACTCTGCGTCTCCCTTGACGTCGATGTATATCTAGTGGCCATGGTTGGTTTTCCGGTTTGGCACCTCGAAGTAGATAGGCAACATTCCAAAAGAGCGATACCACCGTTGCCGTGATTGGTTTTTTTCATCACATAAACGATAGAAGAGGTCAGACAACGCCCCAGCCGCCGTGTTTTGATTGGGCGCTTCAT")) +(assert (= z "ucaauaggguaauau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 new file mode 100644 index 000000000..00fcaa6d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGGTTCATCTAGAAAGCCAAAACCCGCTCTCACTGCTTATCTTACTTCACAATGATAGGTGGCCGTCCGCGCGGTCGTTATCTGCATAGAGTAATCAGTAATTTTCGTGCCGTCACCGTCAGATCGTTACGATACCATTTAGGGCTTTTCGCCAGCTGAAAGCAGTTTGTGGGTCGGTATGTTTACGAATAGCTAGGAA")) +(assert (= z "cacacgauuuuagac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 new file mode 100644 index 000000000..f8b3b58b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAACTTTTGCCATAAAAACCCACACGAGATAGAGAGCCGTAATAATATCAATAGCGTAGAGAGCCAAATATGGCTATGCGCATTGAGTTGGAAGGATCATGATCCAGAGATGTCCTTCAAACTTCGATTCTTCCGTTACCGAACTTGCCGTTCGTTTTATAATAAGTGAAATGCTCCTGCAGGTCGGTCATGTAGCATC")) +(assert (= z "aaacagcauguuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 new file mode 100644 index 000000000..2e8467e58 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTGAGAAACCGTGTTATCGTCAGTGCCACCTCTCCCCAGACTCAGACGCAGTATTCATCCACCCCTGCGCAACTGAGGTTCGCAGATGCGTCACGCAGGCAGAAAACATCCCGGCGTGGTTTTAAACGTTGTGGAGGTCCTTAGGGGTCGTCGACGGTAATTCCGTTGTTGGACCTTTTACTCAAGAGGTCCTTTTAG")) +(assert (= z "gaacuuucugccagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 new file mode 100644 index 000000000..822155028 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATAAAATGGTACGTCAACAAGGCTTAAACAGGTGTTTACCATTACTGCTCATAGGTGTGTTTGGGATATGCTAGTTTGCGGGAGTACTCTCGAGGCACTGCTTCTTCAAAGCCGTGGGATTGGTGAAAGATCGCCTGAGCCACCAGGTCAGCATTTAGATTTCTGTCTAGTTGAAGCAAGCCAAGCGACTCACCTATTG")) +(assert (= z "aacaacgacgaggac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 new file mode 100644 index 000000000..591ed97f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATGAGCTCGACGCCTCCTACTTATTGTAACTCGTGGTTGGGCAGGATCAAATCGGGGTTTGCCCTCAGCTACTGCGGAAGAACTCTGCATGTGAGCGCGTGTCTCCCACATGTCTGCAAAAGCTAAATCCTTTTAGGGGTATTCAGTAAGTCGCCAAACGCTGCATAACGTGTGATTTAGAATTTCCCATGCATCGTGA")) +(assert (= z "agacaucugaaucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 new file mode 100644 index 000000000..47bfd8bff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTGCTCCGACAGCTCATCGTTGACTCTGGGCTTCTGCAATCCACATGGGCGTCTGTGCAGTATGCTCTCGTGTTACGACTAGGACTAACCGTGGACGTTCCTGGGCTTTGTCGGTGACTGGATGCACGTATGAGGCTGTCATCTTGTCTGAATGAGTGCGTTTGTGGAGACTCAGCCACCAAAGTCCTCATGGGCACGT")) +(assert (= z "gaaguggacaugugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 new file mode 100644 index 000000000..a699c10a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAAAAGCCACGCGGAAGATCTTTTAACATTGCATCTGGCAGGGTCCTGACTGTGGTTCGCAGAAACCGGATCTCGCGTCGCTTGCTCAGGCGGTCATACCGGAAGATACGTTTCCGACCACGCAAATGGTTCGGCGGTTTAACTGATCACTTGGCAAGGGCAAATCCCCCAGCTGATCTCGTAAAATGATTATATGACC")) +(assert (= z "cacuacccauucaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 new file mode 100644 index 000000000..14b20ebe6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTGTAAGTCTGTAGTCCGAGGACAATACCCCTTCAGTGCAACGAAATTTAGCTATAGTGCAAATAATAAGCGGTCAATAACTGGTTTAGTCTCCTCGCCCTTGTGAAACCCTCAGGAGGTCAGTCGGCACACCGCTTGTTTAGGAGCATTGAGTTTACTCTTCGCCATAGGTGGATAGGCGATCATATTAAGGAGTTAA")) +(assert (= z "uguaaguggggucac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 new file mode 100644 index 000000000..301fe0a48 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGTCAGAGATTATAATCTTCTTTTTGATGACCAGCGTAGTTGGTCAAATCAGGCACTCCACGGGGGACGGTTGTACACGGGGTCCGAAGATCCATACCAGACTGGTAATGAGCTGGGCTTCTAGAAGAATCAGGCGTCTTCATCACTCTTTCTCGTAGCGCTCGGAGATATTTTAGCAAGACGTGCATGTATCAAGTAC")) +(assert (= z "cgcuugguuugcgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 new file mode 100644 index 000000000..6845b4ec1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGGGGCAGACACTTTTAGGAGTCAGACACGACGTTGCGATATGGACCGCACGTAGGGCGGCTATTGTTGTACCTTATCAGCTTACAGCCCGTCTCGTGCCGATAAGCATCTTACCAATCAGCGTCAACCACATTCTCCTAATGTGGAGCGCAAGTGTCAAGGTAACTCGCCAGGTGAGCCATGAAAGGGGAATGGGCT")) +(assert (= z "gguaucgaucggcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 new file mode 100644 index 000000000..01f75afe5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACACTCACTATCGCTGGCATTCAAAATGCTGTTGACTTAGGAGTGTGGGGTCCACACCCGTGTGGCGAGACTCAGCGAAGCCTACAGATTTCTCCAAAAAATCAAAGGGTTACTGGTAGCGGTCCCGCAAACAGACGTCGTGACCCATCCTCGACGGGGCCCCGTCAGGTAGGTGCCAACCGACTCGGCTTTAGAGGGGT")) +(assert (= z "gagguacuucucaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 new file mode 100644 index 000000000..5f1f11660 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGGATCCCGTGCCAATCGAGTAAGTCCCATAATCACGGCTCATACCATATTGGCCGCAGCACCGACTTAGATTATCCTGTGAGGTTCAGGCTATCCATAGAATTAGCACTCCTGCGAACTTTCCCTACCGTTGGCCTTGTACGTCCGAGATTACAGCCGACCCAGTATAAGGCAGCTTCGACGTGATTTTTCAGCTTGC")) +(assert (= z "gccugggacccagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 new file mode 100644 index 000000000..a9378f9b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTCCGCTCTCATGTACTAGCCAGATCCTCCAAGTAAAGCAGGCGGACGCATAAGAGGTAGCGGCGGCTTCTCTGTTCGTTATAGCCTAAGCACGTCCCTTCGAAGGCCGGGCTAGCCGTACTAAGGTCTGTGAACCAATAGGACGATGCTGCATTCGGCGGCAGGTTATAATGGCAAACACGGATGTGCACCTCGAGA")) +(assert (= z "aggaguccuaauugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 new file mode 100644 index 000000000..83906c12c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGAATCTTTATTACATGGCCAGTAGGATGGTGAGTTGCCCATCAGGGTAAATCGTATAAATGCTGGACGTGGTAACTCCGAGGTTTTACCCACTTCGACATTTAATGGGATATACTGCGGACGTCTAGTTATACTCCGGGGCTGGCGGTGTAATAGAGTGGGCCGGAATTTGACGTGTATAGCGGCACTCCCCAGGAG")) +(assert (= z "cacgcgaagugguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 new file mode 100644 index 000000000..2cdffc026 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGCCAACCCGAGCACCCCCTGAAGGAGTAAAAAAGCACAGTTATTCCACTGGCCACGGGCAGTAGTAGAAACTGCAGTTAAGGTCGGACTCTTTACTATTATCTGGGGGGCCGCACGCTCCCTTTGCAAGTACTTATTGTCTCAGGATCCTAAGAAATCCCCTTCGGGCAGCAGAAAGATAGCTCAAAGACACTACTTA")) +(assert (= z "caagguccgguuguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 new file mode 100644 index 000000000..4ad83b2f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTACAACTCAGGTGGATTTGTCAACATGCCCAAGCCGGTCAACAGGCGGTTCCGAGAAACGCCAGTGTGGAAAACTGTCGTGGGCGCCTCGATTGCCTCTATACTAGCCAATGGTGAATCTTCGAACATTACCCTCAACCAGTATGGAGCTTGTAGTTCAAAAAGTGTGGCGACCTAGGATTCGACGCGGCGAAAGTTT")) +(assert (= z "gugaaaauuguacac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 new file mode 100644 index 000000000..1e0795ac6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACACCTATATTTTAGCTAACCTATCTTCTAGTAGCTCAGTGGAGTTAACACTCAATGGACGTTCCAAATCGCAACGGTTTCGGTCTTGTTTTGCACCCCCTCAACATGTGTCGGGCTCCTCGGATCACAGTTTTTGTGATATGAACAGACTGTCCGTCATTCTCGATAATAGCACACGAAATGCCATGAACGCGCGTAT")) +(assert (= z "auccuacugucguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 new file mode 100644 index 000000000..71146a7f9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACAATTTATGACTGATTTACTAGATAGTTGGAGTCAGATCACTGGTGAATTTCGGGTAAAACGTGCAGACGTGGAGTGTACCTTTCTACGCAGTCTACCTCGGGACGACCGTTGCCTTTATTTAATAAGCAATGAACATAGATCCCTATATTACACCTGTTCACGGGAAGCGTCCTCTTCATACAGCACCGGACTACAC")) +(assert (= z "ggcucguacgaguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 new file mode 100644 index 000000000..bf25e2dfb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAATAGAGCGTCTAAGCACATCACGGATGGATGGGCAGCATATTAAGGCTCAATCTGATTGCATCATGGAGCATCGCCGCTCCAAAACAATGCGGTTCTTAGAAGGTACAATGTTAGATATTTATGTGCGGTCAAAACTGCGCGACACGTTTCCGTGCTGATGATCCTCGTGTTGTATCACTTGTTATGTTAGGTCATT")) +(assert (= z "augacccugcaagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 new file mode 100644 index 000000000..97feecdbc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATATGTGGATCCCCTTGATGATCCTTAGTTTTCTCAGCAACCACTGTCATTAATTTTGTATAGGAACCTGTAAAATTAACGTGCGCCAGGAATGTGCGTCACGCACTGGTAGCCGCCCACCGAAACAGCTCATTTCCGTGTTCTAGGGGTTCCTAGCGTTTCACGTGGAATACGGCTCGCCTCCGCGACAAAGCGAATG")) +(assert (= z "gauuucgcaccaugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 new file mode 100644 index 000000000..92c243554 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGACCTTCGTTAGAGTAAAATTGATAACAGACCTCGCAGGCATGTCCCGATATGCAATGCAAAGGTGGTCTGGGGCGAGATGATAACGCTAGCTGAGGTCTCCAATCCTCAACGCATAGGCATGCCACATGCGTGATACGAAAGGGCCCGCCAATCATTCCAGGGCCATCGCTGACACACTGGGCACTGCGATTTGTTA")) +(assert (= z "accuuuacggauugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 new file mode 100644 index 000000000..eb90a4a47 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCGAAGCCTTATTAGGCGTGCAAAGTGATACCGAATAAAGGGTACCCCACAACATCCTAATCACGCCCAATACACTCGAGCTAGATGTTGATTGAGTTACGATCAGGACACATGCGATGGGCCACGTGGCAACCAGACTTTCGCACCGCACACCATTTTGGGTAGGATAACCGGAAACGTTATGACTAATTCCATGTAA")) +(assert (= z "aguugucuaguccag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 new file mode 100644 index 000000000..39deacbcd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGGTTGCGGGATTCTCGACTCGTCCCCTGTGCAGCCAGAAATGAGTAGGTTGAAGCCATATCTCCTAGAGGTTCCCCTGAGCTAGATCGGTTTCCAGTTCGGGTGCGCCTACAATTACCCTACGAGGGGCGCAAAAGATCAGATCTGGTACACCAACCGTTACTGGTGTTCCCCAACTTGCTATACAGGCAGATCGTT")) +(assert (= z "gcuauuucuuuucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 new file mode 100644 index 000000000..f57b0847e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGAACGATGTTACTTGGTCGGCTACGGAGGTCCCCTCAACAGCGTCAAAAAAGAGAGACGAACGGCACCCACCGGTAATGCCCCGAAAAGGGAAGATCCACGAGATCCGAATCTGGAGATAGAATCTACCAATCATCGCAGCCTTTTCTAACTAGGGCATCGATCAAGGCCAAGTGAACTCACTCGGCCGGGATTGGCA")) +(assert (= z "gggugcgaccacagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 new file mode 100644 index 000000000..687e8af34 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCTCTTGTTTCGCCTCGAAGTGAATAGTGGGAAAATCTTAAAGACACATACCAAGACTTATCCCTTAGGGTACGCTGTGAGATTCCCTGTTTCAAGGGTTGATTCAGCGCTCGAACAAACGAAGTCGCCACGCAGAGCATCACGAACAGGGGAATTTAGCTACGAGTCCTCAGATATTCGGATTAGATTTAACACGCAC")) +(assert (= z "uucacacuacgcaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 new file mode 100644 index 000000000..84a50e6cd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACGTCAACCAGGCCGGTAGCGACGCTCGCGTCTTAATTGATCTGAACCAAAGTGCGGGTCCTACTATTTCGTGTGGTCCAAGTAGTAGCCTTTACGCATTCCAGTGGTTATTCCGGGCCATAAGAGGGCAGCGAGACAACCCTCAGGTTCTGGAGAGCGGAGTACAGCCTATTAGCTTACGACTATTAGCTCGCATCA")) +(assert (= z "cuuuccaucuagcaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 new file mode 100644 index 000000000..b7f939cea --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATGTTGTCTTATACCACTCTAACTGACTGGTCCTCGTAACCCGTAGTGTTCATCCCTATGACCGCGCCGGTAAGACAAAGGGGTATTGATTCTCTTACCGCTGGTAGGTAAGCTGGCGTAACGGGACCGGCGCATGCGTAGACCTAGTATCCACTATAAGCTATTACGTCACCTGGGTTCGTGAGCGGATACATTACTA")) +(assert (= z "gaaacgccucaccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 new file mode 100644 index 000000000..1d7e8e93b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGCAGAGTTTAGCACAGACTCGTAGAAATTGGTGACCTAAGGCGGATGGCTTTTTTTAAACCCCCTACGAAAATTCCCAACCTGTAGTGCAAAGGCGTTCCGACCGGGTTGAGAGAAAGCTGCGCATCTCGCTGGCAGACAAGAGTTTTCGATACCACTTATTTTATCATAACTACGCGACGCTCCGTGCGAGTGGGAG")) +(assert (= z "uauugagagugucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 new file mode 100644 index 000000000..d842274f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGGGTAATATATTTGACCGGTGGTCCTCGAGTACATTAAGTTAAAAGAAGATTCAAGACCACTATGCCGAGACGAGAATGCAGCTTCAATTATCAGGTCTATACATTGACCCAAATCCTCGACCGTAACCCACTAGATATGCCGAGCTTATGAATTTTACGTTCATGCTCACGCGAAGGGAGTAAAGGTATACACCTC")) +(assert (= z "aggacgaccgaaaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 new file mode 100644 index 000000000..07fb17945 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGGATTCAGTACATCCCCGCTGGCACATTTGCCAGCTAAGGTTAACGAACTTGCTATACTTCGTCACTATAAATGAATTCACGGGTTCTCTTTTTATCCTCAAACATTTAAAGCCAGCAACCCCGCTGCAATCAAAGTCACGATTTCTTGCGCACATATTATGGGGCAGGAATAGGGTTTGGTGTGCACAACCATAACA")) +(assert (= z "gggugcacgucuagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 new file mode 100644 index 000000000..0bf900d1b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACAGTCTATCCAGCACGTTCCATTACTGAGGGTAGTTTCGTGAGAATTCCTGTTCACAGCGGGCACACGGAGTTAATCAACTACTCTCGCAGATGTACCCGTGCACAGGAAACTAACTTAAACATTTGTTGCTTTAGAGATACAGGCATGTTCCCTTCTCGTGCGGAAGTGACACCAACATAGGTGGCGCGGCCAACCT")) +(assert (= z "ccgacguacuaugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 new file mode 100644 index 000000000..f962dee28 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACTAGCACCAGCCGTCCGTCCGTCGTTCCCAAGCTAATTACGTCAGACTCGACATCACGCACAACCAGTGGTAATAGCGTCAGGGGCCAAAGTATAGCGCGCATGATTTGCCGTTGCATAATTGGAGACAAACAGTACACGTACGTATCCTTGGGACCTGACGCGAAAATAGTGTTGCGCTTGCGCCAAGAAATGTCT")) +(assert (= z "accagacucauauua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 new file mode 100644 index 000000000..17fdcea69 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACCCTCAGCTCCATCTGCCAACGCACGCGTCCATCATAGTTCCGTGTTCGCGCGTTGGATTCTTGACCGATACACTGGGGCGGGTGGTAACGTTCAACCATATCGACCACGAATACTTGGTGCAGACGTATGTATTTGACGTCATAACAACACCCTTGCGACTACCTTATGTAAAATCTTCACTAGCATTACCCACTA")) +(assert (= z "accagagcacagccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 new file mode 100644 index 000000000..3a321a0b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCAATTAATGAGCGCCCTCTTTACCCATGGTTACATTTTTACGATGTAAACCTAACGAAGGGCATAGACGGCTACCAGAAATTTGCCTAGGGCTGAGTGATACTTAGCGAATGACTCTGTTTCATCTTGATCAAGCCGGTGGACTACAGAAGCAAGCTATCCGGGTTACTCTGTCCCGTACAGAATGCAAACTAGTAAC")) +(assert (= z "acuaaccagucgcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 new file mode 100644 index 000000000..0aa9a623d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAATCACTATGGTGAACCATCCGAAGCTTGAGTTGCGCAGCAGTCTCACCTGGAGGGAAAGAGTGAAACGCTACATAGAGCCAGTTCAGTGTGCCCATATACTTGATAACTGATAGGGCCCCTCGGGTGTCTCAATCACGAGATCGCTACACCAATCCCCGAGCCCCAACCTACGACACAGACTGATGTTGCTAGTCCC")) +(assert (= z "gcuuauuaaugaucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 new file mode 100644 index 000000000..798f2fd0f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGCTGAGGAATCGCGCCCGTCCCTCCCTGAAGCAGCCTTATAGGATTGTTGTCGCCACCTAGGTGATACTGTCTTGCCAGACTTCCCCTATCTTATCGTCTAGTAGATGAAGTCTTGATACCATACACAGTAAGCGGCTAGATGTCGCCTGCCTACCTCAAATATCTCACGACACAGGTGTCTGGGTGTGATATCCGAC")) +(assert (= z "ggguaggaugcgugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 new file mode 100644 index 000000000..085658807 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTACACGGAAATACCACCGTTTTTGAATTGCAACTCCTCGCGTATGCAATCACCCTTGAATGTGTCATCAAGCACAGATAAGGCGGCATAATTCATGAAGTGCGGTATCACCACCCGTTGGTTCTAAGCAACTCGCTGAACTTAGGGCGGGGAGAGACGAAACGGGGCATTGGCTTAAACAATTCAATAATAGCTTACGC")) +(assert (= z "uguaugaggaacauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 new file mode 100644 index 000000000..35701c4f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATTGTCGATGTCCCTCAAATAATAGCGTTAACAGAAACGTAGGTGCACACACGTTCGCGCCACCCTTAAACTCGAGTATTGCTGAAGTTCGCGCAGGTGAAGCTTAGTAGTCCTGGCAATCTGGTAGGGACAATCAGACAGTTCTGGTAATTAGACGAAGAATCCGCTGCGGCGGTATGTACCACACGTCCGTCCCACA")) +(assert (= z "uaacaaugcgauacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 new file mode 100644 index 000000000..f74c5ea50 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAAGCCTGTTTACGCTGGACGCGAGCGTTCGAGCAGCGTCATAACGGACTGGCCACGACATGGAGAGTCCCAGCCCTGGAGTGAATGATTGGCGACAACCAAATGCTTCCTGTCAACTGTGATACGGCATGCTCCGTGGCGTACCCAACAAACGCCTTAATTTTGGTTCTATAGTAGAATCGTAGTTGAATTACAGCGT")) +(assert (= z "gcuuucgcggauaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 new file mode 100644 index 000000000..919961885 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGAATTGGTGTGATAAGCGGACGCTAACCGCTGTGTCAACTTCCCGCTCGGTGTGATATTAGCTCGTGCACCACCCAGTCGGGACGCACGCAGGCTCAGTCCGAAGCCTCCCAAACTCGATCTTTCTGCGTGCACCCCTTATGGCGCAGGTCTACTGTGGTGATGTGAATGTATTAGACGCCTATGTGGCTACGTATCT")) +(assert (= z "acgcggacgugagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 new file mode 100644 index 000000000..80a748502 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATATAGATTCCATACTCCGTAAGAACCTCTCGGCCGCGCATCATTCATCTGGGAGTACTGTAAAGCCACGGAACTTAATTCCCCCGCTTCAATCCTTGCTAAGGTGTATTCCCTATCGAAATGGGTGAAGCCGGCTTCATACGTACGTACAAAGCTTCCTATCACCGAGCTCAGACCTATTAAACTAAATGCAGAACCT")) +(assert (= z "aagagugacuacccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 new file mode 100644 index 000000000..9cc874d84 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAAGAGCTTTGGAACGACAATGAAGTTCACGAGGGTGGCAATACCTTCCGAATTGCACAAGCTGTCGCTGCCTTGGCATGGATTTCCCACTCGACTATTGCCGCCGTTAAAATCGCCAGATCGATTGAGGCAGGTAACACTCAGAATAAGATCTCCAGTCGAGAGTCCTGCAAACGACATAGCTGTAACGACAAGCTCC")) +(assert (= z "agaacaugugaugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 new file mode 100644 index 000000000..9536f3e22 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCGTTCTCTCTTGGTTAATACCCAAACTCGCGCCGACGTAGAGCCCCGCTAGGGGGGCCACCATTCTGATCGATTGGGCTCGCGTGTGTGCTAAACCCAGTAGTTGACCCTATTTGCTGTGTATGCGTAGCTTAGGGTCGCTGTGTGTCATTCAGCAACTTCTCTGTCCCATGTCGAATATCCGCCAGGCTACCTGGGT")) +(assert (= z "gucccccgcuuauua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 new file mode 100644 index 000000000..dc4dcd6ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCCTAGTGGGAAACACACGGCCCGAAAAAAGAAGCGGTCTTTATCCATACACGGTGCTTTGCGTACCCGTTTAACATTGAAGCGCTCTCGCTTGCTAAGGAGTGCCCGCCCTTGTGCGCGGGTAAGTAGTTAGGGTTTCCGTTCAGATTCAGGCACAATTACATCGCCAGCGCCGTTGATCATTGCTTGGCTGGTTTTA")) +(assert (= z "cuauaggcgcuucuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 new file mode 100644 index 000000000..8dbb4c571 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCATAATACGGTTACGTGACCCTGTAACTCCTTAGGCCTGTCTAAACTTGAATAGAGTGCGTTAAGAGCCGAGCGGCGCCATAGTCGCGAGTGCCCGTATTAAGAACTACTTTAAGCTTTTTCAACGGAACTTTTCAGCGTTAGTCCAGTCCTTTAATTCACACACTCCGTTCGAACGAAGTGGCGCTCCGGGAATAAGT")) +(assert (= z "ugggggagggcgacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 new file mode 100644 index 000000000..4846d5894 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGATACTTGGAGCTGGCTACGACACTCGCCACATCCATCAAGCGGCACCCGATCACGGGTTGTGAAAAAACGTACCAACCATGCTTTAAAACCTAGGCGATTGGGTCTACAGCACACCGAGTCGATGAATATCGAGCTACCAATAAAAGGGGATACGGAGACAAAGAATTAAGGCCACACAGTTGGACGCGGCTTACATA")) +(assert (= z "acggucuugacgagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 new file mode 100644 index 000000000..d59152ecb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGGTAGGGAGCATGTCGGCTGATCGTCTGCGCGTCTGTACGCCGAAGAGCTACAACGACCAGGTGTCAGGTCGATGCCAAAATGTTTTATGCTAGCCACGGAGTATGATCACCGGAAAGCAACTATTTCGATGTCTTCGGTCAGACGATAAGGTCCGCTTCCGGACCGTTTTTTAACTCTAATTTCCTGAAAGTATGAG")) +(assert (= z "aggcguauaccggug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 new file mode 100644 index 000000000..b1bd017bd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGATCGATTGCGGCTGATACAGTATCATCCTTGTCGAGGAGAAGATAGTTAAGTAATATACGCTGTCGAGGTCAGAAGACGCATAAAGACGGTCTTTCAGCTAGAGGAGATAGCAGGATGCTTCAACGGATACCGCGGCTAGACTCACCTGAGAGTAAACGAGACTACTTAGTAAACAGACTGAACGTATGGAAGTCGTG")) +(assert (= z "cgcggcucgagaauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 new file mode 100644 index 000000000..67f53a5c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGAATATAGGCGTGGGCATAACCTGGTATCCAAGGGCATAGAGAGTGGGGAGTCAACAACGCGGGCGCAATATTGTTTAAACCACCCCCGTGACGTCAGCGTTAGTTCGGTTCTCCCGCGCGCAGGATCGTTGTCCGTCCCGTAAGGAGTTATGCATCTCTCCTGCGGGGCCCCCCACGTCCGATTTGTTCCCATTGGA")) +(assert (= z "acacuuuuugagaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 new file mode 100644 index 000000000..78cb1db0c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAGTGCGCGGCAATTATACCAATGTTTATGGGTCTCCCATATTCGAAGACTACGCATTAAAGCTCACGTTTCTTCCCAGATGTAACTCGTACCTTTGGTAGGGTCGGTTGTGTTATAATCGTGCAAAACAAAAAAGCACAAGATAAGTAACGCGGACCAACGGAATATCGCTAGCCCTTCGGTCGTGGCTTCCCTGCCA")) +(assert (= z "caugcgagcucaugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 new file mode 100644 index 000000000..0576b40eb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGCTCCTTAGTCAGTCTGTTCTTAAATAGACTTCGGCAATGATTACTCTCCGAGAGTTATTGTTGCCACTACATATCATCGGTGGCCACTTAACTGGTGTATCTGCGAGGCTTTCCACGACTTGATAAGGTAGCTGACCTAACCGTCTTTACCCTTCTAGACATGTTGGATTGTGCCCCCCGTTCCTGCTTCGGCCCGG")) +(assert (= z "cggcuagacuuguca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 new file mode 100644 index 000000000..d24e5c1a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTTACACAAAGTGGAGAAGCAAATGGTCGCTCGGACAAGCCAGGCCCGATTCCAGTTTAGTCGGGGAACAACTTTCTTAATCAGGACGTCCCGTCATAACTGCCAATGTACTCATGTACAACACTGGTACCGGAAGCCGGCGGGATGAGCGCCCTCAGGCGCGGCTGCGTTAAGCTGTGCGTAGCCTTGCGGGTAATTC")) +(assert (= z "gucuuuuauaaagua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 new file mode 100644 index 000000000..129dc49e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTTGTTGCCCCCTCTCCATACCCCCCCGACGTTGTAGAGACAAAGACCCGGACCGGCACCATCCCGTAAATCGTTTTCTGGACTGCCGTTGGCCTGCGATTTCTTAGAAATTAACATGTGAAGTCGGGGTAGAGGGTGTGCCAAGTACTGGCGCGACCCACGCTCGTGCCGCCATTTCAGACTAATTAGAGTTGGGACA")) +(assert (= z "ccacggacuuccuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 new file mode 100644 index 000000000..b93808f74 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATCACAGACGGGGTAGTCACATGAGCCCAGCAGACGAGTGAATGTGACAATGATGCGGTCTCAACACTGGAGTTGGACGTTCTCATAAGAGGCGACACGCCGTACATGTATTGGCCCAATTTATCGAAAGAGGAACTACATTTAGAGTACGTCTTTCGGTTCTACACGCCTGAGTATTCCACGCCTTATGAGGGACGCA")) +(assert (= z "gugcucggcucguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 new file mode 100644 index 000000000..e0a06a972 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACTACGTGTTACTCTTACGCGCACAATGCAAGGTTCCGGTCGGAGATACCCAAGTGAGGATGTATGAATCCCCATGGTGTGATCCTCCAACCACGAATAGGCCCCGGCTTTCAGGTCATACAAGAATCTCTTGGCGACCCATAAACTATCGGTTTTGCAGGACTTTAGTGATCTAATATAATCTCGATAGCCACCAGCC")) +(assert (= z "agaacccagugacug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 new file mode 100644 index 000000000..c43f6874f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCACCACGTGATTTCCCACTATCCTGCTCGTTCGATGATGCCAATCGCGTTATCTCTCACTGGAGAACTACCACAGCGTGCGTGCTGCGATGCGTCTGACGATATTTAGAGACACGCGTCTCAAACAGGACCGAGAGTCACCACCATTGGATGATTTCATTTTTAGGGTCTTGGGCACCGGGGGCGATAAGTGCTACTG")) +(assert (= z "acgauggaaaugagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 new file mode 100644 index 000000000..5b20f2b11 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAAAGTCTTATAGTGTGCGCCACAAATAACCAGTGCAAGCCCATAAACGATAGACCCGTTTCAAGGACACGAGAATCTGGCGAGCGGGTTAGAATATGACTCGGGGCCTACCGAAGAGGCCTTGTAGGGCCTGTCCTGGTCTCAGGGCGCCTCCTCATTCAAGGATAGGAGGCTCGTATCGATGTCTGCGTCGGTCTCGA")) +(assert (= z "uguugauucuacguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 new file mode 100644 index 000000000..370f00f9d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTGTAGGATGGTACGATTTAGATGCCTTGGGTGTAGGGGGGTTCAAAGGAGAACGAGCAAGGAAGTCTACAAGAGAGTCGGTCGCGCCTTTATCATTATGGACTTTGTCGCCCGTGGGCCAGCATCCTGGCTCCGGATAACCCAAACTAACGGCTTGCAGATCGATGGTTATGGCCTGCTCGTTCGTTGATCCCTCTTG")) +(assert (= z "gagcggggcuuaucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 new file mode 100644 index 000000000..616bdfec7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATGGCCTCTCTCTCGAGGTCCGTGCGCCTCGAATATGTTTAAAATTGTGGTTTACCCGAACGTCAATTTAAGCCGAACCCCGCTTATCAAGGGCCACTACTACGTGACGGGTAAACAAACGATCCTCGCCTGAATATGCATCGTGCCCCGTACTTGTCGCACCGCCTGACATTATGGATGTAACCGCTATACACGATGC")) +(assert (= z "aauguucccgaaaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 new file mode 100644 index 000000000..853f2d1f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTGCACTAGAGGGATCCATGTCGATTTTCTCCACTCCGGCGCACGGGGCTAGGATGTCTGCAGGATGAGTGCCTAATTCGGGTGTTTTCATATTTACGGGCTACCCCGTGCGAAGGGCCTCAACAAAATCCTCGGACGGATTTACTCGGAAGACAGTGTTCCTACAGGACGCTTGGACTTTGGACTCTTAATATTGGAG")) +(assert (= z "uggacaaauacuccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 new file mode 100644 index 000000000..8d4724eb5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCTCTACTCCGATCTACAACGCCCACAAGAATGGTGAGTCTAACTATACTCCGGCGCCTGCCCGTCACTGCCGAGCACCGTACCCGCGCAATCCTCGATAAACCTATTGCGGGAATGTAGTCAGGGATCTCGGCTGTTACTATGATTCGATAGATCATCAGTAGTGACAAGACGGGTTCGATAACGGAGCTCCGGGTCA")) +(assert (= z "aucagaugaggggca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 new file mode 100644 index 000000000..1da0d4bf6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGAGCTCACGTCTTGTGGAAGACACTGCATATACGGCTCTAGCTAACCACGCGAATTCCGACATTTACAGCTCCCATATGAAAGATCACATCCCGTTCCAGAACTGGCTAGATTGTAATCATTTTATCGGGAGATGCTGGTATTCAAGCATGAGTACGTGGCATACCTCGAACGGAACTACAACTTTGAGTCACCGTT")) +(assert (= z "uaaaaaguuacgcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 new file mode 100644 index 000000000..7b20b2f69 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCTAACCTTATGCGGTCACGATGGTAATAGAACTCGAACAAGCCTTGCGCCGCTGCGGGAGCCCATTAGTGCTCTTTACCTACGCTCGATTAGGCTTTCGGTACAGGCTTCCGGGATGTAAAAAAGACCTTTAGGTACGAAAGGGCTTAGCATCTACAGTACATTTTAGTAATCATACTGGCATGTGTAGCCGTAATGT")) +(assert (= z "cuaucucgucgcucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 new file mode 100644 index 000000000..726c1cfbf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACCCAGCTTTGGGGATCGGACTTTAAATCGTAGAATCTGAAAGCGTAGCTGCCGCCGATGCTGACGGACACTTTATGCATTGGGTGCATGACGAGATTTGCCTGCTGTCGCATTAGTACACCAGTATACAGTAATACTCGAACCACATATTGAGAGAGTCGCATAGCGCCTGTTGGACCGGAAGGGTCCCCAGCCGCAA")) +(assert (= z "gaggccucccacaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 new file mode 100644 index 000000000..23f11fbb9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGTTTGTCCAAGGGACAGGATCAGTAGGTAACACTAAACAAAATGCGCCATTGATTTAAGCCCTTCCCATCTATACAAGGCAGACGTAAGCGTGAATTTTGAAAGATGTCCTTAATCCTACTCGCCGCCCAATGGCTCTAGCTTTCGCGTGCACCGACCCGCACTCTATTTCATTTTAACATCAGTCTACGGCGCATCC")) +(assert (= z "ucuucaugggacuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 new file mode 100644 index 000000000..722547c66 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACAGGGGACGGTTCTGGTGGCTCCTTGTGCGAAGACAAGTGTTCATCATACTCAACGGCATGTCTACATCTCCAGCTGAGATCAGAGGTGGCTAGGGAAGTCGCTACACCCGCCTCCCTTCCCGTTCTATTACAATTAGACTGAGCTGTTTGCCAACAGGCGCACTCGGGTGCTGACCTATGGATCCATTATGTAGTTA")) +(assert (= z "ccaaaaaucacuagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 new file mode 100644 index 000000000..f00573118 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACACTCAGAGCAACTACAATTAGGTACTGTCTAGTTCATCAGCCGAAGACCGATAACACCTTGAAGATAGGTAAGGTGTGTCTGAAAAGAGCTTTGATCATTTCAGGTATCTTGGTCTCGTTGTATTAGGGGACTACTATAAAATAATTGCCACCGGTCACTTACTACTTAGACACCATGTGGCTAAGAATGTTCGGGG")) +(assert (= z "aucgcaaaggccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 new file mode 100644 index 000000000..a3371a963 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTAATACTAAATAACAAAGTTAAATGCGTGCAGCCACAAACCTTAAGTTTAGAATATATCCGGAGTTGCTCTGGACCTCACCATAAGGAGGTAAGTTAATACTGATCCGCCTGGTGAACGTCAAAACGCACTGAGCTATAACCGGAACTATGTGCCCCAGCTACCTTTGACGATGGTAGAGTGACTATCCCCCATTGTC")) +(assert (= z "gccgugcuggcugau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 new file mode 100644 index 000000000..ea0f0023e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATGAGTGTAGATAGTTTACACATAACTTTGGACAATGGTTTGGACGGAACATCACGAGAAGGGGGTTACATTGATCACTGCCTATTCGTTATGTTAGCACTGCGGGCAAAACAGCCTGCCTAGAGGACAGGGCATAAACGGAGCTTGTGCGTTCTAGGTGAATTACGCTGCCGTCTTCTAAGAAAGAGCTTGCTGGT")) +(assert (= z "gggaguugguugacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 new file mode 100644 index 000000000..2bc936234 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGATTATGTTGTTACATCACGCTCCCAACATATTCCCTCGGCCACATCATGCATTGAGAGCTATGCTCAGCTTATACCGGGAAGCGGCAAGCTCCTCCCGAAGGGAAGGATACCCTCTTAGCCTCCGTCAATTTTTCGCTGATTCCAAGAGGTGACAGAGAACTCCGTAGCGCTTAACAGTCTGGAAGAGCTTGAAAAG")) +(assert (= z "uaauccaaucgagcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 new file mode 100644 index 000000000..89730a32f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAAGCTCCAGCGGAGAGACGGGGGGGCCTACGCAAAAACCACGAGAGTTACACGCATGCATGTTTCCATTTACCCGGTGTGGTCTATCACCTTGGATTGGCGATTAAAAGTCGCTTATTTTTACGCAACTAGATTTCCATCCCTGGACGGCCAAAATGATATTATGGCAGGTGCGGCAATATGGGGCCATGCTCAGAG")) +(assert (= z "cuguaaugauacacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 new file mode 100644 index 000000000..8ef21d4f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCAGCGGTTGGCCCAGTGCTACGACATTGAGAGACATAACGGACGGACAAAAGTCCAACACAGCCATTCGCGTTCGGTGGGGTGAATCCCTTACAGCTGAGCAGAACTTACATCAGTCCTAAGATCGTACGTTTTCATTACCCTTTTGTGTTCCATGGGTACGGTGGTGATTGACTTCCTCGTACTGTGTGAAAATCAG")) +(assert (= z "aaaaauagccacguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 new file mode 100644 index 000000000..ed4c3ef45 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCCATCAGTACCAGCAAAGGAAACTACGTAGGGGGTCTGCTGGTCTAAAGTCTCGGTTATATGTAACGAGTCCGCAGGTTGGTCCAATCGCAGAGCCTCCTTTTGCGTCCTTGGGATATCGCCAAGACCCAGGTCTGTTGATAGCTATGACCAGTATCCGGTTACGAGAGCCTTTATCTGGAGGCTACAGTAATAGAA")) +(assert (= z "ggaagggccguguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 new file mode 100644 index 000000000..23b6c68cb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTTGTTAACAGCAAACATAGTCTACAACACAGCATCTATATCCGTCACCTACGCGAAGCGTCAGTGGGTCAGAAGCGACCGGACGCTGGCCCGTTCCCGTGTGGGGATCGTCTTCTACGCCGAGGAATCCACTTAACAGCACGCGGGCTCCCTCAGCACCTTTTACTACATGAAAGAGATGACGGCTAGCGTGTTGTT")) +(assert (= z "aguacucucagugac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 new file mode 100644 index 000000000..c34fac1bc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCAGTACCGAAATTTGATCAATGAAAAACGAGCTTGGCTAGCAAGACAGCCCACCGATTCTCGAGTCCATCCGTGACAAGCCGGGCTACAGAGGGTTGGGACCATGGTGGGACCGATCACTCCGCTCAAGGAAAAGGTAGACTAGTTGCGCTATGTCCAAGGTCGAAAACCGGGGAGTCAACACATTATCCGGTGCTA")) +(assert (= z "ggucucuggccacgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 new file mode 100644 index 000000000..5e92f0a02 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCGCACAGTTGCTGTTGTGTTTACATTATATCACACGCAAGATTTAGTTGATACCTCGACTAAATAGCGCGCTACCGAGGCGATCTCGAGACTCGTGAGCTCCTAATGCGATTTTGAGTCACTAGAATGCCGAAGTATAGGTGCTGAGACATCCGATAACGGTGACTAACGTCCTCATTTATTTTCAATCCTTCCGGTA")) +(assert (= z "acacauggaccacuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 new file mode 100644 index 000000000..09b904211 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGCACTGAAACACAACCCCTGGGTCGGCGCGTGCCGGGCGAACGCTGGACGGCGTCGGTAGAGTCAGGTTCAACCAGATTAATTCTTGGGGCAACGGCCCGAATGAATAGAACCAAGCTAGCGTCACGGTTGCAGGTGGCCGCTGAAGAAGGCTTACGGCCGAACTTATCTTACCGTGGATCCATCAAATGCCGTCCC")) +(assert (= z "uuguuauuuagauca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 new file mode 100644 index 000000000..b9cf9246c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCGGAGAATGTGTCGAATATTCAAATCCCCGAATAGAATGAAGTAGCGTTCACGATGCGGCAACCTGTGCTCAACGTTTCCCCGGCAGCCCCCTTACGGTGTAAGATTGTCTTAGATTTGTCATGTGCGATACGGAATTGATTTTGCTCGGGTAAGCGCGCTTGTGTGCGAGTCCTAAGGTTAGGGAAAGGAGGTTTTT")) +(assert (= z "accaugugaguccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 new file mode 100644 index 000000000..ce4b5f3b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATCACGCTTAATTCTTATCTGAGCCTACAACGGTTCGGTTCCGTGGAGTTTTGTTTGCTAAAACCAGATACGGTCGCGTAGTTTCGCTCGGAAGCCGTCTTTCCTGCGTTGCGCTTGATGGAGAGTTGTGCGACATACCTAAGCCTGATAGAAAACTTAGGGACGAGCTTGCGCATGTGAGTCCGGGTACGCGAGCTCG")) +(assert (= z "gaccgauuacaacug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 new file mode 100644 index 000000000..0166cbacd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTAGCCGACTCCGTATTTAGAATCGTGATCATTGTCATAAGGCGAGATAGATATACGTAACCCCGCCAAACATTGCGGTATGCGAGGTACAAAGCACCTATGTTTTGGCATCCCGCGTTCGAGCTATCGAGAGATAAGGAGTTTCGTCGTTATCCGGAATCATACAGAGCGTACCGTCCGCAACTTAACAAGATGTTTT")) +(assert (= z "gaggcuccuauccgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 new file mode 100644 index 000000000..476f29c45 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTGTTTACCACAACAAGTAGGCACCAGGAGTACATTCCAGACAAGCCAAAATGGTAGTACTGGGGTTCGGGGTCCTGAGTTTCTCAACTCGTGAGGGCGTAGCGGGGGAGTTAGCTATAGCACTACCTGGGGTTCTACTACGACTGGACCCATGTAGAGGAGTCTCCCACAAAATCCCACAACTAACGAATTAGCCTCG")) +(assert (= z "ggcagcuguuuagcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 new file mode 100644 index 000000000..c968b0346 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTTAAAGTCATTCGAGTTTGAAATCGCTGAACAGTGCAAGAATCCACTCCCAGTTAGTTTGCGCACGCTCCGGATCTCCATTCTACATATTATTGCGACTGATTCGTGGTAGATGGTCTCGCCAGCCTCGTACATTGCTGCCCTGAGTAGCACTAGCCGTGCCATACCATTCCATAATATCTTGGATGTCATGGCATG")) +(assert (= z "ccucguauuugggau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 new file mode 100644 index 000000000..0e9be8c47 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCGGCCTTATACGTAGGATATTCATGTGGATAAAAGGGGTTGCATATTATTATGTCTTGGTCTGGGCACATGGATGCGACCCGAACGATCCTTTACAAGTTCAAGACCGAAGCGGTACATTAAAGTCCCGGCCGGGGTCCAAAATTGACAAGAGGCAGCCCGCAGACATAGACTGCGCCCGGGCAACGATTGAGAGGC")) +(assert (= z "agacgguucacgcac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 new file mode 100644 index 000000000..b6be5f8bf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTTAAGGCTAAAAGCGCTATTCTAATAATATATCTTCTATATCCGAGTTCTTTCCTCATATGTCGGGCTGTTCGTGTCAGCTGGAATCAAACGAAACCAGTGTAAGTCGGAACGACTACGCCAATCATTGATAGCCCTATCTCCATTATCCTTAAATGTGTATGCATATCTCATCCCCCTCTTGATCAAGGTGGTGTAT")) +(assert (= z "ucauccaucuugcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 new file mode 100644 index 000000000..fe5eafdae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGTGACAGACGCCTGCTGCCATAAGGCGCTATCACATGCGTGGCTAGAGGTGGGACTAGAATTTGTCTCCGTGAGTGTGGCTGGCAATCATGACTGACCTTCCGGGACGATGGAAACGTTTGACGTCCGCAGGGCAACATAGCCAACTGTTCCGCAGAACCAAGAACACCGATATAGTCTAAAATTGAAGCATGTTCGT")) +(assert (= z "uguggucaaccgggg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 new file mode 100644 index 000000000..9ac7372d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGGGTTGATGACAATTTACTAGTGCACTGGACTACCGAGAAGAAGTAGCTTTGTCAGAATTATCTCGCCAAGGAGAGGACACCCGTTAATGGCAGTTCACATCGTACAAGGTCAGTACGGCAGTACTATGTGGGCGAGGGAGAAGCTCGAAAAAGTCACTAAGCAAAGACAAGCCTGGCAGTGGTCGTCACGGTCAATT")) +(assert (= z "agggccgcgcgacau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 new file mode 100644 index 000000000..99b8ef703 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCCCGAGGCTGCGTGTTGTCAGTATGCAGCTCCCTCAGTCCGTCATTTCAGAACTAGCCCTAAGAATTAACTTAACGGTGCCGACTGAGTCGATGGCAGGGGAATCTGACCGAGGCCGGCATACGCGATACATCGCCACGTAGAGACGTTGGCAGCGACACTTTGAGACGATTAAGATTACCGAGGATTGCTTCACCCC")) +(assert (= z "auaagugaggagagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 new file mode 100644 index 000000000..c11900861 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACCTAGACCGGGTAGCCAGCGTCGTGCTTCCCGTTATACGAGGTGTAGGACGAGATGTTCAGATAATATAGGAGGAGCTCCGTGTCTGAGTTAGATGACCCAGGTATTATCTTATTTCCGACACCTGGTGCGGCCGGAGGGAGCAACATGCAAACACTTAAGTCGATGTCCAAGCCGGGCAGAAGTATGTTGCATAAAG")) +(assert (= z "gucucaggacuacgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 new file mode 100644 index 000000000..6faed5b0c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGTGGAATTCTCTGTTTAATTGTACCCCACGGATGATGTAATTTGGGCTAGTATGCGTTTACGTCGTACTCGGAACGCCTGCTCCCTGCGGACGTACGAGCGGCCGGGAGGTGGCCTAAAACTCATAGGACCCGGCCACTAACATTCCAGGCCGGGGCACACCTGGCTCTTAACCAATAGGAACTTTGTATGGATTAGC")) +(assert (= z "aacauauguccgcug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 new file mode 100644 index 000000000..aaac7be67 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTTTGCACGACTCTTAAACCGGCGACGGTCCAGAATGGCTACAACATCCCAACTGGGGTATATTGAAGTAGTATTCCTCTTAAGCGATGGACAGCCCTAACGCATAGGACGGCAGCCTGACGTTAAAACTGGCTTAACAGTAGGGGCGCTATGGCATTTTTCTAAAGGCTACTGTACCGACGGCGCACTGAATTTATG")) +(assert (= z "ggccauguuacugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 new file mode 100644 index 000000000..7b20824d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGAGGACATTCAGAGTGGGGCGGTAATCGGATTATGCAGGGCTTGTATAGCGAAGCCTTACGTATTCGTTTTAAGTTACTAGCCGGGGTTCGGCTTTATCGAATCAAAGACCGCGATCAAAACTTGCTGAACGGCACAGTCAAGATATGCCCCGGTCCTGTAATCAACGGATGCGATAAACAGCGAGACGACTTGGCGG")) +(assert (= z "uauaauaaaacgacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 new file mode 100644 index 000000000..dbd6e1f22 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACAACCGAAGTTGATCTCCAGGGATGTGTAGATATACTGGTGGTAAAAGTCATCCTTCGGTGCGCTCAACGCGCGCATCACCTGAATTTCGGGTCGGTAAAACTCATCAGGCAGTATCCGGTGAATCAAGCGGAGAGCGTCTTCTTCTAAGATCATCCCTTCACGTACGCAAACTGTTACAACTTGAACCAGGCGTAAT")) +(assert (= z "uaggugguagaaaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 new file mode 100644 index 000000000..a24f650f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTCAGCACCTTTGTTCCGTGCTACGATTGGGGGGGCTTATTCTTATTATAGTTCACTCTACTTAACATCCGACATATAGATCGGTAGAAACGAGGGGTGACGGCCGTACCTTTACCTCCGGACCCTATGCGAGTCGCAGTTCACCTCGCTTGCTGATACCATGACACAGAACTGGTTTATAACGCTTTTCGATAGATG")) +(assert (= z "gaacaacgaucccug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 new file mode 100644 index 000000000..cb52c1d4e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCACAGCAGTGATTTCAAGAAGGTGTTCCCTGGTCTGGACACCTGTTATTACTTAACTCTGTGGACTTAACGTCGGTTGGCTTTGCGCACAGACTCTGGTGTGCCCGGGGAGACCCTATCCAGGGACACTCATGAGACCAACAGACGGGCTGCTCAAACGAACACCGGCTGATAACAAGTCTCAGGTATCTGCTGACAC")) +(assert (= z "ugccacaugcugcca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 new file mode 100644 index 000000000..2a9d9999a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTGGCCTCAGGTAAAAGCCCCATAATCTGAGTGCGCTCGCTACCAGCAGTCTTTAAGCCTACCAACATCCCGTACTGGCTTTAAGGTATGGTCTGCATGCATATGTTTAGTTGAAATAGACCTACGGATAGTTGACGTGCCGCTAAAAATGCCGCTAGTCTAGCGATGAGAGAAATGATGGCAATGGGACGGCATATA")) +(assert (= z "accuuuccaugcgga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 new file mode 100644 index 000000000..8dfeea3ad --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGGGTATATTACCATCTACAGTGCTTGCATGTGCGTGCTATCTCTGCTTCCCGGCCTGTTGCGGGATTGCCTTCTAGAAAATGAGAGGGCAAGCAGCACGGGCTTGTTGGCACATTTAGGCCCGTGTTAGGGGTACCAGAGTGAACAAGTATTCGGTAATATAACCTGCGTAGGCCGATCTAACAAATGTGTGTACGGC")) +(assert (= z "ggccuguuuuucgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 new file mode 100644 index 000000000..999d7287f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCTCAATATATTTACTAATCACCAGGGAGGGCGGTGGCTAAGTGCATCTCTTCTGTCGCCAAATAGGAGGTTGCTTCTTACGTCACGCGGAGCGCGTCGGCCATAGAACCAGGTGGCAAGGGCCATGGGTACTATATCGTCGTAAACTTGACCTGGTTATGTCGGATTCAATCACGGTTCTCCGTAAAACGTGGCGCA")) +(assert (= z "agugggagagacgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 new file mode 100644 index 000000000..22d098494 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTAGGCAACTACCCATTTCGTCGGACAAGAGCGTGCGAGTGCCTATGCGGGCAAATTACGTCCAGCCCACGGCCAACGCAAGGAGTGTGGGCTCATCGCAGAACTATCACTCGGGGACTCAACGTAGCGAAGATGCTCATCAGCAGGAGCGTTACCCTTACAAGGACCTACGACGTGATTACCCGTTTAGGCGCCTAC")) +(assert (= z "auugccgauuacuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 new file mode 100644 index 000000000..40655fe0b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACGAGGGGAGCAGTATCAAGTCTTCTCGGCCCGTAAGTCCTATACCGAACAAGCGTCAAAATGCGCAGCTGCGTGTATGATGAAGGACAGTGTTCCCATCATCAGTAGCTACCATGCTCAATGAAATTCCTCTTACTTAGTGTGGCGGGTGCGATGCAATGCCTTACTAGTAACACAAAACAGCTCATATCGCTGCGC")) +(assert (= z "guugcggaugagaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 new file mode 100644 index 000000000..c8fa0714a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGTTGCCCCAACGTCCCTCACGGATCTGGTGGTTCAATGAGTCCGCGTGACTTCCATGCGCTCGTCACGGCCCCCTATGCTGGTGGACACGCTGTCAGGTTACGACTCCAAAGCGAAGACGCTTGCATTACTCCCCGATCTCAACCATGCCAGAGCCAGCACACGTAAAATCCCGGTCCTTTCGGCTCATAGTCATGAC")) +(assert (= z "caugucgguauucgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 new file mode 100644 index 000000000..3c3cb7c5d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGCGTGTGGTTAACGAGACGAACGAGGAACGCGCGGAGGGATTCGGTGTGGTGATGCTCAGATAAGTACCTAGGGATTAAGCGCGAACCTGCATGACTTACATCGTGTAATTAGTTCGTTCCTCTCCGTAGCTCCACTCTATACCCTCAGCCGGCGGTTCAGTACAGGCATGTCTTGTTCGTCCGTCATACTGAGGCG")) +(assert (= z "ccagggcgauacauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 new file mode 100644 index 000000000..c31b65f19 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCATGTGACGCGAGATTTCCCTGTCAAGATCCACTGTGTGACCTGGGCAGAGGAGTTTGGAAGGGACGATGACCTTGGATCTCCCGGTCATTCCTTTTTGTAAAACACACATAATATTACAACTACGGGGACGTTAAGTTTAAAAACAAGCACTGCATGGCCAGTAAGATGTGGTAGGCCCCATTTAAATCAAGCGCT")) +(assert (= z "acguugaggcgaauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 new file mode 100644 index 000000000..a88d22e33 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACAGCCGGGTCACCCGGTACCCTTGCCCCATGACAGGAAAATCTGAAAACTTTATCTTTCTTGCGAGTTACATTATCAAAACGTCGTCAGGGATCTGCATCCTAATCTGGGAGGCCTTACATGCACGATGCCCGAATCCATTTCATTAATGATACACGGAGAACGCCTGGAAAGAAAAGAGTACCGCATACATGGGCA")) +(assert (= z "agccgcuauagucaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 new file mode 100644 index 000000000..5e9809c82 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACTAATTAAAGAGCTACGCGTACCCGTGAGAGAGTCGTAACTCAAAGATACACGGATGGTCCTCCCGGTGTTTCATGGAATGGAATAGGCGTGTGTTGTTCCGAAGATCGTGGAACGAGCATGACTACACTCTCATTCTCCATCAGTGGGAAGCACGTACATTACGTAAACATTCAACCGCTAACAGTACTTCGCCCTC")) +(assert (= z "uugaucgcagggcua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 new file mode 100644 index 000000000..2e7857398 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCAGCGCCTGCCGCGTTCTGAAGAGACCTGCGAATATCACATACTGGAGTTCATAAGCGGACCGTGTGACTTTCGAAGCTGATATATTATCGTGAGTTGCATACCGACGATGTACCGTAGAACTCTCGGAAACCCCGCATAAGAAAGAAACCGCGCATTCGCTAGAAAAAATACGGTTAGTGGCCTGAGGCATGGTTTCT")) +(assert (= z "gauagauccguaaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 new file mode 100644 index 000000000..f88a470a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAAGGAAGAACCGCCTGGCAGCAGGGCGGCTAAAAGGTAAACCGACCCCTATGTAGGGTTACGCCACAAGGGGCGAGTCTGTGCGTCTAAGGATGTGTTTTAAGGGACACCAAGCGACGGTCGTCGTGGGCTGTAATGTAACGGATACAAGCCGACCCATCGACTTAGGTGCGGATACGACCTCAAAGATGCCTTTAAC")) +(assert (= z "caccgccgcaaucga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 new file mode 100644 index 000000000..148b9ea9a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACAACGGATGAATTCGGATAAGGAAGCCAAAGCCATCAAACTACGTAGATATCACATTAACTTCCCTCCAACCTTGACACTTTCGGTCAGGCCATCAGATGAACGGCTCCGCGTCACCCTTAGATGTTTTCTAGTAAATGTTATCTTCGAGCGGAGCCAAAAAGCTCTGCATATTTTCTTCGGTTATCCCGGACTTTCA")) +(assert (= z "gaccgcaaaagucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 new file mode 100644 index 000000000..3e42a430a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAACCTCAATGCCCTCGATGTCCCGGAATTTGAAAAGAACCGATGTAAGAAGGGACGATGCGAACTCGTGTAGTGCGCGACTTCAGTCTTGGGGCTCTGCGTCTCCAGCGGTTGACGTACCAACGCCTTCACCTAGATTTAAATGAAAAGATCCAGTGCGGAAAACCACTTCCTCCCATAAAGAACGATCGAATTTACA")) +(assert (= z "cauacuggucagacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 new file mode 100644 index 000000000..2709ac202 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCGCCAGGCGTACGCGATTTGGATAGAACATGACGCTCAGCCCCCGATTCGCATCTGGGACGCAGAATGTTGTGTCCTAGCTCACGTTGGGAACCCCAGGCAGACGACACCCGCAGGCATATCGCCGCGTTGTCACAATAAGGGTTGCCCCGTTAATTGTCTTTTAACCTTGCACTACCGTACATGCACTCGACAAAGG")) +(assert (= z "uauuagcgugauuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 new file mode 100644 index 000000000..76620402c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATCCTCCTATTAGTAGTGTACTAAGGACCACTTTATCGTTTGCTTTGATGCGGATAACTTATGCCGCACCTAAGTCCACCACTAACTCCATGAGAGTACCATAGGCTAATCTTCACCTGAGGAGCGTTAAATGTGTGGACAACTTGCACGCAAACACAGTGGCTCTCTTACCTTGCTTACTGGCATGAATCGGAGAGCG")) +(assert (= z "cgcuucaacugaaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 new file mode 100644 index 000000000..e89474306 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGGGCCTGGAGCGTTTGAACCCTGTAGAAGCGCTGCGTTGAGGACAACCTACTGTTTTATTTGGTGGGTAGGATCGTTGCGGGGCATATGGCCGACACACGTGACCAAGAACAAACGGACGGTGCGCAGTCCTTAAAATGTGTTAATGGGGGTTCGAACCTTATGGCGGACACGGATGTGGTGCGGTAGAGTTATTTGT")) +(assert (= z "uaaggggacgaacac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 new file mode 100644 index 000000000..c0c87c260 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTAGCCGTTACTGGTACATCGATTTCACACGCCCCGTGAAGGAGCGATGTTTCCGGCGTTCTACTGATTGCTACACGCGTCTTCTCAGAGGTTGTGAACTTGATTATAGGCATAGGCGCAGCGTCATAGACGCACGCGGGGAGAAACGCATTTATGCTGTTGTCAGTGACGGCGGTTGAACCGTGGATAAACTTTTTGG")) +(assert (= z "acgggcuagucuugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 new file mode 100644 index 000000000..9443438da --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCCAATGATAGCGACACGATTATGAAAATCCTATAATTTTGATCGAACGCACAAGGGTGCCCGCTGGCTACACTTTATAATGCTATCACAAGTGAAGGTCGTAAATTATTTGAGCACACAGCAGCGTTCTTGCACGGCTTCGTTCACGAGCCCACCTCGCTAGTCGATGACATGTAATTGATGATTGCGCCCCGCAGAA")) +(assert (= z "caacuuaucugcccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 new file mode 100644 index 000000000..7a86a5ea7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTAACGTTAAATAACAACTATAATATTAGGATCACTGAAATTGTGGCCAATTTCTATCGAGCGTAGGGGGAATGCAAGTAATCCATTCTACATATATCGCGAAAAACCTAAACCTCACTTCGTTACCAGTGATGAACTGGGATCACTCGATAAACGGAGCGCATGCATATTGCGTACGCTCCTAGAGATTAACAGCCC")) +(assert (= z "acagacgacucagaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 new file mode 100644 index 000000000..58d26fe5d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGATTGCGTCAGTTCTCCGCAGGTTCAGGTGGAGCTGAGAGGTTTCGAGTTTCGACCCGTTCGTAGCCCGTTCTAGACTGCTTGACTACCGTTGGAGGGTGGGTGCACGCTGATGAAACGAGCCTGTCTAAATTGACCTTAAACGGATATAACAAAAGATTCGTGTCTCTTAAAGAGGGTGATGAGAATCTACTCTTCA")) +(assert (= z "agguguguagaccuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 new file mode 100644 index 000000000..d6105f700 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGACATTTTCATAGCGGTATTGCGTGTTCCAATTATAGATCGCCATCCAACTGCTATAATATCATACAGCTATTCTGGTTGGAGCAGCAATGAATAAACGCTAATTCCCGGCGAGCTATGGCGTGGCCGAAACCAAGCCGACAGGGGTAAGCCATGGGCTTAAGGCTTCAGGTAGTGTCGTCAGGAATACAACGTAATA")) +(assert (= z "aggaggucgcaacga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 new file mode 100644 index 000000000..a90a26c66 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTGTTTATATCTATGTGTGCGTATGCCATGATGTATCCTATAATTTGAATTCCGCCTTATCTCTCCCGTTGATAGGCGTGTCCTGCCGAAGTATTGTTCAGAACGCTCTGGGGCGAAGAAAGGTGTACGCCGCTATCTTTGAGCGTCTACGCGTGTTTCTCCATATGCGTGCGTTTCCGTTTCCAGGTCATCCGGGGT")) +(assert (= z "uuuccucgccggauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 new file mode 100644 index 000000000..f68e02169 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGACGGAAGATCCTCGTAAGCCCTCGCTATCGAAACGCTCTCATTGCTGCAGTTGCACAAGTAGTGGATGGAGATCTATTTACGACAGCAAGACCTTATAGCAGGTACATTTCAGTGTGCAGCTTCCATAAGTTACTGCAATGGTGTTATACGCTTGCACCGAATTGGCATGGACACCTCTCCCTAGACGATTTTGTCA")) +(assert (= z "gguacgagacuauaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 new file mode 100644 index 000000000..fce17bf09 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTAAAGCCCTACGGCAAACCTCTGACCAACCCACAATACCTAGAATCTAGTCTCCCCGCGCGCTTCTTCCCATGCCTAGGTGAAAAATAATTGAGCATACCTGGTTGGCCAGCCTCATGCGGTTACGCAGTTATCTTGTTTGGCAAACGAGACCTGGTTGGATTCCGTGAACAAATCTGCTGAAACATAAGCTATTGG")) +(assert (= z "ucccggcgccaucgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 new file mode 100644 index 000000000..4ab979d3b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAACAAACTGGCTCCAATAGGCGCCAGACTATTAAATTAACAGCCCCGCGAGAACGGGGATTGGGAATGAAGCTTAGGCTAGTATCTGGGTGTGGGACATTCCGGCCTCAGATTCCAAAATTTATAGGTAGCCAGGTTGTGAAGTTGGGCCAGGAACGACCGACGGAGTCTGTAAGCCAATGTTCACCGTGTGATCCTAC")) +(assert (= z "ggucuaaggccgugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 new file mode 100644 index 000000000..f34e8aff0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCTACTTGGAAATTTACGTGGTGAGCACAAACTGTCTTAAGTATAAGAACAGTGATATCGGAATCCGTAACTAAAAGTCAGTTATCGATCGGTCCCTCGAAGTATCTCTCTGGATGGCAGCACTGGACACAACGACCGTGTGTGGGCCACCATCCGCGCCCGTCGCTGAGTTTAGCATTCTCGAGAAGCGAGTGCTTCT")) +(assert (= z "aaccgguagcgcacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 new file mode 100644 index 000000000..450d76be2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTAGCCCCCGCTCGTCGTCCACGATGCCTTTCTCCTACCCCTTTCCACTGAACGCCTCCCTTAGTTGGCTGTGACATGGTGACTCGGGGAATACCCACTCTAGGAGCGTTAGACGCTGCGTCCGCGATTTGAGAGTTCATGGGCACGTGTAGACCATAATAAGTAACTAAGCCAGGCACAATATCTGCCGTCACTAGC")) +(assert (= z "cugccgauaagauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 new file mode 100644 index 000000000..0d2017073 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTATCTGAATTAACCTCTAAAAACTTTCATACCTTAGAGGGGTGCTAGCGTAGCACGCTGAGTGCCTGTTCGTGCTGTTGGCTTGAGCAAACAGGCGTCCACAATATCGACGAATCGGCTTTCGAAGTCGTCACATGAAACCTTGGGCATGTTGAGGTGTGGCCTTGTCCCCCGAAACAACCGTTCGCCCTGCTGATC")) +(assert (= z "uucaguugcauccua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 new file mode 100644 index 000000000..b57c9c806 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTGAAGGCACTTTGTCATCATCGAACCATGTGAGTTACACTATAGACCAACCGATTGGTGTTCCGGCGCTGAATATCGAGTCGCGACCTGCAGTTTCCTATGTATTTGGGAACCTCTAGGTTATCGTGAAGCGGTGATCTCCTCCGTCCACGAGCATCGTATACTAATGTTTCTAAAAAGCGTGGCAGGAGGCAGTTAT")) +(assert (= z "uagggcaaugaauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 new file mode 100644 index 000000000..92ede4d4b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAGCACAATAAGGTGACGTGTATATCATTCCGCTCGGTGATCTTTGCGACTGGTCACCTAATCTCCGGGAAGTCGAGATCTTCTTCTCCACCTCGTAGGTAAAATCTTGGCGATCGAAGCTCGGAACGACTGGGGCGGTCTATCATTCCCATTGGAGTTCTAAGAAGAAAGCGCTTGGTCGGTTTCATCTATTAAAAAT")) +(assert (= z "acaaagguccgcucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 new file mode 100644 index 000000000..c99163a4c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTTTATAATGATCAAATGGCATGATACGTCGTTGGTGCCCATCTGATAGGAGCTCCTGGGTAACCATTTGATTAGGAGATATGTTCAACGCCCGCACGCGCAGATACACATGAGAATCAGCATAAATTTAGTCCGCCGCATACAGATGCTGCCTAAGGAAGTCGTTCTTTATTGTGAAAGGCTCAAGGTGTAGCGGCT")) +(assert (= z "acauacaauaguaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 new file mode 100644 index 000000000..f3782ed18 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGAGTCGTTCTAAGATGCCCCCTAAGCTTCCGGATAAATCGTGATGCGGTGGGCTGGCTGTCGACGTACAGAGAGGTAGAGACCATCCCCCAGAAAACAGAATGCTGTCCTCTTGTCAGTGTCCGTGCCGGGCCTGGGCTACAAGCCTTAAAAAACCGCGCGCGAGCGTACTACCCTTAGCCTCGATAGACGCTGGTCC")) +(assert (= z "ggguuuuauuuuugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 new file mode 100644 index 000000000..9eabbe249 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGCCTTATACCCATAACGATAACGTATCATGTGTTTCTTTCGATTGGAGCGCACGCAGTGCCCCAGTTAGCCCGATGTGTAGAACACAGACTATTTAGAAAAGTTACTACGGAGGCGAGCCACCCGATCTCTCGGCTGAGTCAGCGCATGAGTCAGAACACAAGTCCACCTTGTGGCTTTGAACCGTTTTGCGCGCGTT")) +(assert (= z "cuagcuaacaccaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 new file mode 100644 index 000000000..7bab255cf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCTTTCGCCAGGTGTGTCAGTTGTCTCTAGGGTCACTGCGCCATGACACATTCTTCCGGATGCCATATTGGTGTTGGCTGTCGCTACTTACCCGTGACGGCTATTCGATGACCCACCTTCAGGTTCTATCCATAATTATACGACCACGGAGACGTTAAGCCATCGAACCCGACTTCCTTTGCGTCCTGTTATATCTGTG")) +(assert (= z "ucucagucuacaguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 new file mode 100644 index 000000000..d456ff5ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGTCCGGTCCGAAGCTGTACGCGGTAAGCTTGGACAATGAACATGACGTAGAGAGGCACACAAAGACCTTAGTTACCATATGCCAGGCGATCCAGCCGGTTCTCCTTGCCCCGTCGGGCCAACTACAAAGTTCCTTGCAAATCGAATTGGAATTGCGAGCTTATAATTCGGATTAATTAAAAAGTTTCCGCTGAAGTC")) +(assert (= z "ucuggguaaucgacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 new file mode 100644 index 000000000..ae6166374 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTACAACGGCCCTGGATAAATCAGGACCAGCCTCGGCCAAATGCAGTTTGGACAGGACACTTGGGTGGAACTGGTAGAGGTGCTAAATGAGCTGATCCCACCCTAAGAGGATCTAAAGCTAAGGGAGGCTAAAATCGCACTGGAAGAGGGGCGAGTATCGTTAGTCGCAGATATTCTACTGGCCGTATATCGAAGTAGA")) +(assert (= z "ggggaagaggcuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 new file mode 100644 index 000000000..ad267dbb1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGGCGCCACATCACCCGCGCTATAATGTCTTCAGACGTTTGGCGATGCTCATGGCGAGACTGCGATCGCCAATGAGTTATGGCCGCTCTGAGGAGCGAGCTGCCGGGATAGCGTGCCAATTGAGATTTCTGCCGGGAGCTCCGAGCAAAGATTGTCTAACGGAGGCTCATCACAGCTGATTCAAAGCCCTGATATGTAG")) +(assert (= z "cgaacaggauaccga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 new file mode 100644 index 000000000..bf3ea25ee --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAATCCTTAATCCCTTCCCCGAGGAGCGGGACTTATAAACTCTTGGGCAGTTTAAGTCCCCAACGAGATATCGGCTAATTAAGATTGACAGACGACTATAAGGGCGACCTGGTTTCGGTAGATGACCCCTGGGGGGTTGGATGCACCGATCGATGCACATAGGCCGCTCCGTCACCGAACGCATGGGGATCTGTATCAGG")) +(assert (= z "gguccaaaauagacg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 new file mode 100644 index 000000000..a1941f642 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATAGGTATGACGGCCGAGACTGCAACAACTTTCATAAGCCTTAGTATTCCGATATGTGGACTCTAAGGTGCCCTCACTTGACTCAAACTGAGCCAGGGGCATGGCGTCGGGGCGTCATCTCCCATCAAATGGCGTAGAAGACACGAGTGAACTCAGTGAGTCGTGCCGTTCGCCTAGTGGATAATCAAGCGCCACGAAT")) +(assert (= z "gaaacagggacaucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 new file mode 100644 index 000000000..e7119f040 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTACGGCTTGCCGCCGAGCACTAAAGAGCTTGATAGCCGGATGCGACATCTATTGATGAGAGCTTATGGTAGCCTACCATCTCCCACTTACCCCCAAGCGACCTAACTGATGGTGGTTTATCGGGAGGTCGCCCTATCCATAATTCGTGGCGTCAGTAGCGCAGCATTGTATACTGCTGAAGGATATTCGTTTTCATC")) +(assert (= z "cacccuuucaaagac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 new file mode 100644 index 000000000..02d161bcc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCCCAACTAAGCAAGCGTCCTCTTCCGCGATGCTATTAGGACTGGCTAATAACCTGCTCTGAGGGGCGTTCGGACTCTTAATAGGCGGAATGACGCTCCTGTCCCTTTACGGGCCGTGCACGAACCAAGGCAAGCCCTGTCCGCTATAGGTGTGTGTTAAGCCGCCCTACGGCTTCGTCGTTAGTGTGCTTGTGATCG")) +(assert (= z "cuuuggcaguucuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 new file mode 100644 index 000000000..97dc7773f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCACAGTCTCCTCATCAGCACATATTTATTCGAGGTGGCGCGAAACTTACGTGCATAGACCCTAATGTCCCGGCTAAACATCGCTACAGAAGACTTCTTGCCGCCCCACGGCATCCCCAAACTATGAAGCGGGCCTTATTACTGGTTATAAAGGGGAAGCTAGTTACCTGTCCCACTTATGATCGCTCGTCTTCTTAGTC")) +(assert (= z "agucuucgaucucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 new file mode 100644 index 000000000..cef99ed02 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGTCTGGTTTTCGGCAGAAGGTCTTCCAACTTATGCTCGAAAAAGTCAGATTCTTTCCAATCCAAAACCCCAATCAGCGTTGCACTCCCACGCTGGCCAATACCGTGTCCGAAAACAATCTTTTGGCGCTATTCCCCTTCAACTTCGCAGGGGAAGATCTGACGGTAGACTGACCAAGTTCCCTATACAAGGAGGGTC")) +(assert (= z "ggguacaggaagaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 new file mode 100644 index 000000000..91dac0a5f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCCTTGCCCCACCATATCACGTTCTCCGTTATACAAGTCTTGCTCCCGCCGAGATACGATAAGATATTCTAGGAAGTACTCTTAGGAATGAGCGATTCGTATCAAAGGGCTCGAGCCAACTGCGCGGTTCGGCGTCGAAAGTAGTAACCTCTGGAAGAAAGTAGGGGACGTTATGCCAAGAGTGCGCGAGACCGATCTC")) +(assert (= z "gucgaauacacugac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 new file mode 100644 index 000000000..2f8e73d72 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACGTTGGTTGGTCTCGTGTCTAGCCAGCGCGGTAGTTAGGTCCGGTACTCCTGTGCTGAGGAGGACGATCGCTTATCCGCAACGCTTACACCTGTTGCCGAGATTCGGCATAAATTCGAGGGGGAACTAGCTTGTTTAGCTTCGCTATCAAGAACTTTGTCGAGCCTGGCTTATTGTTAAGGATTCCCGGATTGCCTTG")) +(assert (= z "uguaguuacacccgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 new file mode 100644 index 000000000..fc7b911a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATATGTACTGGTCTCCCCAGGTATCAGGCGTATTTCATCGAAATCAGACGTAGGCGCGTACAAACACTTGGCCTTCGGCCGCTAGCTGCAAGTGTCCAAGCCGTCCATTCGGCGGAGAAATCAGAAAAACAAAGTTAGACCTTTAGCAACCTACACCTATTGTTTCGCAACGGAGATACTCCTGTGTGTAATAGTTTTT")) +(assert (= z "cuucuuuuagucgcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 new file mode 100644 index 000000000..3efd18860 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCATATCAGTCTCTTCTTTCGGGCAGGAATCTTGATGTCGTGCTAGTCGTCTGATCTTCCAAGATACATTTCGACCATAACTACTCAACATCCCTCTCAAGAGCGGTGGTCATAGGGCGGCAGAGCTACGGCAGGTCCTTTAGATATCTGCCATTCAGCACGTTTAGTGATATGACTAATTCACACGGTGTAAATAGAGA")) +(assert (= z "agagacugcuagagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 new file mode 100644 index 000000000..ae60520c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACCGTATGTGAATAATGGCACTCGTATTGCAGACTCTTGTCACTAGACAAGCGGTGGGCGACCTAAATTGTACCTGTAATACTGGGGACCTGGTCGTAGTACTACAGCTTTATGTTTATACCTAGTGGCTCTAGAGCCTTAGTTCAAGGTGTGGCCCCTCGAGTCAGGGTCCCTGTAACATCAATGGTCAACAACGACA")) +(assert (= z "cggucaacauacgaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 new file mode 100644 index 000000000..9f38d4fc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCCTACTTCTGCGTCTACCTCTTAACCTCCGAGCTTGTAGTATGTTATGCGCTATCGTGACCATGATCGGCTGCAACGCCCCTCTTAGAGACTGTACTATTCTTCTGGCGGAATTCCAAATGGGCTCATGCTGGTATGTGAGGGGACAAAAGCGCAGCATTACGACCCAAAAGGACGTCCTGATCCGGGATGCTAGCTA")) +(assert (= z "accggcgaaccuuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 new file mode 100644 index 000000000..95b0f0ed7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACACGTCTGCAGTCCGACCTAATTTTGGTCGACTAATCGCCGATCTGTTTATGTCGACCGCAGTACAAGGGGGGCAAGCGGGTTCTATACGAAAATATCTGCTACTATACTAAATCTAGAACACATAGTATATTGAACTGAATGATCGACTCCAAACAACACAGGCTGTAGAATCAGCTGATCATTCCGCGCATCATTT")) +(assert (= z "aaguuagguauauug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 new file mode 100644 index 000000000..4ba561e36 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCTACTACAATAAGATATGGGACTACTATTGCACCACAAGTCATACGAAGTGATGGTAGAGTTTGCGGTTGCTCGCTAGCCCAGGCCACCATTATGGTGCGGCAAGATACTTGTAGGATGATTGCTATCTCCGTCGAAGCCCCGTCACCTCTTGTACGCCCTGCGTCACTCAAGATCCCCTGGAATGACTGCTATCTT")) +(assert (= z "aguaaacaagggcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 new file mode 100644 index 000000000..92c9c821c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGCTCGTTTACTTTTCCATCCCTGATACTTCTCAGTGTTATCATCGCGCACGTACAATATGATAAGAGGTCTCGAACATACACCGGTGAACCATCATGAGGAGCTCACAAAACCTGAAATTAGGAGTCACCTCATTCGGTTACAATAGCCCCCAACACTAGCGAATGTTATGGATCCAATCCCCAGTGTCGGAGCCAAC")) +(assert (= z "cgacgaauacuugca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 new file mode 100644 index 000000000..f9e27dc15 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTAATACCGTCGGAGCAGCTAGGCCCTCCAAAATGTTAAAGTGACTGCTTAATAACCCGCGCTGCGACACGCTCATCCTTGGCACCGCGGATCCGACATGATGATTAACAGCACGCCGAGGCAGAAAACGGTCAGCCGACCAGTATCGGCTTATTGCCCCTAGGCGGGGCGGCGTACTCATAGGATTGACTAGATCCC")) +(assert (= z "aucuacccggacccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 new file mode 100644 index 000000000..4fdc24eeb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGTGTGTCCCAACAACAAGGCGAGCCCACTTGGTAAGCCGGTTTATACACTCTGCAATTAGCCGGTTAGTAGGTTTGATTCAGGGGGTCTGTGGAATCAGTGCCAAAGGCCGTCCGGGGCTGGTGAGTCTGCAAGATGGGCCGAGGCGTCCTTCGGTAACAGCTCGCGAGCGCCACGCCGCTCGTCACACTAGCGCCCT")) +(assert (= z "acucgugagaccuca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 new file mode 100644 index 000000000..5406d6e89 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCACAGCGTTTTATGCTGTTGAGCACGTCTAGTTTAATGGAATTAGCGTTGGGTCGCTTCCGTGGATCCCCCAAGTACTCTTAGGCATTCGTAGTGCAGGAATGACCCAAGTGCCACCCACCTAATAATGTAGTTTGCAGATAGTCGTTTATATACTTAAGGTACTTTCGTTTACCGACGGGCATACGGGTGTTGCCCCG")) +(assert (= z "caagugauauuuauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 new file mode 100644 index 000000000..65a4e69ea --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACGAAAATCGAGGATGTCAGAGAGCGGTCCGCAAAATATCCCCCTTGTGAGCACATGTCGTGGAAATTAGATGTTGATATTTGCATTTGACAATTATAGCCTGTGTATAAGCCCCGTCAGGAGGGCGTCCCCACCCTCGGATTTCTACTCCCGTGGATCATCAGCGCGCATATTTTGTCTGCAACCGAATTCTCCCACA")) +(assert (= z "ggauuuggccgagau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 new file mode 100644 index 000000000..328a38bab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCTCCGCATTCCCTCTGGGTCTCACCATCACTTCCCGTAATATGACGGTCCCCCCGCCTGAGAGATTCGCCCGCGCCATAAGGGCAGGCATAACTAACATAATAACGCCATATAGTTTGTCATATTCCTAGTCAACCTACGAGTTCTCATGCCTATTTTGCCAGTCCCCAAGCCACATGTGTATGTCGGATAACAGGAG")) +(assert (= z "acauccgccucuugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 new file mode 100644 index 000000000..d9f98f331 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGGGTGTCTGATTCAGGCTGCCGCAATAGCTACGAGACAGCGGTCTGATCTGCATGACCGACGCCCCTCAGCGTAGACGACCTGGTATATTCCAAGGGATAACGCAACGCTTTAAAAAATTGAGGCATGCCATGACTGAGCCCTACATCATCGGTGGCTCTGTTCTTTTATGAACGGGGAAGAACATTGACATACGCAT")) +(assert (= z "auaugugguaaguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 new file mode 100644 index 000000000..af2c424f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGTGAGGATGTGCGTCCCCGCTTATTTATGAGTCGCGGTAGCCTCGCCGTGGCATAATGCGATTTTCTTTATGGACACTCATACCTGGGGAAGCAGATGGGACTCGGCTCGTAGATCCACGTACTGATGATCAACACGGCCTGTGCAATACCTCCAACGTGAAGGTTATGTAGCAGCCTATTTCGGTAGGAGATTTTG")) +(assert (= z "ccagcuaggauacaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 new file mode 100644 index 000000000..a73737a5d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATCGCTTGCTTGTTGACGAATGCTGGGAGTTCGATAAGCGAGCTAGCCATTGTAGAAAAGGAAGCCGACGCTTTGGCTAAAAACACCGGTGTCGTAGTTTCTGTGCGCAATCTCGGGTTTACACAGTACGCCTTGAGCAGAGAAGGCGTTACCATGCATCGTAGCAGAACGTCCCTTACCAGACAATCAATATCTATAG")) +(assert (= z "cgccggucacacggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 new file mode 100644 index 000000000..f117cb9f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTCATGTGTTTAGGCATCCATTACTCTGGCGGATACAGGGTCCATATGTTGCATCGCGAAGGTCACGTAGAATGTGTGAAAATTATCTCCAATAAGTTCCGGCCCAGTGCGATTCGCAGGCGTCATGGCGACGCACGCTTGATAATCGTGGGTCACGCAGAGATGGATTTTGGACAACCAGTCGGTCTCCGGGACTCG")) +(assert (= z "guauaaacacuaagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 new file mode 100644 index 000000000..ceda7db34 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGAAGGGGGTATGACGCAGTGAGGGGCCGTGATTCTCTGTCCCAGCCAGGTGTAACCTCATAGGCCAACAACCCTCGGTAACTGCCTTGTGAGGGATGAGCGTTGCATTACATCGAAATGCGAATCGCCATGGTAATCTGCGACATTAAAATAAAACTGTCGCTTGCGATCTATCAATGGTTATACCGGGACTAACGGG")) +(assert (= z "aacaguuuaagacau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 new file mode 100644 index 000000000..511b6281e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCATCGCCACTAGACTCCCTGGCGACATGGAGACGATTAGCCCGTAACGGCGTGTCTCAATCGGAGATCCGGACCCCTGATAATAACCACTGACCTTGCATATATGAGATATACGTTTGAGTCTCTAAATGGAATACTAAAGAAGGTAGCGCATTAGCGGTCAGAAGCCGAGCCATTCCCACAGGTGGCACCGCGGATAT")) +(assert (= z "gcaagaguaggaagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 new file mode 100644 index 000000000..2d197e893 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAATGGCACAGGCTCCTGAGAGGAGTGATTCCAGGCGATGCTGAACGAGCTCGCACCGATATCACCGGGTCGCAATCACTTGATGACACCGCTATCCCCAACCCCCAAGTAAACCCGCGAGCGACGCTCTGAGACGTTCTCAAGAGGCGCAACTCGAGCAGTTCAAATGCAGAAAGTGCGGGAAACAACTGGCTCGAGTC")) +(assert (= z "ucuacuuggaccuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 new file mode 100644 index 000000000..c26ef0b2c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATGATAGATTTCAGTTGTGTGTTGCAAAGAGAAGGACCTTGAAGACACCCCATCGCCCAGCCTCTGTAAGCCGCTGCTTAGGGTATTCGTGGTTCGCCTCGCAGCAGTTAATTGTCGATACACACCCTGTGGCTTTTCATCCTACTATCATAGACTTCGTGAGAACATGTTCTAGTTGGGCAGGGGAACGTTTAAGATC")) +(assert (= z "cacaggcaagguuua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 new file mode 100644 index 000000000..a20a5dc73 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTTCTCCGTATTCGTGGAGTATTGGCAGAGCGAGTGGCCTGTTCCTTGGGTCTATAGGAATCCTAGCTGAGTCTTCGAAAACTACATAGATATCCAATATGGACGCTAATCAGCTCTTGGCTCGAAGTCTATGGATAGTATCCCACTCGAGCGTACATCATGCAAAATAATGTGTATGCGAACCGAGACATTGAAGTAG")) +(assert (= z "ucauggagcuuaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 new file mode 100644 index 000000000..3df487482 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTACCGGGATGTTTGGGGCTAGTTAGTGTCGTTGTTGCTTGAGACGTCACTTATAGGCGTAGACCGACCCGTCATCTAAGTCGACCAAACTCCATTCCGCTTAGGAGGGGGGATATTCGGCTCTACGAATTCCTTGAAACAGACAGTGAGGGTACCGCGACGTACCCAGATGGTAATGCGTGTCGCGAGTACGGGCTAG")) +(assert (= z "caucaggguauuggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 new file mode 100644 index 000000000..bb2905b16 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGACGGTCTTCCCCGAGTATAAACCCCCGTCAAGAAACCGGTCCTACTTGGTATTTGCCATTAGTTGAGCGGACGCAACAAAGGTGGGGATGCGAGATACCCATAACAGCACCGCATTTACAGGCTCCAGGAATAAACTCGGGGGTCAGGTGTGACGAACTTCCCCGTAGGCAGACTGTGGCAGGGGCGGAAACGGGTCT")) +(assert (= z "caacuuuaccugugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 new file mode 100644 index 000000000..efe073a8f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGAGCTTCTTGAAGGTATGCAGCCCTTCATAGTATTAAACCCAAATCCATCCAGATAGAACATTAGTCGTTGCACAAGCTGAGGAGTGTACTAAACCATCTATTGCCCATTTCTCAGGCTGTTGGCGGCACTTCAGCCCGGTCCCACTGGCTCGAGGTATTTTGGTCATGATGGGGCTAGCAGACCCCAAGCAATACA")) +(assert (= z "gguguugcacguucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 new file mode 100644 index 000000000..d18e71d8d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTTTATCACTGTTCTAGGTCCGCTTCGAAGACGCTGGGGTAGAATATTCAGCTAACCCAAGCTGCATACTAATATAAGTGCCATTGTTATGGCTATGTTAGCGTTTCTTGGACCATAGGGAGACGGATACGCCTACACAGCCATTGAGATCGAAAAGTACAGCCTAGATGCTGTGTCGCTGAAGCAACACATCCGCTCA")) +(assert (= z "uggauacugaguugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 new file mode 100644 index 000000000..23f2ab147 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTGATTAAGGGCTGCTTTCACGCTGTGGGACCGAAGATGTTGATAGGGTACAGGGTTTAGGCATTCGAGTCCTTGGAGACGTTCGTTTGAAGCAGATTGTACAATCTGCGTTTGGCGCATAGCCTGGTAGCTAACCCACTTTGTCACAAATGACTCCGTGGTTACGTATCAAGTGAGGCCCTCCGTCCCCATTGACGA")) +(assert (= z "uaaugcgauauaagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 new file mode 100644 index 000000000..b9972f57f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCGCTTGTTTTAGAATGAGATGTTTTTCGGGTGGAAGCCCTCTGCTTTTTAACTACCAGCCCTAGCATGACACGCCTCTGCGGCTTGCAACCTTCGTCTGGCTTCCCGGCTCCGACCGCCTTCCTGGAACCACTATGGGTGGTACCTAACCAGAGCTTTGACATCCCGGCGCCGAAGATTGTACGGCGCTCGTGGAAC")) +(assert (= z "gauacccgcgucuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 new file mode 100644 index 000000000..6e8fb2006 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCCGGTACATTTTGCCCCCTTGTGTACGGGGCCGATGCACTCTCATTACCCAAATCTTCGAAGGTCTCTAATAAAACTGCAATCGCCGGGTACGACAGGATAGCATGATTACCCGGGCATAAGGTCGGTTAATTGATCTCACGGGCACGAGTAAGTCATGGGCGTGTTGCTCCACTCAAGGTACAGCGCTAGAGAATA")) +(assert (= z "ugcggcuccguguua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 new file mode 100644 index 000000000..f12aeea2e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAGGTTCTGACCAGCGTACTACCACGCAATTGTTCAGAACCTCAAGGACAGTCCGGCCGAAGCGCGGTCGAGGAAGTGAGTAGAGGATGTGAAAATTCTAGTTCCGATATGCTCGTCAGTTAATAGATAGGACACGCAGTCCCAAGTGCCAGTTTGTCGAACTATAGGGAATAAGCCCAACAGCTTGGCGCACACCGGA")) +(assert (= z "aaccguaucucccuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 new file mode 100644 index 000000000..1d4341743 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATAGTATGGATTTGCTCGCTATGATTGCCTTGTCTCAAAAGAAACCCTCTCATATTGGCTCACGGCTTGTCATCGTGATCTTTCGCTGAAACCCCTACGATTATAGAGGTAGTGACATGCTGAAATGCTGGTGGGTGCCGTACTAAGTTTACAATAACATGCTTGCGAGATTTCGGGTTTTTTGCCCAGTACCAGCC")) +(assert (= z "cagcucgagcuaugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 new file mode 100644 index 000000000..efbfca975 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCGCGCGTACTCTTTCACCGAAGTGTGTATTTGCTTGCTTTAGTAGATTAGCTTAGGTGGCACAACGTCCCAGGGAGAAAACGGAGTATGGCAACGGCACCGAGTGTATGTGACGCTAATCACTGACACCTATCCAGGAGGAGTATCTCGTTTTTACGAGACCCGCAGCCTGTATTGGGAGCCACATATTTCTGCAGTC")) +(assert (= z "ugcacuuuucccgcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 new file mode 100644 index 000000000..6926d33ae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGTAGGATTTCTGAGGTTCTGAATTACCTTTATTAGATAAATGGCGGGATCACCAGTACAGCCGAATCGATTCGAGCATCTGGCGAATAGAGATCATCGAAATGTCGGTTGAGAGGCACTCGGATTCGCACCCCATTAGGCCTAGTTAATTCCTTGTCCGCCATAGTTTAGTCTGTGGCTTGTCAGTGAGGAGCGTGCC")) +(assert (= z "uccuucuacagcgug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 new file mode 100644 index 000000000..900edfe60 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTCCCAGATAGTGAGTGCACCATCTTCATCCCGAAGCTACTCAGCCGAGAGTCCCCTGGTGTATGCAGTGCTGGTATTTGGGAGGCCCGAGTACTCAATTTCTTTAGGGAGGGCAACGGGACGTTGTTGTGTGATAGGGGACGCGGTGGTTTAGTAGTGCGGTCAAAGCGAGTTAATCCCGATGGAGCGCTATCACTGA")) +(assert (= z "guaaccaacgugagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 new file mode 100644 index 000000000..92d8a68e1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTTGCCCCAGACTCTAGAAGTCCAATTGTGGTGATCGAATAGCCATTCTAACTACTGGCACGGGAGAATATCTGCCGTCAGTTGGATTACGAAGCATCAAGAAAGCAACTACTGGGATGCCCAGTTCAATCAGTTACCGCATGTGGGCGAGATTCTCGGGGGGGTCATTCGTCTGCTACTGATGTAGTGTGTCATCCGC")) +(assert (= z "cgucgauacaugguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 new file mode 100644 index 000000000..43eea072a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGCGTAACCGGTCTGAACGAGTCATTAATTAGGTTAATTTTCATCTAACGGATAATAAGTGCGCAGAGTAACAAATCTGCAGATTGTTGAAACGGGGTGTCGAATACTGATCAACTATATTGGAGAATGGAGTGTAAGTGTCAGTTATAGGTCGAAAATGGTAATTCACGATAGTATTACCGTAACTACGGCCGAGGAC")) +(assert (= z "ucaaaaagaucuggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 new file mode 100644 index 000000000..8de7e3412 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCAATGGGCTAACGTCTGTTAGCAGCGGATACTATCAAGTCATCCTTTAATGGTTAAAGGTAAATAGTTAGATGTTTTACTAGGTGTAACAACCTCGCCGACTGGTGCGTGAGATTTAAGAATCGTCGGGACGAAGGCTTTCAGGCTAAAGGCCCGGATAACCTCCCTTTTCCAATCCAGGATCGGCTGCTTAGTCCAAA")) +(assert (= z "uagcccgucaccaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 new file mode 100644 index 000000000..45f9eab0f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTTTTGTCTTAATGTTGTTGCGCACGCATATTATGGACGTCTTACTTTTCAGTATATTGTTCAGCCTCAGGGTGCCTGAGGACTCTTCAACATCCATTCGATAGCCTTCGTGCCAGCAACCCTGAAAGTAAACGGTATTTCTCCGGCATCGGACACAGGCGTCATAGCGTGCATTGAGAGCGTTGAACGCTTACCTTT")) +(assert (= z "auuggucuuacgauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 new file mode 100644 index 000000000..783f335b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCTTAATTACCCAGCGACAACATACTAGTGTTCCGGTATCCCGGGGTTAGCGGGTTGCGGAGGGTATGCTAACCTCGCTCTCCTACATAACGTATCTGTAAGTGGGGACCTCAGGTCTTGCCACTCTTCATTCAGAGACTCCGGAATTCCCAGATGCCCTGGACCCCACAGGGGCAACACGTATGTACAGCAGATCATC")) +(assert (= z "cccaaucgaccgucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 new file mode 100644 index 000000000..8ec7a94f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACACAATCCCGGTCCGTTAGAACCACGCTCCCTAGAAACGTGCACCCATGCCGACGCCCTTCAACGCCCAGCCCCTCCAGGCTAGATTGTGCTCTCCGCAGAGTAGTCGGTCACGTGACATTTGCAATGAAACATTAACACTGATGATGTGTGACCCTAACTCTGAGAACTCATCACTGGGCCGGAGACCCCTCTTTT")) +(assert (= z "ccuaauuucaauggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 new file mode 100644 index 000000000..dd9f5a779 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCTAACTAATTCCGATATTGTCTATAGTGTATGGTCATATGTTCTATGGCTTCTACAACGATCCGGTGGCCCTAGACCGGATGCATCGGCGTGTATACCTTGCCGCCACTGTCTTGTGGAACCGGGCTGTCAAGGAACGGGTCAAATGAGATAAGCTCCCGTCAGCCCTTCCCGCAACCGCCAACTAGGTTCGACGCG")) +(assert (= z "aucguucuaggaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 new file mode 100644 index 000000000..b66854417 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGATTTGAACAGGCTGATTATGGTGATTCGAGAGTAGATTGTTCCGCACGTCCTCGTCCGTTGTATGCCAGCTCCACAGGTGCACTTTTAGGACGTACCGAAGGTGAGGGTTTGGCGGGAGTGACTCGGACTAACATCATCTACCGGGAACCGTTTGCCCAGAGGGTGGTGGGCTGTAGGCTCCAGTCGATGTCTACTGT")) +(assert (= z "aguccgggugggggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 new file mode 100644 index 000000000..aca8b0d5e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCAGATAGGGGACCATCGGTGCCAGAGTAGATGTGATGGCTGGAAACGCTATCGATTAGGAGTTGTTTCACGAAGTGTTTTGCCGTCCAACCTCTGCCAGATCCAACGCAGATCCTCCCCGGGTATTGCAGCGATCCAACCTAATGTTATTACTTCCTCAGACGGCGTACGAAGTACTAGGGTAGTCCCTAAGACAGGTC")) +(assert (= z "acggcuugaccuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 new file mode 100644 index 000000000..ae384a6ea --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTGGTCTACACACTCATTAAAATAATGACAACCGTACTAAACATGTCGGCCTGCCTTTCAAGACAAAGTCAGGTTAGAAGTTACTAGTACAAAAGTGACTGGGGTAAAGTTTTCGTGTTCAGCGTTCCGGGGAGGCTTGTCATGAGGGATTAACATAAAGATAAGGACCACACAGGAGTTGCGATACGGTGGTGTCGT")) +(assert (= z "acaggcgaauggcuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 new file mode 100644 index 000000000..d8403ce98 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGACAGGTTGATGAACGAACGCACACCATTCGGGTGCCTTTGGCCTCTAAAGGGAGGAACATCTTTTAAAAGACATCTAACCGGCGTCGATCATCAAATCGAACTACGGATCTAAGAACTTACGGGGTCCAGGCGATGGGGCAAGAATAATCATCACTCACGATTCTCTTGAGGAGCGAATTTATGGGGATCTGGATTG")) +(assert (= z "gaguccuuaugagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 new file mode 100644 index 000000000..ec057f707 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTGGTACCTTGTTGGACGTACTACCTGCGTTATACCCTCCTCCTTGGAACCCAGAGTTCCGATAGCGTAATCTTCGGATCAGACTCGGGATCTCACAAGAGGTCTTAGGCGGGCAAAACTCTTTTAGACCGGTCTTGGGACGATCTGGTATTTGCATGTAAGAACCTGTCACAGCTTCCACCAGGCTAGACTGGTAGA")) +(assert (= z "gacgcauuugaaccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 new file mode 100644 index 000000000..aa1aad897 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAGAAACGCGAAGGTGGCTCGTATATTAACAGAAAATGATTTGAACAACTCGGCCTGGTGTCCGGGTTTTGTGAGAAGGTCTCGGTACCATGTGGAAAGCAATGACACGTACTGAACTTTCGCTCTCCGTGACTGCGGGGCGACCTTGGTAATCGAATAACATGCAGCAGAATAGGTTTAGCCGTCTGAATGAGATTG")) +(assert (= z "ccggcucagaaacua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 new file mode 100644 index 000000000..e0e7af708 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGAGGTTGAGTCAATTGGCAGGATCACGGAAAGAATTCGGTTCGAGAACACGAAGGGCGATACCGAGGCAGTACGAGGAAGCCATGAGTCCGCAGTCACTACCGATTAGGTATACGGACACGTAGACGGGGGACGATTAGATCAACTTCCAGTTTCACCGGCGGGGGCGCTTCTAAACATTTGGCGTACCGTGTACTGGT")) +(assert (= z "uuaugacccaugcga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 new file mode 100644 index 000000000..69cc2e9e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCTTGTGCGATGGTCCGTCGACTCGCCAGATTACCCGTACTTTGTCACGGTGCATATAAAGGCAGCTCCCTGACACATCTGCAAGCATGTATCAGGCGCCAAATCAATTTAATTAGGTCCAACAAGGTTGGAATGGACTGTCAGTCGTTGTAGGAGGGTAGTTACCTATATCCTCTACGCGAGGATTGTGCTTATAGAT")) +(assert (= z "agcgaguuaggauau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 new file mode 100644 index 000000000..29667b332 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGTTTACGCAGTCCCTTCACTAATTAAGATTTCTTTCCTGTAATTTTCTAGTTAGTACGACCGGAAGCTGCAATCTTATAACGATATCCACGATACCTGGGCAGCCGGGACAAAACCGGTCTATGGCCCAGTCGACGGCGATTTGTGCACCGCATGCAGGAGGCAAGTCCTAGCGGCGGACCGCCAGATACGACGGTG")) +(assert (= z "cacgggaccauacga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 new file mode 100644 index 000000000..6312344b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGGCACACGGTATGTCGAGAACGTCTGAAACTAGCTGGAAACAGTATTTGTGCTGCGTTTTTGCAGGATGGGGAGTCTGTAGGTAGATTGCACTCTGTAAAATGCGGGCCCCGGACCGCCGGCAGGGGTACCCGCTAACCGCTGAGCTTGGTCGGGCATACATGTCCGGTTAAAGCAGAATGCTTCCTTCCCTGTAGTC")) +(assert (= z "cucuggagucccccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 new file mode 100644 index 000000000..235bf8009 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGGGCACGCCCGGCCCCACTGTACGCTTGCATGGCCCGATGCGCCCCAGTGTTTAGCACCGGACTTTTTCCTTCGACGGAGCATAAATCAGCAACGATGGCTTGCACCTGGGATAGAGCAGGAGGGTTGCACGTCAGACCCGTCGGTATGCTGAAACTCATCTTGAAGCATCATAACTCCCGAATGCTCCCAGCTAACA")) +(assert (= z "cggagaucuacacau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 new file mode 100644 index 000000000..a479a1fa5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACCACAGTGAGAGCTCTCGGGCCCGCAACGAGTCATTACATTTTTTGTCCCCACCGGGACTAATGCAAAGAGGGCCGGGACACTGCATTGATTGCCACGACGAAGACTCCCTAGTTATAAATGTTTAAACCGCTCGTGTGAGTATACAGGGTATTATAAGTCCAGTGTATTTCGGATCAGGGATATATTATGAAGAAAA")) +(assert (= z "caccgacauuaguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 new file mode 100644 index 000000000..87e3be6d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTACCGCTGAAATGGGTTACAAAGTACTCTTGGTGGCTTAGATACCCTGATACAGCCAGGAATGATAAGACGTTAACAGCTACCCGGGGTTGTGTGGAAGCACGTAAGGGTCATATAAGCCAAGCCGCGCACCGCGTACCACCTGTGTGGTAACCATCGTTACCGGGCCGCTACAAGTTAAGAACGATAGTCCAGACTG")) +(assert (= z "cugacgucccguagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 new file mode 100644 index 000000000..7ae1b04c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCGGCTGACGAACGCACGATATAAATCCAGAGTTGAAGTAATGCGCGGTCGTTAAGATATTCCGGTGCAGATGGTCTGACTCAAGCCCATGAAAGGTCCTCATGAACTTCCTGGGACACTCACTCAGGCAAGGTTTGGAGACGTGCTCGCGCCTCTTCAATCCGGGAGTGCCTGCAACTGATGTGGCCACACCCCGGC")) +(assert (= z "accguuccuccucaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 new file mode 100644 index 000000000..294673e77 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTCTCCCTTTGCCTCAAGCACTGCTGACCGGGCATTCAGAGTTGACTTTATTAATCTAAGATTGTATGTTACGCTCTTTGGCCCGGCGAGCCGTGATGAACCCAACAAGTATCTTTGCAACGCCCCTTGGATACAGAGACTGTTATATTCCCCAGGAGTCCTCTGGCCTGTCAGTCTTAAAGAAATGCTTCTTGAGTAC")) +(assert (= z "cuauacagcaccauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 new file mode 100644 index 000000000..503ab8f45 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAGTCCGCAGCGAATAGCCGTCTGGGGAATCTTTTGGCTTAGACACTATCAAGCTTAGACCAGGCACCTTGCGGAAAGGTCGCCATCTCCAGCCTCGTGAGGATGAGCTTACCCATACGACGGGCTCCTTGTTAGTCGGGAGAGCTATACCGCCATCGAAATCTGCGGCCCGCTTAGACATGTGGCGCCCATCATGCTC")) +(assert (= z "aaccgcggggaccua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 new file mode 100644 index 000000000..ac1f4b6fd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTCCTCATGTTAGCGACCGGCAGGTGTAAGCTAACCCTTCCCATTTGCAATGCCATTCGCGGTGTGTGTTAACCATTGGCCTCCAGCTAAAAATCCGCGGGGGAGGCCTGCTTAGTTCTGTAGCCTATCTGGCTAAAATGAACCATGCAATCTCCGGTCTTGTTTCATCGAAACATTCTGAAACCCGTTGAATAGCGAA")) +(assert (= z "cuucccaguuuuguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 new file mode 100644 index 000000000..bd823d044 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAGGCTATGCTGAGACATTCCTTAAACGCGTTGGGCGACACTTTGGGCGCGATGGTCCGAGCATAATGTTGTCAATCATTCGCTATTTCCCGACAGTCTAGGACGGAGGCTCGATTCTGGCCAAGACCCCGCGCCATACAAGGGTAGATTAGATGAAGGGTATCGTAAGCCGTCGCAAGCTTGTTGATCAAGTTGCGCA")) +(assert (= z "gguagccuuggccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 new file mode 100644 index 000000000..e9b8acdbe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCCGGAGCGTCAGGTACCGCCCCATAACAATCTGAAGCCTATGACAAGTCCGATGAGTAAATGCCTTACGTGCCGACGGCTTACTCGACCTCCTAAGCCCACGCGGCAGTTGGGGTTCGGGCGTCTTATTCGTAAAATCTCTCGTTCAATCTGAGTGTCAGTTTGTGTCGCGGTTGATGGGTGGCAGAAAATTCATAAG")) +(assert (= z "ccaauagaucuuuuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 new file mode 100644 index 000000000..141526e37 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGTTGAGGCGTGATCACATCCAGATCCGTTTGCCAAGAGCGCACTATTGCTAGCGAGTATCTCAGGACCGCATTCATTTCTCAAGCAAGTGTAAAGTGGCCATGGACTAGGTGGCATCTGGATCTTAACGCTTTAGATAACATTTGTACTGATGCTAGTTTATTTTAAGGTCTGAATTCCATTTGGGTGCTGGAAGCAC")) +(assert (= z "aacuaaucaucaagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 new file mode 100644 index 000000000..e679cce43 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGCTGCTGATAGCTGCGGAGAAAGGACATTGATTACTGGAGGGCGTATCCGATCTTAGAAAACCAAGGATCTACGGCACTGACGGTGTTGGAGCACAAACAACATTATAGTGGCGGTGGACAAAAACCAATCCTCCTAGAACCGTCCCTTGCCGATATAGTCGCTGCACTTTCGACGAATCCGCCCGCCATGTCACCCG")) +(assert (= z "cgcggcuagaccggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 new file mode 100644 index 000000000..c8d54cf38 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGAGGGCTCTGCTCAAGTCCAATAGGAAGTACCTCACGTTAGGCGGACGAATGGCATGGAACACGCGCGCTTGATTTATATAATTGAGAGCCGACTCCCAAAAGAGCGAGGTGATAGCGGAAGCTTGGTAACATAACAGTTGATCATCCTTTGGTTGTTCGGAGTTATTCGGCTAGTGCGAGGAGCATGCAAACGACGA")) +(assert (= z "ggaagaccgcccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 new file mode 100644 index 000000000..44162a343 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTACTCAGTAGGCCTAGCCTGATTGAGTTAATTGCCTTCTTTGATTAAGAAGCGCAGGAACATCATCCCATGGGGCTTAGCGATTGGCATTTAAGAGCAGCAGTCGTCCGCTTATCGTCTTTGTCTGATCGTTGGTAGCGTACCTAGCACGCCAAGTCCCAAGCCATGTTGCATGCGGCAGGTACACTCCAGAGTAATG")) +(assert (= z "ucgccuucucuacaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 new file mode 100644 index 000000000..e23a779a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCGCTAAGGGTCGGATTTGAAATGGGAATCGGATAATGTTACCCGTTTAGAAAACCTTAGAGGCATAGTCTATATCAAGGGGTACCGAAGCTGTGAGACTAAGGGGATTGGTAGGATGGCGCCTATACGGACGTGGCGACACAAAGGGAGTTTTGTCTGGTTGCTCCTGGCGGAGCCAAGATTTACTATCACACCACG")) +(assert (= z "guuuucguucacaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 new file mode 100644 index 000000000..9605e54e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACGGGTCATCGTGGATTGCTACATTGGATACCATGCCGGTCCATATGAGACCGTCCGCGAGACCCAGAATCCTAGGGCTCCCTAGGATCCGGGCAAACCAAATAGACATGGCCACATAGGGACTGTTTCTCTGGCACGCTCTAACGACCCAGCACAGCTTCAGTATATTAACCTAGACAGTCATCCGCGGCATGAAAAC")) +(assert (= z "cagucuaggcuguca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 new file mode 100644 index 000000000..3b981b469 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTGCCTGCAGATAGCGTTCAGTCAACGTAAACCCTCCGGCGGTCAGAGACAGCCCAGCTTCATTCCTGGATGGTTTAAGCATGACCGGGTCACGACCCATGCTAAACAGATATATTGCATCAAATGAACGTTACGGTGCTTCGTTACATTTAGGGTAGGAAGGCGTAGGTTGCTCGTGGAGTTAAATTAGTCTCCGTAG")) +(assert (= z "ucccaaauuuaaucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 new file mode 100644 index 000000000..65560fe8c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTGTTGGTCACGGCTTACTGATCGAGCACTGCTGGCGACGATCGACGGTTTATGTTCGCCTCGGCATACCGTCGATATCTATACGATTATTCACTCACCCCAGGTTCCCATTATCGGAAAGCGTCTAGTTGAAAGCGTGACCCCCCAGCCGGCTACTTATTCTGAATTGGTGGCCGCTAGCCGATAATTCCCCCGGTTA")) +(assert (= z "aaucguauauccagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 new file mode 100644 index 000000000..7d19fcc08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTTGAGGCTAAGTTTTACCGTGTAATTCAGCCTTCATTGGTATAGGCACCCTAAGGCTATCGCGGAATGCACCTACCCGACTCGCGTCACTTACACTTCAGTCTATCCCTCTCCTGAATAGACGAACTCCTATAACGCCTACGAGTCATGGCTCGTGTCATGGTTTGGCGCATTTCCAATGCGTGACGAATAAACCCAC")) +(assert (= z "uauucccuguggggg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 new file mode 100644 index 000000000..c2df78bd0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGTTTCTTGCTGATTCTTGCCCTGTGCGGGCGCGGTTGTCTCGAAACATCTAGTCGGGGGATCCGGGTTACTTCCTAGAAGAGCCCCTTTCACTGCATAATAGCGGGTTAAGGGATTGCGAACCAGGCCGTGAACAAACAGATACATCGGGTGGCCCCGTGAACATTCTGGATAGCCCCCGCGGCAAAGTGCTCCTAGG")) +(assert (= z "gaacagaccaacaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 new file mode 100644 index 000000000..3ced1a8a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTGACCCATAGTTATCCTACACAGGTCCACCTGAGTCGACCGGCTATCCGAGGAAAGGGAACCCGGCGAATACTTTGCTGGCAAAGGATGCCTGACCACCCGATTGGGATTGGCTTAGAATGCGTCTCGAAATATGTGGCGCCTTCCAGCTGCTCGAGGGAACACCCATATTACAAGGTCATAGTGTGAACATAACGA")) +(assert (= z "cuguugaucagcaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 new file mode 100644 index 000000000..81d7e8dcd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAATCAGGAAACGATGGGAAAACGGATGACCCCCCCAGCCTAAAGACAGCAGGCCTGACTAGGCATACTAACCCCGACAGCCGAGCCGGGTTAGGCCCTATTGCTGGACGGCTGCTTGCGGAGCCTGAGCCGCGAGCGATGCCCGTTATGCATATCCATACAGTATTACGGTTACAAATTTTTTTTTTTAACATCAACAA")) +(assert (= z "cggagauacuccacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 new file mode 100644 index 000000000..5a036667f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGACATTATGAACTGGGTTAAAGGCTTCTTCGCATCAGATTGGTTGCGCGCGGACTCTCTCACGGCTTTAACCGTGTGCAAGCCGAGCACTGGGGAGTGAAGTATTATAAATAGGTTCGCGTGAACCTCGTCGGCACGCTTGAAGGTAAATTTGCTGCTCGTAAAGGGGTCGGGTGTAAATGGTTCCTTCGTCAGATTT")) +(assert (= z "gaacuaacgcuuccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 new file mode 100644 index 000000000..c191b353c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGAATTTTGAAAAACAACGTTTTTCTCGGGTAGATTACTCATGCGGTTACGGCAGCAGAACCGCTTTTGTAGATGGTAGGGCGTGTGCACGCCCCTGTTCACAGAGACCTCCAGAAGCGCAGCTTGTTGTATCATCTAACTGGGGATTTATTGTATTTATTGTTTAGCCATGAGTTTTAAGATGCATCAAGACTGCTA")) +(assert (= z "ccaagugacaauaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 new file mode 100644 index 000000000..5674aba1e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACACGTGCGTACGGAGGAGGTGAAAACCCAACGGGGGAGTTTTGTAATGACCGCTACACTCGCGGGCTAGGTTCGTCGGCAATCTAAGCGTGCAGATTAGATCGAGTAACACTAGGAACTTTATGAGAATCGATAATCCTGGATGTGTCATCGCGATCATCAGGACTATTCACTGCATATGACTCCTCGACTGCGGTCT")) +(assert (= z "acacuuacaacuaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 new file mode 100644 index 000000000..595c59613 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTTAGGGCGACGGTCACTGTCGTGAGCGAGTCTATTACGCTGTCGTAAAGCCTATCATTCACAACCACTTGTATAAGTGGTTATACCCAATGATATGCTTATCTCGGGATCTTCGTTTCTAAGCTCGGGGGTTAGGCGAAAGACTGCTTCCGTCGGTTCAATACGGGTGCCCATGTTTCCCAGCCCGCAAACAACCATG")) +(assert (= z "ggggguguucgcccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 new file mode 100644 index 000000000..ec91e390c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACTGCCACGTAGCCGGGCTTCTCGGCTTCTTACGCCTGAATTTAATCCCGTTCCTCCATGTCTGAAGCAGTTTGAGCTCACGTGGTGGTTCTGGCACGCATCCCCTATGCTGCGCCAAATCACAAATACCGCGAACACTTTGTGGGACGTACGAGCACTTGTGGTCCGTCTGTACAGGGTATACAACTTCATACACCGG")) +(assert (= z "uccuauguugucugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 new file mode 100644 index 000000000..35f1b86c4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGAACAGTATGCAGCAGGGCCGGTAACGAAAAGAGTGCACGTGTTTTGCCGGAAGGCATGCGGCGCATGCCGACCCTTATGGCTACCCTCTCGTAGTTTGAATTACGTTTTCTATTATCCATCAAGATTGTAGTTCGGAGCAACTCTGGCCGTCCTCAGGAGCAGAGCGACACATCCGTGACCTTCGAGTGACATTCG")) +(assert (= z "agaagggugggcaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 new file mode 100644 index 000000000..849ae5e44 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGACCCTGGAACGGTGTGTGCAGCAAAAATACACCATTAAAAACAAAAAGGCACCACGGCCTACAGAGTATTTCTAGACGTATGTTTCTGACTTTGGTCTTTTATTATAGTGTCCCTCAGCGCTCCCGTCCGCTGACCGGCGTTAAAAGAAAAGACTCCGGAGGACCCCTGAGTGCAAACTTCCAGTTCAACCGGTGGC")) +(assert (= z "ccuauaucucccugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 new file mode 100644 index 000000000..302617a9c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCGTAACAATGGATCAGGCAGAGCATACCCTTATTATTTGTGGTATTTCATCACTCAAAGAAAGTGCGCGCTCCTTTGCATTGACGTGTACATTGATCCTGTTGAGACCAGAGGGGGCACTTGAGTAGTCGCGTGTAGGCTGGGGAGTTTCCCCACAGTAGGTACATCACAGTTATCTATGCCGTGCTAACTCTTCTCA")) +(assert (= z "agccacaacaaaggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 new file mode 100644 index 000000000..fb670fb97 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTGTTACCACTTCTTCCAAAGGTCCGTGGCCGCTGAGTGGACTGCAGTTGTGTAGCACTGCCCAAGAGAAACCTTGCTGTGAAAGCGAGAAACCAGAGGATGTCACCTGTGCACCCATCTCACATACTTACAACCTCGCCCGCTCCTCACGACGCCTGTACGTTATGTAGTAGAGCCTAGTTCATGCGCTATCGATCAT")) +(assert (= z "uugggacguuuggag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 new file mode 100644 index 000000000..bbcb5e558 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCATATGTACAAAGGGTTCGATCCCATATATTGACAGCCCCATCGAGCTCGGCAAGAGCTCGGGGGCACGCGTTCAGCCTGATAGGGATTCTGTAACTTCATCAGGCCCAATTCAGGATATTGTGCTCATAACGCAGTCATCCACGAACGGAGGCCCGATGCGGCCCTTAGAGTCATGGATTTACGTCTTTAGTGCAAT")) +(assert (= z "cgugaaugggugcau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 new file mode 100644 index 000000000..5f759ff34 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTAACTAGTACCTCGGGAATGACTTCGGGGGCGCGATCCAATTTCTAACGCGAGGAGGCTCCACGAAATGTGGCCGTAATGAACTTGAGCTATCCTGTGAGTCCATTTCGAATTACACGAGAGCCCAAATGTGCCTGACTTTGTAATGACTGACGTATGTTTTTACTTACATCGCCGGGTTTGATGGCCCGTCGAAAGG")) +(assert (= z "guguacacccgugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 new file mode 100644 index 000000000..14a192843 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTTAAGATGAATTGCGAGTTGGTAATATACTTTATTGAAGGCACATTGTGCACTCATATATTCCGAATCCTTTACTTTCCCTTCTAAAAGCAGACTAGCTTCAAGTACCGTCCCTGTGTCCACAGTCAAGTCAGTCAGCACACGAACCTGGGCCAACAATCTACAGCCACGCGGCTTAAGTCAATCTCAATGACAAGC")) +(assert (= z "cagcgccggaacuua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 new file mode 100644 index 000000000..77e5a8fc5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGGTTAAACGCGCCCAATGCATTCAAAACAAGCTCTTATCGAAATTTGAGAGCCCAGCATCAGCCCGTGATTTCGAATGGTGCGCTTGTCAATGCTCGTCAATTCATGCAACGATAATACGGGCTGTCCGAGACGCTACGGTTCTGCGATGGGGCCACAACTCAATCATTTGGCCACAACGCTCACAATAATATAGGCA")) +(assert (= z "ugucgugggguugca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 new file mode 100644 index 000000000..2d5d10153 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTCGGGACGATATGGACTCTCATTGTCATTCTGTAGGACTGAAAAAATAATTATTCACGGGTCTGCATACGACAGATATAAGATGCGGTCCGCAAGGATCGGCTCTTGCCCGGCGATCCAATGTTATTTGCACGTACACCCAGCAAGCTTATGAGTGACCCCTTGCCACATGCGTAAAGTGGAGGTGACGGCGAGGCAG")) +(assert (= z "auuuaggcacuuuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 new file mode 100644 index 000000000..21f93a0f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTAGTCAGCGGCGCCAAGAGCATCCATTAGTGAATTCGCTAAGACCAGATGAGCATTTAGCCGTTCTGAGACGGAATCGACCTGATACGGGAAAGACGCGCCACCAGGTCGACACACATTCAATTGTACTGCGGCTCTGCGCCATATCTCCATGAAATGGAACAAGAGATACCTCTACCAATGAAGGAAGGGGTCACCC")) +(assert (= z "uacccugacaccaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 new file mode 100644 index 000000000..8cc6a8d63 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACTCATCGCGAAAACCCGTTCCAGTAGCCAAGGTACGACGCTCATGATTAGACGTGAACTCATTGGGGATGCGCGAAAGGTCATCCCAGCCTCGATTGATACGTATATGGCATGAGGCCCTCAGGGAACTTAATAACTACGGGTGCTCGCGGCTTGACCAATGTGCTTGACCACTTCCAAACCAGGAAAATGCTGGGA")) +(assert (= z "gggacguuuuuguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 new file mode 100644 index 000000000..c98cadfaf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGCTGTGCACTCTCATGCCCCTCATCTTTTCGGGAGTACCCCGTGCCAATACCCATGAATGTATTTGAGTTACCATCTCATTCACATTAGAACGCCAAAAGGAGGTCGTATTGGCATATTAACTCAACGAGATATGTTCTTCCTTGGTTTGCGAGTAAACTAACTGGAACGTTTACGGCGAGCTTCTCCCCAAGAGAT")) +(assert (= z "ucaucuacggcgcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 new file mode 100644 index 000000000..5c832e53d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGCATGGACAGGGAGATCTCCGTCTACATGTAAGGACGTAACCAATGAAAATAACTTCACGAACCCTACGGTGAGCTCTAGAGCTCCGTTCTGGGCGGGAATCGGGGAGCCATTAAGTGTGACCTCCCGTCGGCGGTGTCTACCAGCTGGCGAACCACCCAGGGTCGTACACAGTCAAAATGGCTACGTTTTCCGCTGG")) +(assert (= z "gcauaagucagcacg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 new file mode 100644 index 000000000..d4d85e881 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCAGGGCAACCCAAACCAAAATACCAAACGAACGCTCAATCAGCATCATCTGGCTCTGCCATAGCTCGCCCCATCAGAAATCCCGGCCAGCTATCTAGACTCAGCAGTTAAACCGCGTAAAGGCGTAAATGCATACAAGATAGGCGTTAGGCAACGCTATTTTCCCAGCCCTCATCGACTCTTGATCGAAGAAGGCCGA")) +(assert (= z "agauguccacaguua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 new file mode 100644 index 000000000..ff2267112 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACATGAAAGAGTTATCCGTCACATTGCCGCGGTAGATAGACTCCCCGCTGCATGAGCGTAGAGTTGAGCATCGCGCACAGAGTGGCAGTCTGAGGCGGGGAGGCAGGTCACACGAAGTCGGCGACGATGAGCCCTATCTCTCCGGGACCCTAAAACGACCGCACCAGAGTCCTAGGGCCTCTAACAGGGGAAGCGATGC")) +(assert (= z "aucuuacaguuaaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 new file mode 100644 index 000000000..0e2471f55 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGACGGTTAGACGGGGATCCCCTATCAGTCTAGGAGCGGGGCTATAGTGCGTCCATACCACGAAATGCATGGCGCGAGAAATCCTCCAACCCCGAATTTGAGGCATATCACTACTTACCCGGCGATAAGTCCTCTATGCTGAGGCGGGGCTTGTTGGTTGTACTGAGATGAGACGGAGATTAATCAGAAAGCTAGTTAAC")) +(assert (= z "cuuaccgcguggauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 new file mode 100644 index 000000000..422f81e81 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGATCTATTACAGCATTTTAAAGTTTTCGTGACGCGTGTCACGCATGCGTGTTCGATTAAACACAAGCATACTTGCACCAGCTGGATGCCACAAGTATCAAAGAATTAATAATATTTGCATTCACCGTCGGAGGGGTCCCCAACGGAACGTCAGACGTCGCCGAGTCCACGGAGCGCTCGCGGTGACGATATTGCTACT")) +(assert (= z "augggaggagggcgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 new file mode 100644 index 000000000..0ef2aa772 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCAAAGGGGCGGTTGGCAAGGTTGACGGAATTGGTTATTCACAACATCGCGTCCCCTGATTGCACAGGTGTGATGTGTGCTCATGATTCGATAGAGAGATCCGTCATCAATCTGGAACGAAAAGCGGAACGGAATGAGTGGAAAGGGTGTTTGGTGCTGATCGAATCGACCCCGAGTGGGGAGAAAGGGGAAGCAGGCA")) +(assert (= z "gcuagaucugcucgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 new file mode 100644 index 000000000..80eda293e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGAATGGAACAATGACATTTCGGCTTAGCCTGGGGTCAGGGTAGTGCAGCCTAGTACTACGGCCGACAGGTCCATCGTCTGCCTTTGAAAAGAGTACGATTCTCTGGAGTGAATCGGGTGCGACCAGGCGTAATTAGACTTAGCCCATGAGCCATATCGTGTGGGGGTATGACACCGATTTCTAAAACTACGCACAGT")) +(assert (= z "cacagcuaaccugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 new file mode 100644 index 000000000..b0de4576f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTCAGAATTGTTCTCGCATGGAGCCATGTTTTATTTGAATGCAGGGTAGTTGTGACCTTGCTAATCCGCGCTCTGCACGACGGGAAAGAGCCGGCTGCATACACGCCAGCTGCCACCCTCCGCGATGGTGCTGTTGAGGACCCTATGAAAATTGCTCCCGCAGAGCTGGTACGTTGATGCATCCATACTAGTTCTACCA")) +(assert (= z "gaguugccugaaggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 new file mode 100644 index 000000000..b9b032feb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTGCGGGACCCTTGACCGACATAGATTAGCGCGGCACCGTCGGCCAGAGTGCTATTACATCTAGAATCGCGTATAGGCGGTTGTCTACGCCGAATCATAGCCAATAGCCTCGGACAACACGCTTGAGGAGTATTAGCAATACTTCACGTTTGTCACGGCTAGTTCGTTACGTTCGAGACTGCTTTTCATCAAATGGGAC")) +(assert (= z "cacuagugggaugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 new file mode 100644 index 000000000..b7c039535 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGCTCGTCCGGTTAATACAATACGTGGGTGTGTTATATGACGGACTACAATATCTGGTAACGTCATTGTTGCGGCGTGTCAGTCACCTGGCTGGGTAGTTTGGACATGACATGGCCGTACCATATTAAACCGCTATAGCAAGGATCTCCAAGAAGTAGTTGAAGGCAATTTTTCGATCGCGAGCCGACTTGACTTGCAT")) +(assert (= z "uacuggguuaaccau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 new file mode 100644 index 000000000..37f203474 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTCCGTCTAATGGCGCACTGACGGCGAAACATTGTTTAAACAGTGTTCTCGTTGGTGCTGGAACCAATATAATCCCGGTGCCAAACAGAGCGGGATGGTTGGGCAGCGGAGTATACTTAACGTTGAACGAGCGACGTGTCTGTGGTGCCTGACAAAATTGAGAACATAGTCCTGCAGGGATCACTGCCTTCCTAGCCTT")) +(assert (= z "ucguccuacaacuca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 new file mode 100644 index 000000000..23ff0aba8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTTCCCCCATGGTGATGAAGACCTGTAGGAAGTATAAGACGCTCTAACTCTGTAAATGCAGTAACGGGCACGTCCGTTGAGGGTTCTCACATGTGTTTTTTGAAAGATCTTTCAGGTTTCAAGTGCGACGATGTTATTTGACCCAATATTAAGCTAAGTTCGGTGCGTCTTGTTAGCAACTGCACGGTTGGCATACCTA")) +(assert (= z "cugucggggggucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 new file mode 100644 index 000000000..bce0cd748 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTAAAGGCCCTGTAGATTAGTGAAAATTTAATCCCGGCACTGTCCACCGGGGTAGTAATGGTCCTGCCCTGCTTTTAAAGCCATTGGGCTCGAAGATTGCATTAGGGGTCATTAAGTTAAAACGTTCAGTATGAGGGTTTATGCTACGCACTGCGAACAAAGCTTCAATAGAGGGCCGATTTACGGTCCATGTAAGCAGA")) +(assert (= z "acaagcucacuccgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 new file mode 100644 index 000000000..f3755ad28 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTAAGGGTTTTACTCGGGTAAGGTTCCACCAAAAGTAAGCTGCCGGCGTGTCCAACCCAGTCAGTCCTAATGCGGGTGACACATGACGGTGCGGTCGTTAGCCTCGTACACTTGGGCCATCGAACTGCTCAACCGGTTTTGCTGCCTAGCCACGACTGTCGGCTTGGCCCAATCACACTTGTAGGAACCATGAAAAAC")) +(assert (= z "cgaaaagugaacggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 new file mode 100644 index 000000000..e3376f124 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCGTTTCCAGTCTTCCGGAAGACTGTTCAGCAAATCACTTCTGTGCGACAGTGCTATTCTTTAGCCGACGCAGAGAGTCAGCAGTGATTAAGTTGCGCTGCGACGAGGACATATTAGGTATGGATCGGTTTACCGAGCAACGCTCCCTAGAGGAACCTTCAGGGGGTTAGGACCGCGCTGGTGGATCTGTATGCCCTTT")) +(assert (= z "uaucugugcucucua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 new file mode 100644 index 000000000..dad237b27 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCTTCCCTTTAACCGCTCTTTCAGGCTGCGACGTGGTCATTGCTCTGAGCGCTACACGGAGTTGGAAGGTCCTTGGGAAATCATTGAACCTCGCCTTGAAACCTCTTCCGGGGGACTAACTTTCATCGCTGGTTTAAGACGTGTGACCTGCTGATGTCACAGTTATGGGCTCCGCTTCTCCCCGCTCGTTCCAACACC")) +(assert (= z "gcgauuuuaaagauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 new file mode 100644 index 000000000..30dc17134 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTTATTGTGGGTTTTCCACACTTATGAACGGAATAAATGAATCCCTCCCCATTTAGATAACAGCACAGGATAAACCGACGCACATAATAATGGCGCGCCACGTAGCTCAGCGTTAGAGTACTTTATCTGTGGCCAAGTAACCCCAATGATGTCCCGGACCCTAATACTAGACCCCCTCGGGGAGATCACCCAAGACCC")) +(assert (= z "cuaggcacuuuuggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 new file mode 100644 index 000000000..2450abb01 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCCATAAGGAGTTGCCAACAAAGCTGTAAGAGTAGTTCGACCAACCTTGCAATCTATTGATGTTAGTCGCAGGAACCCTAGCGACGATTAACTGACTACCCGGGTGGTTCAAGAGCCGATCCGCGCTCCTCTCGCAGCGAAAGGCAGTGAAGTGACCTCTGCTCTTAGGCCAGCCTTTTCAGCCTATGCTCTGTACGTT")) +(assert (= z "guccgggcacuguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 new file mode 100644 index 000000000..872ecd6da --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACTTTGGACTCCCCCGACTGCGGCAACTCTGTTGGTTCTGGGGGTTTCCGTGATGCAAGGCCTTGGGCAAGTCTTCTCCGACTGGAAGCTAGCCCTGGTGACCTCGTAGAGAACCTCCGTGGTTTAAAAAAAGTGCGCGCATGTCCCGATAGAACAGGCTCGCCCGCACGTATGAAAACTCCGACCGATCTAGCTTTCG")) +(assert (= z "agcgaguuuagucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 new file mode 100644 index 000000000..250abd6e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATAACGAAGGTTAGCATATACCGCGTATCAGAAGAATCGACCTTACGACACGGTAATGCCGTGCGCACGGAACCAGTGCTGACCACACCTCACATCGCGGACCCTGTTTCCGTGAGGTATGCACTTAGCGTAAGGACTAGTCTCAGCCGCCCTCCGATAAGTTTCTCGGATAGCGTTAATAAACAGGCATGAACCCGTGG")) +(assert (= z "accagucuaucucga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 new file mode 100644 index 000000000..40bafd49e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACTCGGAGGACCAGTCAGCATATTTTTTAGCTTTACAATTGCCTATTCGCTGTGGCGCCGTAAATACCCCATGCGCTAGCCGCTGAGTTTGGTTAAAGCACACGTAGCTTCGGCTGACTACTACAGTTTCTCTACTCTGGATAGCGGAGTTTATAACGCCGATGAGCTACCGCGACCGCTTGTTCACAGACGGTTTGAA")) +(assert (= z "uguggugggcuagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 new file mode 100644 index 000000000..b56836a87 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAATTCATCATGTAGTTAACGTGCTCACAAGGATAACTTGCTCGCTACCCCGCCACGGTACTTCCAGGTTCCAAAGCCCCCCGAGGGATCTGAATAGTATTGTAAACATCCACCCACTGGCTGCATCGCATGCGCAAACCATGTACACTTGTCCGCGTCTCGTATGAACCGTTCAAGCCAGCGTGTGGGAATACAAACC")) +(assert (= z "uagacuguuaucaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 new file mode 100644 index 000000000..88a1e6b1d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTCGTCATTTACGTGGATAGTGCTAGTTAACCAGTCTCCATGAGCTAAACTTAAAGAGTAGGGTGAGGATAAATCGCGCGCACGACTGTTGTTAATTGGTCTAGCTGCGAGAAGGATTAGCAACGCGAGAACCGTCCCACAGGACGCTAGAATATCTTACGATCGCGCTCTCCCAGCGTGGCACGTGGGACTATAAGAA")) +(assert (= z "aaccuaaguacccua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 new file mode 100644 index 000000000..5a4a02290 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCTATAAACGCACCCATTCTATTCTGGCCAAGGGCTGTGAACTACCGGAATTTCTGCTCTACGCACAAGTAGTGTCTGAGAGTGAATGTTGGAACCGAAGGATCATTTGGCATCCAGGATGCGGTCGTGATATCCTCAAAGGCGGTCTTTTGACAACGAAGCCATTTATAACAATCACGCGTAAAATGCCCGATTATGA")) +(assert (= z "ucaacaugcaacggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 new file mode 100644 index 000000000..f28e0da2b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGCTGGCGTGGAGACTCCTACTCTGACTCTAGCAACTCCGAATAGGTCAGTTACCTGACCTGACGAGCAACACCCGCGAGTCCTCTAAAAATTCCATCAGCAGATACGGGTTTACAAGTCCGCAATGTCATGAATGTACCAATCACTCCCGAACCTCTGAGTTGGCTTCGGAACTGGACTGAGTCCCCCATCTTTCCAC")) +(assert (= z "ucggaccgacaaugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 new file mode 100644 index 000000000..1a7c9ffbd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTAAGAATCTAGCACGGTTATTGATCTAGCGTCCTCCACGATGTAGCGTGTGTGCTCCCTCTATAACTAAACATACGAAAAACAGATAGCTTCCTAATTAGCGCGGATGCACGGGGAGGAATCGACAAACTATCATGCAGTTTGAGCACCCACGAGTAACTGTACGGACCACATGAGAGAATTATCCCGGGCTATGGTTA")) +(assert (= z "agaaaacagucaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 new file mode 100644 index 000000000..2db089aed --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATAAACTCATGTCCCATCAAAATGAAGCAATATTTCGTAGCCCTTCGGGTCCTTTTGACACTCTGACACAAACTGGTTTAATCCTTGGGTCTGAAACTTGTGTCCATTTATCCTGATTTTGTGAGCACGGCCAAAGTCTTCACCGCAGTCGCCCAGACGGCTGCTGCACAGCACCAGTCGGGCTATCTGGGCACACCTTA")) +(assert (= z "gccaaauauggugcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 new file mode 100644 index 000000000..912448fa3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTTCGGTATTGCTGTCTTTTGTGAGGAATGGCTAAACCCTGGCGTAGTCAAACCGGTTAAGGTAGCATATCCTGGCGCCTCAGTCCCCATACATGCAGTCGGACCCATTCTAGATGCTGAACGTAGTCGCGAGATGCCCCATGGGACTGTCGTCCGAACATAGAAACTTTGGCGTCTTACCAAATGGCGTGAGCAACAG")) +(assert (= z "caugcugaccugcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 new file mode 100644 index 000000000..f3be01134 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCACCCCAGTCTCACAGTCAATTCTCTCCCGAGTATAGACCATTCGTCGCCGGCGGCTCTCTCAAAAGGCTCACCTTGTTTTCAAATTTTGTTTCCAATTGCCTCGGGCTTGACTTAAACCTTTTGAACGTCACCGGTTAACGGTACGATCGATTGTAGTAGAGTGCAGCCCACTGGCCCTAGAGGGTCGGACCCTTC")) +(assert (= z "uaucacucacgauua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 new file mode 100644 index 000000000..7d769070d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGACTTATTAACACGCAAACTTCCATCTATGCAAAAGATCGCGATTCACGTTATGCCGAGACTAATCGACCGAGGCGGCTACTCCAGGGGAGCATCTGAGTAGCCCATGCTTTATGGATCGGGACTCTATTATACTGTGGCGCTTATCAATGTGGCCACAACAACCATAAATTCATCGTGTAAAATACTGAATTACGG")) +(assert (= z "uuccaucuacuaaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 new file mode 100644 index 000000000..af45ac50b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCATCTTATAATAAGGTGACCCGTTTGCTACTTACGCACTGTTTGGTTTCGAGACTGCGCGGTTGATGTTAGCCCATTCCGTCTCGTTGTTACTTCGGCGTAGCTCTTTTACGTATGTCTACGTATGATAGCCCGATTATTAGTGACTACAGTCAATAACGCGCGTGCGTCACGGGTTGCCGTATTCAACCTGCACGT")) +(assert (= z "cccaauaagguccgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 new file mode 100644 index 000000000..d29905846 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGCTCACTGGTGTTTTATCCCGTGCGTATAACCTGCGAAGCCAACGCTCCAAAATTATATTTCAACTCTAGTTGATAGTTGGAGGTTTGCGCACGACTGGATCGGTTTGAATGGTAGACGTCAGGCCGAGGTGTTGTGATACCGTCCCCCACTAGGTTCCAAATACATTATGGCAGACAGGGGGACAATATTTAAATG")) +(assert (= z "guuucccaguaaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 new file mode 100644 index 000000000..b0bf67085 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGGCAGACTACTATACTCCCTAGTCGCACTAGATAAAGCCAGCCGGGCAGCGTGCGTGTTAACGATAGGGCCAATCTGGAGGGTCATACCACTATCCGACTCTGTGGTATTTAAATCCTGCGGGTGCGCCCCGTGGAAGCAATGCATTCAGATAGCAGTGACCGGGCATGCCGCCCCGTAACCGTCACTGTCGACTCGG")) +(assert (= z "ucucgcuaaugggaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 new file mode 100644 index 000000000..bf698f2f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTCGCGCTAAAACAATAGAGAACAACGGCGTTGAGTAGCGACTCCAAGGCTCGTGTTGACGATTCAGTCCCTGATCAGGTTTGATCTTCCGTGTTTTATGTGCAATGACAGAAATTATAGCTTAATTGAACTAACCGTACAACAGTTGCACCCAATTATATGCCGGAATCCGTGACTCAAAGGATATCGTAACCGTCCG")) +(assert (= z "cauuaugcugucccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 new file mode 100644 index 000000000..0ef8e8987 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGGGGGTCGGATTCACACTGACGGAAGGCGGACCTACCGGACTCCTGGTTTCATCAACTTCTGAAGTCACGGAGGTCTAAGCCGACGTGCTTCGGGATAGACGCAGAAGGATAAGACCCTATTAGACATAGTCGCGACGCAAAAGGCCGCGAATATTGTTTGTGACAGTACTCATCGGCTCTACAAGTGAGCTCCTGAC")) +(assert (= z "ugugaccaauucgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 new file mode 100644 index 000000000..f8ad42aef --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTGACTGTAGATGTATACAGAGGCTAATTGCTTCCACTAGAGTGCACCTCGTAACCCGTGCCGATCTTTCTAAACGCCCATGACAAGAAGCGATTACGAGCAAGAGGACTTCTGCTCTCCTGAGAACTCCCGGCGACATTCGTGCATACACCTAGGTGCCATTTGCAACAGCGCCGTATATCTAAGGTGACCTGAGCG")) +(assert (= z "gugcuaauuuauaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 new file mode 100644 index 000000000..60c1dd869 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGCTGCTCCCACCTAGCGGCATCTCACATCACCGCCCTAGGCTCGTTTATATCTGCGTACTCATCTTGCACTCGACACACGCCTAATGTAAGGCCATTTACGCTCTCTCTCACGATATGACCCCATCCCGATTTGTTATGAATGCGAGCAAGAGTTCCGCATTTTCCGACCGTAACCAGAAACCCGCTAAGGCGACATC")) +(assert (= z "aucugcaaucgcgua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 new file mode 100644 index 000000000..68668e19b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCACCTTCCAATAGCGAATATGCGCCATCCTATAAATGTCGTCCGGCTTCTTCACGATACTCTGGTCGTTTTCTAATCTACTCGGCCTATTGCCAACGCATTCCGTCGCGCAACAGAGAACCTCGAGATGCTCAGATATCATGCAATTCGGTGCGTGGCGAGTTTACATTAGTTCTCCAGCTTTGTGGCAGGTTCAAG")) +(assert (= z "aacauguccgcuuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 new file mode 100644 index 000000000..a942fdee8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGGTTAGCCTCCCAGGCCACACTCTACCATTAAGGTCTTCAGCTGACGCGTAGGTAGGGGCTTTGCTCGTCAAACTGTGGATCCCGTACGCCCGGCCTAACGACACTGCTGTTTGTATCGCTGCCTAATCTAATCCGTCAACTACCGCGTAAAGCAAGAGGAAAACTAAGAGCCAGTTTATCAGGCAGTACCCCCGCAC")) +(assert (= z "caccggcauugguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 new file mode 100644 index 000000000..38e2b7148 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGTCGCGTGGTGTCAGACCAGCTTTACTTAACCAGCTCCGTGTCACTCAAACGAAATAACATTTTTGTGGGAACGGTATCTCACTCATACTGGGGCACCGTATGGCTTTATAACGGTACACTCACCGCTTCTTCGTACGGGCTCCCGCCGAATCAGTGGTGCACCATGCATAAAAACTGGGTCCCACAAGTGATCCAGT")) +(assert (= z "gucacgguacaucuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 new file mode 100644 index 000000000..52e8bbc6a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCACCCTTCTTTGGCCAGAAAGGAGGGGATAACGTCATTACTCCAATAGTGGGAGGGATTGGATGAATTACGCGTCGGTACTTCGTACTCCTGCAAAACTTATCATACGTTACACAGTACATGTCTGCTAATATTTGGCATGCAGTATACTGATCCATGTAAGCTATACAGATGAGCGCACTGGTCCAGTCCATTCCCGA")) +(assert (= z "acaucuguuuugcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 new file mode 100644 index 000000000..53df10a42 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCCGCGCGCTCAAGCTCCAACCGACTGAACCTTGGTCACGGTGCCACAGATTGCGGCATGGGTTCATCTCCTCAATACAAGCCCTTACTTGCTGTCAAGGGAATTAATGACTAGGCCCTGTCCCGAAAGTCGAGTTATCAGTTTAAGACCTGATGTGCTATACTGCGCATTGGAAGGAGCCTATCTATTGTCTATAC")) +(assert (= z "accccaacuuggagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 new file mode 100644 index 000000000..1d02ea2e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTGTATATCACCTGGAACGAAGCTGGTATTTCGTCTTCACCGTGACATGTCGGGAATATGGCTAGATGAAGGCAGTCTTACGTCGAAATGTCCAATTTCTAGCTTTGCTCAATGGCGCACGGGTGTCATGTTAGAGTCAACAAGTTGTCGACTCACTAATTAACCTATACCTCGCCTGTTTCACATGCTGAGCAATGGG")) +(assert (= z "aagagugcucacggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 new file mode 100644 index 000000000..6ef593967 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGACGTCTCACGGGCTAAATTTCGCCTGAGTGAACATCTGTGATCCGAGCTGCCGAGAGAGTAAAAGTATGTCGTATCACTGATCACCATAGGCGTGCATACTTCCCGCCGTGCCCTTGTTATCAAATCGCGCTCACTCCGTAAGCAATCGAAGACTGTCATTGCGGCCGGATTGCTATAATTATACCAGGACACTAACG")) +(assert (= z "aguuauucccgcguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 new file mode 100644 index 000000000..8b1473744 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTGCACGGTAGTCGCTGACTCTGGTTGTGGGCCGCGCTAGAGTAGACCTGTTTCGCTAGCTAGGTAGGGACTGTGTTCCCTTTGTCCTCATCTCACAGATCGGCTAATTCATTAAGCTACCGCCGTAATCTTTGTGGTCGCGGTTTCTGCTGAGCCACGTACTGCCGACGACGTATCGATGTCGATTTGGGTCCTTGT")) +(assert (= z "caaccaagugaucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 new file mode 100644 index 000000000..7765ebf2a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTAACCGAGGGTGGTACGTGAGCTTTGCATTCGGTGGGTTTAGGATCCAGGTGCCAGAATTAGAGCCATGTAACGCGGCATCGGGACCTGCTCAGCCGCTAAGCCAGTTACTTGGGCCTCCATGAATGAAGCATGTCATTGGACGTAAACCGAACACTCGCGGTCGATCTACAACCTACAACTTACTCGAGATTCAGTT")) +(assert (= z "gauccgaaagggugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 new file mode 100644 index 000000000..b6b2043aa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTCCCAGTGAGGAGGTGGATTGGTCCGCCGATCATAAGGCGTAGTCCGCGCATTCCCAGCGCTAGAATTTACTGCTACTAGAGTTTCACGGTGCGCGTGATCCATGACAGTACCAACAATTGAGATTGCGTGTAGTGTCATCCTCAATGATCAAGGCGATGTAATATATTCACGTCCGTTGCCGTAGTCCAACCGATCA")) +(assert (= z "cguauccgccguuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 new file mode 100644 index 000000000..7394f03f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTACATTGGCCGTGATTCCAAAGAATAGGGGGCCCATGGCCATCAAGCTCGGGGGCGGGTCGAGTCGTAGCGAACCGCGAACCGACGCGATAATGGCGGATCGGCAGGATAGATACCGTCTTTACTCAGACCGAGCGAGCCCTGCGCACAAAATAGGTACGTACCGCTCGTGACGATTCGATAGCACGTTATCGCAGAAC")) +(assert (= z "uuaaucaagcggaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 new file mode 100644 index 000000000..cc65de2a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAGTGTGCAATTTGCATGCGTGCGTAAGTTCAGTTACAAACTAAGGCTAGCAATAGCCTTCAGTCCAGCCGTTTAAGGGTTGGATCGATTGACCGCACAGGGTTGTATGCTCTCGTACGGAGCCAAACAAACCCAAAAAAGATTCTAAGCCATCTGCGCTAGTCAAATTTGTAGCTCTAGTTAGTCCACCAATCTAAAC")) +(assert (= z "cuagacgucguguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 new file mode 100644 index 000000000..d89155df8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAGTCGCACCAGATAGCTACTGGGCAGGCTTCATATCAAGAGCGTCAGCCCGAGATAACCCGTTACTTCAACCTAGAACGAGGTGCTATCAAACTGGCTTCGACAGACTCCGGATTGCGTTCTCCTTAGCTTGAACTATGAATTTGGCTGGAACCCCATTGGCAGCTCCATGAGGCCTAGCAACCAATCCATGAGGCGT")) +(assert (= z "cuuugcaugcgaucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 new file mode 100644 index 000000000..4f33ec95d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCGAGTGAGTCTGCCCTCAGTAGTCCAGGCTTATGCTCGGGAACCTGAAGATACTGACGGAAAAGTTCACCGACTTCTAGAACAGTACCAATACTCGCTACCCCCGATATGGCTATGGCTATAGAGTTCAGAGGCCTCTCAGCTTTAGTTCCAACATTGACCCCAGTTGTCACTGCTTAACAGGGGTGTGCTCCATTAC")) +(assert (= z "ggauugcggugcaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 new file mode 100644 index 000000000..e4284b2e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGAGACTATTAACTCTCAATTGTACTTAATCACTTATCTTGTGTTTGTATTACGTCCGTCGTAGTTGATCCGTATCATTTACATCCGCACCAGCACAGCGTTGTCCACCAATGATATAGGAGGCGATATTCCTATATGACTGTGCCGTGCGGCCCTTTCGTTCGAAACCACCTCCGAGAGCTGTCGGACGTGAAATGTCT")) +(assert (= z "cguacggacuauuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 new file mode 100644 index 000000000..38bef56b5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCAGAGCCCTTGATTTCTTTTGTTTAGCCGGAATTACCCATCCGCGACTTACGCGGAACCGTAAGACGGTCCAAATCCCCCTGGTGTGTCCATTCACTAATTCATTTAGCATAGTGGTAGGCAGTATGTTTGGATGAAAGGCTTTGAGATCTCCTGCACGTATGTATCAATTGACAGGAGGCTAGAAGTTTTATAGACC")) +(assert (= z "aaguccuaucgcccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 new file mode 100644 index 000000000..f2be1b2ad --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGGCTTCATGTGCCGATTATCATTCGGTGGACTCTCCATGGTAATTTGACTAGGACCGCTGTTCGTAGTAAAAATCAAGCACACGGTGCCCTGCGTCGCCCGTTCAGTATTCCACGATACGTCCGAGCGCGCTACAATTCCAACGAGTGGTTGTTCTGACAATCTCGCTAAGCGCAGTATAGCTCCGGCTGTATCCATG")) +(assert (= z "ccuauugcaacaaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 new file mode 100644 index 000000000..ec0e0da74 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCGCTTTATATATGCGTTATATGAGGGGGCGAACCATAGCAAACAGATGTGCCCCAAACGCAGCTGAACAGAAATCCGGGCATAGTACGAGACTGGGGCGCGGCCCGGGCGTAGGAACAATAAGACCGGCCCATTCCTTGAGTGTCCTCTAACGAAATACAGCGATAACACCACTGCGTCGTGACTATCTGTACTCTCC")) +(assert (= z "ugaugcugcgccgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 new file mode 100644 index 000000000..e3eb6105c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCTCCCCCATGCTTAACCAAAAGTTCAGTATCCTTAGCGTTTTGCTACCTAGGGCAGCCTTGCTTTTCGAAAGTGATTGTCGAGGTCTCTCTTCGAAGAAGGCTCTGTACGGCTAGCTGGCAACGAGGACGTTTCGATGCATTAGCAAGGACCTTACTGATGTGCCCTGGCGGAAGGCCTTCTAACGACGAGGATTCAT")) +(assert (= z "ucgcauggccaaaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 new file mode 100644 index 000000000..aab3bd658 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACTACACGAATTCCTGTTGATATAGGTGTTTTGTCCTTAGGCAAATAAATACCCTGCCGAACGGCAAGTGGTCGGACGTCAGCTCAACTGTCTGAAAAACCTACTCGTGCTTTCTCTATCTACGGGCTAGTCTAAGAGTGTGCCCGTACCCGGCCACTTACAGTAGTCTCTCTTATGCGGATCCAGTAGTACATCTGAA")) +(assert (= z "aauaagauaggcccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 new file mode 100644 index 000000000..98c27369f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGCTCCTGATCATTATCTCGATAAGACGAGAGTAGTCCTAGCGGGCGGCTGTCTGAAGATATCTACGTACCAGATGAGAGTTGCCCATTACCTAATCTTCATGGCTCGGAGACCCTAGCCGGTGGCCCGACTTGTATCGGATCTAGGTACATTGATATAGTTGATTCAAATAATCCGTCATGCTACGTAATATGCAGCA")) +(assert (= z "cugcgguaauauuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 new file mode 100644 index 000000000..4882b3871 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCGCCCCGGTTTCAAGAACTTAACTTGAGGATACAATCCGCGCCGAGTCTCTTGCTTTATTCCTCGCGCACCGATGGCTACAACAGAGTAATTCTTATCTTCTTTAGGTTTGTGACGGCTATAACCACGTCTCTCCCCTAGGAATGTTCACTTGGTGTCTGATGCGAGCGTGAGTACGATAAGCGGTTCTATGGAGGGT")) +(assert (= z "uugaccucuguaggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 new file mode 100644 index 000000000..48074a9f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGCGAGGATTCAGAGGATTGAGAGGTCCGATACGTACCATGTCGCTCAATTCGGCTAATGTTCCATATACATCGTCAAGGTTGGGTGATCATATCGGTTGATCTGCCCAGAGCGGTCCAGCGTGCGAACGCGCCAAGTAGAGGTAGAGAGCGCTACTTCTTGACATCCGAGAACGCATACACCGTAGATCTGCGCTCAC")) +(assert (= z "aucauacugacucau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 new file mode 100644 index 000000000..c1e91aeb7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGAGGGCAGTCTGTCATCGGATCTGCGTATAGGCGGAGGAATGGTCGCATGTTAACGCTAGGCACATCGAACGCAATGAGACTATCAAGCCAAAAGTCTAGGACCCATTCGCAGGGGGCGATTTGAAACACAAAGCGAAGAAGCGTTTAAATCGGTCCTTGCCTTGGATAGTCGATAATTCCGCTTGGTGGCAGCGCTA")) +(assert (= z "guaagagaauacuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 new file mode 100644 index 000000000..2504ac646 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAAGACAAGACACCGACTTAAGTTAGGGAACTTATTTATCTTGCGCCCGATCTATTGGGATTGTTCCGTGCAGAAGATTCCTCGGAGGTCGACCTATTATCTTGCGATTCAAAAAGGTACTTCGTAGAGCACGAGCAGATCTTCACATCGGTTCAACTCGAGGGAGTAGCCAAGTGCGAAGGTAATGACTTGACCACGTA")) +(assert (= z "cucuugccuggcucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 new file mode 100644 index 000000000..a8e907a16 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTAGAGGCGCTAGACACCAATTCATACTAGAGATACGTTTGCTTTCAAACCGAATGGCGGTATTTTGTTCACTCCATATGACAGCACTGAGATTAATCACTAAGATACGAGGGTAGTAGTTTGCTGAGGCGTGATGAACGGACCACTTTGCATGGTACAAAGTACGGCCCAGTAACGTCCGAATCCTCGATCGTTCGC")) +(assert (= z "ucaaacguuuagcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 new file mode 100644 index 000000000..982c42593 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGTAAGCATGGTTATTAGACGCTCGGATACTGCGGTGACGCTGGCATTGGTGGTGAGCTGCAGTCGGGGCCAAGATTTAGGTACGGCTCTAAGTCCAGTAAGAAAATCGTAACGGTAGCAAATCGATGGACAGCACGCGGGACACGATCATCCTAAGAGTGCGTATCTTCCTGTTCTGTCTTCTTAGCTGGGGTGCCCC")) +(assert (= z "ggacccauuucagag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 new file mode 100644 index 000000000..df4374f63 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGAAGGCGTCCAACCGTCGTCGAGTCTACGATAATCAGTGACTCGATTATCAGCCATGAATAAGGGCCAGCCCAGTCCCCTAATCGTTGTCCCTTGATACGGCACCCCGCGGAATAGGAGTGTAAATGTACACAGCGGCTACCAAGGAAGTCTTTTTGTTTACGCCACTAACATCAGGCAAGGGTAGAACCCCTGGAGC")) +(assert (= z "gugggcuaggaacac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 new file mode 100644 index 000000000..e6f06cb70 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCACGATTTCAATAGGCCTGCTTGTTAAATGGTGCATTTATCGTCACAGCCTAGCAATCACATAGTATGATGTGCGGGACACGATTGCAATCGGGACGGCCTAGTTACATAACCGTCGGCGAGACCCAGACTACTTCTTGTCGTCATCTTCCTTAAGCAGTCTATGGCAGATTTGCGCCCCTCCGGTTAACGCGGTC")) +(assert (= z "gaccuugcaaauagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 new file mode 100644 index 000000000..acdeb50dc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATTTCGACATGGCCGACTCAAGCCGAAACACGCGCACGTTGACATTGTTTTCTTTCGCTAGTCAGCGGTCTCGGACTACAACGGACAACTTACTTCTCCATATAACATTCGCTCGATCGGAACTACACAGCGACTCGTAGAAAGAAATAAGTCCCACCTCCCGCGTGCTTGGTAGAGAACGATCAAGGCGTTTAAAATG")) +(assert (= z "agcuaagugaugauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 new file mode 100644 index 000000000..1ee631a9b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGAAGCGTTGTTACCGACCTCATTTTCGTCTACGAAGGAACAGCCTAGATCCGAATACATTTACACTTCCGCCTTAAGATGTTCTTCGGTCGACCGGTACTCACAACAAAGGATCTCCAGTTACGGAAATGCGTGATCCTTACGTCGCAGACCCATAGTATGTCTAACGTCCTATTGCTATGAGTACTCCTTGGCTGGA")) +(assert (= z "ggacccacagcuccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 new file mode 100644 index 000000000..6ce1e526a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAGATTCACGAATCCTGCCATAGAAGAAATTGCCTAATAATCGTAGCGGTGAAGTTACAGTGGGGAACACCGGTGACTGGTAGTTGATCCAGCTACTGACTATAACGAAGTTAGCCCGGGGCCCAAAAGCACTTAAAGGGTCTCTTTCGAATACGCCTGCCCCTCATATCAAACTCTCCGATCTCGACAGTTTTTGCTC")) +(assert (= z "aggacacgucuaguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 new file mode 100644 index 000000000..a70b93dfd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCACTCACCATAAGTCGTGCCAGACGCTGTGCTGACAGTTGAGGTTCGGTAAATAACAGGCGACCCTATAGCGTATATTCGCGCAATCGTTATGGGCAACAGCCCTATGGCCACTGGGTTTCTTCGGACAATATATCGTGGGTACGGATTTTAACAACTGATGACCACCAGCGGGGTCTACTTTCATTAGAGCGGGTCTT")) +(assert (= z "uucgauagcugggcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 new file mode 100644 index 000000000..f96bd41fd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGTAAGCTCCTTCAATCGCATATCGGACCCGCGCCTAAGTATGTCCCTGCGGAATCTCAGGGTCGGTGTGCTCCGCGAGTTGCGGTTTACCGATCGGTCTTAGGCACCTTCGTCTTCTCTCCTCCGCGCCCCGAGACTTTATTCAAGCGCTGGCCTTTCCTGACCGGCTAGATATCTATTTGCCTGCGCCAAGAGAGG")) +(assert (= z "uucuaacgcuaggua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 new file mode 100644 index 000000000..91a25650e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCATTACCGGCACTAAGCTTCACACTAGTAGAGTGAACTCCTGGCTGCTGTCAGGGCCGCATTAAAGCTTCTGGCTTCGCCTTGTCATTAGGGAACTCGCCCGCGCTGACGGCCTTTATGTGGGATTTTGTGGCAATGACTACACGGAACACTGGTGTACTCTATATACCACGATCGGGCCGGACGAGTCTCCAAAGGC")) +(assert (= z "uguauaugauaggug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 new file mode 100644 index 000000000..1cab1a3e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTTGCATTCTTTATCCCGTTTCAGGAATAACAGTGTTCTTACCAGTATTATGTATTGGAACATTAGGTGCGACAATCCGTCCATCAGGTTTCACAAAGTGGACTGCCAATTTAACGGTTGTCGTGTGTGAGTAAGATACCAAACCGGAATCACCAACAGACTACCGTCTCTCACCCGTACTCAGCCTTCTCGTGACTGG")) +(assert (= z "auacuacaacaugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 new file mode 100644 index 000000000..7646c52f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATAGGGGGCTATAATCGCCCAAAATCTTACCAGGGCCAAGAGAACTGCTTCACCGAAGGCGGTAGGCCAATGGGCGCAGGATTCGCATCCACGTACGGACGTCAATTGGCTGAAAGGGCCAACTACCGCTCATTGAGCGTTATCATTTTCCCTAACCATTACGAATTGTGGGGGATATGATGATCGAGCGGTCCATG")) +(assert (= z "acggaacuucucgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 new file mode 100644 index 000000000..d81fdabba --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAGTCAGTGCTTTGGAATTATGTACAGCGTTTCTTTAGACTGAACTGGACCCTTAGGTCTATGGTGTGGCTGAGTCTGACCGCATTGTCGCTCCCCCTGAGTGGAACTTGTTTACAATCATGCTTCACCGTAGGTGAGAGAGACGTATGGAGGGTACCAGAGAAGGTTGGGAGGCACCGGTCCGCGGGATGACGTAGG")) +(assert (= z "caaguaucgguucug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 new file mode 100644 index 000000000..8490cad5a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGTTGAAGGTCTTAACCTGATGTGTGGCTAAGCAAGGGCTTGTACAGGATCGCGGAAAAGCGGAACAAGCGCTCAGCGTGACACGCGCTATTTGCGCTCTTGTAAGGAATTTGGCGCAAACGTTCCGTTTACATAATATGCCAGGCCACTCTCCGCTAAGCGTAACCCTACGTGTAATAAAGCAATGTCTCTTTGCGAC")) +(assert (= z "ggguucguuaacaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 new file mode 100644 index 000000000..9ddbc92a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCTAAAACCGTGATGAGCCACGTTCCAACTCCAAGTGATAATTGCAATATGACTGGGGACAGAAGCCAAAAGATGCGCTTGGGCACTCCCAATAACCTGCAACGTCTTGGAATCGGAGCCCCGGTCATACATTCAAGTGTTTAATGCTACGCCGCACGGATGGATACTGGGGAGTGAAGCTACAGTGAACTCATAAGT")) +(assert (= z "guuaaugccccccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 new file mode 100644 index 000000000..d9e4a9fd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCGGCTAGTGTGTTATTATTTTACTGTCGCAGTAGACGGCACTGGTGTGGGTCAGACGTGTAAAGGTGGGCCGCCGGCAGGCTTGTTATGGGTGCCAATTTCCTCTGCCGACTCTATCTTAAATCCCATTTACAGGTGCCACATGTATAAAATAGGAATCAATCGCAGTGCGTTAGGGAAGGTACGCGTGCTAAAATCC")) +(assert (= z "uccgaugagauagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 new file mode 100644 index 000000000..06f674253 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACGGTATGCGGGTCTGCTTTGGTGTTTTTCTGTGTCTGGATCTCTTGCACGACTAAGGTGTAGTTTCCCTAGCTTAAAGCGGTTACGCAAAAGCTCTTGCCGACTCCCGCTCTGACCAGCATCAATTCATATAGCTGCTTAATGGCGCTGATAAGACACGTACAGCAATAAGCCTAGCAACAGACGCGACAAAGTCTAT")) +(assert (= z "gacucuuggagucuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 new file mode 100644 index 000000000..21e644d90 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTCCTAGGTGGGTGCAATCACATTGAGGTCTGTAAAGCAAAATGCTTTTTATCGGGAATGATTTCTAATTTTTACTAGAGAAATGCCCATCCGTGGGCACCGACAATGACTGTAAGGGATGCGCATCTAAGAGACGGACAAATGTATGTTGGCTAAAACTTCCGACCTTTGCTCGTCGAATTTTGAGCATTACGGTAT")) +(assert (= z "accggccaauagaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 new file mode 100644 index 000000000..6755ac6f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGCTTGCCCCGAAGCGTGTTATCGAGGATGCGAGTCACAGTACTAACCCTCACGAGTTTGTCCCTAGATAATGGGAAGTCACTGCCACAAACCACCGATGAACCCCAGCTCTCTCACATTCCACGCCATGTTTGGGCGCACATATTCACGTCCTGAACACAAAAAATTCAATTCGCAAGCGATAGAGTTCGTCAGTCTG")) +(assert (= z "gcucaguuguugugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 new file mode 100644 index 000000000..3a6df5418 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAATACCAATTGTAGATGCGGTTGTGCTAGCCTAGGAACTTAAATACACAAGATCACATCGTCGAGAAAAACGAACCGGTGATAGTTAGGTCGACCCGGGTCAGTGAAGTCTAAGCGGCTCGGCCACATGCGGCCCCAGGAGTAATAGTTGCGGAGCACTGGTTTGGGACCCTTGGGACATAACTGTGCTTTCAATTAA")) +(assert (= z "gcuccagaauuagag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 new file mode 100644 index 000000000..006014b36 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAAATAAAAGGCATAATCTACTTGTCTGCTATGGATATTGCCCATAATTTGCATTGAGTGCATTGGCCTTAAGAACCCCCCTGTCCCACGCGTTGCGTGTATTCAAGGGTTCCTTACAGCAGTGACTTCCGAAAATGGCACGTTACCGGCCGCAGTTGGTATTAAGCACATTTGGCCCTGCTTGCCTACGACATGGAGG")) +(assert (= z "cauugcugggucgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 new file mode 100644 index 000000000..6fc738a4c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGTCCCGGGCACGCTATATCACTGAGTGATAAGACCCAGGCCCAATAACCAAAGATGGGGCGTCACCTCTGTCGCAATACGTCGGTGAGTGTCCCCCTTGCAATAGTTATTGCTGTAGTTATCACTGAGCAGTCGGAAAGCCGAGCTCGTCCGAGGATGCCAGTGGGCAGCGCTCGTAGAGATCCCATAACGCCAAGG")) +(assert (= z "guauccguacugcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 new file mode 100644 index 000000000..aafe81f52 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCTAGATGGTGATTCTGCTGACGATGGTACTGCTCCGCTTCGGATTCATAAAGCTACCAACGGCTCGGTTGGATTTGTGCGGCCTGTAAAGGAGTTAAACGTATGTTGCTTCGGGCTCCATCCATTGGATGCAAGTAGGCGGTTCTTGGGCAAGGAGTCGCGGACCATTATCGGACAGAGTGGAAGAAGATATGTCCC")) +(assert (= z "ucucgcgccugucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 new file mode 100644 index 000000000..13a915143 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAACTATGGACGGGAATCAGTATTCGATCTGTCCACAACGAACTCTTGTATGGTTCACGGGTAGTAATCCGCGGCGTTGGGTTGGGGCGTTCACGAGCCCCTGCGCGATTCGACGTAAATACATTACTTGAGAGCAGCACCATGGCGCGTTCGCCGAAATAGGAGGCGGGCCATGACAGTATGAGCAGCGCCTACCAAC")) +(assert (= z "cucguggaccacgcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 new file mode 100644 index 000000000..3ce5a2461 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTATAGCCCAAAGTCCATGGCGTAGATATACTTTACTTCAAAGTTCCCTCAACCCAGTTAGCGATACTACCGTGTGATGTACGTATACGCATGTACAAATTGACTGCCGTTCCTTTCGCGACCGGTGGATGCACGGCAGTGTAATGATTAGCAAGGCCCTTCGAGAGCCATCTGCAGGACGTGGGCATAGTAGCGCTC")) +(assert (= z "uaacccugguuccaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 new file mode 100644 index 000000000..50e5fb642 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTATGAGCTAGCCTTCCTCGGCAAGTATACTCGCCCTCTAAAACCCAGATATGAGCTCGGATACACTCGATAGACGGATATTGTGTAGAGACCAGTCCTTACTTATCTCATAACGCTGCCCGCATCCTCTGCCAGAAGAGCTTTTACGACCTCAAAGCTCTGTCTCTGCTTATTAGCTCAATCGGTCGTACGGAGATAA")) +(assert (= z "ucuaucguugagaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 new file mode 100644 index 000000000..095c3dd60 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTCTCTGCTCGAATCTATCCAACACCGTGCGAGCGTTTCGAAGCGATAGGTCTACGGCAGTGCAACTTAGTGTTTGAGAATAGCGGCCTTTAAGAGGAGACCCCATGATACCCGTAAGTCCACGACTTACGGGTTGACGGTTACTGATTTCAACATTGTGGCGGCGATCGTCGGGGGGCGGCCATTGGCATCTTAAACG")) +(assert (= z "acucgugguccaugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 new file mode 100644 index 000000000..23e92e93d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGGCGATTAAGAGAACTCAAGGATAGGGCATTCGTATATGGCTCGCTAAGGCTTTGCGTCTCCGACCTGGTTTGTTAAGAAGCAGTTATACGAATGATCTAATATAGCTATACTTATCACACAGGTGCACCTGCGGGTAATTTTCTTGTCGCGGCCACACACGAGGGTGGCAAGATTGTATATGTTCTCTCAAAATCCG")) +(assert (= z "cuacugaugaccagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 new file mode 100644 index 000000000..595e4882e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTATTCTAAGTTCGGCGCCATATGTAGGCACTGAGGACCAGCGTCTAGTTGCGAATGCACGCTGTTATTAGAAGTACTGTAGGACGCGGCTCACAGGGTCGGATTCTTTCAGAGCCGGGTCCACTACGCCTCTGAGGCAACGTTACCGGAACAATTTGCAGGCTATTGCGTCATTGGCCATCATATCATATAGCACAGA")) +(assert (= z "acagggggaacuccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 new file mode 100644 index 000000000..54bdfe310 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTTACGCTAAAGCAAATAAATAGGGTCATGGGGGTTCACGGGTGGAACCGGACAGATGAGTAGGTGTTAAGCTAGCAGCTCAGGGAGAGATCGAGGTGTACTTCTCTTGATTCCTATTCGGCAATCCGGACTACCCACCACTAATCCATTCGTACCCGCGTAACAACGTCAGCGCCACTCGAACCCAGGTACATTCACA")) +(assert (= z "ccaacuaacuguccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 new file mode 100644 index 000000000..eac4284ff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGAGTCTGTGTGCGTCTCGAGTCGTACTTGCGTGGACCGTTTGCAAGGAAAAGGGAATGTGTAGCGCGGCTAACAACTATGAGTAGTGTTCAGACTGCTCACTTGCGCAGCCCGGGCCCCTGGGGTCTGCATGCGGCGGGATAGTCAATGCATAAGGTATTCCGGTATCCGGGTGTGTCCTAAACCTAGTTTCATCCGG")) +(assert (= z "cgcgucacuuuggcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 new file mode 100644 index 000000000..77bf1f91a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGCGCCCGCGCTTCAACTCGTCGGTTACTAGCCACAGGGTAAGACTCTGCAAACTTTGGCAGCAGCCCCTCCGCCCATCACCGCGAAACACCATCAAAATCATAACGATGATGAAATCTATCGTACCGAGCTAATCTTAGCGTGGCAGAGGCCCCCGATAGCACTAATTGCATTTATTGCTCCATGACACGCTACTTAC")) +(assert (= z "augguccgcguugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 new file mode 100644 index 000000000..317403327 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCTTGATTACCGAGTTGTCTATTCCGTCGTCGTTAGACGCCAGGTTGAACATATTGACGTAGATCGTACACTCTCTATTGCGCGGCGTCTCCAGAGATATCCACGGCAAAAACGACCAGCGACGAGATCAACAAACATTCTTCTTAGTGCAAGCATGGTGGCTGCGAGGGGGTGAGTAGTAAAATCCCCGTTGTTATG")) +(assert (= z "gacaaccgggaugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 new file mode 100644 index 000000000..90391022c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGGAGCGCCATTCTTTCCAGTAGGACCGATGCGGCGACGTCACACCCCGAACGATTAGGACTTAAGATTGCGCGTCCATCTGCATTTTAAGTAAAATCCCTCCTGATGGCCCTTCGTCTCACTCGAAGAAACCACGCTTAACACCGAGCAAAGGCGGGGAGCCCAAATGGGTTGCCGGGATCGTACTGCCCAACCAGA")) +(assert (= z "accauacccgacaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 new file mode 100644 index 000000000..6796135b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCAAAGAGGAGTTCTCTCTGAGTAACGACACCTAAGCTGACACCTGACCCCGCACAATTGACAAGTATTGAATTAGTATTAAGGAAAGACTGCCCTGCTCCGATACAGGGGGCACCTAGGACGCAGGTTCGTTGTTAGGCTTTCCGCGAAAGAGCTGCAGTAAAACCCCAACCTATCTCTAACTTCAGTTTCCGCTATT")) +(assert (= z "ucccgcggggggaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 new file mode 100644 index 000000000..05a6b8496 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTCGGGCCCTATAAGATTGTAGAGCGGCCCTGGAACTATAGTCCGCAAATTCAGCGAGCCTTAGGTAGAACCGCGCACGGCTCTAGTGACAGGTGGCAGCCTGCGTTTCTCCCATTATTGATAACCCCTCACATGTTAATCGTTCAATAATCAATGGGATAGATGCATCCGGTTGCTAATGGGGCTCCACGACCTATGC")) +(assert (= z "auaacguucuaaucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 new file mode 100644 index 000000000..8d728da5c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGAGCGTCGTCACGGCGTAATTGAGTTGGCTGTTACTTAGCACTATCCAGATAAATTCCCCCAACCGCCTTGGGTGGCGATATCGAGACGCGATTAAGCACGGTATTTACAGTAGTCAACTGTTACCACCGCTTCATCGACCCTACTGGGCTTTGCTCCCGTTTGGAATGCTATTACGCGTATCAAGCTTTTTTGCATC")) +(assert (= z "cguauguagcacguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 new file mode 100644 index 000000000..4915cd479 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAATGGTATAGGAAGCTTTCTTACAGCTATGGGGTTATAATCCGCGTGGTATCTGATCCGGCTCTGCCCACTGCTCTTATTGGATTGTTGCCTATTTAGTTACGACATGTACGTCACAGGTCTACGGGCCCTAGTAGCGGACAGCGCGTTCTAGCAGACTTAACGACATAGGCCCAAGGCCCGTAACCTCTGCGCCCTGG")) +(assert (= z "agggcucaguuucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 new file mode 100644 index 000000000..d10765792 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACCGGCTCGGGTGGCGTACACGGGAAAAAGTCCTCTGTAACGATAATGGGAAGGTACACCATGGCTCGGAGCCGCTCTAGCTACGGGACCACGGGCTCTTTTCCGAAACTGTGAACCTTGGATTTCTCAATGAGAAGAGAAGCGCATGAGTTCGCCCTCGTATGAACGTTATTCGCGCCAGGTCCTTGCAGGCATAAAG")) +(assert (= z "augccaugggacugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 new file mode 100644 index 000000000..ff7235b96 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGCTACTCTTCTCGCAGCTGAACTGGAGTCATCTTCCGCCTTGGAAAGTCCCCGATTCAACGCGAAAATAAACTTCTTTTGTGAGGAGCGATCTGCCCAATAATAACGTGCATAGCCTCTTAGGGTAATAATATATGTGTCATCGGACCTATGCCGGGGTTCCTGACCTCCCCATACATACGGTAATAGATATTATCA")) +(assert (= z "ucacucaugacgucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 new file mode 100644 index 000000000..4a1241ccd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCTGGTCTGTCTTCTAGGAACCGGCTTTACGGAATGATAGTATTGGAGCGGTTACGGTTCTGAGATTGCTGCGTGCGAGAAACAAGTCATTTATAGCTAGTCCGACTGTGTAGTTTCCTGGGGATTAGCCTGTAGCTTTGGCGCTTTCATCGTCCTATCGGAGACGTACGGGTTCATCAATTGCAAAAAGTATATCAGC")) +(assert (= z "auagcaaacauguac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 new file mode 100644 index 000000000..090d382d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGCCAGTGAAGACGACCTAAAACGTATGCTCACAGCTTGAATACTAAGCCGTTGAGTTTTCGTCATACTAGGCCTCTGTTGTCTGTGTTGGGACATCCGCCGGTTAAGATTTGCGTTAGGTGTAACCCGCATACCGGTTAGACCTCATTCCGTATATGGAGCTGCCCTCGCGATATAAGACGGTAGAGTATCTAAAAGT")) +(assert (= z "ugagcgccauuguca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 new file mode 100644 index 000000000..7345eb0a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGCGAAACTTCCGTCAAAATGTACCCTATCAGTTATGTTTACTAAGAACACCCTGAAGGCAAATACCGCGTTCGGGCCTGAAGGGATAAAAGGACGGAACTTGCACTTTCTACGTGTACGTTCCTTGCTCACAAGTGCCGACATAATGAGTTTTAACGCGGCAAGCGCGGCCACATGGCTGAAGGGATCGGCTACATTT")) +(assert (= z "uccccuugucgggag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 new file mode 100644 index 000000000..a8d302c3a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCCAGTTTTCGTGGACAGTTCCCACAACAGATAAGTGTGTCCTGGTACCCGAGATTTAACTGATTGAGAGCTCGAAGTCCATCGGTACGTGAGATTGTATGCTAGTCCTAGCAAAGCGGACCTACATCTTCTCACTGATTCGTACCTGCGTGTAGCCTCTTCTTCGCCATCATTATTTTAAGGAGGGCGTGGGACAGTC")) +(assert (= z "aaaggaccuagucgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 new file mode 100644 index 000000000..549880676 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTTGGGACGCGCGTTCCTGCACATCAGGCGTCTGATACAGATTACTTCCGGAGAGGCTGAATGACTCTAGGCAAATGTCCATCGATAATCGAGAAGGAACCAGCCGGAAGGGCGGTAATGACCAGAATCTCGTCTTTGAGCCCCAATAGCATTAGATGAAGGGTTCGGAGTGTGACTTTTCCTGAACTACCTAGGACGC")) +(assert (= z "gagcgacacaguguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 new file mode 100644 index 000000000..5368bdf14 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATCCGTGTTCGCAGCGGAATTTTAGTGCATACCCGTGCATGTCGGAACAGAATCGATTTGTCGTAGAAGTCGCTTCGGTGCAAGCGCCGTTATGGTTTAGGGTTGGAATGTCTAAAGCATGTCATATTCCACACACACCGTCTCTAATTCGTTCAGCGGACCCTAGGTCATCAATGCCTCGTTGGCTTAGACCGGGC")) +(assert (= z "uggcccauucacacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 new file mode 100644 index 000000000..901244651 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACCAAGGTGAGCGTATATACAAGCTCTTAGTTATGTTCTTTTACGCTGGGACTTAATGCCAAAATAACTCGTGGCACTAAGTATAAGACCGCGATTTCAGCATCCTCACCCCGTGTTGCCCCTGCTTTCAGAAGATGGATGCTCGGCAGGACCTGGCGCGTTTATCCCGTTGCCCTGGCAAGTGATGGGTAACGGTGGG")) +(assert (= z "cguggagcggauccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 new file mode 100644 index 000000000..076c6ff02 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGATGCAGATCTGCTCAATTCCTGGCGACCTTTGCAAACGGTATTCCTTACAGTTCAAAAATAGACCGAAATCATTAGGACAGCCCTGTTGGGGATTGGCTTTCCTAACACACGCGTAATAGGAATCCTTCATACGGCCTCAAGCGAATGCTCGGTTTAGATGCGTGTAGTTACATTTTGCCTGTAACAATCTTAGCCGT")) +(assert (= z "accacaacgagcgau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 new file mode 100644 index 000000000..74a71fd17 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGCTCGAGGTTACGAATGCTCGCGAACGTGTTGGGGCTGCTCCATAGCCCTCTCCCCGTGTCCATTCGCCAGCGGTACTCACTTTGTGAACAATCATGATCACAAGCCTCGCACAGATGTTCGGATCGGGTCGCGCCGCCATGAAAGCCTAGGGAGTCGAAGAGCACCTGAATCCCTCACCCTCATAGCCATACGTTTT")) +(assert (= z "ggaguggacgaguga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 new file mode 100644 index 000000000..5d702df2f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTATGAAGTAAATTGGTGTCGCAAGGCTCAGCTAACATCATGGATTGGACGTCCGGCGTGGTCGGTAATAAGCTTACAATCTATGAGATTGTGGACCACGTCAAGTTAGCTGTGATCCTGCATAAAAAGCTTCCCTTCAGGATATGGCCCTTCAGCCCTAGTTATGCCACAACCCGGGTGTAACCATCGCTGAAATTCG")) +(assert (= z "ucacguagcuuccuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 new file mode 100644 index 000000000..a4baced53 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGCGGTTACTAGTTGATCAAAGCGGTTAAACATCCTCATCACGTGCCCGTGCCTCGAGTAGAACGAAATTCTCTGCCGAGCAGCTGATCTCTTCTCAGTCCATCAATGAGCGACAAGCAAACTCCACCTGCGAAATTTAAGCACGTAGTCATATATTCAAAGCACATGTGACTTGACTATCTTTGGCTGGAATACGCGA")) +(assert (= z "uuggcaugcuuuuga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 new file mode 100644 index 000000000..3efa8c8e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCGAAGTGGCTACAAAACTGTGCACTGCAGACCCAACCAATTTAAGCAGCGACGTCCCGTCGCTATTGGGCCCTATACCACAAACGGACCGCACATTGCTTGAAGTGCCGTCCTGCGAGGTTCTGAACACTGTCAGATTGGGTATGGCCAGGTGAATATAATGGACTAGCTCGAACGTCTGGTGTCCTTAGGGCTCCAC")) +(assert (= z "aucgcgagaggacug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 new file mode 100644 index 000000000..548fb9887 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGATGTCAGTGGGAGTTTCGGCCTTAAACCCTTTTTGGACTACACATTCTTACTGCGTACAGATTGGATTCTAGGGCAATAAATACCGGGAAATATAGTGTTGGAAAGGGAGTTACGCGATCGTTTAATCTTGAACGCGCACTGAAGCTCACTCATGTCGTCTCGCCATAGTGGGTTGTCTGCCTCCGGTTGGACACGT")) +(assert (= z "auggccaucaucuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 new file mode 100644 index 000000000..7dfcd8b00 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTAACGACAATATCCTAAAGTGGGACTGACCAGCTTAGGACCACCTTGTTCGCGGCAAAAATCATATGTGAATCAATGTCGCGACGATCAGTACTAGCGTATTCGTGATTACTACAACGGATTAAATTGACCGTATGCATTTCAGACTTCTCTCTCGCTAGTGGCCTCATCAGCGTAAGATAATCAAAGCATCATTCCCT")) +(assert (= z "gaaauaugccgucug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 new file mode 100644 index 000000000..680c409f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGGATCGACCTGCTGTCGGTACTCTCACGAGTGTACAACGTTTCGCCAGCGTCTCCCCATACTCATCGAGATAATCTCCGAACAGGACACATCGCTTTCAATCCGCAAGAAATTCTCTTAGTGTGGTGGTCACCTACAGGGATGTGCTAAGGGGGGGGGACGAGGTATTCCTTGCTTGGCCTAGTACATAGAGTACTC")) +(assert (= z "cgugucacucguagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 new file mode 100644 index 000000000..5f5660f07 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCAAAAGGATGATGATGGCGAGAGAGAGTTTACGTCTGAGCCGAAGAGCATATGAGGATGGTTTGCGGGTGGGTTGGGAAAGCTCCAGTAGAATGCAATTACCGGCTATCCACGCGCATAGACACCAGTGAACGGACGCTATATTGTGGAGCATCAAGAATTTTTGGTCGCGCCTTAAACAGTTGAACCTCCGAGCGG")) +(assert (= z "gcauugauccucgug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 new file mode 100644 index 000000000..90bc264c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGTCCACGATATTGCAAGACGAGGGATACTTTACGCATAGCTTCTTACACACGGGAGAAACCGGACTAATTACACTTGTAACAGTAAAGTAGTACATTCCGCTTGTAGGCTGGAAAGGGTATACCACCTCCGAGTAGCGTTGGGCTATGCACGGATCGTAGTTGTATTCTTTCATCGTCCCAAGAACAAAGATAGGAGA")) +(assert (= z "auguggauagagacg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 new file mode 100644 index 000000000..2385e5aa8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTATTACTTATACACACGGACCCAGGTATGGCGAGTTAATCTACGTCATTGCTTTTGCCCATACTAACATGAGTGTTAGAAGCCATCTCCCCTTCAAGTTTACACTATCCGCAGTGAATCATTTATCACCAGACGCCAGCCATCGCCGGCAAAACTAAAAAGACATGCGATCGTACCGGGAGGGTTTTCGACCGCGCT")) +(assert (= z "uaaccgcguugucgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 new file mode 100644 index 000000000..005e75382 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGTACTGGGGAATGGTGATTATTTTACATCTCTGAAATTTAGCACGGCTCCAGCGCGATGCGTTGATCAAACGCCCAGATCCGGGGTGCGTGCGTGAGCGGCTTATAACGATCAAGTTAGGTGTTTGGTTCTTATCGATATGCTACGCGACCTTTCCTGATGCCACAAGCTAGACTGGCCGTGGTCCTATAAGTAGGT")) +(assert (= z "agaugcggucuaucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 new file mode 100644 index 000000000..cfe7d7aa9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGGTAGGACAAAACCTCTGTCGAACACTCGAGGTTGGTTCGCCGATCGGTGCCGTCTACAACGTGAGAGGCCTGATCTTAATTTTCGGCTGTGGACTATGTGAGGTCAGAACTCCCTTTAATCTGCGATATAGGCGTCTGTATAGGCCTTTATACATCTACCCAACCAGGTTGCAGCGTGGCAAACCCAAGTAGAGCAA")) +(assert (= z "ccaacagcaaucgug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 new file mode 100644 index 000000000..701d71bec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCAATGCCCATGTCACCCTCGTAGAACCACATGTTTAAGGGGAGTTTCTCCTTATCGGGCGCGAATGACTGGACGTTTAGGTCTAACAGCAGTCTCTGATAAAGCCAAACTGCTAACAGTACCGTTGTACTCCTCAGACATCGACGCAAGATATTTCCACAGGACATGGCTGGCGTATTCTCACCGATACTAGTATATT")) +(assert (= z "acgggcaugguguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 new file mode 100644 index 000000000..954ede5d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACACCTTGGGATCGGGCAGCCGGCTAGATTGACAGCATAAGCATGCTAGGCTCGCCTCGAAGCATATGGGTAAGTAGCCCTTGCACTCCCTGACGCTTAACAATGATTTAACTGCACAGCCTGTCATCCGACGTGAGGATGAACATTGAGTTCGTAAGTCAAGTAGGTGGGCAGTCCTCGGACAGCGGCGGTCGAGGCTA")) +(assert (= z "cgcgugauguuuugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 new file mode 100644 index 000000000..6342302c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAATACTAGTTGAGGACCAGCTTAATCAGAAGCAGGCTGTCGCTGTTCGGGTATAAACTGTCTTCCAGCTCCCAGTAAGATCTATCTCGCTATACAGAAGTCTACAACCAATCATTACGGCGTGTCAAACCTTAGAAGCTCTACAGAGGAGTCATCGTAGGCAAAATGAACTTACAAGGTCCGACCACTGGATAGCGGG")) +(assert (= z "ugacuccaaccaacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 new file mode 100644 index 000000000..b31330e8f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGAGGCTTGATATAGACTTATCAATGGGACAACGTTAATCGTTTTGAGCGACGTTAGACCTGTTTTGTCCGGCTTCATTCTAAATTAACGAAATGCTGAACATACAAGCCTTCCAGCAAGCGATTTAGATTCTAACCCACGAAAGTCCTGTGCGATGACTTGCGCGTGAAGTTGTATGTAGTATTCGTCGTGCACTTCA")) +(assert (= z "cgauuaucauccauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 new file mode 100644 index 000000000..dd86223af --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGCATCGTAGTCAAAACACTGTTACGGTGCTTCGGAAATCCGATGCTCTCCGTCGAACAACATAATGTGGCAGTCAAAGCCCGGTTGAACTAGCCGCCATTGCTCTGTCCACCGGTCCGTGCCACGGCTAATGTCGCGAGTGGGCGCGCTTGGTGACAATAACGTCGTACCGGCAAGCCCCACGAGCTCGCTAGATGT")) +(assert (= z "cgggauucuuaagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 new file mode 100644 index 000000000..593baf1b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGTGGCCATTAGCGAGAGATTTTACGGGTCGTATAGTACTCGCCTGGTAAGTGTAGTGCTCTAGGTTGTCACTGAAGACGTGTACACGACTCTTCATGTCCTCCACCAAAGGTAGTTCCTCGTGATACAAATCTAACAACCAGAAGCCGCTATGCATCAAGAGGCTAAGGTGCCGAGCGTATTAGACTTTAGCACTGCG")) +(assert (= z "agccgauuuguaaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 new file mode 100644 index 000000000..43a9c533e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAACGGGCATCTGCTATTTGTTCGAGTTTAGGCCAACCCTGGACCAAGGCCACTCCTCCATCCGATGGGCGGTCCCGAACGCAACCGAGCGGATCACGCTGGCGTCTGTTATGACTGGATAAGGCGTAAGACGGCGTGCGCAGCCGTGGGAAAGTTTTACACACCCGTCATGCGGATTAGCAAACCGGACGCTAAGACT")) +(assert (= z "caacccugcacccug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 new file mode 100644 index 000000000..9cfdd8ba7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATTATACACATCAGTACTCCACTATGCACGGAAGGCGGCAGGACATGGCTGGGACAACAGGCAAATCGAGGTTACGCTTTTTGTATAAGGTACATCTACGATGGCAGCTAAATGCTGCTGACGTCCGTCGAATTTTACGGGACAAGGCCACCAATTCACCTTAGCGGCCTCTGTGAGTACAAAACCAATACCATTATTC")) +(assert (= z "gaguugguaccggau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 new file mode 100644 index 000000000..12a1100ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAATGCGCAAAAGCCCTAATCGAGTACGCTTCCCGGCCCTGTGTATACAGGCTGTAGTACGCTCTAAAACTCGATCCTAACAGGTTGCCGCCTTGACGTCGTATAGATATTCGACGCGATGGGCAAAAAGGCTCGAGCGCTCTTCTCCTGGAATAGTTTGGCGAGAGTAAGTAGCAAGCCAGTTACTCCGGGGACGGCG")) +(assert (= z "cuucguccgguggaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 new file mode 100644 index 000000000..c9f1e476d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAGCAATAGCAATAGCCCCGCGTGTCATAGTCCGTTGGATCACCGGCGGGGAAGCGCCTTCATTCTACAATGAGGACTCGGAAGTCCGATCAACGATCAGGGGCACCTTCGGGACATGCCTGGTTGGACTACAGAGGTAAATACGGGGGAAGGCAGCCTCTGCCATCACTCGTCCGAGTACGACTGATTTCTTCATAAG")) +(assert (= z "uacaaccguuuauca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 new file mode 100644 index 000000000..33f618e79 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCTATGATACGAAGCCTACGGATAGTGCATCATCCACTAGTACGAGCGAACGCATGTCGTCTCCCTTCCTGTACGGCCTATAGTTCTCCTCATGTTTCACGTAGTAAGTACATTAAGTCCCACCGTCGCTTGACATATTCTCCGGCTAGTATACCAATCGGCGGACACCTGATCCTCCGAATAAGTTATCTCAACTTG")) +(assert (= z "cuaccaaggcuaggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 new file mode 100644 index 000000000..ad68e569a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCGGATATAAGATGGCGCCGTGTGTCGGTCTCCCTGAACTGGGGTCATAGATCCCTGGGCGATCCCCCCCAAAACAATTACTTTCGCATGTCCTTATTAGCTATGACCGCGATGCAATATGAGGCACGAAACTGTCGTACATGACCATGGTGTATTCAACGGAGCTATAATCTTGGTGTCCGATGAGGAAGAGTGCTCA")) +(assert (= z "cugccgauauguaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 new file mode 100644 index 000000000..05b318d30 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGATATATACAAACTTCGTGAGAAGGTTGCCCCGATGACGCATCTCCCGTTACAAACTGCATGGAGAAAAATAAATAGGAATTATTGATTTCTCATGCTTCCCAACTTCTTCAAAGCGCACATTATACTGCACTAGAGAACTTTCTACTAACTGTAGAGTTACAACATGGTAGCGGGTCATGGTCGGACCAGTGCGGCG")) +(assert (= z "ccugucgguacugua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 new file mode 100644 index 000000000..9aceb4fe2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTAGGTACATCTAAGTCAACACCTGTCCGATCACCTATTACGCCACCGGAGCAGTTTGGCTCCCTGTTCTTATGACTATGGAAGACGGCTCCCGCGCAAGTGGCCAAGAACCCTATTGTCCACATAACTCCAAACCCAACTGTACGTGGGAAAAATTGGAAGAGCGGACAAGGACTAGTTTTGTTCGTCCCCCGTAGCA")) +(assert (= z "gugcgaaaagaauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 new file mode 100644 index 000000000..71748ea16 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCAAAATCCTAATTCGGCCTACACTACGGGAACAACCCCTTGTAACTTGATTACCCAATGTTGTATACCTATGTTGACCCAATCACGCGTTCGTATCCTACCCTCCGGCTCGAAAAATTACACTGGCCTCACAAGAGTTTGCGTGAGGATCGGGTATAATATCTGCCTTTGTGAAGCTATCTTATGGGTAGACGTTGG")) +(assert (= z "aaggguuugaauugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 new file mode 100644 index 000000000..d68d16e1a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGGAACACTGGACCTGTTTAGTTACACGTGGGAGGAGTCGAGTGGGAACCTCTCTAGACACGGTCTTACAATATTTCGTCTCGCTATATAACGTTTCTCAAGGCTTCTGCTTGTGCTGAAAAGACGGTAAAACTAGCGTAAGATGGTAATAATACGATCTCCAACGGAGTGTCCTCGTAATACGTGAAACTGGCTTATC")) +(assert (= z "cuuugguacaguuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 new file mode 100644 index 000000000..2f149e457 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGCAAAAAACTCAGCCACTCTTCCATATATAAAATTCTGCGTCGATGCCTTAGTCTCCCCGTGGTACCGTTAACCTTGCCTGCCGTCGTAGGCAGCCTGTTGAGGGTCTTCTAGTGGTACGTAGTCGGAACGGCGCCCTCTTGGTCAATACCCGCGTCGAAGATTATGAAATACAGTTATCTAGTGCCTGAAGACTTT")) +(assert (= z "cuguggauccagacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 new file mode 100644 index 000000000..72785df46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAAGCCCTCATCTCTGGTTGTCTCGCGGATACCTGTCACGCGATAAAGCATATGACTATCACCTGTACTATATTATGGGAGGTTCCGTCTGGAGCATAACCCCCCGATGGCCCGTCGAGTCAAGGGCACGTGGAGAAATGATCCCTATACGCACCTCGGGACTCTGTTTCCTCAACCGAACGCATGTAGGGTGGCTTAC")) +(assert (= z "uauugaaccuccgaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 new file mode 100644 index 000000000..5ea276b5b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACAATCCCGGTGCAATCAATAACGTCATCCAAATAGCTCCTGTCGACAGTAGATTCCCTAATTTGTGGTGGTGCGACCGGTTTCATCGGATACAAAAACATTCGCCGTGAGGCGAGCCAGTGGCTATACCCGTAGTGGTCAGGAAATCATATTAAGCATTGAATCTTCTGCAGCCCCGGAGCAGAACTGTGGTTGCTAC")) +(assert (= z "accguagaauagcac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 new file mode 100644 index 000000000..a8d6a5910 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAATCGAATCATAACCTCTCCGAGATCCGATCTGTGCTGTATGGGAGCATATGACGGGAAGTTGGTCGTATTTAGTGCGTCATTCAGAAATTGGCACGAATTCGAGACGGTTTGCAAAGCTTTCTCTTCAGGCTTAAAAGATTTATGTCGTCGTCCACGAATCTTTCGACACTGACCTCTACTTAAAAACCGAGAGCGT")) +(assert (= z "gaaacguaggcaacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 new file mode 100644 index 000000000..8dc39b5a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCGAACTTGCATACCGAACCTAGCACGGTGGTAAGCCGACCCTGAGGTCGTACATGACGTTTGTTACTCTCCAGACGCAGTGGCAGCTCCGGAAAACCATCGCGTTTACCTGCGAATTATCTGGAAGAATTCCACATGAGACTCTTATTATCCCGGTATCGCTAATTCTGCTCGTCACTCTGGCCTGATGAATTGCCT")) +(assert (= z "agaguggaugagccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 new file mode 100644 index 000000000..71b860226 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCCCTGGGGATCGAATTAAAGTCGTTCCCTAAATACGGAACGTGGACTCTAACCCATTTCATCGCGTCGAAATCGGTGGCCTGCTGATGCCCCCCGGTTGCGTGAGCTAATATGCAAATGTCGTGGGTTCCTGTGAAGGTCAAAGCTGGTTTACGGGGAGACTACCAGAGGCAGGACAGTAGAAGAACGGAAACTAGAT")) +(assert (= z "gaaagccauguguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 new file mode 100644 index 000000000..162c834ab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGAGACACCCCGGACTCCTCATGAAGCTGCATATTAATGAAATGTATCTTCCCAATTCCCTAGGCTGACGAGGACGAATGCGGGGCATCTATGAGCTTGCATTGTCAACCTTAGGTTTACCAAGAGGGGTATGGGCCAACTTACTGCACAGTCTAGTAACTTGAAGGCAGATTGTTAGCTGGGGGCTGGAGTGACTCGC")) +(assert (= z "auuggucacgacaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 new file mode 100644 index 000000000..63def9da5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTAGTCCTATTCGGCCGCGCCGACTGTGACTCGCCCCGATGGTGTGATTATAGGTGGGAGGTCATCACCATAATCGTCCTTGCTTTAACGTGGCAGTGTCACTCATATAGGGGTTTCAAACGTCAATAAGATAGGGAGATGATCCCACGCCACCTATAAATGACTTCCGTAAACAGAGTCCTGCGACCCCCGATGCGG")) +(assert (= z "ugauaaccagcauuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 new file mode 100644 index 000000000..6681da2fd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCGACTTCTCTCGAAGCTCAGTGGAGCCCGCTCACTTAGAATAAAGATTCGTCAGGTCCTAATACATTGGTATCGAGTCTTAAGGTTGGATGTGGGAGCTGGTGGCTGCATGCGTTTGACGTACATTTAGTGCACATTCATGTGGCCAGTATCCCGCTGTCACCCAAAGTGTAGTCTTGTCAAAGTGGTTTCGTTGAGC")) +(assert (= z "cauaaacaagacaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 new file mode 100644 index 000000000..f0c4378b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTAGGGCACGGCAGATATCTCGCTCCCGCCCTGAGAGCCAGAGCTAAACGAACAGCGATCTTGTGTTATTGTACGACTAAATTTGGTGAATTTTACGAGTCTGGAGCGCTAGGTTAGTATATGGTACAGAAGAGCAGACTCCCCTAATTACACTCTAATCGCGATGTCGTAGCAAATATGCATGCATCTTCCCCATGC")) +(assert (= z "aucgauacggcuguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 new file mode 100644 index 000000000..66d6224a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTGTGGGGCTGTTGCCCGCACCGTGACACCGTGTACCAGCAATTACACATAGGAGAACGGAGCCTTCCCGCATTATCGACCCCCAAATCCCTGTCGCACCACCGCGAAGTATGTCCGTATGCAAAGGACGGACTCAGTGTTGCGAAGTCGCCACATGAGTCTGATGAGACACTGCAGCGAAAGTCAGCTACTCTACAA")) +(assert (= z "uccgugggccccauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 new file mode 100644 index 000000000..87cdcf59a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCATCCACACCGCTAGGCACCATTCCAATAGTTGCCCCAAACTCTGGCAATGACAATCTAGGCCCGTTCTACTAGCACGTCTTGTCACGCGTCGTGTGTGTCTTGGGAGATGATCGTGATAGTATATATGTTCGCGTGTTACGACGTCAGGGCGCTAACGCCCAGTCTCAAGAGACCGTCTCCTGGATGAGCTGAGCCTT")) +(assert (= z "gagcauucuccuugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 new file mode 100644 index 000000000..8890c307e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCACTCGGACGGAACCGTGAATATGCTGTTTCATCCGTAAATCGAGAGCCGGTACTCATCTCAGTTAGCTGTGTTCAGACGTTGGCAGCGGACTCCACCGTCTTCCTACAGTCTTTGACCCATCGCGCAATTGCTAGGCGAACTCTACTCATAAACGAGCGCGCTGATAATGGGACTATCGTTCGCAATCAACGTACAAC")) +(assert (= z "gccgcuggaaagcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 new file mode 100644 index 000000000..0117d670b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAAGTGTTAATGTATAGCCGAGCCAAGACGCGAGAACCCTTTAGTAGAACATGCGGGTTTCGAAAACGAAATCTCTAAGTTATAAGGCGAGCGAGCAAATATTAGGAGGGAATTCACCGATACAAGACCTTATCCTTCCTACACCAATCACGTTCGAGTCTTATTTATGACTCTAGGGGTGACAAGCATAATGAGACGCA")) +(assert (= z "aucagguugcggcca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 new file mode 100644 index 000000000..de088132d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCAGTTGATGTTGGTACCTAGACTAGTGTAGTATTCTGAAGACTAACTCATAGATATAATTGTCCCAGAACGTGGGCTCAAGTTACTCGCCAACATGTCGATATGTATGGGTAACTTCCGGATAAACAACCTACCTCGCATTTCCCTCCTCGTTCCGCCTAAGAACTTGAGCTTATGTATCACGCGCTAAATGCTCCAT")) +(assert (= z "gguggcucgggcuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 new file mode 100644 index 000000000..7322a00f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTACACAACTAGTAACAAGCAATAACCATAACCTACCTTGTGTTCGCTTCATCAACTAGAAACCATACACAACCGATAGACCCGGTCAAAATACCCAGCGACAAGACCGGCCATGATTACAAGACTTCCCACTGTTGCACTTTTAGACGCTCCTCACTTATTAGGCGGACCTTTTCTCGTTTCCAGTCTATAGTTTTTG")) +(assert (= z "cuacaggcagggacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 new file mode 100644 index 000000000..bf0cafa32 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCATCCAGGCAGGCTGGGATTACGTCCTCATAGAAAAGCTCACATTTGTACCTAGTGAAGTACAATAGAGGCTTCGCTACGATGGACCCGACTTCGCAAGTGTATTAAGGCTACTGACACCTTTAGTCAACGCCTGCGTGTTGCCTAATTTGAACCCACGACTTTAACCGGTTTTGGCCTCGTCTAGACAGCCGACGGAG")) +(assert (= z "gaucugaguucugaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 new file mode 100644 index 000000000..f91fc2901 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAGATGGGCTCTTCTGGCATCTAGCAAATCATCGCGGAGATACAACTAGAATCCGTTCTTCCAGATCCTCTCTAGGCAGCGCGTGGCGTTTTCCTTGCCTGAGATTACATGCGTCCAGTGATATACCCATGTGGTCTCCAATGTTCCTATAAATTGATTTCAACCCTCATGCCACACCGTGAGCACCCCTTCGCACTAT")) +(assert (= z "ucagguugcgaucac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 new file mode 100644 index 000000000..f3173c633 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGGAGACCGTCAGGACTAGCAGCGACTCGCCGGAATTCTGGTTCTTTTCGTCATTCTCAAGAGCAATTGCTTACGTCATCAACGGAATTCCGAGTGCGGCTCTTTAGGGGCTATGCCCTAGCTAATAAGGCAATGTCAGCCTAATGTGAAGACGTACCCTGCAATCGTCGACCCTTCTGTTTCGTTTCAACTGTAGAGA")) +(assert (= z "auccaagaauaacuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 new file mode 100644 index 000000000..0c0cac6c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCATTCGTTCTCGTAGACCTGGGTACTGAACATCTCATGCCTCCCGATCGTAACCCGATCGTCCTCTAACTTTGATGAGTTGAATATTAGTTGAATGCCAGTAACTAATCGGATTAGCAGCAGGGGTTTTCACACCTAACGGCTACACTTTATACGAGCGTGACAATGCAACCGAAATTTGCTAATGATTACCAGTCACA")) +(assert (= z "accuuucaccugaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 new file mode 100644 index 000000000..3486a4213 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCATCAGTTCTATGTGTGTCCGACTATCCGCTGATTAACTCACGGCGCTGCGAGCTTGTACGGGCCAGCACTTCCCTTAAGGTCGGTCCTACCGCACGTAAGTCCTTTGAAATAACGAACGTTGAGCGGGCACATTGAAGGCCGGAGTTATTTTATTCATCAGATGTAGTCGCAGAGCATCCCTTCTTAAACGATAGAC")) +(assert (= z "auauucaugugagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 new file mode 100644 index 000000000..3a485f1cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCCGTCAATTGCAGACCTGCATGAGTCTTCAAGCGAGCTCAGTTGCGTATTTCCACTGAACGTCGAGATCCGATTGGCAGGAGTTAAGGAGGGTCCGTATAGTTCGGTGGAACTGGAGTCGGCTTTAATAGTTGAATCAGTGGCGTTATAAATGCCATGGGAATCGTCTTAACCTATCTTAATGCGTAAGCCCGTTCGA")) +(assert (= z "uuucuucuaugggau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 new file mode 100644 index 000000000..014c80c66 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTATTCAGCCTCTGAGTAGGTTTCGATGTTTCGCCGCCTAAAGAACACCCGCCATCGGGGATAGGCCTTGCCAATATAAGTTGCTGGGGCGTTCGGCTGCGTCCATCCAACCCTCCTCCTTTCCTGAATGTGTCGTGATCCCCAGACTAGATTAGTACCAGAGATTTCAGTAGGGAACACCGGACAATATAGTTTAAAAA")) +(assert (= z "gcaauguaagaagag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 new file mode 100644 index 000000000..42cb71c50 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATCATAATTATTGATCAAAGGTCGCATGTTGATCAATATTTAGCGCTGCGCAATTCCGAACCGCCGACCTGTCGAGACCCCCCGCGCCAGACACTCATCAGAATCGTATTTGCACACAGAAGCAATCTCTCATGAAATCCGTACACGTTGAAGTTTCTCAGCTCCGATCTTTCGGCCAAAATGTCCTTTGGGCAACACA")) +(assert (= z "cucuaggaucaagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 new file mode 100644 index 000000000..21f377ebf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAGATGTCCGAGGAATTGAAATATGATTGGGCGGTCGTGAGTTCTCCTGCTAACTTGGGGCAACTACGTATCGTACTAAGCCGAGTTCAATACATTCTGACCTTCCGCATCGGCCGAATACAAGCTGGCTTGTAATAAAGTGTTCGCTTTAGGTTATGTTCACGTCCGAAACTGAGAGATCTATGCGGTGGAAACTTAG")) +(assert (= z "ccgaauaguucgcgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 new file mode 100644 index 000000000..034722dcc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCCTCTGGTCACCCGGAAAGCTAAAGGGCGGCGTGCCGAGTCGATCGGGCCATACATACGTTCTGTCCACGAAGTCCGTAAGCGGATCACCGAACCATGCATAGGCTTCTATCTTTAGTCCGGAACGTAGTGATAGGGCTCCTCAGGGCCGGTGACTGGGTACTTACTTTATAAACGCTTATCACGAGTCACTGTCAT")) +(assert (= z "agucgcgagcauccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 new file mode 100644 index 000000000..685f01a14 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGATCCCCTGAACGGGCCGGAAAGGCCAGGTTTGCTGAGAGTAGTATTATCCGCCAATCCGCCTCTAGCGGTATGGTCCAGTAAAAGAGAACCTGTCGACTGGAACGTACGTCGCGTCCACGACTCTCTGGCTAGCCGGCTAGACTCATAAGTGGCGGTCTCCCCAGAATAATCTGTGAGTACGGTTTGCGTCTCCAAAC")) +(assert (= z "ucacgugugcccuua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 new file mode 100644 index 000000000..fab9ef207 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACCCAACAACGCCAGCGGGGTCCTAGGCCGGGTCGTCTAGAGAAAGCAAGGAGTCAACATGACCGGCGGTTAAATTCAGGACTGAATTCAATCGAATCTGATTTGTTTTTGTTTCACGGTTATCAGTTTCATATCAGCCGGTACATGAGGGATGATGGTAGCTCGTTCTATTCGGACCTTCCATGACTGAGCTTGGAAG")) +(assert (= z "gggcguuuucccaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 new file mode 100644 index 000000000..680f318ee --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAACAGACCGCAGGCCAAGTGACTATACTGTGGCCCGCGAGGATAACTAGGTCCTGCGGAATGGGAAACCTAATCGACAGAAAGAGTTCGGTAGGCAGGGACATTTCGCCTCGATGCGTTGCAGACACGTGCCCGTTCCAGGCCAACGCAGTGCAATAGCGTAGCCAGTACAAAATATCTTTCGTGTCGAAGTTTTCTTG")) +(assert (= z "aacucaacucuuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 new file mode 100644 index 000000000..5b0810746 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCATACATATCGCGGGTCAGATAGGATACTCACATTTATGACCAATCTAACGTATAGCGAATTGGAGGAAAGGGTGCGGGGTTAGTCCATCAAATGAAGAGTGCAATCCTGTAGTGGGCCTATTTGCTTAGTGGTGTATTAATATCCCCCATTGGCCACGGTTATGTAAACCTAAGCTCGTCTATCAGGTGTGGAGTA")) +(assert (= z "ggcuuggcagcaggg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 new file mode 100644 index 000000000..5b9f9175f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGTCTAGACAACATGTGGCACCCGTGAACTTCTACCTCTAGCTATACGATAGCTGAGCAGGATCCCTGTGACGACTAAATTTATCCGTTTTAAAATACCGTTAGAACGAAGCTGATTCATGGACGGCTACCCGCCTTGAAGCAGCCATTCGACATTCTTTCGCTCTCCACGTGCTGCTTTAGGTTTCCCTGGAGAATGT")) +(assert (= z "cugccagaaggcucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 new file mode 100644 index 000000000..d5138425c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTATGTCGTGATGGATCCGAAGTCACTCTGCCGTCTAGTTGGTAACATCGGTGTAGACTTCACAGCTACACTCCGAGGGCTTAGTTGCGTCGTTATCGTTAGACGATTGGAGGTAAGGTGCAGAGGAAGGAGTGCATCTAATTGCGGATCTGCGGTACCAGGAGGCAAATACTAATTAGGGATATCTATTCGAGTTGGCA")) +(assert (= z "gacaagucaacuugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 new file mode 100644 index 000000000..cfcded52d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTGGATAACCTAGTTTTAGGAACTCCGGGTCAGACTCCAGTCCACGAGGTGGTATTGACAAGCCGTGTAACTGTCTTCCCCGCCCGAATCTTACTTTAGTATAACACATTAACGGAGATGGCAGTCCCAGTCGTTACTTAGGCATGAAGGTAGACACTCACACAGCTACATTACCCGATTTAAGACCACAAAAAACCAC")) +(assert (= z "uaguggcuacugagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 new file mode 100644 index 000000000..18ad5601f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCAGGGGGTAACCAACACAGTGCCTCTGATGGTCCCCGGTTTACGATGCCCTCAGTTCCGTGACATGGGCTTCGGGACGCTGTCGCCACAAGCCCTAAGGATACAACTATCGATGTTAACTAACGAGTTTGCTAGCGTGCTCAATTTCGCCTTACTGGACCGATCCAATGGCCGACCTAAGCGTGAACAAGGCCAGTT")) +(assert (= z "cggagcauuguaacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 new file mode 100644 index 000000000..45098c17a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCACAACGGCGTAAGAATCGGAACCAATGCCTGTTTGTGCACTTGCGTACCGCGAGATTTGCGCCGGTAGCGACACTTGACGGACTGATACTAATATATCTCGTTCCGCTGTGCCCTCTGCAACCGCCCCTCACGAAGTCCCTGATACGGTTGGCTATAGACAACTCTCATACTAGTATGAGCTGCATACAGAGAAAGC")) +(assert (= z "uaugacguucguuau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 new file mode 100644 index 000000000..5faa17696 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGACACAGAGATGGCACCCCTATGATAAGAACTCCCACAGAGACTGCCAGGCATCCTTGCCTACACAGCCCCAGATGTTGGACTCACTCCAGATAAAGAATCATAATTGCTGTTTAAACACAATATGGCGGCGTTAAGTAAGCAGGAAAGAGTATAAAGCGAACCGCCGGCTGTTTAAAAGGTCTAGCTACAAACTCGT")) +(assert (= z "augcgucccacguga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 new file mode 100644 index 000000000..41846567c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGATTCAGTGCACGAGGGAACTTTGATACATTAGAGCGTTCTACCAGTACGCACATGTTCCTAATTCCCTCATTCGGATTGACATCATACCAGGAGTGATGTGTTATCGCCGAGATGGAGGCTAGAACAGGTCGGTTGTGACAAATATTGATAGGCAACTATCCCTTCCCGATGAACACAATGGGGATGATCCATCCTA")) +(assert (= z "ucaaggaaacgaagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 new file mode 100644 index 000000000..53555cb78 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTTATTCCAAAGTCTGCCGCCAGGAAGCCGGAGCTTGCACTGTTAAGTTTGGTCCGGCAGAGGACCACTCCCGGTAATGATCAGTCTGCGCCGGGCTAGCACATATGGGCAATATCTCACCGAGTGAGTTGACCTTGCTTTGACCTCGCTGGAGGTACACGACCACTTGCAAGTATGAGCCACTAAGGTCAAGGGAATT")) +(assert (= z "ucuaaccucaugucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 new file mode 100644 index 000000000..f2cae668b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGGAACTAGACGGCCTGAAAACTCGTATAGCGACAACTCCCTTTCTTGGTAAATCGCTCCTTACTTGCCACTGGGATTGCCTCGATGTAATCGCGACCTACTGCTATCTTGTCGTGTTAAAACATTCAATTGTTGCCACGAAAGGCGTTCCCCGATATGCCCATCTCACTCCACAATGATGGGCCTGATCGTGAGCTCC")) +(assert (= z "cguggagugaucuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 new file mode 100644 index 000000000..303cea6af --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCAGCCGAACCTCTCCTTGGATGTGTATCGCTAGATATTTTGTTTATTGCCCTAGTGCCTTAACCTGTACTAAAGGCGCCTAGCAGAAAAGTTACGACACATACATACTCGCATTTTGTCTATGGCCAGTTCGGTAGTTGACCTCGGTCCGATTGGCTTTGTTCAATTAAATGTTTGACTGATCCGTGAGGAACTCG")) +(assert (= z "cauuugccgggaaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 new file mode 100644 index 000000000..46668ab4c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATAACTGTTGAGTTCTCGGGGTCAGTGTGTAGTCCGTTAGCATTAAGGTCCAATACCGGATCTTTATTCCTCGGCTATGTCCTGCGGAGGGTTCGGATACAGGGCTTATGTCGCTCTCGAACTTGCTCGGCAGTCACGGCATAGTGATAAGTGTGGGGACCTCTTAATGCTGGAGTCGCCTGGTTCTGCTGGTTTTACT")) +(assert (= z "auguacgucaauaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 new file mode 100644 index 000000000..6f47af02a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTTTCCACCGAGACTCGCCCATTCCACTTGAGGTTCTAGCCTTTTTTATCTTGAGGTGGTGACCTGTAACTATTAAGATGTCGAATGGCATCTCGATTGGTAAAGCTGCTTCCATCATCCTGTCCAATGTAGAGCACGGTGAGAGCTCATGCAAAAGCTCAGCTATTGGTGAGGGTACGTCGGGCTAGGCATTAGTAA")) +(assert (= z "gcucguucugccuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 new file mode 100644 index 000000000..86aadb5b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATAAGATCTCCCGCCTAGGTGACCCAAGACTTGTCAATCCGTCCTTAGGAGTGTCATAACTATCGGTTGGACCCCTATAGCTCGAAAGTAGATCGGTCGGCGTCGGGCCCATTGAGGGTAGAGGGTCCCTCAGTGTCTCAACCCTGGCTACGGAGGCAACCACATGCATCCCTAATACATTGCGGATATGTTTACACCC")) +(assert (= z "uagacccgaacucac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 new file mode 100644 index 000000000..9d309ef46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCCCGCAACACAACACATTTTGGCGCGGGAAGAGCGGGTAAGCTTACCTTGTGATCGCGACTATTCGTAGATGCGGCCGATCTCGGGATAGATCGGTGAGTTCTGATTATATGCGTGGTTCAGTAGGACCACGTGTCACCTTTGTGTTGCCTGACTCGCGGAAAAAGTGGGGCTACTGTGCAACACCGGTGTGGCGGA")) +(assert (= z "gucuucagcuccaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 new file mode 100644 index 000000000..a0fec31d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTCGTGCCTGATGTAAGGCACGCCGATTGACACTGCGAGTTGGCTACACTGAGTTGCTCGCGGACGAGTTATATGGCGGGCCAGCCGCATCTTATACATGAGCTTTAACGGGAGTGTCCGAAGTCAATTCCTACCAACCGCACTCCTATTGCCACGATGACATTAACCAACTAGAGCGGCGATAGTCGACCCGCCAGAC")) +(assert (= z "gcucucugaucauac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 new file mode 100644 index 000000000..b79156188 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGGTGCTCACTGCTCAGAGCTTATTTCATTCTGAATTTGACAGCCTCGCCATAGCGTGCCAATTGGATAGGCCTTCGGACAGTCGCAGGCAAGATGGAAGTACTCCATCATAGTCCTTACTAGTGAGCCAGTGAAGTAATGGCGGTCCGTGGTGGATCGGGCCAATGATCCAAAAACAGGACAATGGCATTAAGCTCTA")) +(assert (= z "gcccucccaggacca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 new file mode 100644 index 000000000..a519bb09c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCTCTATAGATTTCGATCGCGGGGGAGCCTTTAATCCTGAACTACGGAGGTGATGACATTGAGCGGTAATGAGAACCATGCGGTGACGGGCTCCCTATTACACCGAGTGGCTTAAGTTCGTGACCCTAGGGCGAGGCGAAGTCGACATTGGAAAAACTTGGACTGGTGGAACGACAGCATAAAAGAAATATACGTGTCC")) +(assert (= z "aaagguugagcucag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 new file mode 100644 index 000000000..88818e545 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCACAGCTCGAGCCTCCGAGACTCGTTCCCGTGTGTGATACAGAGGTATTTAGGTTTCCAACGGTTAATCAATTATGTCCGCTATATACTAGTCACACGGACAGGAGGCACCACTTACGCAGATTTGGCCTGTGCCATCTCTTTCGAGTAGTGTACGCGTGTTGGCCCGCTGGGATCGTCGTACATGTCACCGCAAGATC")) +(assert (= z "agacugguaguucgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 new file mode 100644 index 000000000..cb5c7612e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAAACGAATGGTCGAAGAACAGAATTATCACGAGAGAACTCTTACATTTTGCACTTACGGCTCCAAAAACAGTTCCACGGGGCCGAACGGAGGCAAGAAACGTCCGCCTCATCTCGTGCCTAACTTGGGCTGCGTACCTGAAGGACGAAAATTATGTTTCGCGGTACGTACGGACACTGTTGTGTGATGTCCTAATGGC")) +(assert (= z "uacuugguccggaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 new file mode 100644 index 000000000..8ece66050 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGGTGTTTCAGGCTTATTGGTTAAGCGATTTGAGGGACATTCGTATTCGTCCTCCTATAACTTTCGATCTCGAACTTTCGGAGGCACGGATTCGATGATGAACCGGCCACGCTTGTGCCCATGCTTGTGTAGCTACTGAGCTCATCGTACAACGCCCGGGACTTGACTTCATGACACTTGCTTAAATACTCAGCCCAGT")) +(assert (= z "ugguugggccaacag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 new file mode 100644 index 000000000..e2c2c377d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTACCCAACAGCGTGGTCTCACTCTCCGCTTCGAAAGGCAAGGTTGTGGATCCGGTGTCCATCAGGTGTATACTCCGCATCATATGCCGACGGATGGGAATGGGGGCCCAGTCCCACAGTGAGGGAGAGTTACTAAGGGACAGTGTGTTGATACGGCAACCTATATCGCAGATAAAGCGATAATTTTCAAGCCTAAGC")) +(assert (= z "uuaccgaucugcucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 new file mode 100644 index 000000000..4ba1c46a1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCATAGCACCCGCGCACCACTGTTCAGTTCTCGATACACGCCCTGCCTATGTCCGCAGACGTGCTCTATGTACGGGGCGGTCTAAAAACCGTCTCCCACAAAGCTCTCGTACAATGGCGCACGTAACGACCAACACTACATATGAAACGTGACCGTGTCACATTTTGAGCTGCTTCGTACAGCATGCTTCCGATGTTA")) +(assert (= z "gaagcauagucgacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 new file mode 100644 index 000000000..19fc18f34 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATGTGGACCGCGTAATACAAGGAATGCTACCGCGGGAAGTGACTGGTCGTATTATTACTGGTACTATAACGGAACCAAAGCCAAATAGCTACTACTTCTACCTTCGCCGCCTGTGGTTCTTTATGGTCGTCAGGCGTGATGGATCTACGCACCTTACGCTGGTTTCTGAAGCACAATGCTTGGCGGCGCGACTGGTGGT")) +(assert (= z "uaccuuuacuccgau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 new file mode 100644 index 000000000..cb8497c55 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATCCATGGTGTCTAGGGGCCGACGTAAATACTCGACGCTTCTGCGCACTCAGGCGAGTATGAGCCCGCTGCTTCAAAATGATCGCCATGAGCCTACTCGAGTCTCACAAGGAGAGGTGATGGGCGATTCTACAGGGTGCGGGCTGGGCGAATCCCTCAGCCATGCCGTGGGCGTGCTAATGGAACACATCTGTCAAAAC")) +(assert (= z "gauguuccgcauauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 new file mode 100644 index 000000000..d0ea84fd0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGGCAAATCAGGGGTATCGAGTGCGGGGGGGCGGAGCCAGCGATGCGCTAGACTGACACGCTAAGGAAAGTTGCTAGGTAGTATCAGGAGTCTCCGAGCACAGTAGCGCCCGCGGGAGTTTGGGAGAGAGAATTTCCATCCAGCGAAGGGGGAAGTCAGCACGGTTCAACTACGAAATGGTCGGTGTTAAATTAGAGCT")) +(assert (= z "ccucauggccgaguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 new file mode 100644 index 000000000..f7d55e900 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTCCGGGCCGCTTAACCGCACTGACCCCTATTCACAGCGGCTCCTCCCTCTCGCCATGCGGTGAGGTCCGTCCAAGATCATGTTTTACGATGTTATTTCTGTACGGGCCTTGCCATCACGGGAAGCAATAAACATCCGCTCGCTATCTTGCTTACTACCGCTGCGAGGACATGTTACGCAGCTCTAGCTAGTGATCTCT")) +(assert (= z "aacgaccuccugaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 new file mode 100644 index 000000000..a5f32e51b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTTCTGTACACGTTTCATGATAGGGTTCGTTTATAAGGTTGCTATCTGTACACTCGTGGATTTTGAAGTGTGGCCAAGGCGATAACCCAGTTCGGTCTGTAATGCACCTGAAGCGTAACCACATCAGGCATCAACAATTAGCCCGTCGTTGGAAAAGGATTGTGAATAAGGCAAGCAAAAAGTTATAAGCAACACATTG")) +(assert (= z "uugggaaaccugcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 new file mode 100644 index 000000000..ecfe54c80 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACGCAGTCCACGTATGAATGACGGCTCCAAGGATACCCTAGGACCGCATACGTACTGGTCACGTTTTGAAACGGTAACGCTAACGGGTCATAACCTAAAGCGCAATGGAGATGCATCGAAAGAGTCCATCTTTCAAGTCACTCTACGTATGGCCCCGAACCCCATGTATTGATGTTTCCTTATCTGGACAGAACAAGCA")) +(assert (= z "ugguaaguucggaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 new file mode 100644 index 000000000..b7cd2a5e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATGCGCTAAGCTGGACGGCACAGTCAATTGTAGTAATTGAGGGATATAGCGAAGTGTAAGGTTGGTGTTGCACCGATCGTGGTCGAGTGACCGTGCCACGGTATGCTAATGCAAAGACCAGTGGTAGGTCAGAGCTGTTCAAGCCGACATTAATCGACCGGTCAGTGTCATAGCCCGGCTCTATCTCAGTGGTTCCCGC")) +(assert (= z "gccuaaacuuaugcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 new file mode 100644 index 000000000..3629665fc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGAGGTGAACCAATAGGGCTTGCCTAAGTCTGTCCATCGCAGGCCGTAGAACGGCAAAGGGCACAAATGAACTCCTTAGACTCTCCGTCCCTATGGTTTACCGCGACATGCCAAGCTAGCCCCCGAAGTGAAGGGGTCCAAGTCTTGGCTCGACGGAACATGGCCGAGAGGAGACTTTTCCACTCGCGGATAACTGCTC")) +(assert (= z "cagguggcgaaccaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 new file mode 100644 index 000000000..5a1348ecc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAATCGCCAGGGGCTCGTGGGACCACTTCTGTTTGGCAATCACAATAAATTACTTAGACCTTTAGATTCTCCGATGGCTGAAGCAGTGTCCGCAGATGGATTCCCACGGGCGCCGGGTAATAGATTTTTAACTTCACCACACGGTATCTTGAGGCGTACAAGACATCCACGACTCGTACGTCCCGGAATCCAATTGCGTG")) +(assert (= z "cguaauuaccaggca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 new file mode 100644 index 000000000..56087e5c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGATATTACAGGAGGTTGTGACTTAGGAAGCCTCCGGTTAGGTCCGGGGTTGCTTTCTGCATAAATGTGAAAAGGTCCATAAGGTACAATAGTGATAGGAGTGGGTTTCCCGACCAAATAGTTTCTCACAGAGCCTCGGCTTTATTCAAACCCACACACTCTGACCGGTAACCCCGACATTTTAAAAACCCCGCAGTGC")) +(assert (= z "ucaguacagucaaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 new file mode 100644 index 000000000..79f8eb331 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAATCCGTTTCATATTCTCTCAGTAAGCTAATTTTGGGCTCCTACCTGTCACGTCGTCTAGGTTGGCTATCGGCCTGCATCCTCTGCGTGAGAGTTAGCGGAGGCTATCTGGCTAGATAATCGAGGACTGACACCACGAGGGTCATCCCAGTTGCCAAGCTTACTCGCTGTGCGATGAATGTTTGTAGCAGAAAAAGAAT")) +(assert (= z "acgcauuuuaucacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 new file mode 100644 index 000000000..1ad9d9129 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACGGCAATGAGGTATGACATTATGCCCATTGTGACTGTGCTATCCGATAGATCTCGCTGGCAGGGTCAGCTAGACGATCTGTGAGAATTACAATTCTTTCGAAGATCGATCCAGTCATTCCATGGGGGCATTCACAGTATCCTCCATGAGCTTCCAGTAGGGCCATGTGCATGTCCTCTCTAACTTTATCGGAGACTAG")) +(assert (= z "cacacccgguuacgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 new file mode 100644 index 000000000..c3a0c7de0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCTAACGGCGGCCTACCCATCCCGAAACGACTTAGACAACCAGGGTCAAGTAATGTCGACGACGCATAGACTAAATGAGCGCCGTGTAGTCTTAGTCGATACTGGACTGGGTAACCGGACCCGCCAGCCATATCATCTGATTCTGTGAGGTACCTCCCTTGAATCTGCCCTCGTCTCTACAGTGCAATGTGATGAGGTA")) +(assert (= z "cgguacagaucguac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 new file mode 100644 index 000000000..998eb4165 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCAGTTGATTGTGTAGCCTCGCCCTCTTTATCCCCATTCGAACGTGTACGGAAGGCCAGCCGACCCTCAGTGGCTTAAGTATTGTCTAGACGTGCAAGGCGGTTTTATCTTTCATGTATTCCTGTGACTCTCAGAAATCTTAACCGGGACAATTGATTGTGCACCATTACTTTGAAGGTTCCTAATTCGAAAGAGTTA")) +(assert (= z "cauaaauuccguaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 new file mode 100644 index 000000000..c43124b98 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTAAATGTATTCCGCGCGAACCAGAGCATTACCGTAACTTAAGTGTGGTTTAGTGGCACTACACGTCAGTCGGCAGGACTAGTTCCTATTTACCCTTTGGGCTAGGCACAGCGGTAATTTAATTAGTGGAGGACTCGTACGCATGACGCATGGCTGAGGCGTAACGTGCCTCAAACCGACTGATCAAAATACTTTCGCCG")) +(assert (= z "gcuuuuuacaauucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 new file mode 100644 index 000000000..44210257d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAATGGGTCCGGCCATAGATTTAAGGCGTTCGCAAGCTGCCTCAGATCGGCTAGCATTTTCTCGAAATCCCGCGCCAGTAAGGATACCATTAGTAATGGCGGAACGAACAAGGTGCGTACCAGCGTTGACGCGAAGTAATACCCCTCCAATGCATACCAGTTTTACTTTACTGCTGGATTCACGGGCTCCTTGCCTTTC")) +(assert (= z "agcuuggccgccuuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 new file mode 100644 index 000000000..fa54dde15 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGATACCAAACTACAGACATCTATTCCTAAGCAATCCTGGGTCAAACTCTTATCCTTGACCTTGACGGACTAGGATGCTCGGTAGACTCGGGGCCGTCCTCGTATCAACATACTTCGGTTGTCCGACATCGGGCATTAAGCAGCTCAGTGTATGGCCGATACGGGGCTATAAACAAGGCTCAATAAAAAATCACAATTAA")) +(assert (= z "ggacucugcaauguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 new file mode 100644 index 000000000..2d382b84e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGAGGGAGACGTGCCTAATGTAAGTATCCATGTAGAACCGATGCTACCTTGTCGTCTACGAATACGTTCCCCTGCCCTGGAACTAATCAGGGCAGCGTCACGTCCCATCAATATGTTCGACAGGCGACTAGGGGTCGACCCCTTTGTTCTATCTGGCTTGGGCCGTTAGTATGTCGGCGGGACGCTTAAGGTTGGAATG")) +(assert (= z "gguucugcauggcac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 new file mode 100644 index 000000000..22d4e9e23 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCGTAGCCATCTGAGCGAATAAGAAGTTCAATCGTACAGTTGGCGCCGTACCACATGTTTCGGAGCAGGTAACGACAGGGCACTCCTCTTGCCAGGGGAAATAAGCGATGAAGGAGGACGTAAGCTCCACCGTGTATCTAGAGGCACGTGGCCGTGCAGCGCGCCGTCGTGCCGGCCCATCCTAGTAAGGCGTATAGTA")) +(assert (= z "ugcgcgccgaaccgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 new file mode 100644 index 000000000..68274b5c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAAGCAATGGGGTCTCTAGACTCCGGAGGCCGTCTTCATCGCCCTTAATCGTACCTCCAACTTAGGTCTTTGCAGGGCGGGTCGGTAGTGACCACTATGTCCCCGGTCAATCATTGCGGTCAGCAAGTCCAAGGGGTTTGCCCGCCAGTAGTAGTAAAGGTATACAGTCGTGGACCGCATCGCTTTCTTGCTGCCCGCC")) +(assert (= z "uccgcaguuuuggug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 new file mode 100644 index 000000000..7be704d0e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGTTAGCATTCGCGGTTAACACACACGGCTACCACCTTCCATCAATAGACTCGGGGACAATGGAGAGGCCCCACCATCGGAGGGTTAACTTAACTTCCTGAAGGGGTCCTATCGAGCACGCAAGAGCAATCAACCGTGTTCTGCCGCGACGGAGTGAATGGTCACTGAGGTGAAGGAACCGCATGATTGTTAGATTCAT")) +(assert (= z "cucgcugccccauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 new file mode 100644 index 000000000..ae129e14f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTGGGTATGAGTACGGGGCCAGTGTACCAATACGTTGTAAAGACACCAGCATACATGCGAGCTTGTTTGGGAGCTAGTGCGGAGGTAGAATGCCCTAACGCTATTTGCACTCTTGATCTACGGCAAACAGCAAATCGGTGCTGTATGAAAAAGTTTCTAAGGCACGTATCTTGGATTAAGAACCCACAAACTAATTCTG")) +(assert (= z "auagguagggcacga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 new file mode 100644 index 000000000..dcf47cb06 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGTCCATAAATATGACATACTCAGGAGTCAGAGCCAACCGGGAAACCTGAGCCCTTAGCTAATTAGGTGGTTCACTGGGTGTATGCCGTGACGAGTCGTGACGCGTACAGGCGTTGCGAGTGACGAGGTCACAGCAAATCGGGTGTTGAGACTGCACGGTCTTTGGTTGATGGCCAGGCCTTCAGCCAAGATGAGGGAG")) +(assert (= z "agccucgugguucag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 new file mode 100644 index 000000000..8b6938a57 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCACTTACCAGCGCTTTAAGTCCACGAAGTTCGTACAACCCTCAGGCTCCGCGACCAACTAGACGCCAAGTCAATCGAATGGTGGCCACCTTGTGATGGAAGCGTACCCCTTGCAGGAACGGTTTCAGCCCGATAGACCGGCCAGCCTCGTATGTTGACTCTCACATGGATTGATCTTCATATACGGCGACCCATTGTC")) +(assert (= z "cuaugguaguaagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 new file mode 100644 index 000000000..f704af897 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGGCGTTGGTTGAGGCCCATCGACATGATCCTTCTCTACCCTGCACCATAACTCACCACGCAAGAATTTTATGCCTGCCCAGAGAGCCTCTGAACGTGCTTAGTAGGATCCTTCTCTCGTAGAATGTATATAATCTAAGTGAGAATCGGTGTATACCTACCAGTCTAATGGAGCAGGACTTCACAGAAGACCAAACTCA")) +(assert (= z "cggccacacuagcaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 new file mode 100644 index 000000000..d789820de --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCTCTGGTAACAGATATGATACCCAATCAAGTCGAAGGTCCGCACAGTGTCTCCTGGACGTCTAAGCAAGACCTAAGCACAGACCTTCCGACATACTGGAAATTCTAGGCGAGATGCCAAATCCACGGAATCGGCGAAGCATATAGAAGACACCCGCTAATAGCTATCAGAGATATTGCTATCCCCTTAGTAGCACGTA")) +(assert (= z "auaauuauaagagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 new file mode 100644 index 000000000..fa72f87cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGATACCATGGACTAATCACGGCTTCCTGATGCTATCCCTATAAACTGGTGATTCTGCGGTCCCCCAATGGTCTCCTTAATTGTACCCGGCGTTGCCTGTAGATATCCGTTACTGAGCACCGAGGGAGAGCAATGGTACTGGACCCGGTAGACGTAAAGATTTTGATTCGGTCTGTGCGATGTCGGGCGTTGATTACAGC")) +(assert (= z "auuauuugguuucga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 new file mode 100644 index 000000000..fe49c8218 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAATTTGAGCAAACTCCTCCTGCCCCAGCGTCATGCCTAATTCCCCTCTTTGGAGGCTTAAGGGGAGATCAAGCTTAATTTAGGTGCAACCTGGTATGCCATTTTACGGTCCCAGGAGAAGTCGTACTGTAGTTCGGGTTTATGGCACTATAAGTAATAACCCTACCGGGTCGAGGTGGCTGCAGCGCCTTACACATCG")) +(assert (= z "ccggugggggacucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 new file mode 100644 index 000000000..466955c10 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGACGAATGAGCTTCGATGAGATCATGACTGCCGCCTGGGACATTTACATCTCGCTCCACCTTAGAACGCGAGCGCATCTGTATTTGCAGGGAGGAGAACACAGCTTCGTTATTAGGAAGCTTCTTGGCTCGTTAAACGGGACTCGCGCACACAGTATCACAATATTACACTATTGTTATAGTTACCGGCCGGTGCTACG")) +(assert (= z "auauucggcccucaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 new file mode 100644 index 000000000..5b59f7630 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAGTGACAGAGAAGAACGCTTACGCTGATAAGTAAGGTTCCACCATCTTGTAACCACAAATGACTGTCGTCATGACTACTATTTGCATGCTTGAGCGCTCAATAGACTCACAAGGACACACGGTTAATGATAAGGCGGCCGCCCGCGCCTGCATTAAGGCGTAAGACCCCCAGTCAGCTCCATGGTCTAACCGTAATG")) +(assert (= z "ccaugucgaaucucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 new file mode 100644 index 000000000..f9a446c42 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACATTCCCTCAACCGCGGGAGGTATCCTCTTGTAGAAGAAGACAGCAAACCGGCACACCCAAGTTTTGGCCCGCGGTGCAGCTGATCGCATGGCTTACTTCTTAGGGCATCCTCTGTCTAATACCATAACTTGCTGGCGACGCCCGCCCAAATCATCTAAGGCACCTCACGTTCCGCGGCGCTATAGGTTATCGGGAC")) +(assert (= z "cuggacauauccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 new file mode 100644 index 000000000..b7257a387 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGTCTCTCTTACCGTCATCGTCGCCTGTTGCCCGGCCAGGCTCACCGGTAGCAGCGACAACGAATCAGAAGCACTTAAAGACTATATGATATAGGTGTCATAAACCCTATTCCACGGTTCGACAGGGCAGCTGCGGAGCGGTGTCTGACGTGTGATTTCGAGAAAAACATAACTACAGTGTGACCCCGGAATGATGAT")) +(assert (= z "cggguagcuugcugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 new file mode 100644 index 000000000..85902cf89 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGTCGTCCTTTAGTAATGCCCTATCTATCCGGCCCCTATCTTAATGGATTCGATTTGAAAGCATGAGCGCTCAGCTTCTTACCTTGCACAGGACTCGTCTGTATTGTAGCAACCCAGAATTTGCATCCCGACGGTAGAACAACTTCGAATATGTCCATGCTCTTTATTGTGGGGGCTGCGTATGTGCTTATTAGGAACG")) +(assert (= z "gagucaaauggugca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 new file mode 100644 index 000000000..95541b440 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACGATACTTATCCGGGCAGTACTCTACCACGTTTCCCTTGCATAGGAATATATCGAAGTCCGTATGACCGACGTTCCGTATACAGAGCCGTAGATTCCACGATCCGTCCTTGAGTCTTCCCTGATTGGCCGTCTAGTTTTTGCCTGGTGAAGCCGCGGTGCTGACGCCGAGGGACCAAATTACTTCGAGCTCTGTGCTC")) +(assert (= z "gcaguaguuccggcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 new file mode 100644 index 000000000..807213628 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGTCTACACCTCCCCGATGTATAATAGCGCTGAAAATCTCCATATCGGTTCGCTTGGGAAGCAACATTCGCCGCCCAAAAACAATTAGACTCCAGCCGTAGGAGCTAGTCCCATTCTCATTTCCTGCACTACAATGTCTGCATTACGCATTGGAGCAACTACGGAGGCACTTGTAGTGTTGTCTTTGACTCCTCGCTGG")) +(assert (= z "gaguggcuucccgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 new file mode 100644 index 000000000..309685fdd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTCCCAACGTACGGTGGGAAGGTCAAGCTGCCACTACACTCACGGTGTAAGCGTATCTAGGGAGTTCAAAGGGCATTCCGAGCTCGAAAAGGCAATCGATTGTAGTGTTCGCAGATATACCATAGGACTCCACGGAAGAGATAATGTTGGTTTCGACGTATTCCCGAAAAGATGCGCTTTCACGTGATGCAGGCATTA")) +(assert (= z "ugccggagcggaagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 new file mode 100644 index 000000000..dca354d46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATATACGTAAGCCACAAGTGAAGCGGGCCCAAGCTCGCCTTCCGTAAGGTATCTGATGGCGTCTCTAAATCCCCTATACCGCCACTTTCTTGGGGTCCTTCCTACTTCCCCCCAAATTACACCATTTAGTAGGCTCTTACCAAGCTATGACCGTCTGCCGCGGGCTGCCTCATTTTCTCCATACTGAGGACGCACACTA")) +(assert (= z "gcucgcuugaauuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 new file mode 100644 index 000000000..aaf3da5da --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATCAACAACATCCATGTTGTAGGGGCAAAGGTTACGTGGATCTAACAACCAAAAACAATCTGCAAGCCTCTCCAGGCGTCTAAATTTAGATTCCGATTACGTGAACGGGTGGGCTTCAGACTTTGCTATCACTCATAGCACAGACGTTATATGGTTAAGATGCTACATATGAGCGGGTCGTTTGCTCCTGGGACCCCTT")) +(assert (= z "guaccuugacgauuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 new file mode 100644 index 000000000..5be76d920 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGAACCTGATCCTAATTTTTGCTGGGTCTATGAACACTGCCCGACCAACCCTTCAAAACGCCATCTAACCAGAGGTATCGGGTTATAAAAGAGTTCCGCTCGTTACGAGGCAATGTGGTCCGGACACCTCATGAGGACCGAACCGCATGCCTAACTCTAAAAGGAGGCGGAACCCGCAAAGTAGACTACCCCAAGTGC")) +(assert (= z "aagaaacuguaugag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 new file mode 100644 index 000000000..3edca2f3e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCACTCGAAGTAGCATTCTCGTGATGAGGGATCTGTTACGAGGCTGTCATGATCTCCGAATCCTGTCCGCTAGGCACGTAAGCCATGACCAGGGACCAGCACTAAGGTTGACCCGCGGTATCTACTGATCCTAAACAGAATCTCTGGAATGCGCGGTCCCCATGCCCACCCCCATACGTACCGAGTGTACCTAGAGCAG")) +(assert (= z "aguccgauuguugcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 new file mode 100644 index 000000000..0c0c8817d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTGACAGAGTTATGTGGTCTCTCGCAACGCCGCGACTGAGCCATGGTTCGTTTCTTACAGGTGCCCTGTGAATTGTGCGGAGATTCGTCTATCGCCACACTACATGGGTAAAGTATGCACCGTTTTTCACAAGTCATCCCTTTTCTTTTCCATAGCGTGAAAGAGGGAGCGACCCGACTATATATGCTTATCCGTACTC")) +(assert (= z "auccucacacaauaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 new file mode 100644 index 000000000..503418f8a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTCGATCGAAGCACCAAAAGGTTTCCCGCGCTAAATCCTTAAATACCGGTCTTAGCAAAGGCACGCCCCGCGCTGATATCTCTATCGCATAACCTCTTGCGCCAAGTGATACCACGGCACCATCGCAGGTTGAAGGATACTCATAAGGACAATTCTTCCATATGCCGGCATTCATACATCACGGGCCCCGTCAGATATA")) +(assert (= z "uugcaauauucagua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 new file mode 100644 index 000000000..9f7daadc9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGCCATTACTCCCAAACATGGCGTCGAGGGTCACCAAGCCGTCGACCAGAGTACGATACCAGCCGTCACCACCGCGCCGCTGAGTGCTTATACGCTTCTAATGGCACCACCCTGCGCTTGGAGGCGGATTTCTTGTCGTTCATGACACCGAGAAGGGGGTTCAGGCTCTAAGTCAGAACGGAGGAAATCATAAAGCCA")) +(assert (= z "aaauccucugacccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 new file mode 100644 index 000000000..9ca7b32a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGGACTAATCAAAGCCACCCAGCACTTTTGAACAGCGCCAAGGTAGGAGGGCCGCCAATGTTATTGTATAAGAATATGTAACGGGCTCTACGGGGTACCGCCTTAGGCCGATTATAGGACACATATCTGGGTTCGTTTCCTGCGGTGGATTATATTCACGCTCAACGGAGGTTTCGGATTTACACTTGGCTGCTAAAT")) +(assert (= z "ccguugugucaggac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 new file mode 100644 index 000000000..55cbad679 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACATTCCCCGCAGAGAACCATATTCCTGCACCCGCCGCCCAGTCAGTGAAAGCATAAACTCAGTTCTGTACCAACCCAAAAGGCCGAGGTGTGGCTTAATCATCACGATGTTCCGATTGATCCCGAAGGGCAACTTCTTTTTATGGCTGAAAATCGCTCTCTTTCATACACACCACAAACATACCACGGCTCCAAAGATA")) +(assert (= z "ccacccgaaguuuga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 new file mode 100644 index 000000000..b8edf9434 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCCTCCTTTACCTTGTTGACGCAGTTCTGGTAATAGACGATAAGCGTGAGCCACGGGGGCGTAGGCCGGCAATCACTAGAGTCTCACATAGATTTTTGTCCGACAACGTACAAGCTCGATGCCGCTATAGACACTGAGTAGCAAATGAATACGTGCTATACGGTTTGCTCATGTCATGAACTACGGGGCATACTATCT")) +(assert (= z "cucuaagcuaugucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 new file mode 100644 index 000000000..2aacb0860 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCGGAGTTGACCCTACAGCCCTGATACAGTGTGGTACCAAGGTTTTTTGCAGATCTCAACATCCACACCACATCCGCATATGTTGACATCATGGTAGCCCAGACTGATATCGCTATACGCCCTGGACAAAAGGGACGATTCTGGCATTTCGTGAAATTCGCATAGCGGATTCTGGGGGGCAAGCATGCGATGTGGCAAC")) +(assert (= z "acgcuggacuuggac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 new file mode 100644 index 000000000..0dc728ec9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTAGTTCATGGGGTGAGGCTTAGAAGTAATGACCATGGCCTCTTAAATGTTCATGCGGCGCAGAGGGCATCACACCAGGATGAGCCGCTCGACTCTCCTGCGCGGTACCCACAGCCGACGGAGGAATAGAATGACACGCCCATGACGCCTCACCGGTCCACGTACGGAGTAGTAATGGCAACTTGGCTCGACCCTTCGT")) +(assert (= z "cgucugaauccgaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 new file mode 100644 index 000000000..94c4fbe7b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGACAGCACCGAAAAGTTCCTACGAGAGACATGACCTCATTCTATGTCCGCGACGAACGCGTGTCATAGAGTAGTTGAAGCAGGTGCGGAAACTTCGCACGTGCCTTCCAAGCTGTGGAGGTTTCAGATATGACAATATGTTTTAGGCAGGGTATGAGAATTGGAACACCAACATCTCCGTCCCACTCCCGGGTCGGCG")) +(assert (= z "uuuuaugucaaagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 new file mode 100644 index 000000000..afee6c674 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCCCCCTAACTGTAGATTGTATTGAAACTATACTCGCTGATACAGCCTGGGTCTAGGAATCAAAATGACCTCATTCACGTTTGAGCGGATCTAAGGTATTCCACTGACCCCAACGTTGTCCCCGCTATTTAGTCCCGCCAAGACTGATGTTGGGTCGATACCTACTTCAGCGGGATTGGCCGACATTTCAGAACCAGCA")) +(assert (= z "auagcgcaugauguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 new file mode 100644 index 000000000..80741e511 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTGAGTCACCAACACTCCACTTGACTAAAACCCCCATCGCGACATCAACTAAACAGGGACTCACTCGATAGCGGCTGCAGCTACTTACTTATACACCTTACCTTAGATCATCTCGGTTGTGAGAAGTAATCTGTTTTGACCTATAGCACATGTACCATCTTGTGGCGCACGGTAGCGAGATAATTTTCTGATACCCGAG")) +(assert (= z "cguccucccaagggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 new file mode 100644 index 000000000..cde51fb24 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCGCATTGCCGTTGATAGTATTCTCATCGTCACCAATCCAAAAAGGGTAGCTTCATCAGGCATAAAAATCGTAAGCTCTAGGTAAACGTCATTCAACCGTCGAAGAGCCCATCGAAATCAATTGGTACAAAACTTAAGCTTGGCAACATTAGGTGCACACAGTTCTTAAGCAACTGTGCTGCACGTGCCAGAGAGAACT")) +(assert (= z "cuuccacuugccucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 new file mode 100644 index 000000000..ac6c315fe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTATGCTTGTGCATATCGGTTCTAATTTTCCCCATCGAGGGGGTAGAGGGCGTAAATAGGGCTTCCAGCATGCACATGATAGAACCTTGGAACCTTCACAACTTTCCACATGGTTGCGGGGTCAAGGAGGCCTGCATGACGCGCTCCAACCTCCTGTTCCCAGAGCCTCTGCGGATATCCGGCTTTCTAGCGATTCCGA")) +(assert (= z "aucagaugggagcug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 new file mode 100644 index 000000000..944b5bc04 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATTATCTTTTCTGATCCATAGGCAATTATATACCACATGCAAGCCCGTTCGGGAAGGCGGAGAACCGAAAGTCAATTCGACCGCAACTATAAGTTACGTAGTTGTATGGCGATGTAGGGGAGATAACCTCCCGTGCGAGGTTTCGCTATCTGACGCACTGAAAGGAGAAAGAAAGGATTGATGCCGACAACAGTTGACC")) +(assert (= z "gaugcgccaguacua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 new file mode 100644 index 000000000..d2027daf8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTATCATGTGACAGTGGATTCCAGTACGCAAGAATTTCGGGTCCTAGCGCAATAGCCCCATTGCCATGCACCGGTTGGAATTTATTTCGGCAAGCAGTATACGACTTGGGATCTGCAATGTCGTTTATCCTTACTGGCGTAGAGGTTCTTAGAAGAATCACTATGGACCTTATGCGTGGTTAATGGATCACGTTAGAGT")) +(assert (= z "ccaccccgaacucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 new file mode 100644 index 000000000..d38e86f73 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTTTGCACAGTGCCTGGCGCGTGATTCAGTACTAGCCAGACGGGAATCCGAGGGACCGTGTCGACAAGAGGTCACTTTTTATGTCCTTGTGGGCCGGGGCCGTACGGGCTTGTGGTAGAACTCGAGGAGTTGCTTTGTGGAAATCTAGCTGCTTCACCACATTCTAGATGCGGTGGGACTTGACGGTATGATAGAGTTG")) +(assert (= z "uauguucccaucgua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 new file mode 100644 index 000000000..044f27243 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGTCTCATACTAGAGGAAGAGATATGTTCGATTTTCCCGTTCTCCATATCCCCGGACGCTGAGCTTGAGGGGATGTAAACGACAACATTCCGCATCAATATGGATCCCGACTCGCAAAGACAAGGTGCCAACCGGCCACTGCCTTACACGTTCCTTTAAGCCACAGTTCATACGAGCCAATAACTCTTGTGGATAGGG")) +(assert (= z "aaucagacuugggca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 new file mode 100644 index 000000000..14b7b092f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCAAGCGCCGTGTTACGGAATTACTTTCTGTGCCAGATGTACAGGAAAACCGAGTACGCTTGGCCTTAATTCGCGTATGTATCCTTCGTGCTACAAACCCGATCCTCAAGGACAGTACGGCGGAGCTCGCGGCAGATTCTCATCAATGTTCTTAATGTTACATTCCAACATGGAGGAGCCACGGACTTATTACATACTG")) +(assert (= z "uaaauccuaccucau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 new file mode 100644 index 000000000..44b77b30a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAAGCACTTGTCCGGCTAGCATGGGATCTATATCGCAATCACCTGTTCATTTGTTAAGGTCGCGCTTAGGGTACACGTAACATGCGGGGCTCGTATGAGGGGGCACGAGGGTGACATAATGCGAGTTGCAGCACTAAGATATGACGTAACGTTTTTAAGGTTGATGTATACATGCTTGCGGCCCCAATGACCGATCCTA")) +(assert (= z "gaaccgauuuuugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 new file mode 100644 index 000000000..5614d69bb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCAACAGTGTAGGGGTCGTAGGGACATGACATGTCCCGATAATTCACATCCACAAGGTCAAGTTCCCGCGAGACGTATGATGTAGCCGTCGCCACTATGGCCCTAAGCCGAAACATGATGACAAGGACCACGAGCCAGGATGCGTGGCCCAGAAGGTAGAACGATAATGGCGTACGCTACAAACTCTTGGGATCCGCGA")) +(assert (= z "ugucaucacuccgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 new file mode 100644 index 000000000..10abcbf88 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGTCATCCCGTGCGAGATAACGTATTAACCCCCCTCAGAAAAGACGCTGCATCTGATTTCCGGGCTCTTTTTATGTCCGACAAAAGGGGAATATGGTCAGCCCAGATATCCGATGCAGGGATTCAATTCCTGCAAGAAGTTCTCCGTAGCCCCTTGCATTGATCGCGTAACACAAGTAACTTAGTGGGGTTGAGACGGC")) +(assert (= z "gauuauucauguagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 new file mode 100644 index 000000000..e6e8e7bca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCTGACAAGTCTGCATTAGTCTAAGGAGTGATAACATAACCAAGACGCGGAGGACACTAGTGTGATCAATTATCAAGCGCGTTGGGCCGTGGGTAGGGGAGATGGAGATCCTGAGTCGGACTTGTATCTGCGGTGCGGCCCCCCCGTGTGCCGGATCATTATGTAGCGAGTGTACCGGGTGCGGAGGAGCTGACTTCCT")) +(assert (= z "gccagagccgaucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 new file mode 100644 index 000000000..be48fa3e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGCTCTCACGGACATCTGACCTCGGGAACCGATTTGTTCGACCATGTGGTTAGAAGTTGAGTAGCAGGCCGTTAGAGCTGTATTATGGCAAATCAAGGTTTTATAGTGGTCAAATCACCATATGAACACTGGTGCAAGGTATGAGCATTGATAGATAGGCCGACAGGGATGCCCGGTCCGGCCTATAATTCATACAAGG")) +(assert (= z "uuaccaccguccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 new file mode 100644 index 000000000..450fb9658 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCATACCCCGTCGGAGATGCGTTATGAGTTCTGTTCTAAACCAGCGGCGAAGCGCCCTTTTCGGTGATACACTTGCGCCATCGAATTGCCTCGCCCTGTCATAATATGTAATAGCCAGGCCCTTATCCTACGTATCGGTTTCCCATACGATTCCCAAGCAGGAGGGCTCCACAGCAAGTCACTGATTCGACCCAAAC")) +(assert (= z "cagcuuuugucguua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 new file mode 100644 index 000000000..aaf317160 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTAACCAGCATATACCTTGTCAAGATGAGCCTAGTGCGACATCACTGGGCAGGACGATCGCTCTTGAGTCTCCGGGCTTGATGTAGCCGAGAATGATAGTCCTAAGGAATAAATTGTGTTATGTCTCTAGAGATTGTCGACGGTAGCCAGCTAAGTCAGCGTGATCCAAGAAGGAGCCTGTACAAACCTGCTTATTCGCT")) +(assert (= z "caaugaggaugugga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 new file mode 100644 index 000000000..24a0341fe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCGTGGCTCCAATCGATACACGACGCACTTATGATCAAACATTTACATATGAAGTGAGTGGATGGAAAGTCGGCAGAGGCCCAGTTGCGCTACACCATCGGCGTTGAAGACCGACGTAGAAGGTAGCGGCGCGGTGAAGCAACTATAGACTGTCAGTTATAGGAAAAGCGGTGGCGAAGAAACGCCATACCGTTATGCC")) +(assert (= z "gagugcuuaagugga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) From f6259542cde2e5fbd7020f89bcf3ec7ba66723b3 Mon Sep 17 00:00:00 2001 From: Oliver Markgraf Date: Tue, 15 Apr 2025 16:07:22 +0200 Subject: [PATCH 2/2] empty space and restructure --- .../pcp_instance_500.smt2 | 53 ----------------- .../pcp_instance_501.smt2 | 53 ----------------- .../pcp_instance_502.smt2 | 53 ----------------- .../pcp_instance_503.smt2 | 53 ----------------- .../pcp_instance_504.smt2 | 53 ----------------- .../pcp_instance_505.smt2 | 53 ----------------- .../pcp_instance_506.smt2 | 53 ----------------- .../pcp_instance_507.smt2 | 53 ----------------- .../pcp_instance_508.smt2 | 53 ----------------- .../pcp_instance_509.smt2 | 53 ----------------- .../pcp_instance_510.smt2 | 53 ----------------- .../pcp_instance_511.smt2 | 53 ----------------- .../pcp_instance_512.smt2 | 53 ----------------- .../pcp_instance_513.smt2 | 53 ----------------- .../pcp_instance_514.smt2 | 53 ----------------- .../pcp_instance_515.smt2 | 53 ----------------- .../pcp_instance_516.smt2 | 53 ----------------- .../pcp_instance_517.smt2 | 53 ----------------- .../pcp_instance_518.smt2 | 53 ----------------- .../pcp_instance_519.smt2 | 53 ----------------- .../pcp_instance_520.smt2 | 53 ----------------- .../pcp_instance_521.smt2 | 53 ----------------- .../pcp_instance_522.smt2 | 53 ----------------- .../pcp_instance_523.smt2 | 53 ----------------- .../pcp_instance_524.smt2 | 53 ----------------- .../pcp_instance_525.smt2 | 53 ----------------- .../pcp_instance_526.smt2 | 53 ----------------- .../pcp_instance_527.smt2 | 53 ----------------- .../pcp_instance_528.smt2 | 53 ----------------- .../pcp_instance_529.smt2 | 53 ----------------- .../pcp_instance_530.smt2 | 53 ----------------- .../pcp_instance_531.smt2 | 53 ----------------- .../pcp_instance_532.smt2 | 53 ----------------- .../pcp_instance_533.smt2 | 53 ----------------- .../pcp_instance_534.smt2 | 53 ----------------- .../pcp_instance_535.smt2 | 53 ----------------- .../pcp_instance_536.smt2 | 53 ----------------- .../pcp_instance_537.smt2 | 53 ----------------- .../pcp_instance_538.smt2 | 53 ----------------- .../pcp_instance_539.smt2 | 53 ----------------- .../pcp_instance_540.smt2 | 53 ----------------- .../pcp_instance_541.smt2 | 53 ----------------- .../pcp_instance_542.smt2 | 53 ----------------- .../pcp_instance_543.smt2 | 53 ----------------- .../pcp_instance_544.smt2 | 53 ----------------- .../pcp_instance_545.smt2 | 53 ----------------- .../pcp_instance_546.smt2 | 53 ----------------- .../pcp_instance_547.smt2 | 53 ----------------- .../pcp_instance_548.smt2 | 53 ----------------- .../pcp_instance_549.smt2 | 53 ----------------- .../pcp_instance_550.smt2 | 53 ----------------- .../pcp_instance_551.smt2 | 53 ----------------- .../pcp_instance_552.smt2 | 53 ----------------- .../pcp_instance_553.smt2 | 53 ----------------- .../pcp_instance_554.smt2 | 53 ----------------- .../pcp_instance_555.smt2 | 53 ----------------- .../pcp_instance_556.smt2 | 53 ----------------- .../pcp_instance_557.smt2 | 53 ----------------- .../pcp_instance_558.smt2 | 53 ----------------- .../pcp_instance_559.smt2 | 53 ----------------- .../pcp_instance_560.smt2 | 53 ----------------- .../pcp_instance_561.smt2 | 53 ----------------- .../pcp_instance_562.smt2 | 53 ----------------- .../pcp_instance_563.smt2 | 53 ----------------- .../pcp_instance_564.smt2 | 53 ----------------- .../pcp_instance_565.smt2 | 53 ----------------- .../pcp_instance_566.smt2 | 53 ----------------- .../pcp_instance_567.smt2 | 53 ----------------- .../pcp_instance_568.smt2 | 53 ----------------- .../pcp_instance_569.smt2 | 53 ----------------- .../pcp_instance_570.smt2 | 53 ----------------- .../pcp_instance_571.smt2 | 53 ----------------- .../pcp_instance_572.smt2 | 53 ----------------- .../pcp_instance_573.smt2 | 53 ----------------- .../pcp_instance_574.smt2 | 53 ----------------- .../pcp_instance_575.smt2 | 53 ----------------- .../pcp_instance_576.smt2 | 53 ----------------- .../pcp_instance_577.smt2 | 53 ----------------- .../pcp_instance_578.smt2 | 53 ----------------- .../pcp_instance_579.smt2 | 53 ----------------- .../pcp_instance_580.smt2 | 53 ----------------- .../pcp_instance_581.smt2 | 53 ----------------- .../pcp_instance_582.smt2 | 53 ----------------- .../pcp_instance_583.smt2 | 53 ----------------- .../pcp_instance_584.smt2 | 53 ----------------- .../pcp_instance_585.smt2 | 53 ----------------- .../pcp_instance_586.smt2 | 53 ----------------- .../pcp_instance_587.smt2 | 53 ----------------- .../pcp_instance_588.smt2 | 53 ----------------- .../pcp_instance_589.smt2 | 53 ----------------- .../pcp_instance_590.smt2 | 53 ----------------- .../pcp_instance_591.smt2 | 53 ----------------- .../pcp_instance_592.smt2 | 53 ----------------- .../pcp_instance_593.smt2 | 53 ----------------- .../pcp_instance_594.smt2 | 53 ----------------- .../pcp_instance_595.smt2 | 53 ----------------- .../pcp_instance_596.smt2 | 53 ----------------- .../pcp_instance_597.smt2 | 53 ----------------- .../pcp_instance_598.smt2 | 53 ----------------- .../pcp_instance_599.smt2 | 53 ----------------- .../pcp_instance_600.smt2 | 53 ----------------- .../pcp_instance_601.smt2 | 53 ----------------- .../pcp_instance_602.smt2 | 53 ----------------- .../pcp_instance_603.smt2 | 53 ----------------- .../pcp_instance_604.smt2 | 53 ----------------- .../pcp_instance_605.smt2 | 53 ----------------- .../pcp_instance_606.smt2 | 53 ----------------- .../pcp_instance_607.smt2 | 53 ----------------- .../pcp_instance_608.smt2 | 53 ----------------- .../pcp_instance_609.smt2 | 53 ----------------- .../pcp_instance_610.smt2 | 53 ----------------- .../pcp_instance_611.smt2 | 53 ----------------- .../pcp_instance_612.smt2 | 53 ----------------- .../pcp_instance_613.smt2 | 53 ----------------- .../pcp_instance_614.smt2 | 53 ----------------- .../pcp_instance_615.smt2 | 53 ----------------- .../pcp_instance_616.smt2 | 53 ----------------- .../pcp_instance_617.smt2 | 53 ----------------- .../pcp_instance_618.smt2 | 53 ----------------- .../pcp_instance_619.smt2 | 53 ----------------- .../pcp_instance_620.smt2 | 53 ----------------- .../pcp_instance_621.smt2 | 53 ----------------- .../pcp_instance_622.smt2 | 53 ----------------- .../pcp_instance_623.smt2 | 53 ----------------- .../pcp_instance_624.smt2 | 53 ----------------- .../pcp_instance_625.smt2 | 53 ----------------- .../pcp_instance_626.smt2 | 53 ----------------- .../pcp_instance_627.smt2 | 53 ----------------- .../pcp_instance_628.smt2 | 53 ----------------- .../pcp_instance_629.smt2 | 53 ----------------- .../pcp_instance_630.smt2 | 53 ----------------- .../pcp_instance_631.smt2 | 53 ----------------- .../pcp_instance_632.smt2 | 53 ----------------- .../pcp_instance_633.smt2 | 53 ----------------- .../pcp_instance_634.smt2 | 53 ----------------- .../pcp_instance_635.smt2 | 53 ----------------- .../pcp_instance_636.smt2 | 53 ----------------- .../pcp_instance_637.smt2 | 53 ----------------- .../pcp_instance_638.smt2 | 53 ----------------- .../pcp_instance_639.smt2 | 53 ----------------- .../pcp_instance_640.smt2 | 53 ----------------- .../pcp_instance_641.smt2 | 53 ----------------- .../pcp_instance_642.smt2 | 53 ----------------- .../pcp_instance_643.smt2 | 53 ----------------- .../pcp_instance_644.smt2 | 53 ----------------- .../pcp_instance_645.smt2 | 53 ----------------- .../pcp_instance_646.smt2 | 53 ----------------- .../pcp_instance_647.smt2 | 53 ----------------- .../pcp_instance_648.smt2 | 53 ----------------- .../pcp_instance_649.smt2 | 53 ----------------- .../pcp_instance_650.smt2 | 53 ----------------- .../pcp_instance_651.smt2 | 53 ----------------- .../pcp_instance_652.smt2 | 53 ----------------- .../pcp_instance_653.smt2 | 53 ----------------- .../pcp_instance_654.smt2 | 53 ----------------- .../pcp_instance_655.smt2 | 53 ----------------- .../pcp_instance_656.smt2 | 53 ----------------- .../pcp_instance_657.smt2 | 53 ----------------- .../pcp_instance_658.smt2 | 53 ----------------- .../pcp_instance_659.smt2 | 53 ----------------- .../pcp_instance_660.smt2 | 53 ----------------- .../pcp_instance_661.smt2 | 53 ----------------- .../pcp_instance_662.smt2 | 53 ----------------- .../pcp_instance_663.smt2 | 53 ----------------- .../pcp_instance_664.smt2 | 53 ----------------- .../pcp_instance_665.smt2 | 53 ----------------- .../pcp_instance_666.smt2 | 53 ----------------- .../pcp_instance_667.smt2 | 53 ----------------- .../pcp_instance_668.smt2 | 53 ----------------- .../pcp_instance_669.smt2 | 53 ----------------- .../pcp_instance_670.smt2 | 53 ----------------- .../pcp_instance_671.smt2 | 53 ----------------- .../pcp_instance_672.smt2 | 53 ----------------- .../pcp_instance_673.smt2 | 53 ----------------- .../pcp_instance_674.smt2 | 53 ----------------- .../pcp_instance_675.smt2 | 53 ----------------- .../pcp_instance_676.smt2 | 53 ----------------- .../pcp_instance_677.smt2 | 53 ----------------- .../pcp_instance_678.smt2 | 53 ----------------- .../pcp_instance_679.smt2 | 53 ----------------- .../pcp_instance_680.smt2 | 53 ----------------- .../pcp_instance_681.smt2 | 53 ----------------- .../pcp_instance_682.smt2 | 53 ----------------- .../pcp_instance_683.smt2 | 53 ----------------- .../pcp_instance_684.smt2 | 53 ----------------- .../pcp_instance_685.smt2 | 53 ----------------- .../pcp_instance_686.smt2 | 53 ----------------- .../pcp_instance_687.smt2 | 53 ----------------- .../pcp_instance_688.smt2 | 53 ----------------- .../pcp_instance_689.smt2 | 53 ----------------- .../pcp_instance_690.smt2 | 53 ----------------- .../pcp_instance_691.smt2 | 53 ----------------- .../pcp_instance_692.smt2 | 53 ----------------- .../pcp_instance_693.smt2 | 53 ----------------- .../pcp_instance_694.smt2 | 53 ----------------- .../pcp_instance_695.smt2 | 53 ----------------- .../pcp_instance_696.smt2 | 53 ----------------- .../pcp_instance_697.smt2 | 53 ----------------- .../pcp_instance_698.smt2 | 53 ----------------- .../pcp_instance_699.smt2 | 53 ----------------- .../pcp_instance_700.smt2 | 53 ----------------- .../pcp_instance_701.smt2 | 53 ----------------- .../pcp_instance_702.smt2 | 53 ----------------- .../pcp_instance_703.smt2 | 53 ----------------- .../pcp_instance_704.smt2 | 53 ----------------- .../pcp_instance_705.smt2 | 53 ----------------- .../pcp_instance_706.smt2 | 53 ----------------- .../pcp_instance_707.smt2 | 53 ----------------- .../pcp_instance_708.smt2 | 53 ----------------- .../pcp_instance_709.smt2 | 53 ----------------- .../pcp_instance_710.smt2 | 53 ----------------- .../pcp_instance_711.smt2 | 53 ----------------- .../pcp_instance_712.smt2 | 53 ----------------- .../pcp_instance_713.smt2 | 53 ----------------- .../pcp_instance_714.smt2 | 53 ----------------- .../pcp_instance_715.smt2 | 53 ----------------- .../pcp_instance_716.smt2 | 53 ----------------- .../pcp_instance_717.smt2 | 53 ----------------- .../pcp_instance_718.smt2 | 53 ----------------- .../pcp_instance_719.smt2 | 53 ----------------- .../pcp_instance_720.smt2 | 53 ----------------- .../pcp_instance_721.smt2 | 53 ----------------- .../pcp_instance_722.smt2 | 53 ----------------- .../pcp_instance_723.smt2 | 53 ----------------- .../pcp_instance_724.smt2 | 53 ----------------- .../pcp_instance_725.smt2 | 53 ----------------- .../pcp_instance_726.smt2 | 53 ----------------- .../pcp_instance_727.smt2 | 53 ----------------- .../pcp_instance_728.smt2 | 53 ----------------- .../pcp_instance_729.smt2 | 53 ----------------- .../pcp_instance_730.smt2 | 53 ----------------- .../pcp_instance_731.smt2 | 53 ----------------- .../pcp_instance_732.smt2 | 53 ----------------- .../pcp_instance_733.smt2 | 53 ----------------- .../pcp_instance_734.smt2 | 53 ----------------- .../pcp_instance_735.smt2 | 53 ----------------- .../pcp_instance_736.smt2 | 53 ----------------- .../pcp_instance_737.smt2 | 53 ----------------- .../pcp_instance_738.smt2 | 53 ----------------- .../pcp_instance_739.smt2 | 53 ----------------- .../pcp_instance_740.smt2 | 53 ----------------- .../pcp_instance_741.smt2 | 53 ----------------- .../pcp_instance_742.smt2 | 53 ----------------- .../pcp_instance_743.smt2 | 53 ----------------- .../pcp_instance_744.smt2 | 53 ----------------- .../pcp_instance_745.smt2 | 53 ----------------- .../pcp_instance_746.smt2 | 53 ----------------- .../pcp_instance_747.smt2 | 53 ----------------- .../pcp_instance_748.smt2 | 53 ----------------- .../pcp_instance_749.smt2 | 53 ----------------- .../pcp_instance_750.smt2 | 53 ----------------- .../pcp_instance_751.smt2 | 53 ----------------- .../pcp_instance_752.smt2 | 53 ----------------- .../pcp_instance_753.smt2 | 53 ----------------- .../pcp_instance_754.smt2 | 53 ----------------- .../pcp_instance_755.smt2 | 53 ----------------- .../pcp_instance_756.smt2 | 53 ----------------- .../pcp_instance_757.smt2 | 53 ----------------- .../pcp_instance_758.smt2 | 53 ----------------- .../pcp_instance_759.smt2 | 53 ----------------- .../pcp_instance_760.smt2 | 53 ----------------- .../pcp_instance_761.smt2 | 53 ----------------- .../pcp_instance_762.smt2 | 53 ----------------- .../pcp_instance_763.smt2 | 53 ----------------- .../pcp_instance_764.smt2 | 53 ----------------- .../pcp_instance_765.smt2 | 53 ----------------- .../pcp_instance_766.smt2 | 53 ----------------- .../pcp_instance_767.smt2 | 53 ----------------- .../pcp_instance_768.smt2 | 53 ----------------- .../pcp_instance_769.smt2 | 53 ----------------- .../pcp_instance_770.smt2 | 53 ----------------- .../pcp_instance_771.smt2 | 53 ----------------- .../pcp_instance_772.smt2 | 53 ----------------- .../pcp_instance_773.smt2 | 53 ----------------- .../pcp_instance_774.smt2 | 53 ----------------- .../pcp_instance_775.smt2 | 53 ----------------- .../pcp_instance_776.smt2 | 53 ----------------- .../pcp_instance_777.smt2 | 53 ----------------- .../pcp_instance_778.smt2 | 53 ----------------- .../pcp_instance_779.smt2 | 53 ----------------- .../pcp_instance_780.smt2 | 53 ----------------- .../pcp_instance_781.smt2 | 53 ----------------- .../pcp_instance_782.smt2 | 53 ----------------- .../pcp_instance_783.smt2 | 53 ----------------- .../pcp_instance_784.smt2 | 53 ----------------- .../pcp_instance_785.smt2 | 53 ----------------- .../pcp_instance_786.smt2 | 53 ----------------- .../pcp_instance_787.smt2 | 53 ----------------- .../pcp_instance_788.smt2 | 53 ----------------- .../pcp_instance_789.smt2 | 53 ----------------- .../pcp_instance_790.smt2 | 53 ----------------- .../pcp_instance_791.smt2 | 53 ----------------- .../pcp_instance_792.smt2 | 53 ----------------- .../pcp_instance_793.smt2 | 53 ----------------- .../pcp_instance_794.smt2 | 53 ----------------- .../pcp_instance_795.smt2 | 53 ----------------- .../pcp_instance_796.smt2 | 53 ----------------- .../pcp_instance_797.smt2 | 53 ----------------- .../pcp_instance_798.smt2 | 53 ----------------- .../pcp_instance_799.smt2 | 53 ----------------- .../pcp_instance_800.smt2 | 53 ----------------- .../pcp_instance_801.smt2 | 53 ----------------- .../pcp_instance_802.smt2 | 53 ----------------- .../pcp_instance_803.smt2 | 53 ----------------- .../pcp_instance_804.smt2 | 53 ----------------- .../pcp_instance_805.smt2 | 53 ----------------- .../pcp_instance_806.smt2 | 53 ----------------- .../pcp_instance_807.smt2 | 53 ----------------- .../pcp_instance_808.smt2 | 53 ----------------- .../pcp_instance_809.smt2 | 53 ----------------- .../pcp_instance_810.smt2 | 53 ----------------- .../pcp_instance_811.smt2 | 53 ----------------- .../pcp_instance_812.smt2 | 53 ----------------- .../pcp_instance_813.smt2 | 53 ----------------- .../pcp_instance_814.smt2 | 53 ----------------- .../pcp_instance_815.smt2 | 53 ----------------- .../pcp_instance_816.smt2 | 53 ----------------- .../pcp_instance_817.smt2 | 53 ----------------- .../pcp_instance_818.smt2 | 53 ----------------- .../pcp_instance_819.smt2 | 53 ----------------- .../pcp_instance_820.smt2 | 53 ----------------- .../pcp_instance_821.smt2 | 53 ----------------- .../pcp_instance_822.smt2 | 53 ----------------- .../pcp_instance_823.smt2 | 53 ----------------- .../pcp_instance_824.smt2 | 53 ----------------- .../pcp_instance_825.smt2 | 53 ----------------- .../pcp_instance_826.smt2 | 53 ----------------- .../pcp_instance_827.smt2 | 53 ----------------- .../pcp_instance_828.smt2 | 53 ----------------- .../pcp_instance_829.smt2 | 53 ----------------- .../pcp_instance_830.smt2 | 53 ----------------- .../pcp_instance_831.smt2 | 53 ----------------- .../pcp_instance_832.smt2 | 53 ----------------- .../pcp_instance_833.smt2 | 53 ----------------- .../pcp_instance_834.smt2 | 53 ----------------- .../pcp_instance_835.smt2 | 53 ----------------- .../pcp_instance_836.smt2 | 53 ----------------- .../pcp_instance_837.smt2 | 53 ----------------- .../pcp_instance_838.smt2 | 53 ----------------- .../pcp_instance_839.smt2 | 53 ----------------- .../pcp_instance_840.smt2 | 53 ----------------- .../pcp_instance_841.smt2 | 53 ----------------- .../pcp_instance_842.smt2 | 53 ----------------- .../pcp_instance_843.smt2 | 53 ----------------- .../pcp_instance_844.smt2 | 53 ----------------- .../pcp_instance_845.smt2 | 53 ----------------- .../pcp_instance_846.smt2 | 53 ----------------- .../pcp_instance_847.smt2 | 53 ----------------- .../pcp_instance_848.smt2 | 53 ----------------- .../pcp_instance_849.smt2 | 53 ----------------- .../pcp_instance_850.smt2 | 53 ----------------- .../pcp_instance_851.smt2 | 53 ----------------- .../pcp_instance_852.smt2 | 53 ----------------- .../pcp_instance_853.smt2 | 53 ----------------- .../pcp_instance_854.smt2 | 53 ----------------- .../pcp_instance_855.smt2 | 53 ----------------- .../pcp_instance_856.smt2 | 53 ----------------- .../pcp_instance_857.smt2 | 53 ----------------- .../pcp_instance_858.smt2 | 53 ----------------- .../pcp_instance_859.smt2 | 53 ----------------- .../pcp_instance_860.smt2 | 53 ----------------- .../pcp_instance_861.smt2 | 53 ----------------- .../pcp_instance_862.smt2 | 53 ----------------- .../pcp_instance_863.smt2 | 53 ----------------- .../pcp_instance_864.smt2 | 53 ----------------- .../pcp_instance_865.smt2 | 53 ----------------- .../pcp_instance_866.smt2 | 53 ----------------- .../pcp_instance_867.smt2 | 53 ----------------- .../pcp_instance_868.smt2 | 53 ----------------- .../pcp_instance_869.smt2 | 53 ----------------- .../pcp_instance_870.smt2 | 53 ----------------- .../pcp_instance_871.smt2 | 53 ----------------- .../pcp_instance_872.smt2 | 53 ----------------- .../pcp_instance_873.smt2 | 53 ----------------- .../pcp_instance_874.smt2 | 53 ----------------- .../pcp_instance_875.smt2 | 53 ----------------- .../pcp_instance_876.smt2 | 53 ----------------- .../pcp_instance_877.smt2 | 53 ----------------- .../pcp_instance_878.smt2 | 53 ----------------- .../pcp_instance_879.smt2 | 53 ----------------- .../pcp_instance_880.smt2 | 53 ----------------- .../pcp_instance_881.smt2 | 53 ----------------- .../pcp_instance_882.smt2 | 53 ----------------- .../pcp_instance_883.smt2 | 53 ----------------- .../pcp_instance_884.smt2 | 53 ----------------- .../pcp_instance_885.smt2 | 53 ----------------- .../pcp_instance_886.smt2 | 53 ----------------- .../pcp_instance_887.smt2 | 53 ----------------- .../pcp_instance_888.smt2 | 53 ----------------- .../pcp_instance_889.smt2 | 53 ----------------- .../pcp_instance_890.smt2 | 53 ----------------- .../pcp_instance_891.smt2 | 53 ----------------- .../pcp_instance_892.smt2 | 53 ----------------- .../pcp_instance_893.smt2 | 53 ----------------- .../pcp_instance_894.smt2 | 53 ----------------- .../pcp_instance_895.smt2 | 53 ----------------- .../pcp_instance_896.smt2 | 53 ----------------- .../pcp_instance_897.smt2 | 53 ----------------- .../pcp_instance_898.smt2 | 53 ----------------- .../pcp_instance_899.smt2 | 53 ----------------- .../pcp_instance_900.smt2 | 53 ----------------- .../pcp_instance_901.smt2 | 53 ----------------- .../pcp_instance_902.smt2 | 53 ----------------- .../pcp_instance_903.smt2 | 53 ----------------- .../pcp_instance_904.smt2 | 53 ----------------- .../pcp_instance_905.smt2 | 53 ----------------- .../pcp_instance_906.smt2 | 53 ----------------- .../pcp_instance_907.smt2 | 53 ----------------- .../pcp_instance_908.smt2 | 53 ----------------- .../pcp_instance_909.smt2 | 53 ----------------- .../pcp_instance_910.smt2 | 53 ----------------- .../pcp_instance_911.smt2 | 53 ----------------- .../pcp_instance_912.smt2 | 53 ----------------- .../pcp_instance_913.smt2 | 53 ----------------- .../pcp_instance_914.smt2 | 53 ----------------- .../pcp_instance_915.smt2 | 53 ----------------- .../pcp_instance_916.smt2 | 53 ----------------- .../pcp_instance_917.smt2 | 53 ----------------- .../pcp_instance_918.smt2 | 53 ----------------- .../pcp_instance_919.smt2 | 53 ----------------- .../pcp_instance_920.smt2 | 53 ----------------- .../pcp_instance_921.smt2 | 53 ----------------- .../pcp_instance_922.smt2 | 53 ----------------- .../pcp_instance_923.smt2 | 53 ----------------- .../pcp_instance_924.smt2 | 53 ----------------- .../pcp_instance_925.smt2 | 53 ----------------- .../pcp_instance_926.smt2 | 53 ----------------- .../pcp_instance_927.smt2 | 53 ----------------- .../pcp_instance_928.smt2 | 53 ----------------- .../pcp_instance_929.smt2 | 53 ----------------- .../pcp_instance_930.smt2 | 53 ----------------- .../pcp_instance_931.smt2 | 53 ----------------- .../pcp_instance_932.smt2 | 53 ----------------- .../pcp_instance_933.smt2 | 53 ----------------- .../pcp_instance_934.smt2 | 53 ----------------- .../pcp_instance_935.smt2 | 53 ----------------- .../pcp_instance_936.smt2 | 53 ----------------- .../pcp_instance_937.smt2 | 53 ----------------- .../pcp_instance_938.smt2 | 53 ----------------- .../pcp_instance_939.smt2 | 53 ----------------- .../pcp_instance_940.smt2 | 53 ----------------- .../pcp_instance_941.smt2 | 53 ----------------- .../pcp_instance_942.smt2 | 53 ----------------- .../pcp_instance_943.smt2 | 53 ----------------- .../pcp_instance_944.smt2 | 53 ----------------- .../pcp_instance_945.smt2 | 53 ----------------- .../pcp_instance_946.smt2 | 53 ----------------- .../pcp_instance_947.smt2 | 53 ----------------- .../pcp_instance_948.smt2 | 53 ----------------- .../pcp_instance_949.smt2 | 53 ----------------- .../pcp_instance_950.smt2 | 53 ----------------- .../pcp_instance_951.smt2 | 53 ----------------- .../pcp_instance_952.smt2 | 53 ----------------- .../pcp_instance_953.smt2 | 53 ----------------- .../pcp_instance_954.smt2 | 53 ----------------- .../pcp_instance_955.smt2 | 53 ----------------- .../pcp_instance_956.smt2 | 53 ----------------- .../pcp_instance_957.smt2 | 53 ----------------- .../pcp_instance_958.smt2 | 53 ----------------- .../pcp_instance_959.smt2 | 53 ----------------- .../pcp_instance_960.smt2 | 53 ----------------- .../pcp_instance_961.smt2 | 53 ----------------- .../pcp_instance_962.smt2 | 53 ----------------- .../pcp_instance_963.smt2 | 53 ----------------- .../pcp_instance_964.smt2 | 53 ----------------- .../pcp_instance_965.smt2 | 53 ----------------- .../pcp_instance_966.smt2 | 53 ----------------- .../pcp_instance_967.smt2 | 53 ----------------- .../pcp_instance_968.smt2 | 53 ----------------- .../pcp_instance_969.smt2 | 53 ----------------- .../pcp_instance_970.smt2 | 53 ----------------- .../pcp_instance_971.smt2 | 53 ----------------- .../pcp_instance_972.smt2 | 53 ----------------- .../pcp_instance_973.smt2 | 53 ----------------- .../pcp_instance_974.smt2 | 53 ----------------- .../pcp_instance_975.smt2 | 53 ----------------- .../pcp_instance_976.smt2 | 53 ----------------- .../pcp_instance_977.smt2 | 53 ----------------- .../pcp_instance_978.smt2 | 53 ----------------- .../pcp_instance_979.smt2 | 53 ----------------- .../pcp_instance_980.smt2 | 53 ----------------- .../pcp_instance_981.smt2 | 53 ----------------- .../pcp_instance_982.smt2 | 53 ----------------- .../pcp_instance_983.smt2 | 53 ----------------- .../pcp_instance_984.smt2 | 53 ----------------- .../pcp_instance_985.smt2 | 53 ----------------- .../pcp_instance_986.smt2 | 53 ----------------- .../pcp_instance_987.smt2 | 53 ----------------- .../pcp_instance_988.smt2 | 53 ----------------- .../pcp_instance_989.smt2 | 53 ----------------- .../pcp_instance_990.smt2 | 53 ----------------- .../pcp_instance_991.smt2 | 53 ----------------- .../pcp_instance_992.smt2 | 53 ----------------- .../pcp_instance_993.smt2 | 53 ----------------- .../pcp_instance_994.smt2 | 53 ----------------- .../pcp_instance_995.smt2 | 53 ----------------- .../pcp_instance_996.smt2 | 53 ----------------- .../pcp_instance_997.smt2 | 53 ----------------- .../pcp_instance_998.smt2 | 53 ----------------- .../pcp_instance_999.smt2 | 53 ----------------- .../unsolved_pcp_instance_1000.smt2 | 57 ------------------- .../unsolved_pcp_instance_1001.smt2 | 57 ------------------- .../unsolved_pcp_instance_1002.smt2 | 57 ------------------- .../unsolved_pcp_instance_1003.smt2 | 57 ------------------- .../unsolved_pcp_instance_1004.smt2 | 57 ------------------- .../unsolved_pcp_instance_1005.smt2 | 57 ------------------- .../unsolved_pcp_instance_1006.smt2 | 57 ------------------- .../unsolved_pcp_instance_1007.smt2 | 57 ------------------- .../unsolved_pcp_instance_1008.smt2 | 57 ------------------- .../unsolved_pcp_instance_1009.smt2 | 57 ------------------- .../unsolved_pcp_instance_1010.smt2 | 57 ------------------- .../unsolved_pcp_instance_1011.smt2 | 57 ------------------- .../unsolved_pcp_instance_1012.smt2 | 57 ------------------- .../unsolved_pcp_instance_1013.smt2 | 57 ------------------- .../unsolved_pcp_instance_1014.smt2 | 57 ------------------- .../unsolved_pcp_instance_1015.smt2 | 57 ------------------- .../unsolved_pcp_instance_1016.smt2 | 57 ------------------- .../unsolved_pcp_instance_1017.smt2 | 57 ------------------- .../unsolved_pcp_instance_1018.smt2 | 57 ------------------- .../unsolved_pcp_instance_1019.smt2 | 57 ------------------- .../unsolved_pcp_instance_1020.smt2 | 57 ------------------- .../unsolved_pcp_instance_1021.smt2 | 57 ------------------- .../unsolved_pcp_instance_1022.smt2 | 57 ------------------- .../unsolved_pcp_instance_1023.smt2 | 57 ------------------- .../unsolved_pcp_instance_1024.smt2 | 57 ------------------- .../unsolved_pcp_instance_1025.smt2 | 57 ------------------- .../unsolved_pcp_instance_1026.smt2 | 57 ------------------- .../unsolved_pcp_instance_1027.smt2 | 57 ------------------- .../unsolved_pcp_instance_1028.smt2 | 57 ------------------- .../unsolved_pcp_instance_1029.smt2 | 57 ------------------- .../unsolved_pcp_instance_1030.smt2 | 57 ------------------- .../unsolved_pcp_instance_1031.smt2 | 57 ------------------- .../unsolved_pcp_instance_1032.smt2 | 57 ------------------- .../unsolved_pcp_instance_1033.smt2 | 57 ------------------- .../unsolved_pcp_instance_1034.smt2 | 57 ------------------- .../unsolved_pcp_instance_1035.smt2 | 57 ------------------- .../unsolved_pcp_instance_1036.smt2 | 57 ------------------- .../unsolved_pcp_instance_1037.smt2 | 57 ------------------- .../unsolved_pcp_instance_1038.smt2 | 57 ------------------- .../unsolved_pcp_instance_1039.smt2 | 57 ------------------- .../unsolved_pcp_instance_1040.smt2 | 57 ------------------- .../unsolved_pcp_instance_1041.smt2 | 57 ------------------- .../unsolved_pcp_instance_1042.smt2 | 57 ------------------- .../unsolved_pcp_instance_1043.smt2 | 57 ------------------- .../unsolved_pcp_instance_1044.smt2 | 57 ------------------- .../unsolved_pcp_instance_1045.smt2 | 57 ------------------- .../unsolved_pcp_instance_1046.smt2 | 57 ------------------- .../unsolved_pcp_instance_1047.smt2 | 57 ------------------- .../unsolved_pcp_instance_1048.smt2 | 57 ------------------- .../unsolved_pcp_instance_1049.smt2 | 57 ------------------- .../unsolved_pcp_instance_1050.smt2 | 57 ------------------- .../unsolved_pcp_instance_1051.smt2 | 57 ------------------- .../unsolved_pcp_instance_1052.smt2 | 57 ------------------- .../unsolved_pcp_instance_1053.smt2 | 57 ------------------- .../unsolved_pcp_instance_1054.smt2 | 57 ------------------- .../unsolved_pcp_instance_1055.smt2 | 57 ------------------- .../unsolved_pcp_instance_1056.smt2 | 57 ------------------- .../unsolved_pcp_instance_1057.smt2 | 57 ------------------- .../unsolved_pcp_instance_1058.smt2 | 57 ------------------- .../unsolved_pcp_instance_1059.smt2 | 57 ------------------- .../unsolved_pcp_instance_1060.smt2 | 57 ------------------- .../unsolved_pcp_instance_1061.smt2 | 57 ------------------- .../unsolved_pcp_instance_1062.smt2 | 57 ------------------- .../unsolved_pcp_instance_1063.smt2 | 57 ------------------- .../unsolved_pcp_instance_1064.smt2 | 57 ------------------- .../unsolved_pcp_instance_1065.smt2 | 57 ------------------- .../unsolved_pcp_instance_1066.smt2 | 57 ------------------- .../unsolved_pcp_instance_1067.smt2 | 57 ------------------- .../unsolved_pcp_instance_1068.smt2 | 57 ------------------- .../unsolved_pcp_instance_1069.smt2 | 57 ------------------- .../unsolved_pcp_instance_1070.smt2 | 57 ------------------- .../unsolved_pcp_instance_1071.smt2 | 57 ------------------- .../unsolved_pcp_instance_1072.smt2 | 57 ------------------- .../unsolved_pcp_instance_1073.smt2 | 57 ------------------- .../unsolved_pcp_instance_1074.smt2 | 57 ------------------- .../unsolved_pcp_instance_1075.smt2 | 57 ------------------- .../unsolved_pcp_instance_1076.smt2 | 57 ------------------- .../unsolved_pcp_instance_1077.smt2 | 57 ------------------- .../unsolved_pcp_instance_1078.smt2 | 57 ------------------- .../unsolved_pcp_instance_1079.smt2 | 57 ------------------- .../unsolved_pcp_instance_1080.smt2 | 57 ------------------- .../unsolved_pcp_instance_1081.smt2 | 57 ------------------- .../unsolved_pcp_instance_1082.smt2 | 57 ------------------- .../unsolved_pcp_instance_1083.smt2 | 57 ------------------- .../unsolved_pcp_instance_1084.smt2 | 57 ------------------- .../unsolved_pcp_instance_1085.smt2 | 57 ------------------- .../unsolved_pcp_instance_1086.smt2 | 57 ------------------- .../unsolved_pcp_instance_1087.smt2 | 57 ------------------- .../unsolved_pcp_instance_1088.smt2 | 57 ------------------- .../unsolved_pcp_instance_1089.smt2 | 57 ------------------- .../unsolved_pcp_instance_1090.smt2 | 57 ------------------- .../unsolved_pcp_instance_1091.smt2 | 57 ------------------- .../unsolved_pcp_instance_1092.smt2 | 57 ------------------- .../unsolved_pcp_instance_1093.smt2 | 57 ------------------- .../unsolved_pcp_instance_1094.smt2 | 57 ------------------- .../unsolved_pcp_instance_1095.smt2 | 57 ------------------- .../unsolved_pcp_instance_1096.smt2 | 57 ------------------- .../unsolved_pcp_instance_1097.smt2 | 57 ------------------- .../unsolved_pcp_instance_1098.smt2 | 57 ------------------- .../unsolved_pcp_instance_1099.smt2 | 57 ------------------- .../unsolved_pcp_instance_1100.smt2 | 57 ------------------- .../unsolved_pcp_instance_1101.smt2 | 57 ------------------- .../unsolved_pcp_instance_1102.smt2 | 57 ------------------- .../unsolved_pcp_instance_1103.smt2 | 57 ------------------- .../unsolved_pcp_instance_1104.smt2 | 57 ------------------- .../unsolved_pcp_instance_1105.smt2 | 57 ------------------- .../unsolved_pcp_instance_1106.smt2 | 57 ------------------- .../unsolved_pcp_instance_1107.smt2 | 57 ------------------- .../unsolved_pcp_instance_1108.smt2 | 57 ------------------- .../unsolved_pcp_instance_1109.smt2 | 57 ------------------- .../unsolved_pcp_instance_1110.smt2 | 57 ------------------- .../unsolved_pcp_instance_1111.smt2 | 57 ------------------- .../unsolved_pcp_instance_1112.smt2 | 57 ------------------- .../unsolved_pcp_instance_1113.smt2 | 57 ------------------- .../unsolved_pcp_instance_1114.smt2 | 57 ------------------- .../unsolved_pcp_instance_1115.smt2 | 57 ------------------- .../unsolved_pcp_instance_1116.smt2 | 57 ------------------- .../unsolved_pcp_instance_1117.smt2 | 57 ------------------- .../unsolved_pcp_instance_1118.smt2 | 57 ------------------- .../unsolved_pcp_instance_1119.smt2 | 57 ------------------- .../unsolved_pcp_instance_1120.smt2 | 57 ------------------- .../unsolved_pcp_instance_1121.smt2 | 57 ------------------- .../unsolved_pcp_instance_1122.smt2 | 57 ------------------- .../unsolved_pcp_instance_1123.smt2 | 57 ------------------- .../unsolved_pcp_instance_1124.smt2 | 57 ------------------- .../unsolved_pcp_instance_1125.smt2 | 57 ------------------- .../unsolved_pcp_instance_1126.smt2 | 57 ------------------- .../unsolved_pcp_instance_1127.smt2 | 57 ------------------- .../unsolved_pcp_instance_1128.smt2 | 57 ------------------- .../unsolved_pcp_instance_1129.smt2 | 57 ------------------- .../unsolved_pcp_instance_1130.smt2 | 57 ------------------- .../unsolved_pcp_instance_1131.smt2 | 57 ------------------- .../unsolved_pcp_instance_1132.smt2 | 57 ------------------- .../unsolved_pcp_instance_1133.smt2 | 57 ------------------- .../unsolved_pcp_instance_1134.smt2 | 57 ------------------- .../unsolved_pcp_instance_1135.smt2 | 57 ------------------- .../unsolved_pcp_instance_1136.smt2 | 57 ------------------- .../unsolved_pcp_instance_1137.smt2 | 57 ------------------- .../unsolved_pcp_instance_1138.smt2 | 57 ------------------- .../unsolved_pcp_instance_1139.smt2 | 57 ------------------- .../unsolved_pcp_instance_1140.smt2 | 57 ------------------- .../unsolved_pcp_instance_1141.smt2 | 57 ------------------- .../unsolved_pcp_instance_1142.smt2 | 57 ------------------- .../unsolved_pcp_instance_1143.smt2 | 57 ------------------- .../unsolved_pcp_instance_1144.smt2 | 57 ------------------- .../unsolved_pcp_instance_1145.smt2 | 57 ------------------- .../unsolved_pcp_instance_1146.smt2 | 57 ------------------- .../unsolved_pcp_instance_1147.smt2 | 57 ------------------- .../unsolved_pcp_instance_1148.smt2 | 57 ------------------- .../unsolved_pcp_instance_1149.smt2 | 57 ------------------- .../unsolved_pcp_instance_1150.smt2 | 57 ------------------- .../unsolved_pcp_instance_1151.smt2 | 57 ------------------- .../unsolved_pcp_instance_1152.smt2 | 57 ------------------- .../unsolved_pcp_instance_1153.smt2 | 57 ------------------- .../unsolved_pcp_instance_1154.smt2 | 57 ------------------- .../unsolved_pcp_instance_1155.smt2 | 57 ------------------- .../unsolved_pcp_instance_1156.smt2 | 57 ------------------- .../unsolved_pcp_instance_1157.smt2 | 57 ------------------- .../unsolved_pcp_instance_1158.smt2 | 57 ------------------- .../unsolved_pcp_instance_1159.smt2 | 57 ------------------- .../unsolved_pcp_instance_1160.smt2 | 57 ------------------- .../unsolved_pcp_instance_1161.smt2 | 57 ------------------- .../unsolved_pcp_instance_1162.smt2 | 57 ------------------- .../unsolved_pcp_instance_1163.smt2 | 57 ------------------- .../unsolved_pcp_instance_1164.smt2 | 57 ------------------- .../unsolved_pcp_instance_1165.smt2 | 57 ------------------- .../unsolved_pcp_instance_1166.smt2 | 57 ------------------- .../unsolved_pcp_instance_1167.smt2 | 57 ------------------- .../unsolved_pcp_instance_1168.smt2 | 57 ------------------- .../unsolved_pcp_instance_1169.smt2 | 57 ------------------- .../unsolved_pcp_instance_1170.smt2 | 57 ------------------- .../unsolved_pcp_instance_1171.smt2 | 57 ------------------- .../unsolved_pcp_instance_1172.smt2 | 57 ------------------- .../unsolved_pcp_instance_1173.smt2 | 57 ------------------- .../unsolved_pcp_instance_1174.smt2 | 57 ------------------- .../unsolved_pcp_instance_1175.smt2 | 57 ------------------- .../unsolved_pcp_instance_1176.smt2 | 57 ------------------- .../unsolved_pcp_instance_1177.smt2 | 57 ------------------- .../unsolved_pcp_instance_1178.smt2 | 57 ------------------- .../unsolved_pcp_instance_1179.smt2 | 57 ------------------- .../unsolved_pcp_instance_1180.smt2 | 57 ------------------- .../unsolved_pcp_instance_1181.smt2 | 57 ------------------- .../unsolved_pcp_instance_1182.smt2 | 57 ------------------- .../unsolved_pcp_instance_1183.smt2 | 57 ------------------- .../unsolved_pcp_instance_1184.smt2 | 57 ------------------- .../unsolved_pcp_instance_1185.smt2 | 57 ------------------- .../unsolved_pcp_instance_1186.smt2 | 57 ------------------- .../unsolved_pcp_instance_1187.smt2 | 57 ------------------- .../unsolved_pcp_instance_1188.smt2 | 57 ------------------- .../unsolved_pcp_instance_1189.smt2 | 57 ------------------- .../unsolved_pcp_instance_1190.smt2 | 57 ------------------- .../unsolved_pcp_instance_1191.smt2 | 57 ------------------- .../unsolved_pcp_instance_1192.smt2 | 57 ------------------- .../unsolved_pcp_instance_1193.smt2 | 57 ------------------- .../unsolved_pcp_instance_1194.smt2 | 57 ------------------- .../unsolved_pcp_instance_1195.smt2 | 57 ------------------- .../unsolved_pcp_instance_1196.smt2 | 57 ------------------- .../unsolved_pcp_instance_1197.smt2 | 57 ------------------- .../unsolved_pcp_instance_1198.smt2 | 57 ------------------- .../unsolved_pcp_instance_1199.smt2 | 57 ------------------- .../unsolved_pcp_instance_1200.smt2 | 57 ------------------- .../unsolved_pcp_instance_1201.smt2 | 57 ------------------- .../unsolved_pcp_instance_1202.smt2 | 57 ------------------- .../unsolved_pcp_instance_1203.smt2 | 57 ------------------- .../unsolved_pcp_instance_1204.smt2 | 57 ------------------- .../unsolved_pcp_instance_1205.smt2 | 57 ------------------- .../unsolved_pcp_instance_1206.smt2 | 57 ------------------- .../unsolved_pcp_instance_1207.smt2 | 57 ------------------- .../unsolved_pcp_instance_1208.smt2 | 57 ------------------- .../unsolved_pcp_instance_1209.smt2 | 57 ------------------- .../unsolved_pcp_instance_1210.smt2 | 57 ------------------- .../unsolved_pcp_instance_1211.smt2 | 57 ------------------- .../unsolved_pcp_instance_1212.smt2 | 57 ------------------- .../unsolved_pcp_instance_1213.smt2 | 57 ------------------- .../unsolved_pcp_instance_1214.smt2 | 57 ------------------- .../unsolved_pcp_instance_1215.smt2 | 57 ------------------- .../unsolved_pcp_instance_1216.smt2 | 57 ------------------- .../unsolved_pcp_instance_1217.smt2 | 57 ------------------- .../unsolved_pcp_instance_1218.smt2 | 57 ------------------- .../unsolved_pcp_instance_1219.smt2 | 57 ------------------- .../unsolved_pcp_instance_1220.smt2 | 57 ------------------- .../unsolved_pcp_instance_1221.smt2 | 57 ------------------- .../unsolved_pcp_instance_1222.smt2 | 57 ------------------- .../unsolved_pcp_instance_1223.smt2 | 57 ------------------- .../unsolved_pcp_instance_1224.smt2 | 57 ------------------- .../unsolved_pcp_instance_1225.smt2 | 57 ------------------- .../unsolved_pcp_instance_1226.smt2 | 57 ------------------- .../unsolved_pcp_instance_1227.smt2 | 57 ------------------- .../unsolved_pcp_instance_1228.smt2 | 57 ------------------- .../unsolved_pcp_instance_1229.smt2 | 57 ------------------- .../unsolved_pcp_instance_1230.smt2 | 57 ------------------- .../unsolved_pcp_instance_1231.smt2 | 57 ------------------- .../unsolved_pcp_instance_1232.smt2 | 57 ------------------- .../unsolved_pcp_instance_1233.smt2 | 57 ------------------- .../unsolved_pcp_instance_1234.smt2 | 57 ------------------- .../unsolved_pcp_instance_1235.smt2 | 57 ------------------- .../unsolved_pcp_instance_1236.smt2 | 57 ------------------- .../unsolved_pcp_instance_1237.smt2 | 57 ------------------- .../unsolved_pcp_instance_1238.smt2 | 57 ------------------- .../unsolved_pcp_instance_1239.smt2 | 57 ------------------- .../unsolved_pcp_instance_1240.smt2 | 57 ------------------- .../unsolved_pcp_instance_1241.smt2 | 57 ------------------- .../unsolved_pcp_instance_1242.smt2 | 57 ------------------- .../unsolved_pcp_instance_1243.smt2 | 57 ------------------- .../unsolved_pcp_instance_1244.smt2 | 57 ------------------- .../unsolved_pcp_instance_1245.smt2 | 57 ------------------- .../unsolved_pcp_instance_1246.smt2 | 57 ------------------- .../unsolved_pcp_instance_1247.smt2 | 57 ------------------- .../unsolved_pcp_instance_1248.smt2 | 57 ------------------- .../unsolved_pcp_instance_1249.smt2 | 57 ------------------- .../unsolved_pcp_instance_1250.smt2 | 57 ------------------- .../unsolved_pcp_instance_1251.smt2 | 57 ------------------- .../unsolved_pcp_instance_1252.smt2 | 57 ------------------- .../unsolved_pcp_instance_1253.smt2 | 57 ------------------- .../unsolved_pcp_instance_1254.smt2 | 57 ------------------- .../unsolved_pcp_instance_1255.smt2 | 57 ------------------- .../unsolved_pcp_instance_1256.smt2 | 57 ------------------- .../unsolved_pcp_instance_1257.smt2 | 57 ------------------- .../unsolved_pcp_instance_1258.smt2 | 57 ------------------- .../unsolved_pcp_instance_1259.smt2 | 57 ------------------- .../unsolved_pcp_instance_1260.smt2 | 57 ------------------- .../unsolved_pcp_instance_1261.smt2 | 57 ------------------- .../unsolved_pcp_instance_1262.smt2 | 57 ------------------- .../unsolved_pcp_instance_1263.smt2 | 57 ------------------- .../unsolved_pcp_instance_1264.smt2 | 57 ------------------- .../unsolved_pcp_instance_1265.smt2 | 57 ------------------- .../unsolved_pcp_instance_1266.smt2 | 57 ------------------- .../unsolved_pcp_instance_1267.smt2 | 57 ------------------- .../unsolved_pcp_instance_1268.smt2 | 57 ------------------- .../unsolved_pcp_instance_1269.smt2 | 57 ------------------- .../unsolved_pcp_instance_1270.smt2 | 57 ------------------- .../unsolved_pcp_instance_1271.smt2 | 57 ------------------- .../unsolved_pcp_instance_1272.smt2 | 57 ------------------- .../unsolved_pcp_instance_1273.smt2 | 57 ------------------- .../unsolved_pcp_instance_1274.smt2 | 57 ------------------- .../unsolved_pcp_instance_1275.smt2 | 57 ------------------- .../unsolved_pcp_instance_1276.smt2 | 57 ------------------- .../unsolved_pcp_instance_1277.smt2 | 57 ------------------- .../unsolved_pcp_instance_1278.smt2 | 57 ------------------- .../unsolved_pcp_instance_1279.smt2 | 57 ------------------- .../unsolved_pcp_instance_1280.smt2 | 57 ------------------- .../unsolved_pcp_instance_1281.smt2 | 57 ------------------- .../unsolved_pcp_instance_1282.smt2 | 57 ------------------- .../unsolved_pcp_instance_1283.smt2 | 57 ------------------- .../unsolved_pcp_instance_1284.smt2 | 57 ------------------- .../unsolved_pcp_instance_1285.smt2 | 57 ------------------- .../unsolved_pcp_instance_1286.smt2 | 57 ------------------- .../unsolved_pcp_instance_1287.smt2 | 57 ------------------- .../unsolved_pcp_instance_1288.smt2 | 57 ------------------- .../unsolved_pcp_instance_1289.smt2 | 57 ------------------- .../unsolved_pcp_instance_1290.smt2 | 57 ------------------- .../unsolved_pcp_instance_1291.smt2 | 57 ------------------- .../unsolved_pcp_instance_1292.smt2 | 57 ------------------- .../unsolved_pcp_instance_1293.smt2 | 57 ------------------- .../unsolved_pcp_instance_1294.smt2 | 57 ------------------- .../unsolved_pcp_instance_1295.smt2 | 57 ------------------- .../unsolved_pcp_instance_1296.smt2 | 57 ------------------- .../unsolved_pcp_instance_1297.smt2 | 57 ------------------- .../unsolved_pcp_instance_1298.smt2 | 57 ------------------- .../unsolved_pcp_instance_1299.smt2 | 57 ------------------- .../unsolved_pcp_instance_1300.smt2 | 57 ------------------- .../unsolved_pcp_instance_1301.smt2 | 57 ------------------- .../unsolved_pcp_instance_1302.smt2 | 57 ------------------- .../unsolved_pcp_instance_1303.smt2 | 57 ------------------- .../unsolved_pcp_instance_1304.smt2 | 57 ------------------- .../unsolved_pcp_instance_1305.smt2 | 57 ------------------- .../unsolved_pcp_instance_1306.smt2 | 57 ------------------- .../unsolved_pcp_instance_1307.smt2 | 57 ------------------- .../unsolved_pcp_instance_1308.smt2 | 57 ------------------- .../unsolved_pcp_instance_1309.smt2 | 57 ------------------- .../unsolved_pcp_instance_1310.smt2 | 57 ------------------- .../unsolved_pcp_instance_1311.smt2 | 57 ------------------- .../unsolved_pcp_instance_1312.smt2 | 57 ------------------- .../unsolved_pcp_instance_1313.smt2 | 57 ------------------- .../unsolved_pcp_instance_1314.smt2 | 57 ------------------- .../unsolved_pcp_instance_1315.smt2 | 57 ------------------- .../unsolved_pcp_instance_1316.smt2 | 57 ------------------- .../unsolved_pcp_instance_1317.smt2 | 57 ------------------- .../unsolved_pcp_instance_1318.smt2 | 57 ------------------- .../unsolved_pcp_instance_1319.smt2 | 57 ------------------- .../unsolved_pcp_instance_1320.smt2 | 57 ------------------- .../unsolved_pcp_instance_1321.smt2 | 57 ------------------- .../unsolved_pcp_instance_1322.smt2 | 57 ------------------- .../unsolved_pcp_instance_1323.smt2 | 57 ------------------- .../unsolved_pcp_instance_1324.smt2 | 57 ------------------- .../unsolved_pcp_instance_1325.smt2 | 57 ------------------- .../unsolved_pcp_instance_1326.smt2 | 57 ------------------- .../unsolved_pcp_instance_1327.smt2 | 57 ------------------- .../unsolved_pcp_instance_1328.smt2 | 57 ------------------- .../unsolved_pcp_instance_1329.smt2 | 57 ------------------- .../unsolved_pcp_instance_1330.smt2 | 57 ------------------- .../unsolved_pcp_instance_1331.smt2 | 57 ------------------- .../unsolved_pcp_instance_1332.smt2 | 57 ------------------- .../unsolved_pcp_instance_1333.smt2 | 57 ------------------- .../unsolved_pcp_instance_1334.smt2 | 57 ------------------- .../unsolved_pcp_instance_1335.smt2 | 57 ------------------- .../unsolved_pcp_instance_1336.smt2 | 57 ------------------- .../unsolved_pcp_instance_1337.smt2 | 57 ------------------- .../unsolved_pcp_instance_1338.smt2 | 57 ------------------- .../unsolved_pcp_instance_1339.smt2 | 57 ------------------- .../unsolved_pcp_instance_1340.smt2 | 57 ------------------- .../unsolved_pcp_instance_1341.smt2 | 57 ------------------- .../unsolved_pcp_instance_1342.smt2 | 57 ------------------- .../unsolved_pcp_instance_1343.smt2 | 57 ------------------- .../unsolved_pcp_instance_1344.smt2 | 57 ------------------- .../unsolved_pcp_instance_1345.smt2 | 57 ------------------- .../unsolved_pcp_instance_1346.smt2 | 57 ------------------- .../unsolved_pcp_instance_1347.smt2 | 57 ------------------- .../unsolved_pcp_instance_1348.smt2 | 57 ------------------- .../unsolved_pcp_instance_1349.smt2 | 57 ------------------- .../unsolved_pcp_instance_1350.smt2 | 57 ------------------- .../unsolved_pcp_instance_1351.smt2 | 57 ------------------- .../unsolved_pcp_instance_1352.smt2 | 57 ------------------- .../unsolved_pcp_instance_1353.smt2 | 57 ------------------- .../unsolved_pcp_instance_1354.smt2 | 57 ------------------- .../unsolved_pcp_instance_1355.smt2 | 57 ------------------- .../unsolved_pcp_instance_1356.smt2 | 57 ------------------- .../unsolved_pcp_instance_1357.smt2 | 57 ------------------- .../unsolved_pcp_instance_1358.smt2 | 57 ------------------- .../unsolved_pcp_instance_1359.smt2 | 57 ------------------- .../unsolved_pcp_instance_1360.smt2 | 57 ------------------- .../unsolved_pcp_instance_1361.smt2 | 57 ------------------- .../unsolved_pcp_instance_1362.smt2 | 57 ------------------- .../unsolved_pcp_instance_1363.smt2 | 57 ------------------- .../unsolved_pcp_instance_1364.smt2 | 57 ------------------- .../unsolved_pcp_instance_1365.smt2 | 57 ------------------- .../unsolved_pcp_instance_1366.smt2 | 57 ------------------- .../unsolved_pcp_instance_1367.smt2 | 57 ------------------- .../unsolved_pcp_instance_1368.smt2 | 57 ------------------- .../unsolved_pcp_instance_1369.smt2 | 57 ------------------- .../unsolved_pcp_instance_1370.smt2 | 57 ------------------- .../unsolved_pcp_instance_1371.smt2 | 57 ------------------- .../unsolved_pcp_instance_1372.smt2 | 57 ------------------- .../unsolved_pcp_instance_1373.smt2 | 57 ------------------- .../unsolved_pcp_instance_1374.smt2 | 57 ------------------- .../unsolved_pcp_instance_1375.smt2 | 57 ------------------- .../unsolved_pcp_instance_1376.smt2 | 57 ------------------- .../unsolved_pcp_instance_1377.smt2 | 57 ------------------- .../unsolved_pcp_instance_1378.smt2 | 57 ------------------- .../unsolved_pcp_instance_1379.smt2 | 57 ------------------- .../unsolved_pcp_instance_1380.smt2 | 57 ------------------- .../unsolved_pcp_instance_1381.smt2 | 57 ------------------- .../unsolved_pcp_instance_1382.smt2 | 57 ------------------- .../unsolved_pcp_instance_1383.smt2 | 57 ------------------- .../unsolved_pcp_instance_1384.smt2 | 57 ------------------- .../unsolved_pcp_instance_1385.smt2 | 57 ------------------- .../unsolved_pcp_instance_1386.smt2 | 57 ------------------- .../unsolved_pcp_instance_1387.smt2 | 57 ------------------- .../unsolved_pcp_instance_1388.smt2 | 57 ------------------- .../unsolved_pcp_instance_1389.smt2 | 57 ------------------- .../unsolved_pcp_instance_1390.smt2 | 57 ------------------- .../unsolved_pcp_instance_1391.smt2 | 57 ------------------- .../unsolved_pcp_instance_1392.smt2 | 57 ------------------- .../unsolved_pcp_instance_1393.smt2 | 57 ------------------- .../unsolved_pcp_instance_1394.smt2 | 57 ------------------- .../unsolved_pcp_instance_1395.smt2 | 57 ------------------- .../unsolved_pcp_instance_1396.smt2 | 57 ------------------- .../unsolved_pcp_instance_1397.smt2 | 57 ------------------- .../unsolved_pcp_instance_1398.smt2 | 57 ------------------- .../unsolved_pcp_instance_1399.smt2 | 57 ------------------- .../unsolved_pcp_instance_1400.smt2 | 57 ------------------- .../unsolved_pcp_instance_1401.smt2 | 57 ------------------- .../unsolved_pcp_instance_1402.smt2 | 57 ------------------- .../unsolved_pcp_instance_1403.smt2 | 57 ------------------- .../unsolved_pcp_instance_1404.smt2 | 57 ------------------- .../unsolved_pcp_instance_1405.smt2 | 57 ------------------- .../unsolved_pcp_instance_1406.smt2 | 57 ------------------- .../unsolved_pcp_instance_1407.smt2 | 57 ------------------- .../unsolved_pcp_instance_1408.smt2 | 57 ------------------- .../unsolved_pcp_instance_1409.smt2 | 57 ------------------- .../unsolved_pcp_instance_1410.smt2 | 57 ------------------- .../unsolved_pcp_instance_1411.smt2 | 57 ------------------- .../unsolved_pcp_instance_1412.smt2 | 57 ------------------- .../unsolved_pcp_instance_1413.smt2 | 57 ------------------- .../unsolved_pcp_instance_1414.smt2 | 57 ------------------- .../unsolved_pcp_instance_1415.smt2 | 57 ------------------- .../unsolved_pcp_instance_1416.smt2 | 57 ------------------- .../unsolved_pcp_instance_1417.smt2 | 57 ------------------- .../unsolved_pcp_instance_1418.smt2 | 57 ------------------- .../unsolved_pcp_instance_1419.smt2 | 57 ------------------- .../unsolved_pcp_instance_1420.smt2 | 57 ------------------- .../unsolved_pcp_instance_1421.smt2 | 57 ------------------- .../unsolved_pcp_instance_1422.smt2 | 57 ------------------- .../unsolved_pcp_instance_1423.smt2 | 57 ------------------- .../unsolved_pcp_instance_1424.smt2 | 57 ------------------- .../unsolved_pcp_instance_1425.smt2 | 57 ------------------- .../unsolved_pcp_instance_1426.smt2 | 57 ------------------- .../unsolved_pcp_instance_1427.smt2 | 57 ------------------- .../unsolved_pcp_instance_1428.smt2 | 57 ------------------- .../unsolved_pcp_instance_1429.smt2 | 57 ------------------- .../unsolved_pcp_instance_1430.smt2 | 57 ------------------- .../unsolved_pcp_instance_1431.smt2 | 57 ------------------- .../unsolved_pcp_instance_1432.smt2 | 57 ------------------- .../unsolved_pcp_instance_1433.smt2 | 57 ------------------- .../unsolved_pcp_instance_1434.smt2 | 57 ------------------- .../unsolved_pcp_instance_1435.smt2 | 57 ------------------- .../unsolved_pcp_instance_1436.smt2 | 57 ------------------- .../unsolved_pcp_instance_1437.smt2 | 57 ------------------- .../unsolved_pcp_instance_1438.smt2 | 57 ------------------- .../unsolved_pcp_instance_1439.smt2 | 57 ------------------- .../unsolved_pcp_instance_1440.smt2 | 57 ------------------- .../unsolved_pcp_instance_1441.smt2 | 57 ------------------- .../unsolved_pcp_instance_1442.smt2 | 57 ------------------- .../unsolved_pcp_instance_1443.smt2 | 57 ------------------- .../unsolved_pcp_instance_1444.smt2 | 57 ------------------- .../unsolved_pcp_instance_1445.smt2 | 57 ------------------- .../unsolved_pcp_instance_1446.smt2 | 57 ------------------- .../unsolved_pcp_instance_1447.smt2 | 57 ------------------- .../unsolved_pcp_instance_1448.smt2 | 57 ------------------- .../unsolved_pcp_instance_1449.smt2 | 57 ------------------- .../unsolved_pcp_instance_1450.smt2 | 57 ------------------- .../unsolved_pcp_instance_1451.smt2 | 57 ------------------- .../unsolved_pcp_instance_1452.smt2 | 57 ------------------- .../unsolved_pcp_instance_1453.smt2 | 57 ------------------- .../unsolved_pcp_instance_1454.smt2 | 57 ------------------- .../unsolved_pcp_instance_1455.smt2 | 57 ------------------- .../unsolved_pcp_instance_1456.smt2 | 57 ------------------- .../unsolved_pcp_instance_1457.smt2 | 57 ------------------- .../unsolved_pcp_instance_1458.smt2 | 57 ------------------- .../unsolved_pcp_instance_1459.smt2 | 57 ------------------- .../unsolved_pcp_instance_1460.smt2 | 57 ------------------- .../unsolved_pcp_instance_1461.smt2 | 57 ------------------- .../unsolved_pcp_instance_1462.smt2 | 57 ------------------- .../unsolved_pcp_instance_1463.smt2 | 57 ------------------- .../unsolved_pcp_instance_1464.smt2 | 57 ------------------- .../unsolved_pcp_instance_1465.smt2 | 57 ------------------- .../unsolved_pcp_instance_1466.smt2 | 57 ------------------- .../unsolved_pcp_instance_1467.smt2 | 57 ------------------- .../unsolved_pcp_instance_1468.smt2 | 57 ------------------- .../unsolved_pcp_instance_1469.smt2 | 57 ------------------- .../unsolved_pcp_instance_1470.smt2 | 57 ------------------- .../unsolved_pcp_instance_1471.smt2 | 57 ------------------- .../unsolved_pcp_instance_1472.smt2 | 57 ------------------- .../unsolved_pcp_instance_1473.smt2 | 57 ------------------- .../unsolved_pcp_instance_1474.smt2 | 57 ------------------- .../unsolved_pcp_instance_1475.smt2 | 57 ------------------- .../unsolved_pcp_instance_1476.smt2 | 57 ------------------- .../unsolved_pcp_instance_1477.smt2 | 57 ------------------- .../unsolved_pcp_instance_1478.smt2 | 57 ------------------- .../unsolved_pcp_instance_1479.smt2 | 57 ------------------- .../unsolved_pcp_instance_1480.smt2 | 57 ------------------- .../unsolved_pcp_instance_1481.smt2 | 57 ------------------- .../unsolved_pcp_instance_1482.smt2 | 57 ------------------- .../unsolved_pcp_instance_1483.smt2 | 57 ------------------- .../unsolved_pcp_instance_1484.smt2 | 57 ------------------- .../unsolved_pcp_instance_1485.smt2 | 57 ------------------- .../unsolved_pcp_instance_1486.smt2 | 57 ------------------- .../unsolved_pcp_instance_1487.smt2 | 57 ------------------- .../unsolved_pcp_instance_1488.smt2 | 57 ------------------- .../unsolved_pcp_instance_1489.smt2 | 57 ------------------- .../unsolved_pcp_instance_1490.smt2 | 57 ------------------- .../unsolved_pcp_instance_1491.smt2 | 57 ------------------- .../unsolved_pcp_instance_1492.smt2 | 57 ------------------- .../unsolved_pcp_instance_1493.smt2 | 57 ------------------- .../unsolved_pcp_instance_1494.smt2 | 57 ------------------- .../unsolved_pcp_instance_1495.smt2 | 57 ------------------- .../unsolved_pcp_instance_1496.smt2 | 57 ------------------- .../unsolved_pcp_instance_1497.smt2 | 57 ------------------- .../unsolved_pcp_instance_1498.smt2 | 57 ------------------- .../unsolved_pcp_instance_1499.smt2 | 57 ------------------- .../unsolved_pcp_instance_1500.smt2 | 57 ------------------- .../unsolved_pcp_instance_1501.smt2 | 57 ------------------- .../unsolved_pcp_instance_1502.smt2 | 57 ------------------- .../unsolved_pcp_instance_1503.smt2 | 57 ------------------- .../unsolved_pcp_instance_1504.smt2 | 57 ------------------- .../unsolved_pcp_instance_1505.smt2 | 57 ------------------- .../unsolved_pcp_instance_1506.smt2 | 57 ------------------- .../unsolved_pcp_instance_1507.smt2 | 57 ------------------- .../unsolved_pcp_instance_1508.smt2 | 57 ------------------- .../unsolved_pcp_instance_1509.smt2 | 57 ------------------- .../unsolved_pcp_instance_1510.smt2 | 57 ------------------- .../unsolved_pcp_instance_1511.smt2 | 57 ------------------- .../unsolved_pcp_instance_1512.smt2 | 57 ------------------- .../unsolved_pcp_instance_1513.smt2 | 57 ------------------- .../unsolved_pcp_instance_1514.smt2 | 57 ------------------- .../unsolved_pcp_instance_1515.smt2 | 57 ------------------- .../unsolved_pcp_instance_1516.smt2 | 57 ------------------- .../unsolved_pcp_instance_1517.smt2 | 57 ------------------- .../unsolved_pcp_instance_1518.smt2 | 57 ------------------- .../unsolved_pcp_instance_1519.smt2 | 57 ------------------- .../unsolved_pcp_instance_1520.smt2 | 57 ------------------- .../unsolved_pcp_instance_1521.smt2 | 57 ------------------- .../unsolved_pcp_instance_1522.smt2 | 57 ------------------- .../unsolved_pcp_instance_1523.smt2 | 57 ------------------- .../unsolved_pcp_instance_1524.smt2 | 57 ------------------- .../unsolved_pcp_instance_1525.smt2 | 57 ------------------- .../unsolved_pcp_instance_1526.smt2 | 57 ------------------- .../unsolved_pcp_instance_1527.smt2 | 57 ------------------- .../unsolved_pcp_instance_1528.smt2 | 57 ------------------- .../unsolved_pcp_instance_1529.smt2 | 57 ------------------- .../unsolved_pcp_instance_1530.smt2 | 57 ------------------- .../unsolved_pcp_instance_1531.smt2 | 57 ------------------- .../unsolved_pcp_instance_1532.smt2 | 57 ------------------- .../unsolved_pcp_instance_1533.smt2 | 57 ------------------- .../unsolved_pcp_instance_1534.smt2 | 57 ------------------- .../unsolved_pcp_instance_1535.smt2 | 57 ------------------- .../unsolved_pcp_instance_1536.smt2 | 57 ------------------- .../unsolved_pcp_instance_1537.smt2 | 57 ------------------- .../unsolved_pcp_instance_1538.smt2 | 57 ------------------- .../unsolved_pcp_instance_1539.smt2 | 57 ------------------- .../unsolved_pcp_instance_1540.smt2 | 57 ------------------- .../unsolved_pcp_instance_1541.smt2 | 57 ------------------- .../unsolved_pcp_instance_1542.smt2 | 57 ------------------- .../unsolved_pcp_instance_1543.smt2 | 57 ------------------- .../unsolved_pcp_instance_1544.smt2 | 57 ------------------- .../unsolved_pcp_instance_1545.smt2 | 57 ------------------- .../unsolved_pcp_instance_1546.smt2 | 57 ------------------- .../unsolved_pcp_instance_1547.smt2 | 57 ------------------- .../unsolved_pcp_instance_1548.smt2 | 57 ------------------- .../unsolved_pcp_instance_1549.smt2 | 57 ------------------- .../unsolved_pcp_instance_1550.smt2 | 57 ------------------- .../unsolved_pcp_instance_1551.smt2 | 57 ------------------- .../unsolved_pcp_instance_1552.smt2 | 57 ------------------- .../unsolved_pcp_instance_1553.smt2 | 57 ------------------- .../unsolved_pcp_instance_1554.smt2 | 57 ------------------- .../unsolved_pcp_instance_1555.smt2 | 57 ------------------- .../unsolved_pcp_instance_1556.smt2 | 57 ------------------- .../unsolved_pcp_instance_1557.smt2 | 57 ------------------- .../unsolved_pcp_instance_1558.smt2 | 57 ------------------- .../unsolved_pcp_instance_1559.smt2 | 57 ------------------- .../unsolved_pcp_instance_1560.smt2 | 57 ------------------- .../unsolved_pcp_instance_1561.smt2 | 57 ------------------- .../unsolved_pcp_instance_1562.smt2 | 57 ------------------- .../unsolved_pcp_instance_1563.smt2 | 57 ------------------- .../unsolved_pcp_instance_1564.smt2 | 57 ------------------- .../unsolved_pcp_instance_1565.smt2 | 57 ------------------- .../unsolved_pcp_instance_1566.smt2 | 57 ------------------- .../unsolved_pcp_instance_1567.smt2 | 57 ------------------- .../unsolved_pcp_instance_1568.smt2 | 57 ------------------- .../unsolved_pcp_instance_1569.smt2 | 57 ------------------- .../unsolved_pcp_instance_1570.smt2 | 57 ------------------- .../unsolved_pcp_instance_1571.smt2 | 57 ------------------- .../unsolved_pcp_instance_1572.smt2 | 57 ------------------- .../unsolved_pcp_instance_1573.smt2 | 57 ------------------- .../unsolved_pcp_instance_1574.smt2 | 57 ------------------- .../unsolved_pcp_instance_1575.smt2 | 57 ------------------- .../unsolved_pcp_instance_1576.smt2 | 57 ------------------- .../unsolved_pcp_instance_1577.smt2 | 57 ------------------- .../unsolved_pcp_instance_1578.smt2 | 57 ------------------- .../unsolved_pcp_instance_1579.smt2 | 57 ------------------- .../unsolved_pcp_instance_1580.smt2 | 57 ------------------- .../unsolved_pcp_instance_1581.smt2 | 57 ------------------- .../unsolved_pcp_instance_1582.smt2 | 57 ------------------- .../unsolved_pcp_instance_1583.smt2 | 57 ------------------- .../unsolved_pcp_instance_1584.smt2 | 57 ------------------- .../unsolved_pcp_instance_1585.smt2 | 57 ------------------- .../unsolved_pcp_instance_1586.smt2 | 57 ------------------- .../unsolved_pcp_instance_1587.smt2 | 57 ------------------- .../unsolved_pcp_instance_1588.smt2 | 57 ------------------- .../unsolved_pcp_instance_1589.smt2 | 57 ------------------- .../unsolved_pcp_instance_1590.smt2 | 57 ------------------- .../unsolved_pcp_instance_1591.smt2 | 57 ------------------- .../unsolved_pcp_instance_1592.smt2 | 57 ------------------- .../unsolved_pcp_instance_1593.smt2 | 57 ------------------- .../unsolved_pcp_instance_1594.smt2 | 57 ------------------- .../unsolved_pcp_instance_1595.smt2 | 57 ------------------- .../unsolved_pcp_instance_1596.smt2 | 57 ------------------- .../unsolved_pcp_instance_1597.smt2 | 57 ------------------- .../unsolved_pcp_instance_1598.smt2 | 57 ------------------- .../unsolved_pcp_instance_1599.smt2 | 57 ------------------- .../unsolved_pcp_instance_1600.smt2 | 57 ------------------- .../unsolved_pcp_instance_1601.smt2 | 57 ------------------- .../unsolved_pcp_instance_1602.smt2 | 57 ------------------- .../unsolved_pcp_instance_1603.smt2 | 57 ------------------- .../unsolved_pcp_instance_1604.smt2 | 57 ------------------- .../unsolved_pcp_instance_1605.smt2 | 57 ------------------- .../unsolved_pcp_instance_1606.smt2 | 57 ------------------- .../unsolved_pcp_instance_1607.smt2 | 57 ------------------- .../unsolved_pcp_instance_1608.smt2 | 57 ------------------- .../unsolved_pcp_instance_1609.smt2 | 57 ------------------- .../unsolved_pcp_instance_1610.smt2 | 57 ------------------- .../unsolved_pcp_instance_1611.smt2 | 57 ------------------- .../unsolved_pcp_instance_1612.smt2 | 57 ------------------- .../unsolved_pcp_instance_1613.smt2 | 57 ------------------- .../unsolved_pcp_instance_1614.smt2 | 57 ------------------- .../unsolved_pcp_instance_1615.smt2 | 57 ------------------- .../unsolved_pcp_instance_1616.smt2 | 57 ------------------- .../unsolved_pcp_instance_1617.smt2 | 57 ------------------- .../unsolved_pcp_instance_1618.smt2 | 57 ------------------- .../unsolved_pcp_instance_1619.smt2 | 57 ------------------- .../unsolved_pcp_instance_1620.smt2 | 57 ------------------- .../unsolved_pcp_instance_1621.smt2 | 57 ------------------- .../unsolved_pcp_instance_1622.smt2 | 57 ------------------- .../unsolved_pcp_instance_1623.smt2 | 57 ------------------- .../unsolved_pcp_instance_1624.smt2 | 57 ------------------- .../unsolved_pcp_instance_1625.smt2 | 57 ------------------- .../unsolved_pcp_instance_1626.smt2 | 57 ------------------- .../unsolved_pcp_instance_1627.smt2 | 57 ------------------- .../unsolved_pcp_instance_1628.smt2 | 57 ------------------- .../unsolved_pcp_instance_1629.smt2 | 57 ------------------- .../unsolved_pcp_instance_1630.smt2 | 57 ------------------- .../unsolved_pcp_instance_1631.smt2 | 57 ------------------- .../unsolved_pcp_instance_1632.smt2 | 57 ------------------- .../unsolved_pcp_instance_1633.smt2 | 57 ------------------- .../unsolved_pcp_instance_1634.smt2 | 57 ------------------- .../unsolved_pcp_instance_1635.smt2 | 57 ------------------- .../unsolved_pcp_instance_1636.smt2 | 57 ------------------- .../unsolved_pcp_instance_1637.smt2 | 57 ------------------- .../unsolved_pcp_instance_1638.smt2 | 57 ------------------- .../unsolved_pcp_instance_1639.smt2 | 57 ------------------- .../unsolved_pcp_instance_1640.smt2 | 57 ------------------- .../unsolved_pcp_instance_1641.smt2 | 57 ------------------- .../unsolved_pcp_instance_1642.smt2 | 57 ------------------- .../unsolved_pcp_instance_1643.smt2 | 57 ------------------- .../unsolved_pcp_instance_1644.smt2 | 57 ------------------- .../unsolved_pcp_instance_1645.smt2 | 57 ------------------- .../unsolved_pcp_instance_1646.smt2 | 57 ------------------- .../unsolved_pcp_instance_1647.smt2 | 57 ------------------- .../unsolved_pcp_instance_1648.smt2 | 57 ------------------- .../unsolved_pcp_instance_1649.smt2 | 57 ------------------- .../unsolved_pcp_instance_1650.smt2 | 57 ------------------- .../unsolved_pcp_instance_1651.smt2 | 57 ------------------- .../unsolved_pcp_instance_1652.smt2 | 57 ------------------- .../unsolved_pcp_instance_1653.smt2 | 57 ------------------- .../unsolved_pcp_instance_1654.smt2 | 57 ------------------- .../unsolved_pcp_instance_1655.smt2 | 57 ------------------- .../unsolved_pcp_instance_1656.smt2 | 57 ------------------- .../unsolved_pcp_instance_1657.smt2 | 57 ------------------- .../unsolved_pcp_instance_1658.smt2 | 57 ------------------- .../unsolved_pcp_instance_1659.smt2 | 57 ------------------- .../unsolved_pcp_instance_1660.smt2 | 57 ------------------- .../unsolved_pcp_instance_1661.smt2 | 57 ------------------- .../unsolved_pcp_instance_1662.smt2 | 57 ------------------- .../unsolved_pcp_instance_1663.smt2 | 57 ------------------- .../unsolved_pcp_instance_1664.smt2 | 57 ------------------- .../unsolved_pcp_instance_1665.smt2 | 57 ------------------- .../unsolved_pcp_instance_1666.smt2 | 57 ------------------- .../unsolved_pcp_instance_1667.smt2 | 57 ------------------- .../unsolved_pcp_instance_1668.smt2 | 57 ------------------- .../unsolved_pcp_instance_1669.smt2 | 57 ------------------- .../unsolved_pcp_instance_1670.smt2 | 57 ------------------- .../unsolved_pcp_instance_1671.smt2 | 57 ------------------- .../unsolved_pcp_instance_1672.smt2 | 57 ------------------- .../unsolved_pcp_instance_1673.smt2 | 57 ------------------- .../unsolved_pcp_instance_1674.smt2 | 57 ------------------- .../unsolved_pcp_instance_1675.smt2 | 57 ------------------- .../unsolved_pcp_instance_1676.smt2 | 57 ------------------- .../unsolved_pcp_instance_1677.smt2 | 57 ------------------- .../unsolved_pcp_instance_1678.smt2 | 57 ------------------- .../unsolved_pcp_instance_1679.smt2 | 57 ------------------- .../unsolved_pcp_instance_1680.smt2 | 57 ------------------- .../unsolved_pcp_instance_1681.smt2 | 57 ------------------- .../unsolved_pcp_instance_1682.smt2 | 57 ------------------- .../unsolved_pcp_instance_1683.smt2 | 57 ------------------- .../unsolved_pcp_instance_1684.smt2 | 57 ------------------- .../unsolved_pcp_instance_1685.smt2 | 57 ------------------- .../unsolved_pcp_instance_1686.smt2 | 57 ------------------- .../unsolved_pcp_instance_1687.smt2 | 57 ------------------- .../unsolved_pcp_instance_1688.smt2 | 57 ------------------- .../unsolved_pcp_instance_1689.smt2 | 57 ------------------- .../unsolved_pcp_instance_1690.smt2 | 57 ------------------- .../unsolved_pcp_instance_1691.smt2 | 57 ------------------- .../unsolved_pcp_instance_1692.smt2 | 57 ------------------- .../unsolved_pcp_instance_1693.smt2 | 57 ------------------- .../unsolved_pcp_instance_1694.smt2 | 57 ------------------- .../unsolved_pcp_instance_1695.smt2 | 57 ------------------- .../unsolved_pcp_instance_1696.smt2 | 57 ------------------- .../unsolved_pcp_instance_1697.smt2 | 57 ------------------- .../unsolved_pcp_instance_1698.smt2 | 57 ------------------- .../unsolved_pcp_instance_1699.smt2 | 57 ------------------- .../unsolved_pcp_instance_1700.smt2 | 57 ------------------- .../unsolved_pcp_instance_1701.smt2 | 57 ------------------- .../unsolved_pcp_instance_1702.smt2 | 57 ------------------- .../unsolved_pcp_instance_1703.smt2 | 57 ------------------- .../unsolved_pcp_instance_1704.smt2 | 57 ------------------- .../unsolved_pcp_instance_1705.smt2 | 57 ------------------- .../unsolved_pcp_instance_1706.smt2 | 57 ------------------- .../unsolved_pcp_instance_1707.smt2 | 57 ------------------- .../unsolved_pcp_instance_1708.smt2 | 57 ------------------- .../unsolved_pcp_instance_1709.smt2 | 57 ------------------- .../unsolved_pcp_instance_1710.smt2 | 57 ------------------- .../unsolved_pcp_instance_1711.smt2 | 57 ------------------- .../unsolved_pcp_instance_1712.smt2 | 57 ------------------- .../unsolved_pcp_instance_1713.smt2 | 57 ------------------- .../unsolved_pcp_instance_1714.smt2 | 57 ------------------- .../unsolved_pcp_instance_1715.smt2 | 57 ------------------- .../unsolved_pcp_instance_1716.smt2 | 57 ------------------- .../unsolved_pcp_instance_1717.smt2 | 57 ------------------- .../unsolved_pcp_instance_1718.smt2 | 57 ------------------- .../unsolved_pcp_instance_1719.smt2 | 57 ------------------- .../unsolved_pcp_instance_1720.smt2 | 57 ------------------- .../unsolved_pcp_instance_1721.smt2 | 57 ------------------- .../unsolved_pcp_instance_1722.smt2 | 57 ------------------- .../unsolved_pcp_instance_1723.smt2 | 57 ------------------- .../unsolved_pcp_instance_1724.smt2 | 57 ------------------- .../unsolved_pcp_instance_1725.smt2 | 57 ------------------- .../unsolved_pcp_instance_1726.smt2 | 57 ------------------- .../unsolved_pcp_instance_1727.smt2 | 57 ------------------- .../unsolved_pcp_instance_1728.smt2 | 57 ------------------- .../unsolved_pcp_instance_1729.smt2 | 57 ------------------- .../unsolved_pcp_instance_1730.smt2 | 57 ------------------- .../unsolved_pcp_instance_1731.smt2 | 57 ------------------- .../unsolved_pcp_instance_1732.smt2 | 57 ------------------- .../unsolved_pcp_instance_1733.smt2 | 57 ------------------- .../unsolved_pcp_instance_1734.smt2 | 57 ------------------- .../unsolved_pcp_instance_1735.smt2 | 57 ------------------- .../unsolved_pcp_instance_1736.smt2 | 57 ------------------- .../unsolved_pcp_instance_1737.smt2 | 57 ------------------- .../unsolved_pcp_instance_1738.smt2 | 57 ------------------- .../unsolved_pcp_instance_1739.smt2 | 57 ------------------- .../unsolved_pcp_instance_1740.smt2 | 57 ------------------- .../unsolved_pcp_instance_1741.smt2 | 57 ------------------- .../unsolved_pcp_instance_1742.smt2 | 57 ------------------- .../unsolved_pcp_instance_1743.smt2 | 57 ------------------- .../unsolved_pcp_instance_1744.smt2 | 57 ------------------- .../unsolved_pcp_instance_1745.smt2 | 57 ------------------- .../unsolved_pcp_instance_1746.smt2 | 57 ------------------- .../unsolved_pcp_instance_1747.smt2 | 57 ------------------- .../unsolved_pcp_instance_1748.smt2 | 57 ------------------- .../unsolved_pcp_instance_1749.smt2 | 57 ------------------- .../unsolved_pcp_instance_1750.smt2 | 57 ------------------- .../unsolved_pcp_instance_1751.smt2 | 57 ------------------- .../unsolved_pcp_instance_1752.smt2 | 57 ------------------- .../unsolved_pcp_instance_1753.smt2 | 57 ------------------- .../unsolved_pcp_instance_1754.smt2 | 57 ------------------- .../unsolved_pcp_instance_1755.smt2 | 57 ------------------- .../unsolved_pcp_instance_1756.smt2 | 57 ------------------- .../unsolved_pcp_instance_1757.smt2 | 57 ------------------- .../unsolved_pcp_instance_1758.smt2 | 57 ------------------- .../unsolved_pcp_instance_1759.smt2 | 57 ------------------- .../unsolved_pcp_instance_1760.smt2 | 57 ------------------- .../unsolved_pcp_instance_1761.smt2 | 57 ------------------- .../unsolved_pcp_instance_1762.smt2 | 57 ------------------- .../unsolved_pcp_instance_1763.smt2 | 57 ------------------- .../unsolved_pcp_instance_1764.smt2 | 57 ------------------- .../unsolved_pcp_instance_1765.smt2 | 57 ------------------- .../unsolved_pcp_instance_1766.smt2 | 57 ------------------- .../unsolved_pcp_instance_1767.smt2 | 57 ------------------- .../unsolved_pcp_instance_1768.smt2 | 57 ------------------- .../unsolved_pcp_instance_1769.smt2 | 57 ------------------- .../unsolved_pcp_instance_1770.smt2 | 57 ------------------- .../unsolved_pcp_instance_1771.smt2 | 57 ------------------- .../unsolved_pcp_instance_1772.smt2 | 57 ------------------- .../unsolved_pcp_instance_1773.smt2 | 57 ------------------- .../unsolved_pcp_instance_1774.smt2 | 57 ------------------- .../unsolved_pcp_instance_1775.smt2 | 57 ------------------- .../unsolved_pcp_instance_1776.smt2 | 57 ------------------- .../unsolved_pcp_instance_1777.smt2 | 57 ------------------- .../unsolved_pcp_instance_1778.smt2 | 57 ------------------- .../unsolved_pcp_instance_1779.smt2 | 57 ------------------- .../unsolved_pcp_instance_1780.smt2 | 57 ------------------- .../unsolved_pcp_instance_1781.smt2 | 57 ------------------- .../unsolved_pcp_instance_1782.smt2 | 57 ------------------- .../unsolved_pcp_instance_1783.smt2 | 57 ------------------- .../unsolved_pcp_instance_1784.smt2 | 57 ------------------- .../unsolved_pcp_instance_1785.smt2 | 57 ------------------- .../unsolved_pcp_instance_1786.smt2 | 57 ------------------- .../unsolved_pcp_instance_1787.smt2 | 57 ------------------- .../unsolved_pcp_instance_1788.smt2 | 57 ------------------- .../unsolved_pcp_instance_1789.smt2 | 57 ------------------- .../unsolved_pcp_instance_1790.smt2 | 57 ------------------- .../unsolved_pcp_instance_1791.smt2 | 57 ------------------- .../unsolved_pcp_instance_1792.smt2 | 57 ------------------- .../unsolved_pcp_instance_1793.smt2 | 57 ------------------- .../unsolved_pcp_instance_1794.smt2 | 57 ------------------- .../unsolved_pcp_instance_1795.smt2 | 57 ------------------- .../unsolved_pcp_instance_1796.smt2 | 57 ------------------- .../unsolved_pcp_instance_1797.smt2 | 57 ------------------- .../unsolved_pcp_instance_1798.smt2 | 57 ------------------- .../unsolved_pcp_instance_1799.smt2 | 57 ------------------- .../unsolved_pcp_instance_1800.smt2 | 57 ------------------- .../unsolved_pcp_instance_1801.smt2 | 57 ------------------- .../unsolved_pcp_instance_1802.smt2 | 57 ------------------- .../unsolved_pcp_instance_1803.smt2 | 57 ------------------- .../unsolved_pcp_instance_1804.smt2 | 57 ------------------- .../unsolved_pcp_instance_1805.smt2 | 57 ------------------- .../unsolved_pcp_instance_1806.smt2 | 57 ------------------- .../unsolved_pcp_instance_1807.smt2 | 57 ------------------- .../unsolved_pcp_instance_1808.smt2 | 57 ------------------- .../unsolved_pcp_instance_1809.smt2 | 57 ------------------- .../unsolved_pcp_instance_1810.smt2 | 57 ------------------- .../unsolved_pcp_instance_1811.smt2 | 57 ------------------- .../unsolved_pcp_instance_1812.smt2 | 57 ------------------- .../unsolved_pcp_instance_1813.smt2 | 57 ------------------- .../unsolved_pcp_instance_1814.smt2 | 57 ------------------- .../unsolved_pcp_instance_1815.smt2 | 57 ------------------- .../unsolved_pcp_instance_1816.smt2 | 57 ------------------- .../unsolved_pcp_instance_1817.smt2 | 57 ------------------- .../unsolved_pcp_instance_1818.smt2 | 57 ------------------- .../unsolved_pcp_instance_1819.smt2 | 57 ------------------- .../unsolved_pcp_instance_1820.smt2 | 57 ------------------- .../unsolved_pcp_instance_1821.smt2 | 57 ------------------- .../unsolved_pcp_instance_1822.smt2 | 57 ------------------- .../unsolved_pcp_instance_1823.smt2 | 57 ------------------- .../unsolved_pcp_instance_1824.smt2 | 57 ------------------- .../unsolved_pcp_instance_1825.smt2 | 57 ------------------- .../unsolved_pcp_instance_1826.smt2 | 57 ------------------- .../unsolved_pcp_instance_1827.smt2 | 57 ------------------- .../unsolved_pcp_instance_1828.smt2 | 57 ------------------- .../unsolved_pcp_instance_1829.smt2 | 57 ------------------- .../unsolved_pcp_instance_1830.smt2 | 57 ------------------- .../unsolved_pcp_instance_1831.smt2 | 57 ------------------- .../unsolved_pcp_instance_1832.smt2 | 57 ------------------- .../unsolved_pcp_instance_1833.smt2 | 57 ------------------- .../unsolved_pcp_instance_1834.smt2 | 57 ------------------- .../unsolved_pcp_instance_1835.smt2 | 57 ------------------- .../unsolved_pcp_instance_1836.smt2 | 57 ------------------- .../unsolved_pcp_instance_1837.smt2 | 57 ------------------- .../unsolved_pcp_instance_1838.smt2 | 57 ------------------- .../unsolved_pcp_instance_1839.smt2 | 57 ------------------- .../unsolved_pcp_instance_1840.smt2 | 57 ------------------- .../unsolved_pcp_instance_1841.smt2 | 57 ------------------- .../unsolved_pcp_instance_1842.smt2 | 57 ------------------- .../unsolved_pcp_instance_1843.smt2 | 57 ------------------- .../unsolved_pcp_instance_1844.smt2 | 57 ------------------- .../unsolved_pcp_instance_1845.smt2 | 57 ------------------- .../unsolved_pcp_instance_1846.smt2 | 57 ------------------- .../unsolved_pcp_instance_1847.smt2 | 57 ------------------- .../unsolved_pcp_instance_1848.smt2 | 57 ------------------- .../unsolved_pcp_instance_1849.smt2 | 57 ------------------- .../unsolved_pcp_instance_1850.smt2 | 57 ------------------- .../unsolved_pcp_instance_1851.smt2 | 57 ------------------- .../unsolved_pcp_instance_1852.smt2 | 57 ------------------- .../unsolved_pcp_instance_1853.smt2 | 57 ------------------- .../unsolved_pcp_instance_1854.smt2 | 57 ------------------- .../unsolved_pcp_instance_1855.smt2 | 57 ------------------- .../unsolved_pcp_instance_1856.smt2 | 57 ------------------- .../unsolved_pcp_instance_1857.smt2 | 57 ------------------- .../unsolved_pcp_instance_1858.smt2 | 57 ------------------- .../unsolved_pcp_instance_1859.smt2 | 57 ------------------- .../unsolved_pcp_instance_1860.smt2 | 57 ------------------- .../unsolved_pcp_instance_1861.smt2 | 57 ------------------- .../unsolved_pcp_instance_1862.smt2 | 57 ------------------- .../unsolved_pcp_instance_1863.smt2 | 57 ------------------- .../unsolved_pcp_instance_1864.smt2 | 57 ------------------- .../unsolved_pcp_instance_1865.smt2 | 57 ------------------- .../unsolved_pcp_instance_1866.smt2 | 57 ------------------- .../unsolved_pcp_instance_1867.smt2 | 57 ------------------- .../unsolved_pcp_instance_1868.smt2 | 57 ------------------- .../unsolved_pcp_instance_1869.smt2 | 57 ------------------- .../unsolved_pcp_instance_1870.smt2 | 57 ------------------- .../unsolved_pcp_instance_1871.smt2 | 57 ------------------- .../unsolved_pcp_instance_1872.smt2 | 57 ------------------- .../unsolved_pcp_instance_1873.smt2 | 57 ------------------- .../unsolved_pcp_instance_1874.smt2 | 57 ------------------- .../unsolved_pcp_instance_1875.smt2 | 57 ------------------- .../unsolved_pcp_instance_1876.smt2 | 57 ------------------- .../unsolved_pcp_instance_1877.smt2 | 57 ------------------- .../unsolved_pcp_instance_1878.smt2 | 57 ------------------- .../unsolved_pcp_instance_1879.smt2 | 57 ------------------- .../unsolved_pcp_instance_1880.smt2 | 57 ------------------- .../unsolved_pcp_instance_1881.smt2 | 57 ------------------- .../unsolved_pcp_instance_1882.smt2 | 57 ------------------- .../unsolved_pcp_instance_1883.smt2 | 57 ------------------- .../unsolved_pcp_instance_1884.smt2 | 57 ------------------- .../unsolved_pcp_instance_1885.smt2 | 57 ------------------- .../unsolved_pcp_instance_1886.smt2 | 57 ------------------- .../unsolved_pcp_instance_1887.smt2 | 57 ------------------- .../unsolved_pcp_instance_1888.smt2 | 57 ------------------- .../unsolved_pcp_instance_1889.smt2 | 57 ------------------- .../unsolved_pcp_instance_1890.smt2 | 57 ------------------- .../unsolved_pcp_instance_1891.smt2 | 57 ------------------- .../unsolved_pcp_instance_1892.smt2 | 57 ------------------- .../unsolved_pcp_instance_1893.smt2 | 57 ------------------- .../unsolved_pcp_instance_1894.smt2 | 57 ------------------- .../unsolved_pcp_instance_1895.smt2 | 57 ------------------- .../unsolved_pcp_instance_1896.smt2 | 57 ------------------- .../unsolved_pcp_instance_1897.smt2 | 57 ------------------- .../unsolved_pcp_instance_1898.smt2 | 57 ------------------- .../unsolved_pcp_instance_1899.smt2 | 57 ------------------- .../unsolved_pcp_instance_1900.smt2 | 57 ------------------- .../unsolved_pcp_instance_1901.smt2 | 57 ------------------- .../unsolved_pcp_instance_1902.smt2 | 57 ------------------- .../unsolved_pcp_instance_1903.smt2 | 57 ------------------- .../unsolved_pcp_instance_1904.smt2 | 57 ------------------- .../unsolved_pcp_instance_1905.smt2 | 57 ------------------- .../unsolved_pcp_instance_1906.smt2 | 57 ------------------- .../unsolved_pcp_instance_1907.smt2 | 57 ------------------- .../unsolved_pcp_instance_1908.smt2 | 57 ------------------- .../unsolved_pcp_instance_1909.smt2 | 57 ------------------- .../unsolved_pcp_instance_1910.smt2 | 57 ------------------- .../unsolved_pcp_instance_1911.smt2 | 57 ------------------- .../unsolved_pcp_instance_1912.smt2 | 57 ------------------- .../unsolved_pcp_instance_1913.smt2 | 57 ------------------- .../unsolved_pcp_instance_1914.smt2 | 57 ------------------- .../unsolved_pcp_instance_1915.smt2 | 57 ------------------- .../unsolved_pcp_instance_1916.smt2 | 57 ------------------- .../unsolved_pcp_instance_1917.smt2 | 57 ------------------- .../unsolved_pcp_instance_1918.smt2 | 57 ------------------- .../unsolved_pcp_instance_1919.smt2 | 57 ------------------- .../unsolved_pcp_instance_1920.smt2 | 57 ------------------- .../unsolved_pcp_instance_1921.smt2 | 57 ------------------- .../unsolved_pcp_instance_1922.smt2 | 57 ------------------- .../unsolved_pcp_instance_1923.smt2 | 57 ------------------- .../unsolved_pcp_instance_1924.smt2 | 57 ------------------- .../unsolved_pcp_instance_1925.smt2 | 57 ------------------- .../unsolved_pcp_instance_1926.smt2 | 57 ------------------- .../unsolved_pcp_instance_1927.smt2 | 57 ------------------- .../unsolved_pcp_instance_1928.smt2 | 57 ------------------- .../unsolved_pcp_instance_1929.smt2 | 57 ------------------- .../unsolved_pcp_instance_1930.smt2 | 57 ------------------- .../unsolved_pcp_instance_1931.smt2 | 57 ------------------- .../unsolved_pcp_instance_1932.smt2 | 57 ------------------- .../unsolved_pcp_instance_1933.smt2 | 57 ------------------- .../unsolved_pcp_instance_1934.smt2 | 57 ------------------- .../unsolved_pcp_instance_1935.smt2 | 57 ------------------- .../unsolved_pcp_instance_1936.smt2 | 57 ------------------- .../unsolved_pcp_instance_1937.smt2 | 57 ------------------- .../unsolved_pcp_instance_1938.smt2 | 57 ------------------- .../unsolved_pcp_instance_1939.smt2 | 57 ------------------- .../unsolved_pcp_instance_1940.smt2 | 57 ------------------- .../unsolved_pcp_instance_1941.smt2 | 57 ------------------- .../unsolved_pcp_instance_1942.smt2 | 57 ------------------- .../unsolved_pcp_instance_1943.smt2 | 57 ------------------- .../unsolved_pcp_instance_1944.smt2 | 57 ------------------- .../unsolved_pcp_instance_1945.smt2 | 57 ------------------- .../unsolved_pcp_instance_1946.smt2 | 57 ------------------- .../unsolved_pcp_instance_1947.smt2 | 57 ------------------- .../unsolved_pcp_instance_1948.smt2 | 57 ------------------- .../unsolved_pcp_instance_1949.smt2 | 57 ------------------- .../unsolved_pcp_instance_1950.smt2 | 57 ------------------- .../unsolved_pcp_instance_1951.smt2 | 57 ------------------- .../unsolved_pcp_instance_1952.smt2 | 57 ------------------- .../unsolved_pcp_instance_1953.smt2 | 57 ------------------- .../unsolved_pcp_instance_1954.smt2 | 57 ------------------- .../unsolved_pcp_instance_1955.smt2 | 57 ------------------- .../unsolved_pcp_instance_1956.smt2 | 57 ------------------- .../unsolved_pcp_instance_1957.smt2 | 57 ------------------- .../unsolved_pcp_instance_1958.smt2 | 57 ------------------- .../unsolved_pcp_instance_1959.smt2 | 57 ------------------- .../unsolved_pcp_instance_1960.smt2 | 57 ------------------- .../unsolved_pcp_instance_1961.smt2 | 57 ------------------- .../unsolved_pcp_instance_1962.smt2 | 57 ------------------- .../unsolved_pcp_instance_1963.smt2 | 57 ------------------- .../unsolved_pcp_instance_1964.smt2 | 57 ------------------- .../unsolved_pcp_instance_1965.smt2 | 57 ------------------- .../unsolved_pcp_instance_1966.smt2 | 57 ------------------- .../unsolved_pcp_instance_1967.smt2 | 57 ------------------- .../unsolved_pcp_instance_1968.smt2 | 57 ------------------- .../unsolved_pcp_instance_1969.smt2 | 57 ------------------- .../unsolved_pcp_instance_1970.smt2 | 57 ------------------- .../unsolved_pcp_instance_1971.smt2 | 57 ------------------- .../unsolved_pcp_instance_1972.smt2 | 57 ------------------- .../unsolved_pcp_instance_1973.smt2 | 57 ------------------- .../unsolved_pcp_instance_1974.smt2 | 57 ------------------- .../unsolved_pcp_instance_1975.smt2 | 57 ------------------- .../unsolved_pcp_instance_1976.smt2 | 57 ------------------- .../unsolved_pcp_instance_1977.smt2 | 57 ------------------- .../unsolved_pcp_instance_1978.smt2 | 57 ------------------- .../unsolved_pcp_instance_1979.smt2 | 57 ------------------- .../unsolved_pcp_instance_1980.smt2 | 57 ------------------- .../unsolved_pcp_instance_1981.smt2 | 57 ------------------- .../unsolved_pcp_instance_1982.smt2 | 57 ------------------- .../unsolved_pcp_instance_1983.smt2 | 57 ------------------- .../unsolved_pcp_instance_1984.smt2 | 57 ------------------- .../unsolved_pcp_instance_1985.smt2 | 57 ------------------- .../unsolved_pcp_instance_1986.smt2 | 57 ------------------- .../unsolved_pcp_instance_1987.smt2 | 57 ------------------- .../unsolved_pcp_instance_1988.smt2 | 57 ------------------- .../unsolved_pcp_instance_1989.smt2 | 57 ------------------- .../unsolved_pcp_instance_1990.smt2 | 57 ------------------- .../unsolved_pcp_instance_1991.smt2 | 57 ------------------- .../unsolved_pcp_instance_1992.smt2 | 57 ------------------- .../unsolved_pcp_instance_1993.smt2 | 57 ------------------- .../unsolved_pcp_instance_1994.smt2 | 57 ------------------- .../unsolved_pcp_instance_1995.smt2 | 57 ------------------- .../unsolved_pcp_instance_1996.smt2 | 57 ------------------- .../unsolved_pcp_instance_1997.smt2 | 57 ------------------- .../unsolved_pcp_instance_1998.smt2 | 57 ------------------- .../unsolved_pcp_instance_1999.smt2 | 57 ------------------- .../unsolved_pcp_instance_2000.smt2 | 57 ------------------- .../unsolved_pcp_instance_2001.smt2 | 57 ------------------- .../unsolved_pcp_instance_2002.smt2 | 57 ------------------- .../unsolved_pcp_instance_2003.smt2 | 57 ------------------- .../unsolved_pcp_instance_2004.smt2 | 57 ------------------- .../unsolved_pcp_instance_2005.smt2 | 57 ------------------- .../unsolved_pcp_instance_2006.smt2 | 57 ------------------- .../unsolved_pcp_instance_2007.smt2 | 57 ------------------- .../unsolved_pcp_instance_2008.smt2 | 57 ------------------- .../unsolved_pcp_instance_2009.smt2 | 57 ------------------- .../unsolved_pcp_instance_2010.smt2 | 57 ------------------- .../unsolved_pcp_instance_2011.smt2 | 57 ------------------- .../unsolved_pcp_instance_2012.smt2 | 57 ------------------- .../unsolved_pcp_instance_2013.smt2 | 57 ------------------- .../unsolved_pcp_instance_2014.smt2 | 57 ------------------- .../unsolved_pcp_instance_2015.smt2 | 57 ------------------- .../unsolved_pcp_instance_2016.smt2 | 57 ------------------- .../unsolved_pcp_instance_2017.smt2 | 57 ------------------- .../unsolved_pcp_instance_2018.smt2 | 57 ------------------- .../unsolved_pcp_instance_2019.smt2 | 57 ------------------- .../unsolved_pcp_instance_2020.smt2 | 57 ------------------- .../unsolved_pcp_instance_2021.smt2 | 57 ------------------- .../unsolved_pcp_instance_2022.smt2 | 57 ------------------- .../unsolved_pcp_instance_2023.smt2 | 57 ------------------- .../unsolved_pcp_instance_2024.smt2 | 57 ------------------- .../unsolved_pcp_instance_2025.smt2 | 57 ------------------- .../unsolved_pcp_instance_2026.smt2 | 57 ------------------- .../unsolved_pcp_instance_2027.smt2 | 57 ------------------- .../unsolved_pcp_instance_2028.smt2 | 57 ------------------- .../unsolved_pcp_instance_2029.smt2 | 57 ------------------- .../unsolved_pcp_instance_2030.smt2 | 57 ------------------- .../unsolved_pcp_instance_2031.smt2 | 57 ------------------- .../unsolved_pcp_instance_2032.smt2 | 57 ------------------- .../unsolved_pcp_instance_2033.smt2 | 57 ------------------- .../unsolved_pcp_instance_2034.smt2 | 57 ------------------- .../unsolved_pcp_instance_2035.smt2 | 57 ------------------- .../unsolved_pcp_instance_2036.smt2 | 57 ------------------- .../unsolved_pcp_instance_2037.smt2 | 57 ------------------- .../unsolved_pcp_instance_2038.smt2 | 57 ------------------- .../unsolved_pcp_instance_2039.smt2 | 57 ------------------- .../unsolved_pcp_instance_2040.smt2 | 57 ------------------- .../unsolved_pcp_instance_2041.smt2 | 57 ------------------- .../unsolved_pcp_instance_2042.smt2 | 57 ------------------- .../unsolved_pcp_instance_2043.smt2 | 57 ------------------- .../unsolved_pcp_instance_2044.smt2 | 57 ------------------- .../unsolved_pcp_instance_2045.smt2 | 57 ------------------- .../unsolved_pcp_instance_2046.smt2 | 57 ------------------- .../unsolved_pcp_instance_2047.smt2 | 57 ------------------- .../unsolved_pcp_instance_2048.smt2 | 57 ------------------- .../unsolved_pcp_instance_2049.smt2 | 57 ------------------- .../unsolved_pcp_instance_2050.smt2 | 57 ------------------- .../unsolved_pcp_instance_2051.smt2 | 57 ------------------- .../unsolved_pcp_instance_2052.smt2 | 57 ------------------- .../unsolved_pcp_instance_2053.smt2 | 57 ------------------- .../unsolved_pcp_instance_2054.smt2 | 57 ------------------- .../unsolved_pcp_instance_2055.smt2 | 57 ------------------- .../unsolved_pcp_instance_2056.smt2 | 57 ------------------- .../unsolved_pcp_instance_2057.smt2 | 57 ------------------- .../unsolved_pcp_instance_2058.smt2 | 57 ------------------- .../unsolved_pcp_instance_2059.smt2 | 57 ------------------- .../unsolved_pcp_instance_2060.smt2 | 57 ------------------- .../unsolved_pcp_instance_2061.smt2 | 57 ------------------- .../unsolved_pcp_instance_2062.smt2 | 57 ------------------- .../unsolved_pcp_instance_2063.smt2 | 57 ------------------- .../unsolved_pcp_instance_2064.smt2 | 57 ------------------- .../unsolved_pcp_instance_2065.smt2 | 57 ------------------- .../unsolved_pcp_instance_2066.smt2 | 57 ------------------- .../unsolved_pcp_instance_2067.smt2 | 57 ------------------- .../unsolved_pcp_instance_2068.smt2 | 57 ------------------- .../unsolved_pcp_instance_2069.smt2 | 57 ------------------- .../unsolved_pcp_instance_2070.smt2 | 57 ------------------- .../unsolved_pcp_instance_2071.smt2 | 57 ------------------- .../unsolved_pcp_instance_2072.smt2 | 57 ------------------- .../unsolved_pcp_instance_2073.smt2 | 57 ------------------- .../unsolved_pcp_instance_2074.smt2 | 57 ------------------- .../unsolved_pcp_instance_2075.smt2 | 57 ------------------- .../unsolved_pcp_instance_2076.smt2 | 57 ------------------- .../unsolved_pcp_instance_2077.smt2 | 57 ------------------- .../unsolved_pcp_instance_2078.smt2 | 57 ------------------- .../unsolved_pcp_instance_2079.smt2 | 57 ------------------- .../unsolved_pcp_instance_2080.smt2 | 57 ------------------- .../unsolved_pcp_instance_2081.smt2 | 57 ------------------- .../unsolved_pcp_instance_2082.smt2 | 57 ------------------- .../unsolved_pcp_instance_2083.smt2 | 57 ------------------- .../unsolved_pcp_instance_2084.smt2 | 57 ------------------- .../unsolved_pcp_instance_2085.smt2 | 57 ------------------- .../unsolved_pcp_instance_2086.smt2 | 57 ------------------- .../unsolved_pcp_instance_2087.smt2 | 57 ------------------- .../unsolved_pcp_instance_2088.smt2 | 57 ------------------- .../unsolved_pcp_instance_2089.smt2 | 57 ------------------- .../unsolved_pcp_instance_2090.smt2 | 57 ------------------- .../unsolved_pcp_instance_2091.smt2 | 57 ------------------- .../unsolved_pcp_instance_2092.smt2 | 57 ------------------- .../unsolved_pcp_instance_2093.smt2 | 57 ------------------- .../unsolved_pcp_instance_2094.smt2 | 57 ------------------- .../unsolved_pcp_instance_2095.smt2 | 57 ------------------- .../unsolved_pcp_instance_2096.smt2 | 57 ------------------- .../unsolved_pcp_instance_2097.smt2 | 57 ------------------- .../unsolved_pcp_instance_2098.smt2 | 57 ------------------- .../unsolved_pcp_instance_2099.smt2 | 57 ------------------- .../unsolved_pcp_instance_2100.smt2 | 57 ------------------- .../unsolved_pcp_instance_2101.smt2 | 57 ------------------- .../unsolved_pcp_instance_2102.smt2 | 57 ------------------- .../unsolved_pcp_instance_2103.smt2 | 57 ------------------- .../unsolved_pcp_instance_2104.smt2 | 57 ------------------- .../unsolved_pcp_instance_2105.smt2 | 57 ------------------- .../unsolved_pcp_instance_2106.smt2 | 57 ------------------- .../unsolved_pcp_instance_2107.smt2 | 57 ------------------- .../unsolved_pcp_instance_2108.smt2 | 57 ------------------- .../unsolved_pcp_instance_2109.smt2 | 57 ------------------- .../unsolved_pcp_instance_2110.smt2 | 57 ------------------- .../unsolved_pcp_instance_2111.smt2 | 57 ------------------- .../unsolved_pcp_instance_2112.smt2 | 57 ------------------- .../unsolved_pcp_instance_2113.smt2 | 57 ------------------- .../unsolved_pcp_instance_2114.smt2 | 57 ------------------- .../unsolved_pcp_instance_2115.smt2 | 57 ------------------- .../unsolved_pcp_instance_2116.smt2 | 57 ------------------- .../unsolved_pcp_instance_2117.smt2 | 57 ------------------- .../unsolved_pcp_instance_2118.smt2 | 57 ------------------- .../unsolved_pcp_instance_2119.smt2 | 57 ------------------- .../unsolved_pcp_instance_2120.smt2 | 57 ------------------- .../unsolved_pcp_instance_2121.smt2 | 57 ------------------- .../unsolved_pcp_instance_2122.smt2 | 57 ------------------- .../unsolved_pcp_instance_2123.smt2 | 57 ------------------- .../unsolved_pcp_instance_2124.smt2 | 57 ------------------- .../unsolved_pcp_instance_2125.smt2 | 57 ------------------- .../unsolved_pcp_instance_2126.smt2 | 57 ------------------- .../unsolved_pcp_instance_2127.smt2 | 57 ------------------- .../unsolved_pcp_instance_2128.smt2 | 57 ------------------- .../unsolved_pcp_instance_2129.smt2 | 57 ------------------- .../unsolved_pcp_instance_2130.smt2 | 57 ------------------- .../unsolved_pcp_instance_2131.smt2 | 57 ------------------- .../unsolved_pcp_instance_2132.smt2 | 57 ------------------- .../unsolved_pcp_instance_2133.smt2 | 57 ------------------- .../unsolved_pcp_instance_2134.smt2 | 57 ------------------- .../unsolved_pcp_instance_2135.smt2 | 57 ------------------- .../unsolved_pcp_instance_2136.smt2 | 57 ------------------- .../unsolved_pcp_instance_2137.smt2 | 57 ------------------- .../unsolved_pcp_instance_2138.smt2 | 57 ------------------- .../unsolved_pcp_instance_2139.smt2 | 57 ------------------- .../unsolved_pcp_instance_2140.smt2 | 57 ------------------- .../unsolved_pcp_instance_2141.smt2 | 57 ------------------- .../unsolved_pcp_instance_2142.smt2 | 57 ------------------- .../unsolved_pcp_instance_2143.smt2 | 57 ------------------- .../unsolved_pcp_instance_2144.smt2 | 57 ------------------- .../unsolved_pcp_instance_2145.smt2 | 57 ------------------- .../unsolved_pcp_instance_2146.smt2 | 57 ------------------- .../unsolved_pcp_instance_2147.smt2 | 57 ------------------- .../unsolved_pcp_instance_2148.smt2 | 57 ------------------- .../unsolved_pcp_instance_2149.smt2 | 57 ------------------- .../unsolved_pcp_instance_2150.smt2 | 57 ------------------- .../unsolved_pcp_instance_2151.smt2 | 57 ------------------- .../unsolved_pcp_instance_2152.smt2 | 57 ------------------- .../unsolved_pcp_instance_2153.smt2 | 57 ------------------- .../unsolved_pcp_instance_2154.smt2 | 57 ------------------- .../unsolved_pcp_instance_2155.smt2 | 57 ------------------- .../unsolved_pcp_instance_2156.smt2 | 57 ------------------- .../unsolved_pcp_instance_2157.smt2 | 57 ------------------- .../unsolved_pcp_instance_2158.smt2 | 57 ------------------- .../unsolved_pcp_instance_2159.smt2 | 57 ------------------- .../unsolved_pcp_instance_2160.smt2 | 57 ------------------- .../unsolved_pcp_instance_2161.smt2 | 57 ------------------- .../unsolved_pcp_instance_2162.smt2 | 57 ------------------- .../unsolved_pcp_instance_2163.smt2 | 57 ------------------- .../unsolved_pcp_instance_2164.smt2 | 57 ------------------- .../unsolved_pcp_instance_2165.smt2 | 57 ------------------- .../unsolved_pcp_instance_2166.smt2 | 57 ------------------- .../unsolved_pcp_instance_2167.smt2 | 57 ------------------- .../unsolved_pcp_instance_2168.smt2 | 57 ------------------- .../unsolved_pcp_instance_2169.smt2 | 57 ------------------- .../unsolved_pcp_instance_2170.smt2 | 57 ------------------- .../unsolved_pcp_instance_2171.smt2 | 57 ------------------- .../unsolved_pcp_instance_2172.smt2 | 57 ------------------- .../unsolved_pcp_instance_2173.smt2 | 57 ------------------- .../unsolved_pcp_instance_2174.smt2 | 57 ------------------- .../unsolved_pcp_instance_2175.smt2 | 57 ------------------- .../unsolved_pcp_instance_2176.smt2 | 57 ------------------- .../unsolved_pcp_instance_2177.smt2 | 57 ------------------- .../unsolved_pcp_instance_2178.smt2 | 57 ------------------- .../unsolved_pcp_instance_2179.smt2 | 57 ------------------- .../unsolved_pcp_instance_2180.smt2 | 57 ------------------- .../unsolved_pcp_instance_2181.smt2 | 57 ------------------- .../unsolved_pcp_instance_2182.smt2 | 57 ------------------- .../unsolved_pcp_instance_2183.smt2 | 57 ------------------- .../unsolved_pcp_instance_2184.smt2 | 57 ------------------- .../unsolved_pcp_instance_2185.smt2 | 57 ------------------- .../unsolved_pcp_instance_2186.smt2 | 57 ------------------- .../unsolved_pcp_instance_2187.smt2 | 57 ------------------- .../unsolved_pcp_instance_2188.smt2 | 57 ------------------- .../unsolved_pcp_instance_2189.smt2 | 57 ------------------- .../unsolved_pcp_instance_2190.smt2 | 57 ------------------- .../unsolved_pcp_instance_2191.smt2 | 57 ------------------- .../unsolved_pcp_instance_2192.smt2 | 57 ------------------- .../unsolved_pcp_instance_2193.smt2 | 57 ------------------- .../unsolved_pcp_instance_2194.smt2 | 57 ------------------- .../unsolved_pcp_instance_2195.smt2 | 57 ------------------- .../unsolved_pcp_instance_2196.smt2 | 57 ------------------- .../unsolved_pcp_instance_2197.smt2 | 57 ------------------- .../unsolved_pcp_instance_2198.smt2 | 57 ------------------- .../unsolved_pcp_instance_2199.smt2 | 57 ------------------- .../unsolved_pcp_instance_2200.smt2 | 57 ------------------- .../unsolved_pcp_instance_2201.smt2 | 57 ------------------- .../unsolved_pcp_instance_2202.smt2 | 57 ------------------- .../unsolved_pcp_instance_2203.smt2 | 57 ------------------- .../unsolved_pcp_instance_2204.smt2 | 57 ------------------- .../unsolved_pcp_instance_2205.smt2 | 57 ------------------- .../unsolved_pcp_instance_2206.smt2 | 57 ------------------- .../unsolved_pcp_instance_2207.smt2 | 57 ------------------- .../unsolved_pcp_instance_2208.smt2 | 57 ------------------- .../unsolved_pcp_instance_2209.smt2 | 57 ------------------- .../unsolved_pcp_instance_2210.smt2 | 57 ------------------- .../unsolved_pcp_instance_2211.smt2 | 57 ------------------- .../unsolved_pcp_instance_2212.smt2 | 57 ------------------- .../unsolved_pcp_instance_2213.smt2 | 57 ------------------- .../unsolved_pcp_instance_2214.smt2 | 57 ------------------- .../unsolved_pcp_instance_2215.smt2 | 57 ------------------- .../unsolved_pcp_instance_2216.smt2 | 57 ------------------- .../unsolved_pcp_instance_2217.smt2 | 57 ------------------- .../unsolved_pcp_instance_2218.smt2 | 57 ------------------- .../unsolved_pcp_instance_2219.smt2 | 57 ------------------- .../unsolved_pcp_instance_2220.smt2 | 57 ------------------- .../unsolved_pcp_instance_2221.smt2 | 57 ------------------- .../unsolved_pcp_instance_2222.smt2 | 57 ------------------- .../unsolved_pcp_instance_2223.smt2 | 57 ------------------- .../unsolved_pcp_instance_2224.smt2 | 57 ------------------- .../unsolved_pcp_instance_2225.smt2 | 57 ------------------- .../unsolved_pcp_instance_2226.smt2 | 57 ------------------- .../unsolved_pcp_instance_2227.smt2 | 57 ------------------- .../unsolved_pcp_instance_2228.smt2 | 57 ------------------- .../unsolved_pcp_instance_2229.smt2 | 57 ------------------- .../unsolved_pcp_instance_2230.smt2 | 57 ------------------- .../unsolved_pcp_instance_2231.smt2 | 57 ------------------- .../unsolved_pcp_instance_2232.smt2 | 57 ------------------- .../unsolved_pcp_instance_2233.smt2 | 57 ------------------- .../unsolved_pcp_instance_2234.smt2 | 57 ------------------- .../unsolved_pcp_instance_2235.smt2 | 57 ------------------- .../unsolved_pcp_instance_2236.smt2 | 57 ------------------- .../unsolved_pcp_instance_2237.smt2 | 57 ------------------- .../unsolved_pcp_instance_2238.smt2 | 57 ------------------- .../unsolved_pcp_instance_2239.smt2 | 57 ------------------- .../unsolved_pcp_instance_2240.smt2 | 57 ------------------- .../unsolved_pcp_instance_2241.smt2 | 57 ------------------- .../unsolved_pcp_instance_2242.smt2 | 57 ------------------- .../unsolved_pcp_instance_2243.smt2 | 57 ------------------- .../unsolved_pcp_instance_2244.smt2 | 57 ------------------- .../unsolved_pcp_instance_2245.smt2 | 57 ------------------- .../unsolved_pcp_instance_2246.smt2 | 57 ------------------- .../unsolved_pcp_instance_2247.smt2 | 57 ------------------- .../unsolved_pcp_instance_2248.smt2 | 57 ------------------- .../unsolved_pcp_instance_2249.smt2 | 57 ------------------- .../unsolved_pcp_instance_2250.smt2 | 57 ------------------- .../unsolved_pcp_instance_2251.smt2 | 57 ------------------- .../unsolved_pcp_instance_2252.smt2 | 57 ------------------- .../unsolved_pcp_instance_2253.smt2 | 57 ------------------- .../unsolved_pcp_instance_2254.smt2 | 57 ------------------- .../unsolved_pcp_instance_2255.smt2 | 57 ------------------- .../unsolved_pcp_instance_2256.smt2 | 57 ------------------- .../unsolved_pcp_instance_2257.smt2 | 57 ------------------- .../unsolved_pcp_instance_2258.smt2 | 57 ------------------- .../unsolved_pcp_instance_2259.smt2 | 57 ------------------- .../unsolved_pcp_instance_2260.smt2 | 57 ------------------- .../unsolved_pcp_instance_2261.smt2 | 57 ------------------- .../unsolved_pcp_instance_2262.smt2 | 57 ------------------- .../unsolved_pcp_instance_2263.smt2 | 57 ------------------- .../unsolved_pcp_instance_2264.smt2 | 57 ------------------- .../unsolved_pcp_instance_2265.smt2 | 57 ------------------- .../unsolved_pcp_instance_2266.smt2 | 57 ------------------- .../unsolved_pcp_instance_2267.smt2 | 57 ------------------- .../unsolved_pcp_instance_2268.smt2 | 57 ------------------- .../unsolved_pcp_instance_2269.smt2 | 57 ------------------- .../unsolved_pcp_instance_2270.smt2 | 57 ------------------- .../unsolved_pcp_instance_2271.smt2 | 57 ------------------- .../unsolved_pcp_instance_2272.smt2 | 57 ------------------- .../unsolved_pcp_instance_2273.smt2 | 57 ------------------- .../unsolved_pcp_instance_2274.smt2 | 57 ------------------- .../unsolved_pcp_instance_2275.smt2 | 57 ------------------- .../unsolved_pcp_instance_2276.smt2 | 57 ------------------- .../unsolved_pcp_instance_2277.smt2 | 57 ------------------- .../unsolved_pcp_instance_2278.smt2 | 57 ------------------- .../unsolved_pcp_instance_2279.smt2 | 57 ------------------- .../unsolved_pcp_instance_2280.smt2 | 57 ------------------- .../unsolved_pcp_instance_2281.smt2 | 57 ------------------- .../unsolved_pcp_instance_2282.smt2 | 57 ------------------- .../unsolved_pcp_instance_2283.smt2 | 57 ------------------- .../unsolved_pcp_instance_2284.smt2 | 57 ------------------- .../unsolved_pcp_instance_2285.smt2 | 57 ------------------- .../unsolved_pcp_instance_2286.smt2 | 57 ------------------- .../unsolved_pcp_instance_2287.smt2 | 57 ------------------- .../unsolved_pcp_instance_2288.smt2 | 57 ------------------- .../unsolved_pcp_instance_2289.smt2 | 57 ------------------- .../unsolved_pcp_instance_2290.smt2 | 57 ------------------- .../unsolved_pcp_instance_2291.smt2 | 57 ------------------- .../unsolved_pcp_instance_2292.smt2 | 57 ------------------- .../unsolved_pcp_instance_2293.smt2 | 57 ------------------- .../unsolved_pcp_instance_2294.smt2 | 57 ------------------- .../unsolved_pcp_instance_2295.smt2 | 57 ------------------- .../unsolved_pcp_instance_2296.smt2 | 57 ------------------- .../unsolved_pcp_instance_2297.smt2 | 57 ------------------- .../unsolved_pcp_instance_2298.smt2 | 57 ------------------- .../unsolved_pcp_instance_2299.smt2 | 57 ------------------- .../unsolved_pcp_instance_2300.smt2 | 57 ------------------- .../unsolved_pcp_instance_2301.smt2 | 57 ------------------- .../unsolved_pcp_instance_2302.smt2 | 57 ------------------- .../unsolved_pcp_instance_2303.smt2 | 57 ------------------- .../unsolved_pcp_instance_2304.smt2 | 57 ------------------- .../unsolved_pcp_instance_2305.smt2 | 57 ------------------- .../unsolved_pcp_instance_2306.smt2 | 57 ------------------- .../unsolved_pcp_instance_2307.smt2 | 57 ------------------- .../unsolved_pcp_instance_2308.smt2 | 57 ------------------- .../unsolved_pcp_instance_2309.smt2 | 57 ------------------- .../unsolved_pcp_instance_2310.smt2 | 57 ------------------- .../unsolved_pcp_instance_2311.smt2 | 57 ------------------- .../unsolved_pcp_instance_2312.smt2 | 57 ------------------- .../unsolved_pcp_instance_2313.smt2 | 57 ------------------- .../unsolved_pcp_instance_2314.smt2 | 57 ------------------- .../unsolved_pcp_instance_2315.smt2 | 57 ------------------- .../unsolved_pcp_instance_2316.smt2 | 57 ------------------- .../unsolved_pcp_instance_2317.smt2 | 57 ------------------- .../unsolved_pcp_instance_2318.smt2 | 57 ------------------- .../unsolved_pcp_instance_2319.smt2 | 57 ------------------- .../unsolved_pcp_instance_2320.smt2 | 57 ------------------- .../unsolved_pcp_instance_2321.smt2 | 57 ------------------- .../unsolved_pcp_instance_2322.smt2 | 57 ------------------- .../unsolved_pcp_instance_2323.smt2 | 57 ------------------- .../unsolved_pcp_instance_2324.smt2 | 57 ------------------- .../unsolved_pcp_instance_2325.smt2 | 57 ------------------- .../unsolved_pcp_instance_2326.smt2 | 57 ------------------- .../unsolved_pcp_instance_2327.smt2 | 57 ------------------- .../unsolved_pcp_instance_2328.smt2 | 57 ------------------- .../unsolved_pcp_instance_2329.smt2 | 57 ------------------- .../unsolved_pcp_instance_2330.smt2 | 57 ------------------- .../unsolved_pcp_instance_2331.smt2 | 57 ------------------- .../unsolved_pcp_instance_2332.smt2 | 57 ------------------- .../unsolved_pcp_instance_2333.smt2 | 57 ------------------- .../unsolved_pcp_instance_2334.smt2 | 57 ------------------- .../unsolved_pcp_instance_2335.smt2 | 57 ------------------- .../unsolved_pcp_instance_2336.smt2 | 57 ------------------- .../unsolved_pcp_instance_2337.smt2 | 57 ------------------- .../unsolved_pcp_instance_2338.smt2 | 57 ------------------- .../unsolved_pcp_instance_2339.smt2 | 57 ------------------- .../unsolved_pcp_instance_2340.smt2 | 57 ------------------- .../unsolved_pcp_instance_2341.smt2 | 57 ------------------- .../unsolved_pcp_instance_2342.smt2 | 57 ------------------- .../unsolved_pcp_instance_2343.smt2 | 57 ------------------- .../unsolved_pcp_instance_2344.smt2 | 57 ------------------- .../unsolved_pcp_instance_2345.smt2 | 57 ------------------- .../unsolved_pcp_instance_2346.smt2 | 57 ------------------- .../unsolved_pcp_instance_2347.smt2 | 57 ------------------- .../unsolved_pcp_instance_2348.smt2 | 57 ------------------- .../unsolved_pcp_instance_2349.smt2 | 57 ------------------- .../unsolved_pcp_instance_2350.smt2 | 57 ------------------- .../unsolved_pcp_instance_2351.smt2 | 57 ------------------- .../unsolved_pcp_instance_2352.smt2 | 57 ------------------- .../unsolved_pcp_instance_2353.smt2 | 57 ------------------- .../unsolved_pcp_instance_2354.smt2 | 57 ------------------- .../unsolved_pcp_instance_2355.smt2 | 57 ------------------- .../unsolved_pcp_instance_2356.smt2 | 57 ------------------- .../unsolved_pcp_instance_2357.smt2 | 57 ------------------- .../unsolved_pcp_instance_2358.smt2 | 57 ------------------- .../unsolved_pcp_instance_2359.smt2 | 57 ------------------- .../unsolved_pcp_instance_2360.smt2 | 57 ------------------- .../unsolved_pcp_instance_2361.smt2 | 57 ------------------- .../unsolved_pcp_instance_2362.smt2 | 57 ------------------- .../unsolved_pcp_instance_2363.smt2 | 57 ------------------- .../unsolved_pcp_instance_2364.smt2 | 57 ------------------- .../unsolved_pcp_instance_2365.smt2 | 57 ------------------- .../unsolved_pcp_instance_2366.smt2 | 57 ------------------- .../unsolved_pcp_instance_2367.smt2 | 57 ------------------- .../unsolved_pcp_instance_2368.smt2 | 57 ------------------- .../unsolved_pcp_instance_2369.smt2 | 57 ------------------- .../unsolved_pcp_instance_2370.smt2 | 57 ------------------- .../unsolved_pcp_instance_2371.smt2 | 57 ------------------- .../unsolved_pcp_instance_2372.smt2 | 57 ------------------- .../unsolved_pcp_instance_2373.smt2 | 57 ------------------- .../unsolved_pcp_instance_2374.smt2 | 57 ------------------- .../unsolved_pcp_instance_2375.smt2 | 57 ------------------- .../unsolved_pcp_instance_2376.smt2 | 57 ------------------- .../unsolved_pcp_instance_2377.smt2 | 57 ------------------- .../unsolved_pcp_instance_2378.smt2 | 57 ------------------- .../unsolved_pcp_instance_2379.smt2 | 57 ------------------- .../unsolved_pcp_instance_2380.smt2 | 57 ------------------- .../unsolved_pcp_instance_2381.smt2 | 57 ------------------- .../unsolved_pcp_instance_2382.smt2 | 57 ------------------- .../unsolved_pcp_instance_2383.smt2 | 57 ------------------- .../unsolved_pcp_instance_2384.smt2 | 57 ------------------- .../unsolved_pcp_instance_2385.smt2 | 57 ------------------- .../unsolved_pcp_instance_2386.smt2 | 57 ------------------- .../unsolved_pcp_instance_2387.smt2 | 57 ------------------- .../unsolved_pcp_instance_2388.smt2 | 57 ------------------- .../unsolved_pcp_instance_2389.smt2 | 57 ------------------- .../unsolved_pcp_instance_2390.smt2 | 57 ------------------- .../unsolved_pcp_instance_2391.smt2 | 57 ------------------- .../unsolved_pcp_instance_2392.smt2 | 57 ------------------- .../unsolved_pcp_instance_2393.smt2 | 57 ------------------- .../unsolved_pcp_instance_2394.smt2 | 57 ------------------- .../unsolved_pcp_instance_2395.smt2 | 57 ------------------- .../unsolved_pcp_instance_2396.smt2 | 57 ------------------- .../unsolved_pcp_instance_2397.smt2 | 57 ------------------- .../unsolved_pcp_instance_2398.smt2 | 57 ------------------- .../unsolved_pcp_instance_2399.smt2 | 57 ------------------- .../unsolved_pcp_instance_2400.smt2 | 57 ------------------- .../unsolved_pcp_instance_2401.smt2 | 57 ------------------- .../unsolved_pcp_instance_2402.smt2 | 57 ------------------- .../unsolved_pcp_instance_2403.smt2 | 57 ------------------- .../unsolved_pcp_instance_2404.smt2 | 57 ------------------- .../unsolved_pcp_instance_2405.smt2 | 57 ------------------- .../unsolved_pcp_instance_2406.smt2 | 57 ------------------- .../unsolved_pcp_instance_2407.smt2 | 57 ------------------- .../unsolved_pcp_instance_2408.smt2 | 57 ------------------- .../unsolved_pcp_instance_2409.smt2 | 57 ------------------- .../unsolved_pcp_instance_2410.smt2 | 57 ------------------- .../unsolved_pcp_instance_2411.smt2 | 57 ------------------- .../unsolved_pcp_instance_2412.smt2 | 57 ------------------- .../unsolved_pcp_instance_2413.smt2 | 57 ------------------- .../unsolved_pcp_instance_2414.smt2 | 57 ------------------- .../unsolved_pcp_instance_2415.smt2 | 57 ------------------- .../unsolved_pcp_instance_2416.smt2 | 57 ------------------- .../unsolved_pcp_instance_2417.smt2 | 57 ------------------- .../unsolved_pcp_instance_2418.smt2 | 57 ------------------- .../unsolved_pcp_instance_2419.smt2 | 57 ------------------- .../unsolved_pcp_instance_2420.smt2 | 57 ------------------- .../unsolved_pcp_instance_2421.smt2 | 57 ------------------- .../unsolved_pcp_instance_2422.smt2 | 57 ------------------- .../unsolved_pcp_instance_2423.smt2 | 57 ------------------- .../unsolved_pcp_instance_2424.smt2 | 57 ------------------- .../unsolved_pcp_instance_2425.smt2 | 57 ------------------- .../unsolved_pcp_instance_2426.smt2 | 57 ------------------- .../unsolved_pcp_instance_2427.smt2 | 57 ------------------- .../unsolved_pcp_instance_2428.smt2 | 57 ------------------- .../unsolved_pcp_instance_2429.smt2 | 57 ------------------- .../unsolved_pcp_instance_2430.smt2 | 57 ------------------- .../unsolved_pcp_instance_2431.smt2 | 57 ------------------- .../unsolved_pcp_instance_2432.smt2 | 57 ------------------- .../unsolved_pcp_instance_2433.smt2 | 57 ------------------- .../unsolved_pcp_instance_2434.smt2 | 57 ------------------- .../unsolved_pcp_instance_2435.smt2 | 57 ------------------- .../unsolved_pcp_instance_2436.smt2 | 57 ------------------- .../unsolved_pcp_instance_2437.smt2 | 57 ------------------- .../unsolved_pcp_instance_2438.smt2 | 57 ------------------- .../unsolved_pcp_instance_2439.smt2 | 57 ------------------- .../unsolved_pcp_instance_2440.smt2 | 57 ------------------- .../unsolved_pcp_instance_2441.smt2 | 57 ------------------- .../unsolved_pcp_instance_2442.smt2 | 57 ------------------- .../unsolved_pcp_instance_2443.smt2 | 57 ------------------- .../unsolved_pcp_instance_2444.smt2 | 57 ------------------- .../unsolved_pcp_instance_2445.smt2 | 57 ------------------- .../unsolved_pcp_instance_2446.smt2 | 57 ------------------- .../unsolved_pcp_instance_2447.smt2 | 57 ------------------- .../unsolved_pcp_instance_2448.smt2 | 57 ------------------- .../unsolved_pcp_instance_2449.smt2 | 57 ------------------- .../unsolved_pcp_instance_2450.smt2 | 57 ------------------- .../unsolved_pcp_instance_2451.smt2 | 57 ------------------- .../unsolved_pcp_instance_2452.smt2 | 57 ------------------- .../unsolved_pcp_instance_2453.smt2 | 57 ------------------- .../unsolved_pcp_instance_2454.smt2 | 57 ------------------- .../unsolved_pcp_instance_2455.smt2 | 57 ------------------- .../unsolved_pcp_instance_2456.smt2 | 57 ------------------- .../unsolved_pcp_instance_2457.smt2 | 57 ------------------- .../unsolved_pcp_instance_2458.smt2 | 57 ------------------- .../unsolved_pcp_instance_2459.smt2 | 57 ------------------- .../unsolved_pcp_instance_2460.smt2 | 57 ------------------- .../unsolved_pcp_instance_2461.smt2 | 57 ------------------- .../unsolved_pcp_instance_2462.smt2 | 57 ------------------- .../unsolved_pcp_instance_2463.smt2 | 57 ------------------- .../unsolved_pcp_instance_2464.smt2 | 57 ------------------- .../unsolved_pcp_instance_2465.smt2 | 57 ------------------- .../unsolved_pcp_instance_2466.smt2 | 57 ------------------- .../unsolved_pcp_instance_2467.smt2 | 57 ------------------- .../unsolved_pcp_instance_2468.smt2 | 57 ------------------- .../unsolved_pcp_instance_2469.smt2 | 57 ------------------- .../unsolved_pcp_instance_2470.smt2 | 57 ------------------- .../unsolved_pcp_instance_2471.smt2 | 57 ------------------- .../unsolved_pcp_instance_2472.smt2 | 57 ------------------- .../unsolved_pcp_instance_2473.smt2 | 57 ------------------- .../unsolved_pcp_instance_2474.smt2 | 57 ------------------- .../unsolved_pcp_instance_2475.smt2 | 57 ------------------- .../unsolved_pcp_instance_2476.smt2 | 57 ------------------- .../unsolved_pcp_instance_2477.smt2 | 57 ------------------- .../unsolved_pcp_instance_2478.smt2 | 57 ------------------- .../unsolved_pcp_instance_2479.smt2 | 57 ------------------- .../unsolved_pcp_instance_2480.smt2 | 57 ------------------- .../unsolved_pcp_instance_2481.smt2 | 57 ------------------- .../unsolved_pcp_instance_2482.smt2 | 57 ------------------- .../unsolved_pcp_instance_2483.smt2 | 57 ------------------- .../unsolved_pcp_instance_2484.smt2 | 57 ------------------- .../unsolved_pcp_instance_2485.smt2 | 57 ------------------- .../unsolved_pcp_instance_2486.smt2 | 57 ------------------- .../unsolved_pcp_instance_2487.smt2 | 57 ------------------- .../unsolved_pcp_instance_2488.smt2 | 57 ------------------- .../unsolved_pcp_instance_2489.smt2 | 57 ------------------- .../unsolved_pcp_instance_2490.smt2 | 57 ------------------- .../unsolved_pcp_instance_2491.smt2 | 57 ------------------- .../unsolved_pcp_instance_2492.smt2 | 57 ------------------- .../unsolved_pcp_instance_2493.smt2 | 57 ------------------- .../unsolved_pcp_instance_2494.smt2 | 57 ------------------- .../unsolved_pcp_instance_2495.smt2 | 57 ------------------- .../unsolved_pcp_instance_2496.smt2 | 57 ------------------- .../unsolved_pcp_instance_2497.smt2 | 57 ------------------- .../unsolved_pcp_instance_2498.smt2 | 57 ------------------- .../unsolved_pcp_instance_2499.smt2 | 57 ------------------- .../unsolved_pcp_instance_2500.smt2 | 57 ------------------- .../unsolved_pcp_instance_2501.smt2 | 57 ------------------- .../unsolved_pcp_instance_2502.smt2 | 57 ------------------- .../unsolved_pcp_instance_2503.smt2 | 57 ------------------- .../unsolved_pcp_instance_2504.smt2 | 57 ------------------- .../unsolved_pcp_instance_2505.smt2 | 57 ------------------- .../unsolved_pcp_instance_2506.smt2 | 57 ------------------- .../unsolved_pcp_instance_2507.smt2 | 57 ------------------- .../unsolved_pcp_instance_2508.smt2 | 57 ------------------- .../unsolved_pcp_instance_2509.smt2 | 57 ------------------- .../unsolved_pcp_instance_2510.smt2 | 57 ------------------- .../unsolved_pcp_instance_2511.smt2 | 57 ------------------- .../unsolved_pcp_instance_2512.smt2 | 57 ------------------- .../unsolved_pcp_instance_2513.smt2 | 57 ------------------- .../unsolved_pcp_instance_2514.smt2 | 57 ------------------- .../unsolved_pcp_instance_2515.smt2 | 57 ------------------- .../unsolved_pcp_instance_2516.smt2 | 57 ------------------- .../unsolved_pcp_instance_2517.smt2 | 57 ------------------- .../unsolved_pcp_instance_2518.smt2 | 57 ------------------- .../unsolved_pcp_instance_2519.smt2 | 57 ------------------- .../unsolved_pcp_instance_2520.smt2 | 57 ------------------- .../unsolved_pcp_instance_2521.smt2 | 57 ------------------- .../unsolved_pcp_instance_2522.smt2 | 57 ------------------- .../unsolved_pcp_instance_2523.smt2 | 57 ------------------- .../unsolved_pcp_instance_2524.smt2 | 57 ------------------- .../unsolved_pcp_instance_2525.smt2 | 57 ------------------- .../unsolved_pcp_instance_2526.smt2 | 57 ------------------- .../unsolved_pcp_instance_2527.smt2 | 57 ------------------- .../unsolved_pcp_instance_2528.smt2 | 57 ------------------- .../unsolved_pcp_instance_2529.smt2 | 57 ------------------- .../unsolved_pcp_instance_2530.smt2 | 57 ------------------- .../unsolved_pcp_instance_2531.smt2 | 57 ------------------- .../unsolved_pcp_instance_2532.smt2 | 57 ------------------- .../unsolved_pcp_instance_2533.smt2 | 57 ------------------- .../unsolved_pcp_instance_2534.smt2 | 57 ------------------- .../unsolved_pcp_instance_2535.smt2 | 57 ------------------- .../unsolved_pcp_instance_2536.smt2 | 57 ------------------- .../unsolved_pcp_instance_2537.smt2 | 57 ------------------- .../unsolved_pcp_instance_2538.smt2 | 57 ------------------- .../unsolved_pcp_instance_2539.smt2 | 57 ------------------- .../unsolved_pcp_instance_2540.smt2 | 57 ------------------- .../unsolved_pcp_instance_2541.smt2 | 57 ------------------- .../unsolved_pcp_instance_2542.smt2 | 57 ------------------- .../unsolved_pcp_instance_2543.smt2 | 57 ------------------- .../unsolved_pcp_instance_2544.smt2 | 57 ------------------- .../unsolved_pcp_instance_2545.smt2 | 57 ------------------- .../unsolved_pcp_instance_2546.smt2 | 57 ------------------- .../unsolved_pcp_instance_2547.smt2 | 57 ------------------- .../unsolved_pcp_instance_2548.smt2 | 57 ------------------- .../unsolved_pcp_instance_2549.smt2 | 57 ------------------- .../unsolved_pcp_instance_2550.smt2 | 57 ------------------- .../unsolved_pcp_instance_2551.smt2 | 57 ------------------- .../unsolved_pcp_instance_2552.smt2 | 57 ------------------- .../unsolved_pcp_instance_2553.smt2 | 57 ------------------- .../unsolved_pcp_instance_2554.smt2 | 57 ------------------- .../unsolved_pcp_instance_2555.smt2 | 57 ------------------- .../unsolved_pcp_instance_2556.smt2 | 57 ------------------- .../unsolved_pcp_instance_2557.smt2 | 57 ------------------- .../unsolved_pcp_instance_2558.smt2 | 57 ------------------- .../unsolved_pcp_instance_2559.smt2 | 57 ------------------- .../unsolved_pcp_instance_2560.smt2 | 57 ------------------- .../unsolved_pcp_instance_2561.smt2 | 57 ------------------- .../unsolved_pcp_instance_2562.smt2 | 57 ------------------- .../unsolved_pcp_instance_2563.smt2 | 57 ------------------- .../unsolved_pcp_instance_2564.smt2 | 57 ------------------- .../unsolved_pcp_instance_2565.smt2 | 57 ------------------- .../unsolved_pcp_instance_2566.smt2 | 57 ------------------- .../unsolved_pcp_instance_2567.smt2 | 57 ------------------- .../unsolved_pcp_instance_2568.smt2 | 57 ------------------- .../unsolved_pcp_instance_2569.smt2 | 57 ------------------- .../unsolved_pcp_instance_2570.smt2 | 57 ------------------- .../unsolved_pcp_instance_2571.smt2 | 57 ------------------- .../unsolved_pcp_instance_2572.smt2 | 57 ------------------- .../unsolved_pcp_instance_2573.smt2 | 57 ------------------- .../unsolved_pcp_instance_2574.smt2 | 57 ------------------- .../unsolved_pcp_instance_2575.smt2 | 57 ------------------- .../unsolved_pcp_instance_2576.smt2 | 57 ------------------- .../unsolved_pcp_instance_2577.smt2 | 57 ------------------- .../unsolved_pcp_instance_2578.smt2 | 57 ------------------- .../unsolved_pcp_instance_2579.smt2 | 57 ------------------- .../unsolved_pcp_instance_2580.smt2 | 57 ------------------- .../unsolved_pcp_instance_2581.smt2 | 57 ------------------- .../unsolved_pcp_instance_2582.smt2 | 57 ------------------- .../unsolved_pcp_instance_2583.smt2 | 57 ------------------- .../unsolved_pcp_instance_2584.smt2 | 57 ------------------- .../unsolved_pcp_instance_2585.smt2 | 57 ------------------- .../unsolved_pcp_instance_2586.smt2 | 57 ------------------- .../unsolved_pcp_instance_2587.smt2 | 57 ------------------- .../unsolved_pcp_instance_2588.smt2 | 57 ------------------- .../unsolved_pcp_instance_2589.smt2 | 57 ------------------- .../unsolved_pcp_instance_2590.smt2 | 57 ------------------- .../unsolved_pcp_instance_2591.smt2 | 57 ------------------- .../unsolved_pcp_instance_2592.smt2 | 57 ------------------- .../unsolved_pcp_instance_2593.smt2 | 57 ------------------- .../unsolved_pcp_instance_2594.smt2 | 57 ------------------- .../unsolved_pcp_instance_2595.smt2 | 57 ------------------- .../unsolved_pcp_instance_2596.smt2 | 57 ------------------- .../unsolved_pcp_instance_2597.smt2 | 57 ------------------- .../unsolved_pcp_instance_2598.smt2 | 57 ------------------- .../unsolved_pcp_instance_2599.smt2 | 57 ------------------- .../unsolved_pcp_instance_2600.smt2 | 57 ------------------- .../unsolved_pcp_instance_2601.smt2 | 57 ------------------- .../unsolved_pcp_instance_2602.smt2 | 57 ------------------- .../unsolved_pcp_instance_2603.smt2 | 57 ------------------- .../unsolved_pcp_instance_2604.smt2 | 57 ------------------- .../unsolved_pcp_instance_2605.smt2 | 57 ------------------- .../unsolved_pcp_instance_2606.smt2 | 57 ------------------- .../unsolved_pcp_instance_2607.smt2 | 57 ------------------- .../unsolved_pcp_instance_2608.smt2 | 57 ------------------- .../unsolved_pcp_instance_2609.smt2 | 57 ------------------- .../unsolved_pcp_instance_2610.smt2 | 57 ------------------- .../unsolved_pcp_instance_2611.smt2 | 57 ------------------- .../unsolved_pcp_instance_2612.smt2 | 57 ------------------- .../unsolved_pcp_instance_2613.smt2 | 57 ------------------- .../unsolved_pcp_instance_2614.smt2 | 57 ------------------- .../unsolved_pcp_instance_2615.smt2 | 57 ------------------- .../unsolved_pcp_instance_2616.smt2 | 57 ------------------- .../unsolved_pcp_instance_2617.smt2 | 57 ------------------- .../unsolved_pcp_instance_2618.smt2 | 57 ------------------- .../unsolved_pcp_instance_2619.smt2 | 57 ------------------- .../unsolved_pcp_instance_2620.smt2 | 57 ------------------- .../unsolved_pcp_instance_2621.smt2 | 57 ------------------- .../unsolved_pcp_instance_2622.smt2 | 57 ------------------- .../unsolved_pcp_instance_2623.smt2 | 57 ------------------- .../unsolved_pcp_instance_2624.smt2 | 57 ------------------- .../unsolved_pcp_instance_2625.smt2 | 57 ------------------- .../unsolved_pcp_instance_2626.smt2 | 57 ------------------- .../unsolved_pcp_instance_2627.smt2 | 57 ------------------- .../unsolved_pcp_instance_2628.smt2 | 57 ------------------- .../unsolved_pcp_instance_2629.smt2 | 57 ------------------- .../unsolved_pcp_instance_2630.smt2 | 57 ------------------- .../unsolved_pcp_instance_2631.smt2 | 57 ------------------- .../unsolved_pcp_instance_2632.smt2 | 57 ------------------- .../unsolved_pcp_instance_2633.smt2 | 57 ------------------- .../unsolved_pcp_instance_2634.smt2 | 57 ------------------- .../unsolved_pcp_instance_2635.smt2 | 57 ------------------- .../unsolved_pcp_instance_2636.smt2 | 57 ------------------- .../unsolved_pcp_instance_2637.smt2 | 57 ------------------- .../unsolved_pcp_instance_2638.smt2 | 57 ------------------- .../unsolved_pcp_instance_2639.smt2 | 57 ------------------- .../unsolved_pcp_instance_2640.smt2 | 57 ------------------- .../unsolved_pcp_instance_2641.smt2 | 57 ------------------- .../unsolved_pcp_instance_2642.smt2 | 57 ------------------- .../unsolved_pcp_instance_2643.smt2 | 57 ------------------- .../unsolved_pcp_instance_2644.smt2 | 57 ------------------- .../unsolved_pcp_instance_2645.smt2 | 57 ------------------- .../unsolved_pcp_instance_2646.smt2 | 57 ------------------- .../unsolved_pcp_instance_2647.smt2 | 57 ------------------- .../unsolved_pcp_instance_2648.smt2 | 57 ------------------- .../unsolved_pcp_instance_2649.smt2 | 57 ------------------- .../unsolved_pcp_instance_2650.smt2 | 57 ------------------- .../unsolved_pcp_instance_2651.smt2 | 57 ------------------- .../unsolved_pcp_instance_2652.smt2 | 57 ------------------- .../unsolved_pcp_instance_2653.smt2 | 57 ------------------- .../unsolved_pcp_instance_2654.smt2 | 57 ------------------- .../unsolved_pcp_instance_2655.smt2 | 57 ------------------- .../unsolved_pcp_instance_2656.smt2 | 57 ------------------- .../unsolved_pcp_instance_2657.smt2 | 57 ------------------- .../unsolved_pcp_instance_2658.smt2 | 57 ------------------- .../unsolved_pcp_instance_2659.smt2 | 57 ------------------- .../unsolved_pcp_instance_2660.smt2 | 57 ------------------- .../unsolved_pcp_instance_2661.smt2 | 57 ------------------- .../unsolved_pcp_instance_2662.smt2 | 57 ------------------- .../unsolved_pcp_instance_2663.smt2 | 57 ------------------- .../unsolved_pcp_instance_2664.smt2 | 57 ------------------- .../unsolved_pcp_instance_2665.smt2 | 57 ------------------- .../unsolved_pcp_instance_2666.smt2 | 57 ------------------- .../unsolved_pcp_instance_2667.smt2 | 57 ------------------- .../unsolved_pcp_instance_2668.smt2 | 57 ------------------- .../unsolved_pcp_instance_2669.smt2 | 57 ------------------- .../unsolved_pcp_instance_2670.smt2 | 57 ------------------- .../unsolved_pcp_instance_2671.smt2 | 57 ------------------- .../unsolved_pcp_instance_2672.smt2 | 57 ------------------- .../unsolved_pcp_instance_2673.smt2 | 57 ------------------- .../unsolved_pcp_instance_2674.smt2 | 57 ------------------- .../unsolved_pcp_instance_2675.smt2 | 57 ------------------- .../unsolved_pcp_instance_2676.smt2 | 57 ------------------- .../unsolved_pcp_instance_2677.smt2 | 57 ------------------- .../unsolved_pcp_instance_2678.smt2 | 57 ------------------- .../unsolved_pcp_instance_2679.smt2 | 57 ------------------- .../unsolved_pcp_instance_2680.smt2 | 57 ------------------- .../unsolved_pcp_instance_2681.smt2 | 57 ------------------- .../unsolved_pcp_instance_2682.smt2 | 57 ------------------- .../unsolved_pcp_instance_2683.smt2 | 57 ------------------- .../unsolved_pcp_instance_2684.smt2 | 57 ------------------- .../unsolved_pcp_instance_2685.smt2 | 57 ------------------- .../unsolved_pcp_instance_2686.smt2 | 57 ------------------- .../unsolved_pcp_instance_2687.smt2 | 57 ------------------- .../unsolved_pcp_instance_2688.smt2 | 57 ------------------- .../unsolved_pcp_instance_2689.smt2 | 57 ------------------- .../unsolved_pcp_instance_2690.smt2 | 57 ------------------- .../unsolved_pcp_instance_2691.smt2 | 57 ------------------- .../unsolved_pcp_instance_2692.smt2 | 57 ------------------- .../unsolved_pcp_instance_2693.smt2 | 57 ------------------- .../unsolved_pcp_instance_2694.smt2 | 57 ------------------- .../unsolved_pcp_instance_2695.smt2 | 57 ------------------- .../unsolved_pcp_instance_2696.smt2 | 57 ------------------- .../unsolved_pcp_instance_2697.smt2 | 57 ------------------- .../unsolved_pcp_instance_2698.smt2 | 57 ------------------- .../unsolved_pcp_instance_2699.smt2 | 57 ------------------- .../unsolved_pcp_instance_2700.smt2 | 57 ------------------- .../unsolved_pcp_instance_2701.smt2 | 57 ------------------- .../unsolved_pcp_instance_2702.smt2 | 57 ------------------- .../unsolved_pcp_instance_2703.smt2 | 57 ------------------- .../unsolved_pcp_instance_2704.smt2 | 57 ------------------- .../unsolved_pcp_instance_2705.smt2 | 57 ------------------- .../unsolved_pcp_instance_2706.smt2 | 57 ------------------- .../unsolved_pcp_instance_2707.smt2 | 57 ------------------- .../unsolved_pcp_instance_2708.smt2 | 57 ------------------- .../unsolved_pcp_instance_2709.smt2 | 57 ------------------- .../unsolved_pcp_instance_2710.smt2 | 57 ------------------- .../unsolved_pcp_instance_2711.smt2 | 57 ------------------- .../unsolved_pcp_instance_2712.smt2 | 57 ------------------- .../unsolved_pcp_instance_2713.smt2 | 57 ------------------- .../unsolved_pcp_instance_2714.smt2 | 57 ------------------- .../unsolved_pcp_instance_2715.smt2 | 57 ------------------- .../unsolved_pcp_instance_2716.smt2 | 57 ------------------- .../unsolved_pcp_instance_2717.smt2 | 57 ------------------- .../unsolved_pcp_instance_2718.smt2 | 57 ------------------- .../unsolved_pcp_instance_2719.smt2 | 57 ------------------- .../unsolved_pcp_instance_2720.smt2 | 57 ------------------- .../unsolved_pcp_instance_2721.smt2 | 57 ------------------- .../unsolved_pcp_instance_2722.smt2 | 57 ------------------- .../unsolved_pcp_instance_2723.smt2 | 57 ------------------- .../unsolved_pcp_instance_2724.smt2 | 57 ------------------- .../unsolved_pcp_instance_2725.smt2 | 57 ------------------- .../unsolved_pcp_instance_2726.smt2 | 57 ------------------- .../unsolved_pcp_instance_2727.smt2 | 57 ------------------- .../unsolved_pcp_instance_2728.smt2 | 57 ------------------- .../unsolved_pcp_instance_2729.smt2 | 57 ------------------- .../unsolved_pcp_instance_2730.smt2 | 57 ------------------- .../unsolved_pcp_instance_2731.smt2 | 57 ------------------- .../unsolved_pcp_instance_2732.smt2 | 57 ------------------- .../unsolved_pcp_instance_2733.smt2 | 57 ------------------- .../unsolved_pcp_instance_2734.smt2 | 57 ------------------- .../unsolved_pcp_instance_2735.smt2 | 57 ------------------- .../unsolved_pcp_instance_2736.smt2 | 57 ------------------- .../unsolved_pcp_instance_2737.smt2 | 57 ------------------- .../unsolved_pcp_instance_2738.smt2 | 57 ------------------- .../unsolved_pcp_instance_2739.smt2 | 57 ------------------- .../unsolved_pcp_instance_2740.smt2 | 57 ------------------- .../unsolved_pcp_instance_2741.smt2 | 57 ------------------- .../unsolved_pcp_instance_2742.smt2 | 57 ------------------- .../unsolved_pcp_instance_2743.smt2 | 57 ------------------- .../unsolved_pcp_instance_2744.smt2 | 57 ------------------- .../unsolved_pcp_instance_2745.smt2 | 57 ------------------- .../unsolved_pcp_instance_2746.smt2 | 57 ------------------- .../unsolved_pcp_instance_2747.smt2 | 57 ------------------- .../unsolved_pcp_instance_2748.smt2 | 57 ------------------- .../unsolved_pcp_instance_2749.smt2 | 57 ------------------- .../unsolved_pcp_instance_2750.smt2 | 57 ------------------- .../unsolved_pcp_instance_2751.smt2 | 57 ------------------- .../unsolved_pcp_instance_2752.smt2 | 57 ------------------- .../unsolved_pcp_instance_2753.smt2 | 57 ------------------- .../unsolved_pcp_instance_2754.smt2 | 57 ------------------- .../unsolved_pcp_instance_2755.smt2 | 57 ------------------- .../unsolved_pcp_instance_2756.smt2 | 57 ------------------- .../unsolved_pcp_instance_2757.smt2 | 57 ------------------- .../unsolved_pcp_instance_2758.smt2 | 57 ------------------- .../unsolved_pcp_instance_2759.smt2 | 57 ------------------- .../unsolved_pcp_instance_2760.smt2 | 57 ------------------- .../unsolved_pcp_instance_2761.smt2 | 57 ------------------- .../unsolved_pcp_instance_2762.smt2 | 57 ------------------- .../unsolved_pcp_instance_2763.smt2 | 57 ------------------- .../unsolved_pcp_instance_2764.smt2 | 57 ------------------- .../unsolved_pcp_instance_2765.smt2 | 57 ------------------- .../unsolved_pcp_instance_2766.smt2 | 57 ------------------- .../unsolved_pcp_instance_2767.smt2 | 57 ------------------- .../unsolved_pcp_instance_2768.smt2 | 57 ------------------- .../unsolved_pcp_instance_2769.smt2 | 57 ------------------- .../unsolved_pcp_instance_2770.smt2 | 57 ------------------- .../unsolved_pcp_instance_2771.smt2 | 57 ------------------- .../unsolved_pcp_instance_2772.smt2 | 57 ------------------- .../unsolved_pcp_instance_2773.smt2 | 57 ------------------- .../unsolved_pcp_instance_2774.smt2 | 57 ------------------- .../unsolved_pcp_instance_2775.smt2 | 57 ------------------- .../unsolved_pcp_instance_2776.smt2 | 57 ------------------- .../unsolved_pcp_instance_2777.smt2 | 57 ------------------- .../unsolved_pcp_instance_2778.smt2 | 57 ------------------- .../unsolved_pcp_instance_2779.smt2 | 57 ------------------- .../unsolved_pcp_instance_2780.smt2 | 57 ------------------- .../unsolved_pcp_instance_2781.smt2 | 57 ------------------- .../unsolved_pcp_instance_2782.smt2 | 57 ------------------- .../unsolved_pcp_instance_2783.smt2 | 57 ------------------- .../unsolved_pcp_instance_2784.smt2 | 57 ------------------- .../unsolved_pcp_instance_2785.smt2 | 57 ------------------- .../unsolved_pcp_instance_2786.smt2 | 57 ------------------- .../unsolved_pcp_instance_2787.smt2 | 57 ------------------- .../unsolved_pcp_instance_2788.smt2 | 57 ------------------- .../unsolved_pcp_instance_2789.smt2 | 57 ------------------- .../unsolved_pcp_instance_2790.smt2 | 57 ------------------- .../unsolved_pcp_instance_2791.smt2 | 57 ------------------- .../unsolved_pcp_instance_2792.smt2 | 57 ------------------- .../unsolved_pcp_instance_2793.smt2 | 57 ------------------- .../unsolved_pcp_instance_2794.smt2 | 57 ------------------- .../unsolved_pcp_instance_2795.smt2 | 57 ------------------- .../unsolved_pcp_instance_2796.smt2 | 57 ------------------- .../unsolved_pcp_instance_2797.smt2 | 57 ------------------- .../unsolved_pcp_instance_2798.smt2 | 57 ------------------- .../unsolved_pcp_instance_2799.smt2 | 57 ------------------- .../unsolved_pcp_instance_2800.smt2 | 57 ------------------- .../unsolved_pcp_instance_2801.smt2 | 57 ------------------- .../unsolved_pcp_instance_2802.smt2 | 57 ------------------- .../unsolved_pcp_instance_2803.smt2 | 57 ------------------- .../unsolved_pcp_instance_2804.smt2 | 57 ------------------- .../unsolved_pcp_instance_2805.smt2 | 57 ------------------- .../unsolved_pcp_instance_2806.smt2 | 57 ------------------- .../unsolved_pcp_instance_2807.smt2 | 57 ------------------- .../unsolved_pcp_instance_2808.smt2 | 57 ------------------- .../unsolved_pcp_instance_2809.smt2 | 57 ------------------- .../unsolved_pcp_instance_2810.smt2 | 57 ------------------- .../unsolved_pcp_instance_2811.smt2 | 57 ------------------- .../unsolved_pcp_instance_2812.smt2 | 57 ------------------- .../unsolved_pcp_instance_2813.smt2 | 57 ------------------- .../unsolved_pcp_instance_2814.smt2 | 57 ------------------- .../unsolved_pcp_instance_2815.smt2 | 57 ------------------- .../unsolved_pcp_instance_2816.smt2 | 57 ------------------- .../unsolved_pcp_instance_2817.smt2 | 57 ------------------- .../unsolved_pcp_instance_2818.smt2 | 57 ------------------- .../unsolved_pcp_instance_2819.smt2 | 57 ------------------- .../unsolved_pcp_instance_2820.smt2 | 57 ------------------- .../unsolved_pcp_instance_2821.smt2 | 57 ------------------- .../unsolved_pcp_instance_2822.smt2 | 57 ------------------- .../unsolved_pcp_instance_2823.smt2 | 57 ------------------- .../unsolved_pcp_instance_2824.smt2 | 57 ------------------- .../unsolved_pcp_instance_2825.smt2 | 57 ------------------- .../unsolved_pcp_instance_2826.smt2 | 57 ------------------- .../unsolved_pcp_instance_2827.smt2 | 57 ------------------- .../unsolved_pcp_instance_2828.smt2 | 57 ------------------- .../unsolved_pcp_instance_2829.smt2 | 57 ------------------- .../unsolved_pcp_instance_2830.smt2 | 57 ------------------- .../unsolved_pcp_instance_2831.smt2 | 57 ------------------- .../unsolved_pcp_instance_2832.smt2 | 57 ------------------- .../unsolved_pcp_instance_2833.smt2 | 57 ------------------- .../unsolved_pcp_instance_2834.smt2 | 57 ------------------- .../unsolved_pcp_instance_2835.smt2 | 57 ------------------- .../unsolved_pcp_instance_2836.smt2 | 57 ------------------- .../unsolved_pcp_instance_2837.smt2 | 57 ------------------- .../unsolved_pcp_instance_2838.smt2 | 57 ------------------- .../unsolved_pcp_instance_2839.smt2 | 57 ------------------- .../unsolved_pcp_instance_2840.smt2 | 57 ------------------- .../unsolved_pcp_instance_2841.smt2 | 57 ------------------- .../unsolved_pcp_instance_2842.smt2 | 57 ------------------- .../unsolved_pcp_instance_2843.smt2 | 57 ------------------- .../unsolved_pcp_instance_2844.smt2 | 57 ------------------- .../unsolved_pcp_instance_2845.smt2 | 57 ------------------- .../unsolved_pcp_instance_2846.smt2 | 57 ------------------- .../unsolved_pcp_instance_2847.smt2 | 57 ------------------- .../unsolved_pcp_instance_2848.smt2 | 57 ------------------- .../unsolved_pcp_instance_2849.smt2 | 57 ------------------- .../unsolved_pcp_instance_2850.smt2 | 57 ------------------- .../unsolved_pcp_instance_2851.smt2 | 57 ------------------- .../unsolved_pcp_instance_2852.smt2 | 57 ------------------- .../unsolved_pcp_instance_2853.smt2 | 57 ------------------- .../unsolved_pcp_instance_2854.smt2 | 57 ------------------- .../unsolved_pcp_instance_2855.smt2 | 57 ------------------- .../unsolved_pcp_instance_2856.smt2 | 57 ------------------- .../unsolved_pcp_instance_2857.smt2 | 57 ------------------- .../unsolved_pcp_instance_2858.smt2 | 57 ------------------- .../unsolved_pcp_instance_2859.smt2 | 57 ------------------- .../unsolved_pcp_instance_2860.smt2 | 57 ------------------- .../unsolved_pcp_instance_2861.smt2 | 57 ------------------- .../unsolved_pcp_instance_2862.smt2 | 57 ------------------- .../unsolved_pcp_instance_2863.smt2 | 57 ------------------- .../unsolved_pcp_instance_2864.smt2 | 57 ------------------- .../unsolved_pcp_instance_2865.smt2 | 57 ------------------- .../unsolved_pcp_instance_2866.smt2 | 57 ------------------- .../unsolved_pcp_instance_2867.smt2 | 57 ------------------- .../unsolved_pcp_instance_2868.smt2 | 57 ------------------- .../unsolved_pcp_instance_2869.smt2 | 57 ------------------- .../unsolved_pcp_instance_2870.smt2 | 57 ------------------- .../unsolved_pcp_instance_2871.smt2 | 57 ------------------- .../unsolved_pcp_instance_2872.smt2 | 57 ------------------- .../unsolved_pcp_instance_2873.smt2 | 57 ------------------- .../unsolved_pcp_instance_2874.smt2 | 57 ------------------- .../unsolved_pcp_instance_2875.smt2 | 57 ------------------- .../unsolved_pcp_instance_2876.smt2 | 57 ------------------- .../unsolved_pcp_instance_2877.smt2 | 57 ------------------- .../unsolved_pcp_instance_2878.smt2 | 57 ------------------- .../unsolved_pcp_instance_2879.smt2 | 57 ------------------- .../unsolved_pcp_instance_2880.smt2 | 57 ------------------- .../unsolved_pcp_instance_2881.smt2 | 57 ------------------- .../unsolved_pcp_instance_2882.smt2 | 57 ------------------- .../unsolved_pcp_instance_2883.smt2 | 57 ------------------- .../unsolved_pcp_instance_2884.smt2 | 57 ------------------- .../unsolved_pcp_instance_2885.smt2 | 57 ------------------- .../unsolved_pcp_instance_2886.smt2 | 57 ------------------- .../unsolved_pcp_instance_2887.smt2 | 57 ------------------- .../unsolved_pcp_instance_2888.smt2 | 57 ------------------- .../unsolved_pcp_instance_2889.smt2 | 57 ------------------- .../unsolved_pcp_instance_2890.smt2 | 57 ------------------- .../unsolved_pcp_instance_2891.smt2 | 57 ------------------- .../unsolved_pcp_instance_2892.smt2 | 57 ------------------- .../unsolved_pcp_instance_2893.smt2 | 57 ------------------- .../unsolved_pcp_instance_2894.smt2 | 57 ------------------- .../unsolved_pcp_instance_2895.smt2 | 57 ------------------- .../unsolved_pcp_instance_2896.smt2 | 57 ------------------- .../unsolved_pcp_instance_2897.smt2 | 57 ------------------- .../unsolved_pcp_instance_2898.smt2 | 57 ------------------- .../unsolved_pcp_instance_2899.smt2 | 57 ------------------- .../unsolved_pcp_instance_2900.smt2 | 57 ------------------- .../unsolved_pcp_instance_2901.smt2 | 57 ------------------- .../unsolved_pcp_instance_2902.smt2 | 57 ------------------- .../unsolved_pcp_instance_2903.smt2 | 57 ------------------- .../unsolved_pcp_instance_2904.smt2 | 57 ------------------- .../unsolved_pcp_instance_2905.smt2 | 57 ------------------- .../unsolved_pcp_instance_2906.smt2 | 57 ------------------- .../unsolved_pcp_instance_2907.smt2 | 57 ------------------- .../unsolved_pcp_instance_2908.smt2 | 57 ------------------- .../unsolved_pcp_instance_2909.smt2 | 57 ------------------- .../unsolved_pcp_instance_2910.smt2 | 57 ------------------- .../unsolved_pcp_instance_2911.smt2 | 57 ------------------- .../unsolved_pcp_instance_2912.smt2 | 57 ------------------- .../unsolved_pcp_instance_2913.smt2 | 57 ------------------- .../unsolved_pcp_instance_2914.smt2 | 57 ------------------- .../unsolved_pcp_instance_2915.smt2 | 57 ------------------- .../unsolved_pcp_instance_2916.smt2 | 57 ------------------- .../unsolved_pcp_instance_2917.smt2 | 57 ------------------- .../unsolved_pcp_instance_2918.smt2 | 57 ------------------- .../unsolved_pcp_instance_2919.smt2 | 57 ------------------- .../unsolved_pcp_instance_2920.smt2 | 57 ------------------- .../unsolved_pcp_instance_2921.smt2 | 57 ------------------- .../unsolved_pcp_instance_2922.smt2 | 57 ------------------- .../unsolved_pcp_instance_2923.smt2 | 57 ------------------- .../unsolved_pcp_instance_2924.smt2 | 57 ------------------- .../unsolved_pcp_instance_2925.smt2 | 57 ------------------- .../unsolved_pcp_instance_2926.smt2 | 57 ------------------- .../unsolved_pcp_instance_2927.smt2 | 57 ------------------- .../unsolved_pcp_instance_2928.smt2 | 57 ------------------- .../unsolved_pcp_instance_2929.smt2 | 57 ------------------- .../unsolved_pcp_instance_2930.smt2 | 57 ------------------- .../unsolved_pcp_instance_2931.smt2 | 57 ------------------- .../unsolved_pcp_instance_2932.smt2 | 57 ------------------- .../unsolved_pcp_instance_2933.smt2 | 57 ------------------- .../unsolved_pcp_instance_2934.smt2 | 57 ------------------- .../unsolved_pcp_instance_2935.smt2 | 57 ------------------- .../unsolved_pcp_instance_2936.smt2 | 57 ------------------- .../unsolved_pcp_instance_2937.smt2 | 57 ------------------- .../unsolved_pcp_instance_2938.smt2 | 57 ------------------- .../unsolved_pcp_instance_2939.smt2 | 57 ------------------- .../unsolved_pcp_instance_2940.smt2 | 57 ------------------- .../unsolved_pcp_instance_2941.smt2 | 57 ------------------- .../unsolved_pcp_instance_2942.smt2 | 57 ------------------- .../unsolved_pcp_instance_2943.smt2 | 57 ------------------- .../unsolved_pcp_instance_2944.smt2 | 57 ------------------- .../unsolved_pcp_instance_2945.smt2 | 57 ------------------- .../unsolved_pcp_instance_2946.smt2 | 57 ------------------- .../unsolved_pcp_instance_2947.smt2 | 57 ------------------- .../unsolved_pcp_instance_2948.smt2 | 57 ------------------- .../unsolved_pcp_instance_2949.smt2 | 57 ------------------- .../unsolved_pcp_instance_2950.smt2 | 57 ------------------- .../unsolved_pcp_instance_2951.smt2 | 57 ------------------- .../unsolved_pcp_instance_2952.smt2 | 57 ------------------- .../unsolved_pcp_instance_2953.smt2 | 57 ------------------- .../unsolved_pcp_instance_2954.smt2 | 57 ------------------- .../unsolved_pcp_instance_2955.smt2 | 57 ------------------- .../unsolved_pcp_instance_2956.smt2 | 57 ------------------- .../unsolved_pcp_instance_2957.smt2 | 57 ------------------- .../unsolved_pcp_instance_2958.smt2 | 57 ------------------- .../unsolved_pcp_instance_2959.smt2 | 57 ------------------- .../unsolved_pcp_instance_2960.smt2 | 57 ------------------- .../unsolved_pcp_instance_2961.smt2 | 57 ------------------- .../unsolved_pcp_instance_2962.smt2 | 57 ------------------- .../unsolved_pcp_instance_2963.smt2 | 57 ------------------- .../unsolved_pcp_instance_2964.smt2 | 57 ------------------- .../unsolved_pcp_instance_2965.smt2 | 57 ------------------- .../unsolved_pcp_instance_2966.smt2 | 57 ------------------- .../unsolved_pcp_instance_2967.smt2 | 57 ------------------- .../unsolved_pcp_instance_2968.smt2 | 57 ------------------- .../unsolved_pcp_instance_2969.smt2 | 57 ------------------- .../unsolved_pcp_instance_2970.smt2 | 57 ------------------- .../unsolved_pcp_instance_2971.smt2 | 57 ------------------- .../unsolved_pcp_instance_2972.smt2 | 57 ------------------- .../unsolved_pcp_instance_2973.smt2 | 57 ------------------- .../unsolved_pcp_instance_2974.smt2 | 57 ------------------- .../unsolved_pcp_instance_2975.smt2 | 57 ------------------- .../unsolved_pcp_instance_2976.smt2 | 57 ------------------- .../unsolved_pcp_instance_2977.smt2 | 57 ------------------- .../unsolved_pcp_instance_2978.smt2 | 57 ------------------- .../unsolved_pcp_instance_2979.smt2 | 57 ------------------- .../unsolved_pcp_instance_2980.smt2 | 57 ------------------- .../unsolved_pcp_instance_2981.smt2 | 57 ------------------- .../unsolved_pcp_instance_2982.smt2 | 57 ------------------- .../unsolved_pcp_instance_2983.smt2 | 57 ------------------- .../unsolved_pcp_instance_2984.smt2 | 57 ------------------- .../unsolved_pcp_instance_2985.smt2 | 57 ------------------- .../unsolved_pcp_instance_2986.smt2 | 57 ------------------- .../unsolved_pcp_instance_2987.smt2 | 57 ------------------- .../unsolved_pcp_instance_2988.smt2 | 57 ------------------- .../unsolved_pcp_instance_2989.smt2 | 57 ------------------- .../unsolved_pcp_instance_2990.smt2 | 57 ------------------- .../unsolved_pcp_instance_2991.smt2 | 57 ------------------- .../unsolved_pcp_instance_2992.smt2 | 57 ------------------- .../unsolved_pcp_instance_2993.smt2 | 57 ------------------- .../unsolved_pcp_instance_2994.smt2 | 57 ------------------- .../unsolved_pcp_instance_2995.smt2 | 57 ------------------- .../unsolved_pcp_instance_2996.smt2 | 57 ------------------- .../unsolved_pcp_instance_2997.smt2 | 57 ------------------- .../unsolved_pcp_instance_2998.smt2 | 57 ------------------- .../unsolved_pcp_instance_2999.smt2 | 57 ------------------- .../unsolved_pcp_instance_3000.smt2 | 57 ------------------- .../unsolved_pcp_instance_3001.smt2 | 57 ------------------- .../unsolved_pcp_instance_3002.smt2 | 57 ------------------- .../unsolved_pcp_instance_3003.smt2 | 57 ------------------- .../unsolved_pcp_instance_3004.smt2 | 57 ------------------- .../unsolved_pcp_instance_3005.smt2 | 57 ------------------- .../unsolved_pcp_instance_3006.smt2 | 57 ------------------- .../unsolved_pcp_instance_3007.smt2 | 57 ------------------- .../unsolved_pcp_instance_3008.smt2 | 57 ------------------- .../unsolved_pcp_instance_3009.smt2 | 57 ------------------- .../unsolved_pcp_instance_3010.smt2 | 57 ------------------- .../unsolved_pcp_instance_3011.smt2 | 57 ------------------- .../unsolved_pcp_instance_3012.smt2 | 57 ------------------- .../unsolved_pcp_instance_3013.smt2 | 57 ------------------- .../unsolved_pcp_instance_3014.smt2 | 57 ------------------- .../unsolved_pcp_instance_3015.smt2 | 57 ------------------- .../unsolved_pcp_instance_3016.smt2 | 57 ------------------- .../unsolved_pcp_instance_3017.smt2 | 57 ------------------- .../unsolved_pcp_instance_3018.smt2 | 57 ------------------- .../unsolved_pcp_instance_3019.smt2 | 57 ------------------- .../unsolved_pcp_instance_3020.smt2 | 57 ------------------- .../unsolved_pcp_instance_3021.smt2 | 57 ------------------- .../unsolved_pcp_instance_3022.smt2 | 57 ------------------- .../unsolved_pcp_instance_3023.smt2 | 57 ------------------- .../unsolved_pcp_instance_3024.smt2 | 57 ------------------- .../unsolved_pcp_instance_3025.smt2 | 57 ------------------- .../unsolved_pcp_instance_3026.smt2 | 57 ------------------- .../unsolved_pcp_instance_3027.smt2 | 57 ------------------- .../unsolved_pcp_instance_3028.smt2 | 57 ------------------- .../unsolved_pcp_instance_3029.smt2 | 57 ------------------- .../unsolved_pcp_instance_3030.smt2 | 57 ------------------- .../unsolved_pcp_instance_3031.smt2 | 57 ------------------- .../unsolved_pcp_instance_3032.smt2 | 57 ------------------- .../unsolved_pcp_instance_3033.smt2 | 57 ------------------- .../unsolved_pcp_instance_3034.smt2 | 57 ------------------- .../unsolved_pcp_instance_3035.smt2 | 57 ------------------- .../unsolved_pcp_instance_3036.smt2 | 57 ------------------- .../unsolved_pcp_instance_3037.smt2 | 57 ------------------- .../unsolved_pcp_instance_3038.smt2 | 57 ------------------- .../unsolved_pcp_instance_3039.smt2 | 57 ------------------- .../unsolved_pcp_instance_3040.smt2 | 57 ------------------- .../unsolved_pcp_instance_3041.smt2 | 57 ------------------- .../unsolved_pcp_instance_3042.smt2 | 57 ------------------- .../unsolved_pcp_instance_3043.smt2 | 57 ------------------- .../unsolved_pcp_instance_3044.smt2 | 57 ------------------- .../unsolved_pcp_instance_3045.smt2 | 57 ------------------- .../unsolved_pcp_instance_3046.smt2 | 57 ------------------- .../unsolved_pcp_instance_3047.smt2 | 57 ------------------- .../unsolved_pcp_instance_3048.smt2 | 57 ------------------- .../unsolved_pcp_instance_3049.smt2 | 57 ------------------- .../unsolved_pcp_instance_3050.smt2 | 57 ------------------- .../unsolved_pcp_instance_3051.smt2 | 57 ------------------- .../unsolved_pcp_instance_3052.smt2 | 57 ------------------- .../unsolved_pcp_instance_3053.smt2 | 57 ------------------- .../unsolved_pcp_instance_3054.smt2 | 57 ------------------- .../unsolved_pcp_instance_3055.smt2 | 57 ------------------- .../unsolved_pcp_instance_3056.smt2 | 57 ------------------- .../unsolved_pcp_instance_3057.smt2 | 57 ------------------- .../unsolved_pcp_instance_3058.smt2 | 57 ------------------- .../unsolved_pcp_instance_3059.smt2 | 57 ------------------- .../unsolved_pcp_instance_3060.smt2 | 57 ------------------- .../unsolved_pcp_instance_3061.smt2 | 57 ------------------- .../unsolved_pcp_instance_3062.smt2 | 57 ------------------- .../unsolved_pcp_instance_3063.smt2 | 57 ------------------- .../unsolved_pcp_instance_3064.smt2 | 57 ------------------- .../unsolved_pcp_instance_3065.smt2 | 57 ------------------- .../unsolved_pcp_instance_3066.smt2 | 57 ------------------- .../unsolved_pcp_instance_3067.smt2 | 57 ------------------- .../unsolved_pcp_instance_3068.smt2 | 57 ------------------- .../unsolved_pcp_instance_3069.smt2 | 57 ------------------- .../unsolved_pcp_instance_3070.smt2 | 57 ------------------- .../unsolved_pcp_instance_3071.smt2 | 57 ------------------- .../unsolved_pcp_instance_3072.smt2 | 57 ------------------- .../unsolved_pcp_instance_3073.smt2 | 57 ------------------- .../unsolved_pcp_instance_3074.smt2 | 57 ------------------- .../unsolved_pcp_instance_3075.smt2 | 57 ------------------- .../unsolved_pcp_instance_3076.smt2 | 57 ------------------- .../unsolved_pcp_instance_3077.smt2 | 57 ------------------- .../unsolved_pcp_instance_3078.smt2 | 57 ------------------- .../unsolved_pcp_instance_3079.smt2 | 57 ------------------- .../unsolved_pcp_instance_3080.smt2 | 57 ------------------- .../unsolved_pcp_instance_3081.smt2 | 57 ------------------- .../unsolved_pcp_instance_3082.smt2 | 57 ------------------- .../unsolved_pcp_instance_3083.smt2 | 57 ------------------- .../unsolved_pcp_instance_3084.smt2 | 57 ------------------- .../unsolved_pcp_instance_3085.smt2 | 57 ------------------- .../unsolved_pcp_instance_3086.smt2 | 57 ------------------- .../unsolved_pcp_instance_3087.smt2 | 57 ------------------- .../unsolved_pcp_instance_3088.smt2 | 57 ------------------- .../unsolved_pcp_instance_3089.smt2 | 57 ------------------- .../unsolved_pcp_instance_3090.smt2 | 57 ------------------- .../unsolved_pcp_instance_3091.smt2 | 57 ------------------- .../unsolved_pcp_instance_3092.smt2 | 57 ------------------- .../unsolved_pcp_instance_3093.smt2 | 57 ------------------- .../unsolved_pcp_instance_3094.smt2 | 57 ------------------- .../unsolved_pcp_instance_3095.smt2 | 57 ------------------- .../unsolved_pcp_instance_3096.smt2 | 57 ------------------- .../unsolved_pcp_instance_3097.smt2 | 57 ------------------- .../unsolved_pcp_instance_3098.smt2 | 57 ------------------- .../unsolved_pcp_instance_3099.smt2 | 57 ------------------- .../unsolved_pcp_instance_3100.smt2 | 57 ------------------- .../unsolved_pcp_instance_3101.smt2 | 57 ------------------- .../unsolved_pcp_instance_3102.smt2 | 57 ------------------- .../unsolved_pcp_instance_3103.smt2 | 57 ------------------- .../unsolved_pcp_instance_3104.smt2 | 57 ------------------- .../unsolved_pcp_instance_3105.smt2 | 57 ------------------- .../unsolved_pcp_instance_3106.smt2 | 57 ------------------- .../unsolved_pcp_instance_3107.smt2 | 57 ------------------- .../unsolved_pcp_instance_3108.smt2 | 57 ------------------- .../unsolved_pcp_instance_3109.smt2 | 57 ------------------- .../unsolved_pcp_instance_3110.smt2 | 57 ------------------- .../unsolved_pcp_instance_3111.smt2 | 57 ------------------- .../unsolved_pcp_instance_3112.smt2 | 57 ------------------- .../unsolved_pcp_instance_3113.smt2 | 57 ------------------- .../unsolved_pcp_instance_3114.smt2 | 57 ------------------- .../unsolved_pcp_instance_3115.smt2 | 57 ------------------- .../unsolved_pcp_instance_3116.smt2 | 57 ------------------- .../unsolved_pcp_instance_3117.smt2 | 57 ------------------- .../unsolved_pcp_instance_3118.smt2 | 57 ------------------- .../unsolved_pcp_instance_3119.smt2 | 57 ------------------- .../unsolved_pcp_instance_3120.smt2 | 57 ------------------- .../unsolved_pcp_instance_3121.smt2 | 57 ------------------- .../unsolved_pcp_instance_3122.smt2 | 57 ------------------- .../unsolved_pcp_instance_3123.smt2 | 57 ------------------- .../unsolved_pcp_instance_3124.smt2 | 57 ------------------- .../unsolved_pcp_instance_3125.smt2 | 57 ------------------- .../unsolved_pcp_instance_3126.smt2 | 57 ------------------- .../unsolved_pcp_instance_3127.smt2 | 57 ------------------- .../unsolved_pcp_instance_3128.smt2 | 57 ------------------- .../unsolved_pcp_instance_3129.smt2 | 57 ------------------- .../unsolved_pcp_instance_3130.smt2 | 57 ------------------- .../unsolved_pcp_instance_3131.smt2 | 57 ------------------- .../unsolved_pcp_instance_3132.smt2 | 57 ------------------- .../unsolved_pcp_instance_3133.smt2 | 57 ------------------- .../unsolved_pcp_instance_3134.smt2 | 57 ------------------- .../unsolved_pcp_instance_3135.smt2 | 57 ------------------- .../unsolved_pcp_instance_3136.smt2 | 57 ------------------- .../unsolved_pcp_instance_3137.smt2 | 57 ------------------- .../unsolved_pcp_instance_3138.smt2 | 57 ------------------- .../unsolved_pcp_instance_3139.smt2 | 57 ------------------- .../unsolved_pcp_instance_3140.smt2 | 57 ------------------- .../unsolved_pcp_instance_3141.smt2 | 57 ------------------- .../unsolved_pcp_instance_3142.smt2 | 57 ------------------- .../unsolved_pcp_instance_3143.smt2 | 57 ------------------- .../unsolved_pcp_instance_3144.smt2 | 57 ------------------- .../unsolved_pcp_instance_3145.smt2 | 57 ------------------- .../unsolved_pcp_instance_3146.smt2 | 57 ------------------- .../unsolved_pcp_instance_3147.smt2 | 57 ------------------- .../unsolved_pcp_instance_3148.smt2 | 57 ------------------- .../unsolved_pcp_instance_3149.smt2 | 57 ------------------- .../unsolved_pcp_instance_3150.smt2 | 57 ------------------- .../unsolved_pcp_instance_3151.smt2 | 57 ------------------- .../unsolved_pcp_instance_3152.smt2 | 57 ------------------- .../unsolved_pcp_instance_3153.smt2 | 57 ------------------- .../unsolved_pcp_instance_3154.smt2 | 57 ------------------- .../unsolved_pcp_instance_3155.smt2 | 57 ------------------- .../unsolved_pcp_instance_3156.smt2 | 57 ------------------- .../unsolved_pcp_instance_3157.smt2 | 57 ------------------- .../unsolved_pcp_instance_3158.smt2 | 57 ------------------- .../unsolved_pcp_instance_3159.smt2 | 57 ------------------- .../unsolved_pcp_instance_3160.smt2 | 57 ------------------- .../unsolved_pcp_instance_3161.smt2 | 57 ------------------- .../unsolved_pcp_instance_3162.smt2 | 57 ------------------- .../unsolved_pcp_instance_3163.smt2 | 57 ------------------- .../unsolved_pcp_instance_3164.smt2 | 57 ------------------- .../unsolved_pcp_instance_3165.smt2 | 57 ------------------- .../unsolved_pcp_instance_3166.smt2 | 57 ------------------- .../unsolved_pcp_instance_3167.smt2 | 57 ------------------- .../unsolved_pcp_instance_3168.smt2 | 57 ------------------- .../unsolved_pcp_instance_3169.smt2 | 57 ------------------- .../unsolved_pcp_instance_500.smt2 | 57 ------------------- .../unsolved_pcp_instance_501.smt2 | 57 ------------------- .../unsolved_pcp_instance_502.smt2 | 57 ------------------- .../unsolved_pcp_instance_503.smt2 | 57 ------------------- .../unsolved_pcp_instance_504.smt2 | 57 ------------------- .../unsolved_pcp_instance_505.smt2 | 57 ------------------- .../unsolved_pcp_instance_506.smt2 | 57 ------------------- .../unsolved_pcp_instance_507.smt2 | 57 ------------------- .../unsolved_pcp_instance_508.smt2 | 57 ------------------- .../unsolved_pcp_instance_509.smt2 | 57 ------------------- .../unsolved_pcp_instance_510.smt2 | 57 ------------------- .../unsolved_pcp_instance_511.smt2 | 57 ------------------- .../unsolved_pcp_instance_512.smt2 | 57 ------------------- .../unsolved_pcp_instance_513.smt2 | 57 ------------------- .../unsolved_pcp_instance_514.smt2 | 57 ------------------- .../unsolved_pcp_instance_515.smt2 | 57 ------------------- .../unsolved_pcp_instance_516.smt2 | 57 ------------------- .../unsolved_pcp_instance_517.smt2 | 57 ------------------- .../unsolved_pcp_instance_518.smt2 | 57 ------------------- .../unsolved_pcp_instance_519.smt2 | 57 ------------------- .../unsolved_pcp_instance_520.smt2 | 57 ------------------- .../unsolved_pcp_instance_521.smt2 | 57 ------------------- .../unsolved_pcp_instance_522.smt2 | 57 ------------------- .../unsolved_pcp_instance_523.smt2 | 57 ------------------- .../unsolved_pcp_instance_524.smt2 | 57 ------------------- .../unsolved_pcp_instance_525.smt2 | 57 ------------------- .../unsolved_pcp_instance_526.smt2 | 57 ------------------- .../unsolved_pcp_instance_527.smt2 | 57 ------------------- .../unsolved_pcp_instance_528.smt2 | 57 ------------------- .../unsolved_pcp_instance_529.smt2 | 57 ------------------- .../unsolved_pcp_instance_530.smt2 | 57 ------------------- .../unsolved_pcp_instance_531.smt2 | 57 ------------------- .../unsolved_pcp_instance_532.smt2 | 57 ------------------- .../unsolved_pcp_instance_533.smt2 | 57 ------------------- .../unsolved_pcp_instance_534.smt2 | 57 ------------------- .../unsolved_pcp_instance_535.smt2 | 57 ------------------- .../unsolved_pcp_instance_536.smt2 | 57 ------------------- .../unsolved_pcp_instance_537.smt2 | 57 ------------------- .../unsolved_pcp_instance_538.smt2 | 57 ------------------- .../unsolved_pcp_instance_539.smt2 | 57 ------------------- .../unsolved_pcp_instance_540.smt2 | 57 ------------------- .../unsolved_pcp_instance_541.smt2 | 57 ------------------- .../unsolved_pcp_instance_542.smt2 | 57 ------------------- .../unsolved_pcp_instance_543.smt2 | 57 ------------------- .../unsolved_pcp_instance_544.smt2 | 57 ------------------- .../unsolved_pcp_instance_545.smt2 | 57 ------------------- .../unsolved_pcp_instance_546.smt2 | 57 ------------------- .../unsolved_pcp_instance_547.smt2 | 57 ------------------- .../unsolved_pcp_instance_548.smt2 | 57 ------------------- .../unsolved_pcp_instance_549.smt2 | 57 ------------------- .../unsolved_pcp_instance_550.smt2 | 57 ------------------- .../unsolved_pcp_instance_551.smt2 | 57 ------------------- .../unsolved_pcp_instance_552.smt2 | 57 ------------------- .../unsolved_pcp_instance_553.smt2 | 57 ------------------- .../unsolved_pcp_instance_554.smt2 | 57 ------------------- .../unsolved_pcp_instance_555.smt2 | 57 ------------------- .../unsolved_pcp_instance_556.smt2 | 57 ------------------- .../unsolved_pcp_instance_557.smt2 | 57 ------------------- .../unsolved_pcp_instance_558.smt2 | 57 ------------------- .../unsolved_pcp_instance_559.smt2 | 57 ------------------- .../unsolved_pcp_instance_560.smt2 | 57 ------------------- .../unsolved_pcp_instance_561.smt2 | 57 ------------------- .../unsolved_pcp_instance_562.smt2 | 57 ------------------- .../unsolved_pcp_instance_563.smt2 | 57 ------------------- .../unsolved_pcp_instance_564.smt2 | 57 ------------------- .../unsolved_pcp_instance_565.smt2 | 57 ------------------- .../unsolved_pcp_instance_566.smt2 | 57 ------------------- .../unsolved_pcp_instance_567.smt2 | 57 ------------------- .../unsolved_pcp_instance_568.smt2 | 57 ------------------- .../unsolved_pcp_instance_569.smt2 | 57 ------------------- .../unsolved_pcp_instance_570.smt2 | 57 ------------------- .../unsolved_pcp_instance_571.smt2 | 57 ------------------- .../unsolved_pcp_instance_572.smt2 | 57 ------------------- .../unsolved_pcp_instance_573.smt2 | 57 ------------------- .../unsolved_pcp_instance_574.smt2 | 57 ------------------- .../unsolved_pcp_instance_575.smt2 | 57 ------------------- .../unsolved_pcp_instance_576.smt2 | 57 ------------------- .../unsolved_pcp_instance_577.smt2 | 57 ------------------- .../unsolved_pcp_instance_578.smt2 | 57 ------------------- .../unsolved_pcp_instance_579.smt2 | 57 ------------------- .../unsolved_pcp_instance_580.smt2 | 57 ------------------- .../unsolved_pcp_instance_581.smt2 | 57 ------------------- .../unsolved_pcp_instance_582.smt2 | 57 ------------------- .../unsolved_pcp_instance_583.smt2 | 57 ------------------- .../unsolved_pcp_instance_584.smt2 | 57 ------------------- .../unsolved_pcp_instance_585.smt2 | 57 ------------------- .../unsolved_pcp_instance_586.smt2 | 57 ------------------- .../unsolved_pcp_instance_587.smt2 | 57 ------------------- .../unsolved_pcp_instance_588.smt2 | 57 ------------------- .../unsolved_pcp_instance_589.smt2 | 57 ------------------- .../unsolved_pcp_instance_590.smt2 | 57 ------------------- .../unsolved_pcp_instance_591.smt2 | 57 ------------------- .../unsolved_pcp_instance_592.smt2 | 57 ------------------- .../unsolved_pcp_instance_593.smt2 | 57 ------------------- .../unsolved_pcp_instance_594.smt2 | 57 ------------------- .../unsolved_pcp_instance_595.smt2 | 57 ------------------- .../unsolved_pcp_instance_596.smt2 | 57 ------------------- .../unsolved_pcp_instance_597.smt2 | 57 ------------------- .../unsolved_pcp_instance_598.smt2 | 57 ------------------- .../unsolved_pcp_instance_599.smt2 | 57 ------------------- .../unsolved_pcp_instance_600.smt2 | 57 ------------------- .../unsolved_pcp_instance_601.smt2 | 57 ------------------- .../unsolved_pcp_instance_602.smt2 | 57 ------------------- .../unsolved_pcp_instance_603.smt2 | 57 ------------------- .../unsolved_pcp_instance_604.smt2 | 57 ------------------- .../unsolved_pcp_instance_605.smt2 | 57 ------------------- .../unsolved_pcp_instance_606.smt2 | 57 ------------------- .../unsolved_pcp_instance_607.smt2 | 57 ------------------- .../unsolved_pcp_instance_608.smt2 | 57 ------------------- .../unsolved_pcp_instance_609.smt2 | 57 ------------------- .../unsolved_pcp_instance_610.smt2 | 57 ------------------- .../unsolved_pcp_instance_611.smt2 | 57 ------------------- .../unsolved_pcp_instance_612.smt2 | 57 ------------------- .../unsolved_pcp_instance_613.smt2 | 57 ------------------- .../unsolved_pcp_instance_614.smt2 | 57 ------------------- .../unsolved_pcp_instance_615.smt2 | 57 ------------------- .../unsolved_pcp_instance_616.smt2 | 57 ------------------- .../unsolved_pcp_instance_617.smt2 | 57 ------------------- .../unsolved_pcp_instance_618.smt2 | 57 ------------------- .../unsolved_pcp_instance_619.smt2 | 57 ------------------- .../unsolved_pcp_instance_620.smt2 | 57 ------------------- .../unsolved_pcp_instance_621.smt2 | 57 ------------------- .../unsolved_pcp_instance_622.smt2 | 57 ------------------- .../unsolved_pcp_instance_623.smt2 | 57 ------------------- .../unsolved_pcp_instance_624.smt2 | 57 ------------------- .../unsolved_pcp_instance_625.smt2 | 57 ------------------- .../unsolved_pcp_instance_626.smt2 | 57 ------------------- .../unsolved_pcp_instance_627.smt2 | 57 ------------------- .../unsolved_pcp_instance_628.smt2 | 57 ------------------- .../unsolved_pcp_instance_629.smt2 | 57 ------------------- .../unsolved_pcp_instance_630.smt2 | 57 ------------------- .../unsolved_pcp_instance_631.smt2 | 57 ------------------- .../unsolved_pcp_instance_632.smt2 | 57 ------------------- .../unsolved_pcp_instance_633.smt2 | 57 ------------------- .../unsolved_pcp_instance_634.smt2 | 57 ------------------- .../unsolved_pcp_instance_635.smt2 | 57 ------------------- .../unsolved_pcp_instance_636.smt2 | 57 ------------------- .../unsolved_pcp_instance_637.smt2 | 57 ------------------- .../unsolved_pcp_instance_638.smt2 | 57 ------------------- .../unsolved_pcp_instance_639.smt2 | 57 ------------------- .../unsolved_pcp_instance_640.smt2 | 57 ------------------- .../unsolved_pcp_instance_641.smt2 | 57 ------------------- .../unsolved_pcp_instance_642.smt2 | 57 ------------------- .../unsolved_pcp_instance_643.smt2 | 57 ------------------- .../unsolved_pcp_instance_644.smt2 | 57 ------------------- .../unsolved_pcp_instance_645.smt2 | 57 ------------------- .../unsolved_pcp_instance_646.smt2 | 57 ------------------- .../unsolved_pcp_instance_647.smt2 | 57 ------------------- .../unsolved_pcp_instance_648.smt2 | 57 ------------------- .../unsolved_pcp_instance_649.smt2 | 57 ------------------- .../unsolved_pcp_instance_650.smt2 | 57 ------------------- .../unsolved_pcp_instance_651.smt2 | 57 ------------------- .../unsolved_pcp_instance_652.smt2 | 57 ------------------- .../unsolved_pcp_instance_653.smt2 | 57 ------------------- .../unsolved_pcp_instance_654.smt2 | 57 ------------------- .../unsolved_pcp_instance_655.smt2 | 57 ------------------- .../unsolved_pcp_instance_656.smt2 | 57 ------------------- .../unsolved_pcp_instance_657.smt2 | 57 ------------------- .../unsolved_pcp_instance_658.smt2 | 57 ------------------- .../unsolved_pcp_instance_659.smt2 | 57 ------------------- .../unsolved_pcp_instance_660.smt2 | 57 ------------------- .../unsolved_pcp_instance_661.smt2 | 57 ------------------- .../unsolved_pcp_instance_662.smt2 | 57 ------------------- .../unsolved_pcp_instance_663.smt2 | 57 ------------------- .../unsolved_pcp_instance_664.smt2 | 57 ------------------- .../unsolved_pcp_instance_665.smt2 | 57 ------------------- .../unsolved_pcp_instance_666.smt2 | 57 ------------------- .../unsolved_pcp_instance_667.smt2 | 57 ------------------- .../unsolved_pcp_instance_668.smt2 | 57 ------------------- .../unsolved_pcp_instance_669.smt2 | 57 ------------------- .../unsolved_pcp_instance_670.smt2 | 57 ------------------- .../unsolved_pcp_instance_671.smt2 | 57 ------------------- .../unsolved_pcp_instance_672.smt2 | 57 ------------------- .../unsolved_pcp_instance_673.smt2 | 57 ------------------- .../unsolved_pcp_instance_674.smt2 | 57 ------------------- .../unsolved_pcp_instance_675.smt2 | 57 ------------------- .../unsolved_pcp_instance_676.smt2 | 57 ------------------- .../unsolved_pcp_instance_677.smt2 | 57 ------------------- .../unsolved_pcp_instance_678.smt2 | 57 ------------------- .../unsolved_pcp_instance_679.smt2 | 57 ------------------- .../unsolved_pcp_instance_680.smt2 | 57 ------------------- .../unsolved_pcp_instance_681.smt2 | 57 ------------------- .../unsolved_pcp_instance_682.smt2 | 57 ------------------- .../unsolved_pcp_instance_683.smt2 | 57 ------------------- .../unsolved_pcp_instance_684.smt2 | 57 ------------------- .../unsolved_pcp_instance_685.smt2 | 57 ------------------- .../unsolved_pcp_instance_686.smt2 | 57 ------------------- .../unsolved_pcp_instance_687.smt2 | 57 ------------------- .../unsolved_pcp_instance_688.smt2 | 57 ------------------- .../unsolved_pcp_instance_689.smt2 | 57 ------------------- .../unsolved_pcp_instance_690.smt2 | 57 ------------------- .../unsolved_pcp_instance_691.smt2 | 57 ------------------- .../unsolved_pcp_instance_692.smt2 | 57 ------------------- .../unsolved_pcp_instance_693.smt2 | 57 ------------------- .../unsolved_pcp_instance_694.smt2 | 57 ------------------- .../unsolved_pcp_instance_695.smt2 | 57 ------------------- .../unsolved_pcp_instance_696.smt2 | 57 ------------------- .../unsolved_pcp_instance_697.smt2 | 57 ------------------- .../unsolved_pcp_instance_698.smt2 | 57 ------------------- .../unsolved_pcp_instance_699.smt2 | 57 ------------------- .../unsolved_pcp_instance_700.smt2 | 57 ------------------- .../unsolved_pcp_instance_701.smt2 | 57 ------------------- .../unsolved_pcp_instance_702.smt2 | 57 ------------------- .../unsolved_pcp_instance_703.smt2 | 57 ------------------- .../unsolved_pcp_instance_704.smt2 | 57 ------------------- .../unsolved_pcp_instance_705.smt2 | 57 ------------------- .../unsolved_pcp_instance_706.smt2 | 57 ------------------- .../unsolved_pcp_instance_707.smt2 | 57 ------------------- .../unsolved_pcp_instance_708.smt2 | 57 ------------------- .../unsolved_pcp_instance_709.smt2 | 57 ------------------- .../unsolved_pcp_instance_710.smt2 | 57 ------------------- .../unsolved_pcp_instance_711.smt2 | 57 ------------------- .../unsolved_pcp_instance_712.smt2 | 57 ------------------- .../unsolved_pcp_instance_713.smt2 | 57 ------------------- .../unsolved_pcp_instance_714.smt2 | 57 ------------------- .../unsolved_pcp_instance_715.smt2 | 57 ------------------- .../unsolved_pcp_instance_716.smt2 | 57 ------------------- .../unsolved_pcp_instance_717.smt2 | 57 ------------------- .../unsolved_pcp_instance_718.smt2 | 57 ------------------- .../unsolved_pcp_instance_719.smt2 | 57 ------------------- .../unsolved_pcp_instance_720.smt2 | 57 ------------------- .../unsolved_pcp_instance_721.smt2 | 57 ------------------- .../unsolved_pcp_instance_722.smt2 | 57 ------------------- .../unsolved_pcp_instance_723.smt2 | 57 ------------------- .../unsolved_pcp_instance_724.smt2 | 57 ------------------- .../unsolved_pcp_instance_725.smt2 | 57 ------------------- .../unsolved_pcp_instance_726.smt2 | 57 ------------------- .../unsolved_pcp_instance_727.smt2 | 57 ------------------- .../unsolved_pcp_instance_728.smt2 | 57 ------------------- .../unsolved_pcp_instance_729.smt2 | 57 ------------------- .../unsolved_pcp_instance_730.smt2 | 57 ------------------- .../unsolved_pcp_instance_731.smt2 | 57 ------------------- .../unsolved_pcp_instance_732.smt2 | 57 ------------------- .../unsolved_pcp_instance_733.smt2 | 57 ------------------- .../unsolved_pcp_instance_734.smt2 | 57 ------------------- .../unsolved_pcp_instance_735.smt2 | 57 ------------------- .../unsolved_pcp_instance_736.smt2 | 57 ------------------- .../unsolved_pcp_instance_737.smt2 | 57 ------------------- .../unsolved_pcp_instance_738.smt2 | 57 ------------------- .../unsolved_pcp_instance_739.smt2 | 57 ------------------- .../unsolved_pcp_instance_740.smt2 | 57 ------------------- .../unsolved_pcp_instance_741.smt2 | 57 ------------------- .../unsolved_pcp_instance_742.smt2 | 57 ------------------- .../unsolved_pcp_instance_743.smt2 | 57 ------------------- .../unsolved_pcp_instance_744.smt2 | 57 ------------------- .../unsolved_pcp_instance_745.smt2 | 57 ------------------- .../unsolved_pcp_instance_746.smt2 | 57 ------------------- .../unsolved_pcp_instance_747.smt2 | 57 ------------------- .../unsolved_pcp_instance_748.smt2 | 57 ------------------- .../unsolved_pcp_instance_749.smt2 | 57 ------------------- .../unsolved_pcp_instance_750.smt2 | 57 ------------------- .../unsolved_pcp_instance_751.smt2 | 57 ------------------- .../unsolved_pcp_instance_752.smt2 | 57 ------------------- .../unsolved_pcp_instance_753.smt2 | 57 ------------------- .../unsolved_pcp_instance_754.smt2 | 57 ------------------- .../unsolved_pcp_instance_755.smt2 | 57 ------------------- .../unsolved_pcp_instance_756.smt2 | 57 ------------------- .../unsolved_pcp_instance_757.smt2 | 57 ------------------- .../unsolved_pcp_instance_758.smt2 | 57 ------------------- .../unsolved_pcp_instance_759.smt2 | 57 ------------------- .../unsolved_pcp_instance_760.smt2 | 57 ------------------- .../unsolved_pcp_instance_761.smt2 | 57 ------------------- .../unsolved_pcp_instance_762.smt2 | 57 ------------------- .../unsolved_pcp_instance_763.smt2 | 57 ------------------- .../unsolved_pcp_instance_764.smt2 | 57 ------------------- .../unsolved_pcp_instance_765.smt2 | 57 ------------------- .../unsolved_pcp_instance_766.smt2 | 57 ------------------- .../unsolved_pcp_instance_767.smt2 | 57 ------------------- .../unsolved_pcp_instance_768.smt2 | 57 ------------------- .../unsolved_pcp_instance_769.smt2 | 57 ------------------- .../unsolved_pcp_instance_770.smt2 | 57 ------------------- .../unsolved_pcp_instance_771.smt2 | 57 ------------------- .../unsolved_pcp_instance_772.smt2 | 57 ------------------- .../unsolved_pcp_instance_773.smt2 | 57 ------------------- .../unsolved_pcp_instance_774.smt2 | 57 ------------------- .../unsolved_pcp_instance_775.smt2 | 57 ------------------- .../unsolved_pcp_instance_776.smt2 | 57 ------------------- .../unsolved_pcp_instance_777.smt2 | 57 ------------------- .../unsolved_pcp_instance_778.smt2 | 57 ------------------- .../unsolved_pcp_instance_779.smt2 | 57 ------------------- .../unsolved_pcp_instance_780.smt2 | 57 ------------------- .../unsolved_pcp_instance_781.smt2 | 57 ------------------- .../unsolved_pcp_instance_782.smt2 | 57 ------------------- .../unsolved_pcp_instance_783.smt2 | 57 ------------------- .../unsolved_pcp_instance_784.smt2 | 57 ------------------- .../unsolved_pcp_instance_785.smt2 | 57 ------------------- .../unsolved_pcp_instance_786.smt2 | 57 ------------------- .../unsolved_pcp_instance_787.smt2 | 57 ------------------- .../unsolved_pcp_instance_788.smt2 | 57 ------------------- .../unsolved_pcp_instance_789.smt2 | 57 ------------------- .../unsolved_pcp_instance_790.smt2 | 57 ------------------- .../unsolved_pcp_instance_791.smt2 | 57 ------------------- .../unsolved_pcp_instance_792.smt2 | 57 ------------------- .../unsolved_pcp_instance_793.smt2 | 57 ------------------- .../unsolved_pcp_instance_794.smt2 | 57 ------------------- .../unsolved_pcp_instance_795.smt2 | 57 ------------------- .../unsolved_pcp_instance_796.smt2 | 57 ------------------- .../unsolved_pcp_instance_797.smt2 | 57 ------------------- .../unsolved_pcp_instance_798.smt2 | 57 ------------------- .../unsolved_pcp_instance_799.smt2 | 57 ------------------- .../unsolved_pcp_instance_800.smt2 | 57 ------------------- .../unsolved_pcp_instance_801.smt2 | 57 ------------------- .../unsolved_pcp_instance_802.smt2 | 57 ------------------- .../unsolved_pcp_instance_803.smt2 | 57 ------------------- .../unsolved_pcp_instance_804.smt2 | 57 ------------------- .../unsolved_pcp_instance_805.smt2 | 57 ------------------- .../unsolved_pcp_instance_806.smt2 | 57 ------------------- .../unsolved_pcp_instance_807.smt2 | 57 ------------------- .../unsolved_pcp_instance_808.smt2 | 57 ------------------- .../unsolved_pcp_instance_809.smt2 | 57 ------------------- .../unsolved_pcp_instance_810.smt2 | 57 ------------------- .../unsolved_pcp_instance_811.smt2 | 57 ------------------- .../unsolved_pcp_instance_812.smt2 | 57 ------------------- .../unsolved_pcp_instance_813.smt2 | 57 ------------------- .../unsolved_pcp_instance_814.smt2 | 57 ------------------- .../unsolved_pcp_instance_815.smt2 | 57 ------------------- .../unsolved_pcp_instance_816.smt2 | 57 ------------------- .../unsolved_pcp_instance_817.smt2 | 57 ------------------- .../unsolved_pcp_instance_818.smt2 | 57 ------------------- .../unsolved_pcp_instance_819.smt2 | 57 ------------------- .../unsolved_pcp_instance_820.smt2 | 57 ------------------- .../unsolved_pcp_instance_821.smt2 | 57 ------------------- .../unsolved_pcp_instance_822.smt2 | 57 ------------------- .../unsolved_pcp_instance_823.smt2 | 57 ------------------- .../unsolved_pcp_instance_824.smt2 | 57 ------------------- .../unsolved_pcp_instance_825.smt2 | 57 ------------------- .../unsolved_pcp_instance_826.smt2 | 57 ------------------- .../unsolved_pcp_instance_827.smt2 | 57 ------------------- .../unsolved_pcp_instance_828.smt2 | 57 ------------------- .../unsolved_pcp_instance_829.smt2 | 57 ------------------- .../unsolved_pcp_instance_830.smt2 | 57 ------------------- .../unsolved_pcp_instance_831.smt2 | 57 ------------------- .../unsolved_pcp_instance_832.smt2 | 57 ------------------- .../unsolved_pcp_instance_833.smt2 | 57 ------------------- .../unsolved_pcp_instance_834.smt2 | 57 ------------------- .../unsolved_pcp_instance_835.smt2 | 57 ------------------- .../unsolved_pcp_instance_836.smt2 | 57 ------------------- .../unsolved_pcp_instance_837.smt2 | 57 ------------------- .../unsolved_pcp_instance_838.smt2 | 57 ------------------- .../unsolved_pcp_instance_839.smt2 | 57 ------------------- .../unsolved_pcp_instance_840.smt2 | 57 ------------------- .../unsolved_pcp_instance_841.smt2 | 57 ------------------- .../unsolved_pcp_instance_842.smt2 | 57 ------------------- .../unsolved_pcp_instance_843.smt2 | 57 ------------------- .../unsolved_pcp_instance_844.smt2 | 57 ------------------- .../unsolved_pcp_instance_845.smt2 | 57 ------------------- .../unsolved_pcp_instance_846.smt2 | 57 ------------------- .../unsolved_pcp_instance_847.smt2 | 57 ------------------- .../unsolved_pcp_instance_848.smt2 | 57 ------------------- .../unsolved_pcp_instance_849.smt2 | 57 ------------------- .../unsolved_pcp_instance_850.smt2 | 57 ------------------- .../unsolved_pcp_instance_851.smt2 | 57 ------------------- .../unsolved_pcp_instance_852.smt2 | 57 ------------------- .../unsolved_pcp_instance_853.smt2 | 57 ------------------- .../unsolved_pcp_instance_854.smt2 | 57 ------------------- .../unsolved_pcp_instance_855.smt2 | 57 ------------------- .../unsolved_pcp_instance_856.smt2 | 57 ------------------- .../unsolved_pcp_instance_857.smt2 | 57 ------------------- .../unsolved_pcp_instance_858.smt2 | 57 ------------------- .../unsolved_pcp_instance_859.smt2 | 57 ------------------- .../unsolved_pcp_instance_860.smt2 | 57 ------------------- .../unsolved_pcp_instance_861.smt2 | 57 ------------------- .../unsolved_pcp_instance_862.smt2 | 57 ------------------- .../unsolved_pcp_instance_863.smt2 | 57 ------------------- .../unsolved_pcp_instance_864.smt2 | 57 ------------------- .../unsolved_pcp_instance_865.smt2 | 57 ------------------- .../unsolved_pcp_instance_866.smt2 | 57 ------------------- .../unsolved_pcp_instance_867.smt2 | 57 ------------------- .../unsolved_pcp_instance_868.smt2 | 57 ------------------- .../unsolved_pcp_instance_869.smt2 | 57 ------------------- .../unsolved_pcp_instance_870.smt2 | 57 ------------------- .../unsolved_pcp_instance_871.smt2 | 57 ------------------- .../unsolved_pcp_instance_872.smt2 | 57 ------------------- .../unsolved_pcp_instance_873.smt2 | 57 ------------------- .../unsolved_pcp_instance_874.smt2 | 57 ------------------- .../unsolved_pcp_instance_875.smt2 | 57 ------------------- .../unsolved_pcp_instance_876.smt2 | 57 ------------------- .../unsolved_pcp_instance_877.smt2 | 57 ------------------- .../unsolved_pcp_instance_878.smt2 | 57 ------------------- .../unsolved_pcp_instance_879.smt2 | 57 ------------------- .../unsolved_pcp_instance_880.smt2 | 57 ------------------- .../unsolved_pcp_instance_881.smt2 | 57 ------------------- .../unsolved_pcp_instance_882.smt2 | 57 ------------------- .../unsolved_pcp_instance_883.smt2 | 57 ------------------- .../unsolved_pcp_instance_884.smt2 | 57 ------------------- .../unsolved_pcp_instance_885.smt2 | 57 ------------------- .../unsolved_pcp_instance_886.smt2 | 57 ------------------- .../unsolved_pcp_instance_887.smt2 | 57 ------------------- .../unsolved_pcp_instance_888.smt2 | 57 ------------------- .../unsolved_pcp_instance_889.smt2 | 57 ------------------- .../unsolved_pcp_instance_890.smt2 | 57 ------------------- .../unsolved_pcp_instance_891.smt2 | 57 ------------------- .../unsolved_pcp_instance_892.smt2 | 57 ------------------- .../unsolved_pcp_instance_893.smt2 | 57 ------------------- .../unsolved_pcp_instance_894.smt2 | 57 ------------------- .../unsolved_pcp_instance_895.smt2 | 57 ------------------- .../unsolved_pcp_instance_896.smt2 | 57 ------------------- .../unsolved_pcp_instance_897.smt2 | 57 ------------------- .../unsolved_pcp_instance_898.smt2 | 57 ------------------- .../unsolved_pcp_instance_899.smt2 | 57 ------------------- .../unsolved_pcp_instance_900.smt2 | 57 ------------------- .../unsolved_pcp_instance_901.smt2 | 57 ------------------- .../unsolved_pcp_instance_902.smt2 | 57 ------------------- .../unsolved_pcp_instance_903.smt2 | 57 ------------------- .../unsolved_pcp_instance_904.smt2 | 57 ------------------- .../unsolved_pcp_instance_905.smt2 | 57 ------------------- .../unsolved_pcp_instance_906.smt2 | 57 ------------------- .../unsolved_pcp_instance_907.smt2 | 57 ------------------- .../unsolved_pcp_instance_908.smt2 | 57 ------------------- .../unsolved_pcp_instance_909.smt2 | 57 ------------------- .../unsolved_pcp_instance_910.smt2 | 57 ------------------- .../unsolved_pcp_instance_911.smt2 | 57 ------------------- .../unsolved_pcp_instance_912.smt2 | 57 ------------------- .../unsolved_pcp_instance_913.smt2 | 57 ------------------- .../unsolved_pcp_instance_914.smt2 | 57 ------------------- .../unsolved_pcp_instance_915.smt2 | 57 ------------------- .../unsolved_pcp_instance_916.smt2 | 57 ------------------- .../unsolved_pcp_instance_917.smt2 | 57 ------------------- .../unsolved_pcp_instance_918.smt2 | 57 ------------------- .../unsolved_pcp_instance_919.smt2 | 57 ------------------- .../unsolved_pcp_instance_920.smt2 | 57 ------------------- .../unsolved_pcp_instance_921.smt2 | 57 ------------------- .../unsolved_pcp_instance_922.smt2 | 57 ------------------- .../unsolved_pcp_instance_923.smt2 | 57 ------------------- .../unsolved_pcp_instance_924.smt2 | 57 ------------------- .../unsolved_pcp_instance_925.smt2 | 57 ------------------- .../unsolved_pcp_instance_926.smt2 | 57 ------------------- .../unsolved_pcp_instance_927.smt2 | 57 ------------------- .../unsolved_pcp_instance_928.smt2 | 57 ------------------- .../unsolved_pcp_instance_929.smt2 | 57 ------------------- .../unsolved_pcp_instance_930.smt2 | 57 ------------------- .../unsolved_pcp_instance_931.smt2 | 57 ------------------- .../unsolved_pcp_instance_932.smt2 | 57 ------------------- .../unsolved_pcp_instance_933.smt2 | 57 ------------------- .../unsolved_pcp_instance_934.smt2 | 57 ------------------- .../unsolved_pcp_instance_935.smt2 | 57 ------------------- .../unsolved_pcp_instance_936.smt2 | 57 ------------------- .../unsolved_pcp_instance_937.smt2 | 57 ------------------- .../unsolved_pcp_instance_938.smt2 | 57 ------------------- .../unsolved_pcp_instance_939.smt2 | 57 ------------------- .../unsolved_pcp_instance_940.smt2 | 57 ------------------- .../unsolved_pcp_instance_941.smt2 | 57 ------------------- .../unsolved_pcp_instance_942.smt2 | 57 ------------------- .../unsolved_pcp_instance_943.smt2 | 57 ------------------- .../unsolved_pcp_instance_944.smt2 | 57 ------------------- .../unsolved_pcp_instance_945.smt2 | 57 ------------------- .../unsolved_pcp_instance_946.smt2 | 57 ------------------- .../unsolved_pcp_instance_947.smt2 | 57 ------------------- .../unsolved_pcp_instance_948.smt2 | 57 ------------------- .../unsolved_pcp_instance_949.smt2 | 57 ------------------- .../unsolved_pcp_instance_950.smt2 | 57 ------------------- .../unsolved_pcp_instance_951.smt2 | 57 ------------------- .../unsolved_pcp_instance_952.smt2 | 57 ------------------- .../unsolved_pcp_instance_953.smt2 | 57 ------------------- .../unsolved_pcp_instance_954.smt2 | 57 ------------------- .../unsolved_pcp_instance_955.smt2 | 57 ------------------- .../unsolved_pcp_instance_956.smt2 | 57 ------------------- .../unsolved_pcp_instance_957.smt2 | 57 ------------------- .../unsolved_pcp_instance_958.smt2 | 57 ------------------- .../unsolved_pcp_instance_959.smt2 | 57 ------------------- .../unsolved_pcp_instance_960.smt2 | 57 ------------------- .../unsolved_pcp_instance_961.smt2 | 57 ------------------- .../unsolved_pcp_instance_962.smt2 | 57 ------------------- .../unsolved_pcp_instance_963.smt2 | 57 ------------------- .../unsolved_pcp_instance_964.smt2 | 57 ------------------- .../unsolved_pcp_instance_965.smt2 | 57 ------------------- .../unsolved_pcp_instance_966.smt2 | 57 ------------------- .../unsolved_pcp_instance_967.smt2 | 57 ------------------- .../unsolved_pcp_instance_968.smt2 | 57 ------------------- .../unsolved_pcp_instance_969.smt2 | 57 ------------------- .../unsolved_pcp_instance_970.smt2 | 57 ------------------- .../unsolved_pcp_instance_971.smt2 | 57 ------------------- .../unsolved_pcp_instance_972.smt2 | 57 ------------------- .../unsolved_pcp_instance_973.smt2 | 57 ------------------- .../unsolved_pcp_instance_974.smt2 | 57 ------------------- .../unsolved_pcp_instance_975.smt2 | 57 ------------------- .../unsolved_pcp_instance_976.smt2 | 57 ------------------- .../unsolved_pcp_instance_977.smt2 | 57 ------------------- .../unsolved_pcp_instance_978.smt2 | 57 ------------------- .../unsolved_pcp_instance_979.smt2 | 57 ------------------- .../unsolved_pcp_instance_980.smt2 | 57 ------------------- .../unsolved_pcp_instance_981.smt2 | 57 ------------------- .../unsolved_pcp_instance_982.smt2 | 57 ------------------- .../unsolved_pcp_instance_983.smt2 | 57 ------------------- .../unsolved_pcp_instance_984.smt2 | 57 ------------------- .../unsolved_pcp_instance_985.smt2 | 57 ------------------- .../unsolved_pcp_instance_986.smt2 | 57 ------------------- .../unsolved_pcp_instance_987.smt2 | 57 ------------------- .../unsolved_pcp_instance_988.smt2 | 57 ------------------- .../unsolved_pcp_instance_989.smt2 | 57 ------------------- .../unsolved_pcp_instance_990.smt2 | 57 ------------------- .../unsolved_pcp_instance_991.smt2 | 57 ------------------- .../unsolved_pcp_instance_992.smt2 | 57 ------------------- .../unsolved_pcp_instance_993.smt2 | 57 ------------------- .../unsolved_pcp_instance_994.smt2 | 57 ------------------- .../unsolved_pcp_instance_995.smt2 | 57 ------------------- .../unsolved_pcp_instance_996.smt2 | 57 ------------------- .../unsolved_pcp_instance_997.smt2 | 57 ------------------- .../unsolved_pcp_instance_998.smt2 | 57 ------------------- .../unsolved_pcp_instance_999.smt2 | 57 ------------------- .../pcp-3-3-random}/pcp_instance_0.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_1.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_10.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_100.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_101.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_102.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_103.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_104.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_105.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_106.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_107.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_108.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_109.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_11.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_110.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_111.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_112.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_113.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_114.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_115.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_116.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_117.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_118.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_119.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_12.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_120.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_121.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_122.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_123.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_124.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_125.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_126.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_127.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_128.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_129.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_13.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_130.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_131.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_132.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_133.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_134.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_135.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_136.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_137.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_138.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_139.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_14.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_140.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_141.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_142.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_143.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_144.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_145.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_146.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_147.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_148.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_149.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_15.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_150.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_151.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_152.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_153.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_154.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_155.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_156.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_157.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_158.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_159.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_16.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_160.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_161.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_162.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_163.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_164.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_165.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_166.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_167.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_168.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_169.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_17.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_170.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_171.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_172.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_173.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_174.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_175.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_176.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_177.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_178.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_179.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_18.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_180.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_181.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_182.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_183.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_184.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_185.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_186.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_187.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_188.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_189.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_19.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_190.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_191.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_192.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_193.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_194.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_195.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_196.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_197.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_198.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_199.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_2.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_20.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_200.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_201.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_202.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_203.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_204.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_205.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_206.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_207.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_208.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_209.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_21.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_210.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_211.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_212.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_213.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_214.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_215.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_216.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_217.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_218.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_219.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_22.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_220.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_221.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_222.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_223.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_224.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_225.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_226.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_227.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_228.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_229.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_23.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_230.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_231.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_232.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_233.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_234.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_235.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_236.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_237.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_238.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_239.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_24.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_240.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_241.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_242.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_243.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_244.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_245.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_246.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_247.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_248.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_249.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_25.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_250.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_251.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_252.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_253.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_254.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_255.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_256.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_257.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_258.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_259.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_26.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_260.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_261.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_262.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_263.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_264.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_265.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_266.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_267.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_268.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_269.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_27.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_270.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_271.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_272.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_273.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_274.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_275.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_276.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_277.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_278.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_279.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_28.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_280.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_281.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_282.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_283.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_284.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_285.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_286.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_287.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_288.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_289.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_29.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_290.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_291.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_292.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_293.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_294.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_295.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_296.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_297.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_298.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_299.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_3.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_30.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_300.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_301.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_302.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_303.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_304.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_305.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_306.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_307.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_308.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_309.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_31.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_310.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_311.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_312.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_313.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_314.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_315.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_316.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_317.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_318.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_319.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_32.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_320.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_321.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_322.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_323.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_324.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_325.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_326.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_327.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_328.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_329.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_33.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_330.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_331.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_332.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_333.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_334.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_335.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_336.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_337.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_338.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_339.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_34.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_340.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_341.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_342.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_343.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_344.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_345.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_346.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_347.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_348.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_349.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_35.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_350.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_351.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_352.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_353.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_354.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_355.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_356.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_357.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_358.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_359.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_36.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_360.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_361.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_362.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_363.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_364.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_365.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_366.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_367.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_368.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_369.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_37.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_370.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_371.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_372.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_373.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_374.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_375.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_376.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_377.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_378.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_379.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_38.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_380.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_381.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_382.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_383.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_384.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_385.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_386.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_387.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_388.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_389.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_39.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_390.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_391.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_392.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_393.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_394.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_395.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_396.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_397.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_398.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_399.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_4.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_40.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_400.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_401.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_402.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_403.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_404.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_405.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_406.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_407.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_408.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_409.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_41.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_410.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_411.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_412.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_413.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_414.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_415.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_416.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_417.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_418.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_419.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_42.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_420.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_421.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_422.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_423.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_424.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_425.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_426.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_427.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_428.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_429.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_43.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_430.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_431.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_432.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_433.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_434.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_435.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_436.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_437.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_438.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_439.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_44.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_440.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_441.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_442.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_443.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_444.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_445.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_446.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_447.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_448.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_449.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_45.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_450.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_451.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_452.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_453.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_454.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_455.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_456.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_457.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_458.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_459.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_46.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_460.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_461.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_462.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_463.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_464.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_465.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_466.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_467.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_468.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_469.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_47.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_470.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_471.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_472.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_473.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_474.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_475.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_476.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_477.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_478.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_479.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_48.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_480.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_481.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_482.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_483.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_484.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_485.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_486.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_487.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_488.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_489.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_49.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_490.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_491.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_492.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_493.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_494.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_495.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_496.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_497.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_498.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_499.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_5.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_50.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_51.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_52.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_53.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_54.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_55.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_56.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_57.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_58.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_59.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_6.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_60.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_61.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_62.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_63.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_64.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_65.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_66.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_67.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_68.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_69.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_7.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_70.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_71.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_72.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_73.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_74.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_75.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_76.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_77.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_78.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_79.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_8.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_80.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_81.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_82.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_83.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_84.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_85.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_86.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_87.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_88.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_89.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_9.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_90.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_91.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_92.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_93.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_94.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_95.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_96.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_97.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_98.smt2 | 2 +- .../pcp-3-3-random}/pcp_instance_99.smt2 | 2 +- .../unsolved_pcp_instance_0.smt2 | 2 +- .../unsolved_pcp_instance_1.smt2 | 2 +- .../unsolved_pcp_instance_10.smt2 | 2 +- .../unsolved_pcp_instance_100.smt2 | 2 +- .../unsolved_pcp_instance_101.smt2 | 2 +- .../unsolved_pcp_instance_102.smt2 | 2 +- .../unsolved_pcp_instance_103.smt2 | 2 +- .../unsolved_pcp_instance_104.smt2 | 2 +- .../unsolved_pcp_instance_105.smt2 | 2 +- .../unsolved_pcp_instance_106.smt2 | 2 +- .../unsolved_pcp_instance_107.smt2 | 2 +- .../unsolved_pcp_instance_108.smt2 | 2 +- .../unsolved_pcp_instance_109.smt2 | 2 +- .../unsolved_pcp_instance_11.smt2 | 2 +- .../unsolved_pcp_instance_110.smt2 | 2 +- .../unsolved_pcp_instance_111.smt2 | 2 +- .../unsolved_pcp_instance_112.smt2 | 2 +- .../unsolved_pcp_instance_113.smt2 | 2 +- .../unsolved_pcp_instance_114.smt2 | 2 +- .../unsolved_pcp_instance_115.smt2 | 2 +- .../unsolved_pcp_instance_116.smt2 | 2 +- .../unsolved_pcp_instance_117.smt2 | 2 +- .../unsolved_pcp_instance_118.smt2 | 2 +- .../unsolved_pcp_instance_119.smt2 | 2 +- .../unsolved_pcp_instance_12.smt2 | 2 +- .../unsolved_pcp_instance_120.smt2 | 2 +- .../unsolved_pcp_instance_121.smt2 | 2 +- .../unsolved_pcp_instance_122.smt2 | 2 +- .../unsolved_pcp_instance_123.smt2 | 2 +- .../unsolved_pcp_instance_124.smt2 | 2 +- .../unsolved_pcp_instance_125.smt2 | 2 +- .../unsolved_pcp_instance_126.smt2 | 2 +- .../unsolved_pcp_instance_127.smt2 | 2 +- .../unsolved_pcp_instance_128.smt2 | 2 +- .../unsolved_pcp_instance_129.smt2 | 2 +- .../unsolved_pcp_instance_13.smt2 | 2 +- .../unsolved_pcp_instance_130.smt2 | 2 +- .../unsolved_pcp_instance_131.smt2 | 2 +- .../unsolved_pcp_instance_132.smt2 | 2 +- .../unsolved_pcp_instance_133.smt2 | 2 +- .../unsolved_pcp_instance_134.smt2 | 2 +- .../unsolved_pcp_instance_135.smt2 | 2 +- .../unsolved_pcp_instance_136.smt2 | 2 +- .../unsolved_pcp_instance_137.smt2 | 2 +- .../unsolved_pcp_instance_138.smt2 | 2 +- .../unsolved_pcp_instance_139.smt2 | 2 +- .../unsolved_pcp_instance_14.smt2 | 2 +- .../unsolved_pcp_instance_140.smt2 | 2 +- .../unsolved_pcp_instance_141.smt2 | 2 +- .../unsolved_pcp_instance_142.smt2 | 2 +- .../unsolved_pcp_instance_143.smt2 | 2 +- .../unsolved_pcp_instance_144.smt2 | 2 +- .../unsolved_pcp_instance_145.smt2 | 2 +- .../unsolved_pcp_instance_146.smt2 | 2 +- .../unsolved_pcp_instance_147.smt2 | 2 +- .../unsolved_pcp_instance_148.smt2 | 2 +- .../unsolved_pcp_instance_149.smt2 | 2 +- .../unsolved_pcp_instance_15.smt2 | 2 +- .../unsolved_pcp_instance_150.smt2 | 2 +- .../unsolved_pcp_instance_151.smt2 | 2 +- .../unsolved_pcp_instance_152.smt2 | 2 +- .../unsolved_pcp_instance_153.smt2 | 2 +- .../unsolved_pcp_instance_154.smt2 | 2 +- .../unsolved_pcp_instance_155.smt2 | 2 +- .../unsolved_pcp_instance_156.smt2 | 2 +- .../unsolved_pcp_instance_157.smt2 | 2 +- .../unsolved_pcp_instance_158.smt2 | 2 +- .../unsolved_pcp_instance_159.smt2 | 2 +- .../unsolved_pcp_instance_16.smt2 | 2 +- .../unsolved_pcp_instance_160.smt2 | 2 +- .../unsolved_pcp_instance_161.smt2 | 2 +- .../unsolved_pcp_instance_162.smt2 | 2 +- .../unsolved_pcp_instance_163.smt2 | 2 +- .../unsolved_pcp_instance_164.smt2 | 2 +- .../unsolved_pcp_instance_165.smt2 | 2 +- .../unsolved_pcp_instance_166.smt2 | 2 +- .../unsolved_pcp_instance_167.smt2 | 2 +- .../unsolved_pcp_instance_168.smt2 | 2 +- .../unsolved_pcp_instance_169.smt2 | 2 +- .../unsolved_pcp_instance_17.smt2 | 2 +- .../unsolved_pcp_instance_170.smt2 | 2 +- .../unsolved_pcp_instance_171.smt2 | 2 +- .../unsolved_pcp_instance_172.smt2 | 2 +- .../unsolved_pcp_instance_173.smt2 | 2 +- .../unsolved_pcp_instance_174.smt2 | 2 +- .../unsolved_pcp_instance_175.smt2 | 2 +- .../unsolved_pcp_instance_176.smt2 | 2 +- .../unsolved_pcp_instance_177.smt2 | 2 +- .../unsolved_pcp_instance_178.smt2 | 2 +- .../unsolved_pcp_instance_179.smt2 | 2 +- .../unsolved_pcp_instance_18.smt2 | 2 +- .../unsolved_pcp_instance_180.smt2 | 2 +- .../unsolved_pcp_instance_181.smt2 | 2 +- .../unsolved_pcp_instance_182.smt2 | 2 +- .../unsolved_pcp_instance_183.smt2 | 2 +- .../unsolved_pcp_instance_184.smt2 | 2 +- .../unsolved_pcp_instance_185.smt2 | 2 +- .../unsolved_pcp_instance_186.smt2 | 2 +- .../unsolved_pcp_instance_187.smt2 | 2 +- .../unsolved_pcp_instance_188.smt2 | 2 +- .../unsolved_pcp_instance_189.smt2 | 2 +- .../unsolved_pcp_instance_19.smt2 | 2 +- .../unsolved_pcp_instance_190.smt2 | 2 +- .../unsolved_pcp_instance_191.smt2 | 2 +- .../unsolved_pcp_instance_192.smt2 | 2 +- .../unsolved_pcp_instance_193.smt2 | 2 +- .../unsolved_pcp_instance_194.smt2 | 2 +- .../unsolved_pcp_instance_195.smt2 | 2 +- .../unsolved_pcp_instance_196.smt2 | 2 +- .../unsolved_pcp_instance_197.smt2 | 2 +- .../unsolved_pcp_instance_198.smt2 | 2 +- .../unsolved_pcp_instance_199.smt2 | 2 +- .../unsolved_pcp_instance_2.smt2 | 2 +- .../unsolved_pcp_instance_20.smt2 | 2 +- .../unsolved_pcp_instance_200.smt2 | 2 +- .../unsolved_pcp_instance_201.smt2 | 2 +- .../unsolved_pcp_instance_202.smt2 | 2 +- .../unsolved_pcp_instance_203.smt2 | 2 +- .../unsolved_pcp_instance_204.smt2 | 2 +- .../unsolved_pcp_instance_205.smt2 | 2 +- .../unsolved_pcp_instance_206.smt2 | 2 +- .../unsolved_pcp_instance_207.smt2 | 2 +- .../unsolved_pcp_instance_208.smt2 | 2 +- .../unsolved_pcp_instance_209.smt2 | 2 +- .../unsolved_pcp_instance_21.smt2 | 2 +- .../unsolved_pcp_instance_210.smt2 | 2 +- .../unsolved_pcp_instance_211.smt2 | 2 +- .../unsolved_pcp_instance_212.smt2 | 2 +- .../unsolved_pcp_instance_213.smt2 | 2 +- .../unsolved_pcp_instance_214.smt2 | 2 +- .../unsolved_pcp_instance_215.smt2 | 2 +- .../unsolved_pcp_instance_216.smt2 | 2 +- .../unsolved_pcp_instance_217.smt2 | 2 +- .../unsolved_pcp_instance_218.smt2 | 2 +- .../unsolved_pcp_instance_219.smt2 | 2 +- .../unsolved_pcp_instance_22.smt2 | 2 +- .../unsolved_pcp_instance_220.smt2 | 2 +- .../unsolved_pcp_instance_221.smt2 | 2 +- .../unsolved_pcp_instance_222.smt2 | 2 +- .../unsolved_pcp_instance_223.smt2 | 2 +- .../unsolved_pcp_instance_224.smt2 | 2 +- .../unsolved_pcp_instance_225.smt2 | 2 +- .../unsolved_pcp_instance_226.smt2 | 2 +- .../unsolved_pcp_instance_227.smt2 | 2 +- .../unsolved_pcp_instance_228.smt2 | 2 +- .../unsolved_pcp_instance_229.smt2 | 2 +- .../unsolved_pcp_instance_23.smt2 | 2 +- .../unsolved_pcp_instance_230.smt2 | 2 +- .../unsolved_pcp_instance_231.smt2 | 2 +- .../unsolved_pcp_instance_232.smt2 | 2 +- .../unsolved_pcp_instance_233.smt2 | 2 +- .../unsolved_pcp_instance_234.smt2 | 2 +- .../unsolved_pcp_instance_235.smt2 | 2 +- .../unsolved_pcp_instance_236.smt2 | 2 +- .../unsolved_pcp_instance_237.smt2 | 2 +- .../unsolved_pcp_instance_238.smt2 | 2 +- .../unsolved_pcp_instance_239.smt2 | 2 +- .../unsolved_pcp_instance_24.smt2 | 2 +- .../unsolved_pcp_instance_240.smt2 | 2 +- .../unsolved_pcp_instance_241.smt2 | 2 +- .../unsolved_pcp_instance_242.smt2 | 2 +- .../unsolved_pcp_instance_243.smt2 | 2 +- .../unsolved_pcp_instance_244.smt2 | 2 +- .../unsolved_pcp_instance_245.smt2 | 2 +- .../unsolved_pcp_instance_246.smt2 | 2 +- .../unsolved_pcp_instance_247.smt2 | 2 +- .../unsolved_pcp_instance_248.smt2 | 2 +- .../unsolved_pcp_instance_249.smt2 | 2 +- .../unsolved_pcp_instance_25.smt2 | 2 +- .../unsolved_pcp_instance_250.smt2 | 2 +- .../unsolved_pcp_instance_251.smt2 | 2 +- .../unsolved_pcp_instance_252.smt2 | 2 +- .../unsolved_pcp_instance_253.smt2 | 2 +- .../unsolved_pcp_instance_254.smt2 | 2 +- .../unsolved_pcp_instance_255.smt2 | 2 +- .../unsolved_pcp_instance_256.smt2 | 2 +- .../unsolved_pcp_instance_257.smt2 | 2 +- .../unsolved_pcp_instance_258.smt2 | 2 +- .../unsolved_pcp_instance_259.smt2 | 2 +- .../unsolved_pcp_instance_26.smt2 | 2 +- .../unsolved_pcp_instance_260.smt2 | 2 +- .../unsolved_pcp_instance_261.smt2 | 2 +- .../unsolved_pcp_instance_262.smt2 | 2 +- .../unsolved_pcp_instance_263.smt2 | 2 +- .../unsolved_pcp_instance_264.smt2 | 2 +- .../unsolved_pcp_instance_265.smt2 | 2 +- .../unsolved_pcp_instance_266.smt2 | 2 +- .../unsolved_pcp_instance_267.smt2 | 2 +- .../unsolved_pcp_instance_268.smt2 | 2 +- .../unsolved_pcp_instance_269.smt2 | 2 +- .../unsolved_pcp_instance_27.smt2 | 2 +- .../unsolved_pcp_instance_270.smt2 | 2 +- .../unsolved_pcp_instance_271.smt2 | 2 +- .../unsolved_pcp_instance_272.smt2 | 2 +- .../unsolved_pcp_instance_273.smt2 | 2 +- .../unsolved_pcp_instance_274.smt2 | 2 +- .../unsolved_pcp_instance_275.smt2 | 2 +- .../unsolved_pcp_instance_276.smt2 | 2 +- .../unsolved_pcp_instance_277.smt2 | 2 +- .../unsolved_pcp_instance_278.smt2 | 2 +- .../unsolved_pcp_instance_279.smt2 | 2 +- .../unsolved_pcp_instance_28.smt2 | 2 +- .../unsolved_pcp_instance_280.smt2 | 2 +- .../unsolved_pcp_instance_281.smt2 | 2 +- .../unsolved_pcp_instance_282.smt2 | 2 +- .../unsolved_pcp_instance_283.smt2 | 2 +- .../unsolved_pcp_instance_284.smt2 | 2 +- .../unsolved_pcp_instance_285.smt2 | 2 +- .../unsolved_pcp_instance_286.smt2 | 2 +- .../unsolved_pcp_instance_287.smt2 | 2 +- .../unsolved_pcp_instance_288.smt2 | 2 +- .../unsolved_pcp_instance_289.smt2 | 2 +- .../unsolved_pcp_instance_29.smt2 | 2 +- .../unsolved_pcp_instance_290.smt2 | 2 +- .../unsolved_pcp_instance_291.smt2 | 2 +- .../unsolved_pcp_instance_292.smt2 | 2 +- .../unsolved_pcp_instance_293.smt2 | 2 +- .../unsolved_pcp_instance_294.smt2 | 2 +- .../unsolved_pcp_instance_295.smt2 | 2 +- .../unsolved_pcp_instance_296.smt2 | 2 +- .../unsolved_pcp_instance_297.smt2 | 2 +- .../unsolved_pcp_instance_298.smt2 | 2 +- .../unsolved_pcp_instance_299.smt2 | 2 +- .../unsolved_pcp_instance_3.smt2 | 2 +- .../unsolved_pcp_instance_30.smt2 | 2 +- .../unsolved_pcp_instance_300.smt2 | 2 +- .../unsolved_pcp_instance_301.smt2 | 2 +- .../unsolved_pcp_instance_302.smt2 | 2 +- .../unsolved_pcp_instance_303.smt2 | 2 +- .../unsolved_pcp_instance_304.smt2 | 2 +- .../unsolved_pcp_instance_305.smt2 | 2 +- .../unsolved_pcp_instance_306.smt2 | 2 +- .../unsolved_pcp_instance_307.smt2 | 2 +- .../unsolved_pcp_instance_308.smt2 | 2 +- .../unsolved_pcp_instance_309.smt2 | 2 +- .../unsolved_pcp_instance_31.smt2 | 2 +- .../unsolved_pcp_instance_310.smt2 | 2 +- .../unsolved_pcp_instance_311.smt2 | 2 +- .../unsolved_pcp_instance_312.smt2 | 2 +- .../unsolved_pcp_instance_313.smt2 | 2 +- .../unsolved_pcp_instance_314.smt2 | 2 +- .../unsolved_pcp_instance_315.smt2 | 2 +- .../unsolved_pcp_instance_316.smt2 | 2 +- .../unsolved_pcp_instance_317.smt2 | 2 +- .../unsolved_pcp_instance_318.smt2 | 2 +- .../unsolved_pcp_instance_319.smt2 | 2 +- .../unsolved_pcp_instance_32.smt2 | 2 +- .../unsolved_pcp_instance_320.smt2 | 2 +- .../unsolved_pcp_instance_321.smt2 | 2 +- .../unsolved_pcp_instance_322.smt2 | 2 +- .../unsolved_pcp_instance_323.smt2 | 2 +- .../unsolved_pcp_instance_324.smt2 | 2 +- .../unsolved_pcp_instance_325.smt2 | 2 +- .../unsolved_pcp_instance_326.smt2 | 2 +- .../unsolved_pcp_instance_327.smt2 | 2 +- .../unsolved_pcp_instance_328.smt2 | 2 +- .../unsolved_pcp_instance_329.smt2 | 2 +- .../unsolved_pcp_instance_33.smt2 | 2 +- .../unsolved_pcp_instance_330.smt2 | 2 +- .../unsolved_pcp_instance_331.smt2 | 2 +- .../unsolved_pcp_instance_332.smt2 | 2 +- .../unsolved_pcp_instance_333.smt2 | 2 +- .../unsolved_pcp_instance_334.smt2 | 2 +- .../unsolved_pcp_instance_335.smt2 | 2 +- .../unsolved_pcp_instance_336.smt2 | 2 +- .../unsolved_pcp_instance_337.smt2 | 2 +- .../unsolved_pcp_instance_338.smt2 | 2 +- .../unsolved_pcp_instance_339.smt2 | 2 +- .../unsolved_pcp_instance_34.smt2 | 2 +- .../unsolved_pcp_instance_340.smt2 | 2 +- .../unsolved_pcp_instance_341.smt2 | 2 +- .../unsolved_pcp_instance_342.smt2 | 2 +- .../unsolved_pcp_instance_343.smt2 | 2 +- .../unsolved_pcp_instance_344.smt2 | 2 +- .../unsolved_pcp_instance_345.smt2 | 2 +- .../unsolved_pcp_instance_346.smt2 | 2 +- .../unsolved_pcp_instance_347.smt2 | 2 +- .../unsolved_pcp_instance_348.smt2 | 2 +- .../unsolved_pcp_instance_349.smt2 | 2 +- .../unsolved_pcp_instance_35.smt2 | 2 +- .../unsolved_pcp_instance_350.smt2 | 2 +- .../unsolved_pcp_instance_351.smt2 | 2 +- .../unsolved_pcp_instance_352.smt2 | 2 +- .../unsolved_pcp_instance_353.smt2 | 2 +- .../unsolved_pcp_instance_354.smt2 | 2 +- .../unsolved_pcp_instance_355.smt2 | 2 +- .../unsolved_pcp_instance_356.smt2 | 2 +- .../unsolved_pcp_instance_357.smt2 | 2 +- .../unsolved_pcp_instance_358.smt2 | 2 +- .../unsolved_pcp_instance_359.smt2 | 2 +- .../unsolved_pcp_instance_36.smt2 | 2 +- .../unsolved_pcp_instance_360.smt2 | 2 +- .../unsolved_pcp_instance_361.smt2 | 2 +- .../unsolved_pcp_instance_362.smt2 | 2 +- .../unsolved_pcp_instance_363.smt2 | 2 +- .../unsolved_pcp_instance_364.smt2 | 2 +- .../unsolved_pcp_instance_365.smt2 | 2 +- .../unsolved_pcp_instance_366.smt2 | 2 +- .../unsolved_pcp_instance_367.smt2 | 2 +- .../unsolved_pcp_instance_368.smt2 | 2 +- .../unsolved_pcp_instance_369.smt2 | 2 +- .../unsolved_pcp_instance_37.smt2 | 2 +- .../unsolved_pcp_instance_370.smt2 | 2 +- .../unsolved_pcp_instance_371.smt2 | 2 +- .../unsolved_pcp_instance_372.smt2 | 2 +- .../unsolved_pcp_instance_373.smt2 | 2 +- .../unsolved_pcp_instance_374.smt2 | 2 +- .../unsolved_pcp_instance_375.smt2 | 2 +- .../unsolved_pcp_instance_376.smt2 | 2 +- .../unsolved_pcp_instance_377.smt2 | 2 +- .../unsolved_pcp_instance_378.smt2 | 2 +- .../unsolved_pcp_instance_379.smt2 | 2 +- .../unsolved_pcp_instance_38.smt2 | 2 +- .../unsolved_pcp_instance_380.smt2 | 2 +- .../unsolved_pcp_instance_381.smt2 | 2 +- .../unsolved_pcp_instance_382.smt2 | 2 +- .../unsolved_pcp_instance_383.smt2 | 2 +- .../unsolved_pcp_instance_384.smt2 | 2 +- .../unsolved_pcp_instance_385.smt2 | 2 +- .../unsolved_pcp_instance_386.smt2 | 2 +- .../unsolved_pcp_instance_387.smt2 | 2 +- .../unsolved_pcp_instance_388.smt2 | 2 +- .../unsolved_pcp_instance_389.smt2 | 2 +- .../unsolved_pcp_instance_39.smt2 | 2 +- .../unsolved_pcp_instance_390.smt2 | 2 +- .../unsolved_pcp_instance_391.smt2 | 2 +- .../unsolved_pcp_instance_392.smt2 | 2 +- .../unsolved_pcp_instance_393.smt2 | 2 +- .../unsolved_pcp_instance_394.smt2 | 2 +- .../unsolved_pcp_instance_395.smt2 | 2 +- .../unsolved_pcp_instance_396.smt2 | 2 +- .../unsolved_pcp_instance_397.smt2 | 2 +- .../unsolved_pcp_instance_398.smt2 | 2 +- .../unsolved_pcp_instance_399.smt2 | 2 +- .../unsolved_pcp_instance_4.smt2 | 2 +- .../unsolved_pcp_instance_40.smt2 | 2 +- .../unsolved_pcp_instance_400.smt2 | 2 +- .../unsolved_pcp_instance_401.smt2 | 2 +- .../unsolved_pcp_instance_402.smt2 | 2 +- .../unsolved_pcp_instance_403.smt2 | 2 +- .../unsolved_pcp_instance_404.smt2 | 2 +- .../unsolved_pcp_instance_405.smt2 | 2 +- .../unsolved_pcp_instance_406.smt2 | 2 +- .../unsolved_pcp_instance_407.smt2 | 2 +- .../unsolved_pcp_instance_408.smt2 | 2 +- .../unsolved_pcp_instance_409.smt2 | 2 +- .../unsolved_pcp_instance_41.smt2 | 2 +- .../unsolved_pcp_instance_410.smt2 | 2 +- .../unsolved_pcp_instance_411.smt2 | 2 +- .../unsolved_pcp_instance_412.smt2 | 2 +- .../unsolved_pcp_instance_413.smt2 | 2 +- .../unsolved_pcp_instance_414.smt2 | 2 +- .../unsolved_pcp_instance_415.smt2 | 2 +- .../unsolved_pcp_instance_416.smt2 | 2 +- .../unsolved_pcp_instance_417.smt2 | 2 +- .../unsolved_pcp_instance_418.smt2 | 2 +- .../unsolved_pcp_instance_419.smt2 | 2 +- .../unsolved_pcp_instance_42.smt2 | 2 +- .../unsolved_pcp_instance_420.smt2 | 2 +- .../unsolved_pcp_instance_421.smt2 | 2 +- .../unsolved_pcp_instance_422.smt2 | 2 +- .../unsolved_pcp_instance_423.smt2 | 2 +- .../unsolved_pcp_instance_424.smt2 | 2 +- .../unsolved_pcp_instance_425.smt2 | 2 +- .../unsolved_pcp_instance_426.smt2 | 2 +- .../unsolved_pcp_instance_427.smt2 | 2 +- .../unsolved_pcp_instance_428.smt2 | 2 +- .../unsolved_pcp_instance_429.smt2 | 2 +- .../unsolved_pcp_instance_43.smt2 | 2 +- .../unsolved_pcp_instance_430.smt2 | 2 +- .../unsolved_pcp_instance_431.smt2 | 2 +- .../unsolved_pcp_instance_432.smt2 | 2 +- .../unsolved_pcp_instance_433.smt2 | 2 +- .../unsolved_pcp_instance_434.smt2 | 2 +- .../unsolved_pcp_instance_435.smt2 | 2 +- .../unsolved_pcp_instance_436.smt2 | 2 +- .../unsolved_pcp_instance_437.smt2 | 2 +- .../unsolved_pcp_instance_438.smt2 | 2 +- .../unsolved_pcp_instance_439.smt2 | 2 +- .../unsolved_pcp_instance_44.smt2 | 2 +- .../unsolved_pcp_instance_440.smt2 | 2 +- .../unsolved_pcp_instance_441.smt2 | 2 +- .../unsolved_pcp_instance_442.smt2 | 2 +- .../unsolved_pcp_instance_443.smt2 | 2 +- .../unsolved_pcp_instance_444.smt2 | 2 +- .../unsolved_pcp_instance_445.smt2 | 2 +- .../unsolved_pcp_instance_446.smt2 | 2 +- .../unsolved_pcp_instance_447.smt2 | 2 +- .../unsolved_pcp_instance_448.smt2 | 2 +- .../unsolved_pcp_instance_449.smt2 | 2 +- .../unsolved_pcp_instance_45.smt2 | 2 +- .../unsolved_pcp_instance_450.smt2 | 2 +- .../unsolved_pcp_instance_451.smt2 | 2 +- .../unsolved_pcp_instance_452.smt2 | 2 +- .../unsolved_pcp_instance_453.smt2 | 2 +- .../unsolved_pcp_instance_454.smt2 | 2 +- .../unsolved_pcp_instance_455.smt2 | 2 +- .../unsolved_pcp_instance_456.smt2 | 2 +- .../unsolved_pcp_instance_457.smt2 | 2 +- .../unsolved_pcp_instance_458.smt2 | 2 +- .../unsolved_pcp_instance_459.smt2 | 2 +- .../unsolved_pcp_instance_46.smt2 | 2 +- .../unsolved_pcp_instance_460.smt2 | 2 +- .../unsolved_pcp_instance_461.smt2 | 2 +- .../unsolved_pcp_instance_462.smt2 | 2 +- .../unsolved_pcp_instance_463.smt2 | 2 +- .../unsolved_pcp_instance_464.smt2 | 2 +- .../unsolved_pcp_instance_465.smt2 | 2 +- .../unsolved_pcp_instance_466.smt2 | 2 +- .../unsolved_pcp_instance_467.smt2 | 2 +- .../unsolved_pcp_instance_468.smt2 | 2 +- .../unsolved_pcp_instance_469.smt2 | 2 +- .../unsolved_pcp_instance_47.smt2 | 2 +- .../unsolved_pcp_instance_470.smt2 | 2 +- .../unsolved_pcp_instance_471.smt2 | 2 +- .../unsolved_pcp_instance_472.smt2 | 2 +- .../unsolved_pcp_instance_473.smt2 | 2 +- .../unsolved_pcp_instance_474.smt2 | 2 +- .../unsolved_pcp_instance_475.smt2 | 2 +- .../unsolved_pcp_instance_476.smt2 | 2 +- .../unsolved_pcp_instance_477.smt2 | 2 +- .../unsolved_pcp_instance_478.smt2 | 2 +- .../unsolved_pcp_instance_479.smt2 | 2 +- .../unsolved_pcp_instance_48.smt2 | 2 +- .../unsolved_pcp_instance_480.smt2 | 2 +- .../unsolved_pcp_instance_481.smt2 | 2 +- .../unsolved_pcp_instance_482.smt2 | 2 +- .../unsolved_pcp_instance_483.smt2 | 2 +- .../unsolved_pcp_instance_484.smt2 | 2 +- .../unsolved_pcp_instance_485.smt2 | 2 +- .../unsolved_pcp_instance_486.smt2 | 2 +- .../unsolved_pcp_instance_487.smt2 | 2 +- .../unsolved_pcp_instance_488.smt2 | 2 +- .../unsolved_pcp_instance_489.smt2 | 2 +- .../unsolved_pcp_instance_49.smt2 | 2 +- .../unsolved_pcp_instance_490.smt2 | 2 +- .../unsolved_pcp_instance_491.smt2 | 2 +- .../unsolved_pcp_instance_492.smt2 | 2 +- .../unsolved_pcp_instance_493.smt2 | 2 +- .../unsolved_pcp_instance_494.smt2 | 2 +- .../unsolved_pcp_instance_495.smt2 | 2 +- .../unsolved_pcp_instance_496.smt2 | 2 +- .../unsolved_pcp_instance_497.smt2 | 2 +- .../unsolved_pcp_instance_498.smt2 | 2 +- .../unsolved_pcp_instance_499.smt2 | 2 +- .../unsolved_pcp_instance_5.smt2 | 2 +- .../unsolved_pcp_instance_50.smt2 | 2 +- .../unsolved_pcp_instance_51.smt2 | 2 +- .../unsolved_pcp_instance_52.smt2 | 2 +- .../unsolved_pcp_instance_53.smt2 | 2 +- .../unsolved_pcp_instance_54.smt2 | 2 +- .../unsolved_pcp_instance_55.smt2 | 2 +- .../unsolved_pcp_instance_56.smt2 | 2 +- .../unsolved_pcp_instance_57.smt2 | 2 +- .../unsolved_pcp_instance_58.smt2 | 2 +- .../unsolved_pcp_instance_59.smt2 | 2 +- .../unsolved_pcp_instance_6.smt2 | 2 +- .../unsolved_pcp_instance_60.smt2 | 2 +- .../unsolved_pcp_instance_61.smt2 | 2 +- .../unsolved_pcp_instance_62.smt2 | 2 +- .../unsolved_pcp_instance_63.smt2 | 2 +- .../unsolved_pcp_instance_64.smt2 | 2 +- .../unsolved_pcp_instance_65.smt2 | 2 +- .../unsolved_pcp_instance_66.smt2 | 2 +- .../unsolved_pcp_instance_67.smt2 | 2 +- .../unsolved_pcp_instance_68.smt2 | 2 +- .../unsolved_pcp_instance_69.smt2 | 2 +- .../unsolved_pcp_instance_7.smt2 | 2 +- .../unsolved_pcp_instance_70.smt2 | 2 +- .../unsolved_pcp_instance_71.smt2 | 2 +- .../unsolved_pcp_instance_72.smt2 | 2 +- .../unsolved_pcp_instance_73.smt2 | 2 +- .../unsolved_pcp_instance_74.smt2 | 2 +- .../unsolved_pcp_instance_75.smt2 | 2 +- .../unsolved_pcp_instance_76.smt2 | 2 +- .../unsolved_pcp_instance_77.smt2 | 2 +- .../unsolved_pcp_instance_78.smt2 | 2 +- .../unsolved_pcp_instance_79.smt2 | 2 +- .../unsolved_pcp_instance_8.smt2 | 2 +- .../unsolved_pcp_instance_80.smt2 | 2 +- .../unsolved_pcp_instance_81.smt2 | 2 +- .../unsolved_pcp_instance_82.smt2 | 2 +- .../unsolved_pcp_instance_83.smt2 | 2 +- .../unsolved_pcp_instance_84.smt2 | 2 +- .../unsolved_pcp_instance_85.smt2 | 2 +- .../unsolved_pcp_instance_86.smt2 | 2 +- .../unsolved_pcp_instance_87.smt2 | 2 +- .../unsolved_pcp_instance_88.smt2 | 2 +- .../unsolved_pcp_instance_89.smt2 | 2 +- .../unsolved_pcp_instance_9.smt2 | 2 +- .../unsolved_pcp_instance_90.smt2 | 2 +- .../unsolved_pcp_instance_91.smt2 | 2 +- .../unsolved_pcp_instance_92.smt2 | 2 +- .../unsolved_pcp_instance_93.smt2 | 2 +- .../unsolved_pcp_instance_94.smt2 | 2 +- .../unsolved_pcp_instance_95.smt2 | 2 +- .../unsolved_pcp_instance_96.smt2 | 2 +- .../unsolved_pcp_instance_97.smt2 | 2 +- .../unsolved_pcp_instance_98.smt2 | 2 +- .../unsolved_pcp_instance_99.smt2 | 2 +- .../QF_S/20250403-rna-sat/benchmark_0001.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0002.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0003.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0004.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0005.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0006.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0007.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0008.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0009.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0010.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0011.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0012.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0013.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0014.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0015.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0016.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0017.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0018.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0019.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0020.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0021.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0022.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0023.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0024.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0025.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0026.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0027.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0028.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0029.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0030.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0031.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0032.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0033.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0034.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0035.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0036.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0037.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0038.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0039.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0040.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0041.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0042.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0043.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0044.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0045.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0046.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0047.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0048.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0049.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0050.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0051.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0052.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0053.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0054.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0055.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0056.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0057.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0058.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0059.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0060.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0061.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0062.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0063.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0064.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0065.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0066.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0067.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0068.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0069.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0070.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0071.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0072.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0073.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0074.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0075.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0076.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0077.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0078.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0079.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0080.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0081.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0082.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0083.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0084.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0085.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0086.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0087.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0088.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0089.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0090.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0091.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0092.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0093.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0094.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0095.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0096.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0097.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0098.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0099.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0100.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0101.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0102.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0103.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0104.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0105.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0106.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0107.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0108.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0109.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0110.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0111.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0112.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0113.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0114.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0115.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0116.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0117.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0118.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0119.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0120.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0121.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0122.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0123.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0124.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0125.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0126.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0127.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0128.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0129.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0130.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0131.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0132.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0133.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0134.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0135.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0136.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0137.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0138.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0139.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0140.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0141.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0142.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0143.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0144.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0145.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0146.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0147.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0148.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0149.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0150.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0151.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0152.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0153.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0154.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0155.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0156.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0157.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0158.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0159.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0160.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0161.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0162.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0163.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0164.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0165.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0166.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0167.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0168.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0169.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0170.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0171.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0172.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0173.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0174.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0175.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0176.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0177.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0178.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0179.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0180.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0181.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0182.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0183.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0184.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0185.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0186.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0187.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0188.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0189.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0190.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0191.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0192.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0193.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0194.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0195.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0196.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0197.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0198.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0199.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0200.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0201.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0202.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0203.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0204.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0205.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0206.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0207.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0208.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0209.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0210.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0211.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0212.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0213.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0214.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0215.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0216.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0217.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0218.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0219.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0220.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0221.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0222.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0223.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0224.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0225.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0226.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0227.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0228.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0229.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0230.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0231.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0232.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0233.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0234.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0235.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0236.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0237.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0238.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0239.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0240.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0241.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0242.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0243.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0244.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0245.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0246.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0247.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0248.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0249.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0250.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0251.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0252.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0253.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0254.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0255.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0256.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0257.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0258.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0259.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0260.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0261.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0262.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0263.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0264.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0265.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0266.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0267.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0268.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0269.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0270.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0271.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0272.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0273.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0274.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0275.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0276.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0277.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0278.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0279.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0280.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0281.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0282.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0283.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0284.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0285.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0286.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0287.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0288.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0289.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0290.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0291.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0292.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0293.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0294.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0295.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0296.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0297.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0298.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0299.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0300.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0301.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0302.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0303.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0304.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0305.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0306.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0307.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0308.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0309.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0310.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0311.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0312.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0313.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0314.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0315.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0316.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0317.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0318.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0319.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0320.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0321.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0322.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0323.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0324.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0325.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0326.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0327.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0328.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0329.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0330.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0331.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0332.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0333.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0334.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0335.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0336.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0337.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0338.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0339.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0340.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0341.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0342.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0343.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0344.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0345.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0346.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0347.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0348.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0349.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0350.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0351.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0352.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0353.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0354.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0355.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0356.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0357.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0358.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0359.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0360.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0361.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0362.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0363.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0364.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0365.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0366.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0367.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0368.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0369.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0370.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0371.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0372.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0373.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0374.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0375.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0376.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0377.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0378.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0379.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0380.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0381.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0382.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0383.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0384.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0385.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0386.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0387.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0388.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0389.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0390.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0391.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0392.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0393.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0394.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0395.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0396.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0397.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0398.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0399.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0400.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0401.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0402.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0403.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0404.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0405.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0406.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0407.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0408.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0409.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0410.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0411.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0412.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0413.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0414.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0415.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0416.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0417.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0418.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0419.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0420.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0421.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0422.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0423.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0424.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0425.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0426.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0427.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0428.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0429.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0430.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0431.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0432.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0433.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0434.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0435.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0436.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0437.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0438.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0439.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0440.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0441.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0442.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0443.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0444.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0445.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0446.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0447.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0448.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0449.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0450.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0451.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0452.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0453.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0454.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0455.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0456.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0457.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0458.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0459.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0460.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0461.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0462.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0463.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0464.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0465.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0466.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0467.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0468.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0469.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0470.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0471.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0472.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0473.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0474.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0475.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0476.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0477.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0478.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0479.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0480.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0481.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0482.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0483.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0484.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0485.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0486.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0487.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0488.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0489.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0490.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0491.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0492.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0493.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0494.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0495.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0496.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0497.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0498.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0499.smt2 | 39 ------------- .../QF_S/20250403-rna-sat/benchmark_0500.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0001.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0002.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0003.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0004.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0005.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0006.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0007.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0008.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0009.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0010.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0011.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0012.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0013.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0014.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0015.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0016.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0017.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0018.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0019.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0020.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0021.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0022.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0023.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0024.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0025.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0026.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0027.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0028.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0029.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0030.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0031.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0032.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0033.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0034.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0035.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0036.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0037.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0038.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0039.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0040.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0041.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0042.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0043.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0044.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0045.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0046.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0047.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0048.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0049.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0050.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0051.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0052.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0053.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0054.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0055.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0056.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0057.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0058.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0059.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0060.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0061.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0062.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0063.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0064.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0065.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0066.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0067.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0068.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0069.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0070.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0071.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0072.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0073.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0074.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0075.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0076.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0077.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0078.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0079.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0080.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0081.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0082.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0083.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0084.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0085.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0086.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0087.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0088.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0089.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0090.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0091.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0092.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0093.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0094.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0095.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0096.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0097.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0098.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0099.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0100.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0101.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0102.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0103.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0104.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0105.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0106.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0107.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0108.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0109.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0110.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0111.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0112.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0113.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0114.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0115.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0116.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0117.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0118.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0119.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0120.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0121.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0122.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0123.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0124.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0125.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0126.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0127.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0128.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0129.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0130.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0131.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0132.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0133.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0134.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0135.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0136.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0137.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0138.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0139.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0140.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0141.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0142.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0143.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0144.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0145.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0146.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0147.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0148.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0149.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0150.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0151.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0152.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0153.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0154.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0155.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0156.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0157.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0158.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0159.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0160.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0161.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0162.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0163.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0164.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0165.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0166.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0167.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0168.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0169.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0170.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0171.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0172.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0173.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0174.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0175.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0176.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0177.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0178.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0179.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0180.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0181.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0182.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0183.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0184.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0185.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0186.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0187.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0188.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0189.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0190.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0191.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0192.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0193.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0194.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0195.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0196.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0197.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0198.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0199.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0200.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0201.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0202.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0203.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0204.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0205.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0206.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0207.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0208.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0209.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0210.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0211.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0212.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0213.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0214.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0215.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0216.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0217.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0218.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0219.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0220.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0221.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0222.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0223.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0224.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0225.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0226.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0227.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0228.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0229.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0230.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0231.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0232.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0233.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0234.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0235.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0236.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0237.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0238.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0239.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0240.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0241.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0242.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0243.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0244.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0245.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0246.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0247.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0248.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0249.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0250.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0251.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0252.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0253.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0254.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0255.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0256.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0257.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0258.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0259.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0260.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0261.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0262.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0263.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0264.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0265.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0266.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0267.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0268.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0269.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0270.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0271.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0272.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0273.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0274.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0275.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0276.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0277.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0278.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0279.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0280.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0281.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0282.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0283.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0284.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0285.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0286.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0287.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0288.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0289.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0290.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0291.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0292.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0293.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0294.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0295.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0296.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0297.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0298.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0299.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0300.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0301.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0302.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0303.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0304.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0305.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0306.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0307.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0308.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0309.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0310.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0311.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0312.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0313.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0314.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0315.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0316.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0317.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0318.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0319.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0320.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0321.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0322.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0323.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0324.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0325.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0326.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0327.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0328.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0329.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0330.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0331.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0332.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0333.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0334.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0335.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0336.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0337.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0338.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0339.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0340.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0341.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0342.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0343.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0344.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0345.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0346.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0347.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0348.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0349.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0350.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0351.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0352.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0353.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0354.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0355.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0356.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0357.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0358.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0359.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0360.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0361.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0362.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0363.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0364.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0365.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0366.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0367.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0368.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0369.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0370.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0371.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0372.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0373.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0374.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0375.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0376.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0377.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0378.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0379.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0380.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0381.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0382.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0383.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0384.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0385.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0386.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0387.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0388.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0389.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0390.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0391.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0392.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0393.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0394.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0395.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0396.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0397.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0398.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0399.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0400.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0401.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0402.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0403.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0404.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0405.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0406.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0407.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0408.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0409.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0410.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0411.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0412.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0413.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0414.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0415.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0416.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0417.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0418.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0419.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0420.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0421.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0422.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0423.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0424.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0425.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0426.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0427.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0428.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0429.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0430.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0431.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0432.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0433.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0434.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0435.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0436.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0437.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0438.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0439.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0440.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0441.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0442.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0443.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0444.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0445.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0446.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0447.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0448.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0449.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0450.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0451.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0452.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0453.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0454.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0455.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0456.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0457.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0458.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0459.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0460.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0461.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0462.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0463.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0464.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0465.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0466.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0467.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0468.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0469.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0470.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0471.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0472.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0473.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0474.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0475.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0476.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0477.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0478.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0479.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0480.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0481.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0482.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0483.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0484.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0485.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0486.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0487.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0488.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0489.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0490.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0491.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0492.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0493.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0494.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0495.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0496.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0497.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0498.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0499.smt2 | 39 ------------- .../20250403-rna-unsat/benchmark_0500.smt2 | 39 ------------- .../20250403-rna/rna-sat/benchmark_0001.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0002.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0003.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0004.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0005.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0006.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0007.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0008.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0009.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0010.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0011.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0012.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0013.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0014.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0015.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0016.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0017.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0018.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0019.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0020.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0021.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0022.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0023.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0024.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0025.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0026.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0027.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0028.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0029.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0030.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0031.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0032.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0033.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0034.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0035.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0036.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0037.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0038.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0039.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0040.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0041.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0042.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0043.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0044.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0045.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0046.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0047.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0048.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0049.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0050.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0051.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0052.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0053.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0054.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0055.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0056.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0057.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0058.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0059.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0060.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0061.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0062.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0063.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0064.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0065.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0066.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0067.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0068.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0069.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0070.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0071.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0072.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0073.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0074.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0075.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0076.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0077.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0078.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0079.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0080.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0081.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0082.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0083.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0084.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0085.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0086.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0087.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0088.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0089.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0090.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0091.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0092.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0093.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0094.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0095.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0096.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0097.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0098.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0099.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0100.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0101.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0102.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0103.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0104.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0105.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0106.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0107.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0108.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0109.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0110.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0111.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0112.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0113.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0114.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0115.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0116.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0117.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0118.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0119.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0120.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0121.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0122.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0123.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0124.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0125.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0126.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0127.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0128.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0129.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0130.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0131.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0132.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0133.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0134.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0135.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0136.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0137.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0138.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0139.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0140.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0141.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0142.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0143.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0144.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0145.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0146.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0147.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0148.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0149.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0150.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0151.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0152.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0153.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0154.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0155.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0156.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0157.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0158.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0159.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0160.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0161.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0162.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0163.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0164.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0165.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0166.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0167.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0168.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0169.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0170.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0171.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0172.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0173.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0174.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0175.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0176.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0177.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0178.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0179.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0180.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0181.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0182.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0183.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0184.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0185.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0186.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0187.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0188.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0189.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0190.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0191.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0192.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0193.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0194.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0195.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0196.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0197.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0198.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0199.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0200.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0201.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0202.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0203.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0204.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0205.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0206.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0207.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0208.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0209.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0210.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0211.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0212.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0213.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0214.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0215.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0216.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0217.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0218.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0219.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0220.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0221.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0222.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0223.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0224.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0225.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0226.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0227.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0228.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0229.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0230.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0231.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0232.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0233.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0234.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0235.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0236.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0237.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0238.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0239.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0240.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0241.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0242.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0243.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0244.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0245.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0246.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0247.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0248.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0249.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0250.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0251.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0252.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0253.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0254.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0255.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0256.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0257.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0258.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0259.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0260.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0261.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0262.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0263.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0264.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0265.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0266.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0267.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0268.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0269.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0270.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0271.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0272.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0273.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0274.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0275.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0276.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0277.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0278.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0279.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0280.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0281.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0282.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0283.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0284.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0285.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0286.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0287.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0288.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0289.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0290.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0291.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0292.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0293.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0294.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0295.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0296.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0297.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0298.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0299.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0300.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0301.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0302.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0303.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0304.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0305.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0306.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0307.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0308.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0309.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0310.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0311.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0312.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0313.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0314.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0315.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0316.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0317.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0318.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0319.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0320.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0321.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0322.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0323.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0324.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0325.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0326.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0327.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0328.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0329.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0330.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0331.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0332.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0333.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0334.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0335.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0336.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0337.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0338.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0339.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0340.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0341.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0342.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0343.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0344.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0345.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0346.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0347.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0348.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0349.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0350.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0351.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0352.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0353.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0354.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0355.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0356.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0357.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0358.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0359.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0360.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0361.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0362.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0363.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0364.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0365.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0366.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0367.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0368.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0369.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0370.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0371.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0372.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0373.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0374.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0375.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0376.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0377.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0378.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0379.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0380.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0381.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0382.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0383.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0384.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0385.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0386.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0387.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0388.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0389.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0390.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0391.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0392.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0393.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0394.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0395.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0396.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0397.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0398.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0399.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0400.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0401.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0402.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0403.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0404.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0405.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0406.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0407.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0408.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0409.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0410.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0411.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0412.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0413.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0414.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0415.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0416.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0417.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0418.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0419.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0420.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0421.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0422.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0423.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0424.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0425.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0426.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0427.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0428.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0429.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0430.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0431.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0432.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0433.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0434.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0435.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0436.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0437.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0438.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0439.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0440.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0441.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0442.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0443.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0444.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0445.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0446.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0447.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0448.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0449.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0450.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0451.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0452.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0453.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0454.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0455.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0456.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0457.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0458.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0459.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0460.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0461.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0462.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0463.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0464.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0465.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0466.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0467.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0468.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0469.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0470.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0471.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0472.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0473.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0474.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0475.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0476.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0477.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0478.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0479.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0480.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0481.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0482.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0483.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0484.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0485.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0486.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0487.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0488.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0489.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0490.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0491.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0492.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0493.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0494.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0495.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0496.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0497.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0498.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0499.smt2 | 39 +++++++++++++ .../20250403-rna/rna-sat/benchmark_0500.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0001.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0002.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0003.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0004.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0005.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0006.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0007.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0008.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0009.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0010.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0011.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0012.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0013.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0014.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0015.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0016.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0017.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0018.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0019.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0020.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0021.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0022.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0023.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0024.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0025.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0026.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0027.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0028.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0029.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0030.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0031.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0032.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0033.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0034.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0035.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0036.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0037.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0038.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0039.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0040.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0041.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0042.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0043.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0044.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0045.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0046.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0047.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0048.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0049.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0050.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0051.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0052.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0053.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0054.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0055.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0056.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0057.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0058.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0059.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0060.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0061.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0062.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0063.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0064.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0065.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0066.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0067.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0068.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0069.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0070.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0071.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0072.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0073.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0074.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0075.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0076.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0077.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0078.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0079.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0080.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0081.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0082.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0083.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0084.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0085.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0086.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0087.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0088.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0089.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0090.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0091.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0092.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0093.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0094.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0095.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0096.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0097.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0098.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0099.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0100.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0101.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0102.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0103.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0104.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0105.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0106.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0107.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0108.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0109.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0110.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0111.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0112.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0113.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0114.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0115.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0116.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0117.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0118.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0119.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0120.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0121.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0122.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0123.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0124.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0125.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0126.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0127.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0128.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0129.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0130.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0131.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0132.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0133.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0134.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0135.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0136.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0137.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0138.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0139.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0140.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0141.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0142.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0143.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0144.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0145.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0146.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0147.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0148.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0149.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0150.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0151.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0152.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0153.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0154.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0155.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0156.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0157.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0158.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0159.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0160.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0161.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0162.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0163.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0164.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0165.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0166.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0167.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0168.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0169.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0170.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0171.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0172.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0173.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0174.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0175.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0176.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0177.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0178.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0179.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0180.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0181.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0182.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0183.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0184.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0185.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0186.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0187.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0188.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0189.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0190.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0191.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0192.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0193.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0194.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0195.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0196.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0197.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0198.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0199.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0200.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0201.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0202.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0203.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0204.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0205.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0206.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0207.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0208.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0209.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0210.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0211.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0212.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0213.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0214.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0215.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0216.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0217.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0218.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0219.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0220.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0221.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0222.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0223.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0224.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0225.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0226.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0227.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0228.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0229.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0230.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0231.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0232.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0233.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0234.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0235.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0236.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0237.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0238.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0239.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0240.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0241.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0242.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0243.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0244.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0245.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0246.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0247.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0248.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0249.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0250.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0251.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0252.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0253.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0254.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0255.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0256.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0257.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0258.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0259.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0260.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0261.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0262.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0263.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0264.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0265.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0266.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0267.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0268.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0269.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0270.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0271.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0272.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0273.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0274.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0275.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0276.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0277.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0278.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0279.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0280.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0281.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0282.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0283.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0284.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0285.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0286.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0287.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0288.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0289.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0290.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0291.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0292.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0293.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0294.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0295.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0296.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0297.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0298.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0299.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0300.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0301.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0302.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0303.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0304.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0305.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0306.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0307.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0308.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0309.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0310.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0311.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0312.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0313.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0314.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0315.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0316.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0317.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0318.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0319.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0320.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0321.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0322.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0323.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0324.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0325.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0326.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0327.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0328.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0329.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0330.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0331.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0332.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0333.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0334.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0335.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0336.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0337.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0338.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0339.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0340.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0341.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0342.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0343.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0344.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0345.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0346.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0347.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0348.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0349.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0350.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0351.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0352.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0353.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0354.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0355.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0356.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0357.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0358.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0359.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0360.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0361.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0362.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0363.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0364.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0365.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0366.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0367.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0368.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0369.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0370.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0371.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0372.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0373.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0374.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0375.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0376.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0377.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0378.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0379.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0380.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0381.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0382.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0383.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0384.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0385.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0386.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0387.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0388.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0389.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0390.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0391.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0392.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0393.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0394.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0395.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0396.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0397.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0398.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0399.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0400.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0401.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0402.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0403.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0404.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0405.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0406.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0407.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0408.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0409.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0410.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0411.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0412.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0413.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0414.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0415.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0416.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0417.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0418.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0419.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0420.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0421.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0422.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0423.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0424.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0425.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0426.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0427.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0428.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0429.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0430.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0431.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0432.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0433.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0434.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0435.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0436.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0437.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0438.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0439.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0440.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0441.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0442.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0443.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0444.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0445.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0446.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0447.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0448.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0449.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0450.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0451.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0452.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0453.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0454.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0455.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0456.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0457.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0458.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0459.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0460.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0461.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0462.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0463.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0464.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0465.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0466.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0467.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0468.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0469.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0470.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0471.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0472.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0473.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0474.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0475.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0476.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0477.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0478.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0479.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0480.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0481.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0482.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0483.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0484.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0485.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0486.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0487.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0488.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0489.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0490.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0491.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0492.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0493.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0494.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0495.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0496.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0497.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0498.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0499.smt2 | 39 +++++++++++++ .../rna-unsat/benchmark_0500.smt2 | 39 +++++++++++++ 6170 files changed, 40000 insertions(+), 218690 deletions(-) delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 delete mode 100644 non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_0.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_1.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_10.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_100.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_101.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_102.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_103.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_104.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_105.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_106.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_107.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_108.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_109.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_11.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_110.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_111.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_112.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_113.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_114.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_115.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_116.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_117.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_118.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_119.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_12.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_120.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_121.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_122.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_123.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_124.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_125.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_126.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_127.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_128.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_129.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_13.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_130.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_131.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_132.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_133.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_134.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_135.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_136.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_137.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_138.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_139.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_14.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_140.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_141.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_142.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_143.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_144.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_145.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_146.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_147.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_148.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_149.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_15.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_150.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_151.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_152.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_153.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_154.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_155.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_156.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_157.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_158.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_159.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_16.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_160.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_161.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_162.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_163.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_164.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_165.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_166.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_167.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_168.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_169.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_17.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_170.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_171.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_172.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_173.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_174.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_175.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_176.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_177.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_178.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_179.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_18.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_180.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_181.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_182.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_183.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_184.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_185.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_186.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_187.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_188.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_189.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_19.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_190.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_191.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_192.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_193.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_194.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_195.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_196.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_197.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_198.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_199.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_2.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_20.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_200.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_201.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_202.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_203.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_204.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_205.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_206.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_207.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_208.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_209.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_21.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_210.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_211.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_212.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_213.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_214.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_215.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_216.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_217.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_218.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_219.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_22.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_220.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_221.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_222.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_223.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_224.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_225.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_226.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_227.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_228.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_229.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_23.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_230.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_231.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_232.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_233.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_234.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_235.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_236.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_237.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_238.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_239.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_24.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_240.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_241.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_242.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_243.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_244.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_245.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_246.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_247.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_248.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_249.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_25.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_250.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_251.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_252.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_253.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_254.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_255.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_256.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_257.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_258.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_259.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_26.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_260.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_261.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_262.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_263.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_264.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_265.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_266.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_267.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_268.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_269.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_27.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_270.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_271.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_272.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_273.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_274.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_275.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_276.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_277.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_278.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_279.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_28.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_280.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_281.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_282.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_283.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_284.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_285.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_286.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_287.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_288.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_289.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_29.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_290.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_291.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_292.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_293.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_294.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_295.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_296.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_297.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_298.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_299.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_3.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_30.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_300.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_301.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_302.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_303.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_304.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_305.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_306.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_307.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_308.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_309.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_31.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_310.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_311.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_312.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_313.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_314.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_315.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_316.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_317.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_318.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_319.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_32.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_320.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_321.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_322.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_323.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_324.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_325.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_326.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_327.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_328.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_329.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_33.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_330.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_331.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_332.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_333.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_334.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_335.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_336.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_337.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_338.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_339.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_34.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_340.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_341.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_342.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_343.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_344.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_345.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_346.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_347.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_348.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_349.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_35.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_350.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_351.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_352.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_353.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_354.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_355.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_356.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_357.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_358.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_359.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_36.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_360.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_361.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_362.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_363.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_364.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_365.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_366.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_367.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_368.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_369.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_37.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_370.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_371.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_372.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_373.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_374.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_375.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_376.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_377.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_378.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_379.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_38.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_380.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_381.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_382.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_383.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_384.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_385.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_386.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_387.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_388.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_389.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_39.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_390.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_391.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_392.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_393.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_394.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_395.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_396.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_397.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_398.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_399.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_4.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_40.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_400.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_401.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_402.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_403.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_404.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_405.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_406.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_407.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_408.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_409.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_41.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_410.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_411.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_412.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_413.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_414.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_415.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_416.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_417.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_418.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_419.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_42.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_420.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_421.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_422.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_423.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_424.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_425.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_426.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_427.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_428.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_429.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_43.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_430.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_431.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_432.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_433.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_434.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_435.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_436.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_437.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_438.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_439.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_44.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_440.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_441.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_442.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_443.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_444.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_445.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_446.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_447.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_448.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_449.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_45.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_450.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_451.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_452.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_453.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_454.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_455.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_456.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_457.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_458.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_459.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_46.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_460.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_461.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_462.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_463.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_464.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_465.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_466.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_467.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_468.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_469.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_47.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_470.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_471.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_472.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_473.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_474.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_475.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_476.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_477.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_478.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_479.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_48.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_480.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_481.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_482.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_483.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_484.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_485.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_486.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_487.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_488.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_489.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_49.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_490.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_491.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_492.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_493.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_494.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_495.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_496.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_497.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_498.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_499.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_5.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_50.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_51.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_52.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_53.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_54.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_55.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_56.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_57.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_58.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_59.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_6.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_60.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_61.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_62.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_63.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_64.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_65.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_66.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_67.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_68.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_69.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_7.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_70.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_71.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_72.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_73.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_74.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_75.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_76.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_77.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_78.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_79.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_8.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_80.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_81.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_82.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_83.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_84.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_85.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_86.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_87.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_88.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_89.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_9.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_90.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_91.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_92.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_93.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_94.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_95.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_96.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_97.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_98.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-3-random => 20250403-pcp-string/pcp-3-3-random}/pcp_instance_99.smt2 (97%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_0.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_1.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_10.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_100.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_101.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_102.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_103.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_104.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_105.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_106.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_107.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_108.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_109.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_11.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_110.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_111.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_112.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_113.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_114.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_115.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_116.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_117.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_118.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_119.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_12.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_120.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_121.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_122.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_123.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_124.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_125.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_126.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_127.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_128.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_129.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_13.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_130.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_131.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_132.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_133.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_134.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_135.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_136.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_137.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_138.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_139.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_14.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_140.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_141.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_142.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_143.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_144.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_145.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_146.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_147.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_148.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_149.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_15.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_150.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_151.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_152.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_153.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_154.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_155.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_156.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_157.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_158.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_159.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_16.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_160.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_161.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_162.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_163.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_164.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_165.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_166.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_167.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_168.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_169.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_17.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_170.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_171.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_172.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_173.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_174.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_175.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_176.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_177.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_178.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_179.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_18.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_180.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_181.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_182.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_183.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_184.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_185.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_186.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_187.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_188.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_189.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_19.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_190.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_191.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_192.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_193.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_194.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_195.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_196.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_197.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_198.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_199.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_2.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_20.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_200.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_201.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_202.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_203.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_204.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_205.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_206.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_207.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_208.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_209.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_21.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_210.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_211.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_212.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_213.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_214.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_215.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_216.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_217.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_218.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_219.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_22.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_220.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_221.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_222.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_223.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_224.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_225.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_226.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_227.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_228.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_229.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_23.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_230.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_231.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_232.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_233.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_234.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_235.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_236.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_237.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_238.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_239.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_24.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_240.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_241.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_242.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_243.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_244.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_245.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_246.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_247.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_248.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_249.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_25.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_250.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_251.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_252.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_253.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_254.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_255.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_256.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_257.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_258.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_259.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_26.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_260.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_261.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_262.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_263.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_264.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_265.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_266.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_267.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_268.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_269.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_27.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_270.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_271.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_272.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_273.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_274.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_275.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_276.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_277.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_278.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_279.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_28.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_280.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_281.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_282.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_283.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_284.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_285.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_286.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_287.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_288.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_289.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_29.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_290.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_291.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_292.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_293.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_294.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_295.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_296.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_297.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_298.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_299.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_3.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_30.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_300.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_301.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_302.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_303.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_304.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_305.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_306.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_307.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_308.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_309.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_31.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_310.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_311.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_312.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_313.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_314.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_315.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_316.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_317.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_318.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_319.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_32.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_320.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_321.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_322.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_323.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_324.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_325.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_326.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_327.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_328.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_329.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_33.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_330.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_331.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_332.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_333.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_334.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_335.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_336.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_337.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_338.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_339.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_34.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_340.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_341.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_342.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_343.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_344.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_345.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_346.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_347.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_348.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_349.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_35.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_350.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_351.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_352.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_353.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_354.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_355.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_356.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_357.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_358.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_359.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_36.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_360.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_361.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_362.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_363.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_364.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_365.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_366.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_367.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_368.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_369.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_37.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_370.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_371.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_372.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_373.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_374.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_375.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_376.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_377.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_378.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_379.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_38.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_380.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_381.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_382.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_383.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_384.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_385.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_386.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_387.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_388.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_389.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_39.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_390.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_391.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_392.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_393.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_394.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_395.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_396.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_397.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_398.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_399.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_4.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_40.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_400.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_401.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_402.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_403.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_404.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_405.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_406.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_407.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_408.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_409.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_41.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_410.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_411.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_412.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_413.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_414.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_415.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_416.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_417.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_418.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_419.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_42.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_420.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_421.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_422.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_423.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_424.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_425.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_426.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_427.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_428.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_429.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_43.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_430.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_431.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_432.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_433.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_434.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_435.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_436.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_437.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_438.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_439.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_44.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_440.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_441.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_442.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_443.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_444.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_445.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_446.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_447.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_448.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_449.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_45.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_450.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_451.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_452.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_453.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_454.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_455.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_456.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_457.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_458.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_459.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_46.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_460.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_461.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_462.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_463.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_464.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_465.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_466.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_467.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_468.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_469.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_47.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_470.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_471.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_472.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_473.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_474.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_475.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_476.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_477.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_478.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_479.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_48.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_480.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_481.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_482.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_483.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_484.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_485.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_486.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_487.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_488.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_489.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_49.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_490.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_491.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_492.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_493.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_494.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_495.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_496.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_497.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_498.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_499.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_5.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_50.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_51.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_52.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_53.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_54.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_55.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_56.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_57.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_58.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_59.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_6.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_60.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_61.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_62.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_63.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_64.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_65.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_66.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_67.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_68.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_69.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_7.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_70.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_71.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_72.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_73.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_74.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_75.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_76.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_77.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_78.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_79.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_8.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_80.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_81.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_82.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_83.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_84.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_85.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_86.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_87.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_88.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_89.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_9.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_90.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_91.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_92.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_93.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_94.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_95.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_96.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_97.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_98.smt2 (98%) rename non-incremental/QF_S/{20250403-pcp-3-4-hard => 20250403-pcp-string/pcp-3-4-hard}/unsolved_pcp_instance_99.smt2 (98%) delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 delete mode 100644 non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0002.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0003.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0004.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0005.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0006.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0007.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0008.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0009.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0010.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0011.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0012.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0013.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0014.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0015.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0016.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0017.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0018.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0019.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0020.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0021.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0022.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0023.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0024.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0025.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0026.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0027.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0028.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0029.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0030.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0031.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0032.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0033.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0034.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0035.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0036.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0037.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0038.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0039.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0040.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0041.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0042.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0043.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0044.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0045.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0046.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0047.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0048.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0049.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0050.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0051.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0052.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0053.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0054.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0055.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0056.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0057.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0058.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0059.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0060.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0061.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0062.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0063.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0064.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0065.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0066.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0067.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0068.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0069.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0070.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0071.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0072.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0073.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0074.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0075.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0076.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0077.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0078.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0079.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0080.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0081.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0082.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0083.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0084.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0085.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0086.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0087.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0088.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0089.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0090.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0091.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0092.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0093.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0094.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0096.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0097.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0098.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0099.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0100.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0101.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0102.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0103.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0104.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0105.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0106.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0107.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0108.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0109.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0110.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0111.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0112.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0113.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0114.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0115.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0116.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0117.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0118.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0119.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0120.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0121.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0122.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0123.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0124.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0125.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0126.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0127.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0128.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0129.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0130.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0131.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0132.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0133.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0134.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0135.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0136.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0137.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0138.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0139.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0140.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0141.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0142.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0143.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0144.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0145.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0146.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0147.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0148.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0149.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0150.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0151.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0152.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0153.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0154.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0155.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0156.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0157.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0158.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0159.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0160.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0161.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0162.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0163.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0164.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0165.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0166.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0167.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0168.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0169.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0170.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0171.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0172.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0173.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0174.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0175.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0176.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0177.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0178.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0179.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0180.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0181.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0182.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0183.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0184.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0185.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0186.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0187.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0188.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0189.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0190.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0191.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0192.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0193.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0194.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0195.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0196.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0197.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0198.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0199.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0200.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0201.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0202.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0203.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0204.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0205.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0206.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0207.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0208.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0209.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0210.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0211.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0212.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0213.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0214.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0215.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0216.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0217.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0218.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0219.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0220.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0221.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0222.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0223.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0224.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0225.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0226.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0227.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0228.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0229.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0230.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0231.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0232.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0233.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0234.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0235.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0236.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0237.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0238.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0239.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0240.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0241.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0242.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0243.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0244.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0245.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0246.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0247.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0248.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0249.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0250.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0251.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0252.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0253.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0254.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0255.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0256.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0257.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0258.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0259.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0260.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0261.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0262.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0263.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0264.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0265.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0266.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0267.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0268.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0269.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0270.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0271.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0272.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0273.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0274.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0275.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0276.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0277.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0278.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0279.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0280.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0281.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0282.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0283.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0284.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0285.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0286.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0287.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0288.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0289.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0290.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0291.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0292.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0293.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0294.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0295.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0296.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0297.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0298.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0299.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0300.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0301.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0302.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0303.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0304.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0305.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0306.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0307.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0308.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0309.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0310.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0311.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0312.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0313.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0314.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0315.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0316.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0317.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0318.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0319.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0320.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0321.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0322.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0323.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0324.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0325.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0326.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0327.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0328.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0329.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0330.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0331.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0332.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0333.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0334.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0335.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0336.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0337.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0338.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0339.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0340.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0341.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0342.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0343.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0344.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0345.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0346.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0347.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0348.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0349.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0350.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0351.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0352.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0353.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0354.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0355.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0356.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0357.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0358.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0359.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0360.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0361.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0362.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0363.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0364.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0365.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0366.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0367.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0368.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0369.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0370.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0371.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0372.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0373.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0374.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0375.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0376.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0377.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0378.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0379.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0380.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0381.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0382.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0383.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0384.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0385.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0386.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0387.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0388.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0389.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0390.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0391.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0392.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0393.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0394.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0395.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0396.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0397.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0398.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0399.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0400.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0401.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0402.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0403.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0404.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0405.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0406.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0407.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0408.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0409.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0410.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0411.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0412.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0413.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0414.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0415.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0417.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0418.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0419.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0420.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0421.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0422.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0423.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0424.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0425.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0426.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0427.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0428.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0429.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0430.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0431.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0432.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0433.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0434.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0435.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0436.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0437.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0438.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0439.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0440.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0441.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0442.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0443.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0444.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0445.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0446.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0447.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0448.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0449.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0450.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0451.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0452.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0453.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0454.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0455.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0456.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0457.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0458.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0459.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0460.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0461.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0462.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0463.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0464.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0465.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0466.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0467.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0468.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0469.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0470.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0471.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0472.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0473.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0474.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0475.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0476.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0477.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0478.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0479.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0480.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0481.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0482.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0483.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0484.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0485.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0486.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0487.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0488.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0489.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0490.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0491.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0492.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0493.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0494.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0495.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0496.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0497.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0498.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0499.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0500.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0001.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0002.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0003.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0004.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0005.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0006.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0007.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0008.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0009.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0010.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0011.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0012.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0013.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0014.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0015.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0016.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0017.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0018.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0019.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0020.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0021.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0022.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0023.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0024.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0025.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0026.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0027.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0028.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0029.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0030.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0031.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0032.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0033.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0034.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0035.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0036.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0037.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0038.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0039.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0040.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0041.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0042.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0043.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0044.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0045.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0046.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0047.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0048.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0049.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0050.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0051.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0052.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0053.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0054.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0055.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0056.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0057.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0058.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0059.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0060.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0061.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0062.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0063.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0064.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0065.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0066.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0067.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0068.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0069.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0070.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0071.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0072.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0073.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0074.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0075.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0076.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0077.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0078.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0079.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0080.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0081.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0082.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0083.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0084.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0085.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0086.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0087.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0088.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0089.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0090.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0091.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0092.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0093.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0094.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0095.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0096.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0097.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0098.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0099.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0100.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0101.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0102.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0103.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0104.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0105.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0106.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0107.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0108.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0109.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0110.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0111.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0112.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0113.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0114.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0115.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0116.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0117.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0118.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0119.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0120.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0121.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0122.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0123.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0124.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0125.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0126.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0127.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0128.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0129.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0130.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0131.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0132.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0133.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0134.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0135.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0136.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0137.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0138.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0139.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0140.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0141.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0142.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0143.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0144.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0145.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0146.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0147.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0148.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0149.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0150.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0151.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0152.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0153.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0154.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0155.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0156.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0157.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0158.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0159.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0160.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0161.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0162.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0163.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0165.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0166.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0167.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0168.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0169.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0170.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0171.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0172.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0173.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0174.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0175.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0176.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0177.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0178.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0179.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0180.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0181.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0182.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0183.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0184.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0185.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0186.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0187.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0188.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0189.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0190.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0191.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0192.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0193.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0194.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0195.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0196.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0197.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0198.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0199.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0200.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0201.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0202.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0203.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0204.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0205.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0206.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0207.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0208.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0209.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0210.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0211.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0212.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0213.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0214.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0215.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0216.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0217.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0218.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0219.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0220.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0221.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0222.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0223.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0224.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0225.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0226.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0227.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0228.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0229.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0230.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0231.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0232.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0233.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0234.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0235.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0236.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0237.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0238.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0239.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0240.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0241.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0242.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0243.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0244.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0245.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0246.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0247.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0248.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0249.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0250.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0251.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0252.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0253.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0254.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0255.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0256.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0257.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0258.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0259.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0260.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0261.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0262.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0263.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0264.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0265.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0266.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0267.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0268.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0269.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0270.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0271.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0272.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0273.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0274.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0275.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0276.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0277.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0278.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0279.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0280.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0281.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0282.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0283.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0284.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0285.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0286.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0287.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0288.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0289.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0290.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0291.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0292.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0293.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0294.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0295.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0296.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0297.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0298.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0299.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0300.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0301.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0302.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0303.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0304.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0305.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0306.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0307.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0308.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0309.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0310.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0311.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0312.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0313.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0314.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0315.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0316.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0317.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0318.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0319.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0320.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0321.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0323.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0324.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0325.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0326.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0327.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0328.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0329.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0330.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0331.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0332.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0333.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0334.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0335.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0336.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0337.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0338.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0339.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0340.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0341.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0342.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0343.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0344.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0345.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0346.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0347.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0348.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0349.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0350.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0351.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0352.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0353.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0354.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0355.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0356.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0357.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0358.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0359.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0360.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0361.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0362.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0363.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0364.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0365.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0366.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0367.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0368.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0369.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0370.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0371.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0372.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0373.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0374.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0375.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0376.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0377.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0378.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0379.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0380.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0381.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0382.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0383.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0384.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0385.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0386.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0387.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0388.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0389.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0390.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0391.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0392.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0393.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0394.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0395.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0396.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0397.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0398.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0399.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0400.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0401.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0402.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0403.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0404.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0405.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0406.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0407.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0408.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0409.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0410.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0411.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0412.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0413.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0414.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0415.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0416.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0417.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0418.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0419.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0420.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0421.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0422.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0423.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0424.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0425.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0426.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0427.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0428.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0429.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0430.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0431.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0432.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0433.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0434.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0435.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0436.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0437.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0438.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0439.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0440.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0441.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0442.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0443.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0444.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0445.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0446.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0447.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0448.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0449.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0450.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0451.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0452.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0453.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0454.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0455.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0456.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0457.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0458.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0459.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0460.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0461.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0462.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0463.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0464.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0465.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0466.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0467.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0468.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0469.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0470.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0471.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0472.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0473.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0474.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0475.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0476.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0477.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0478.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0479.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0480.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0481.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0482.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0483.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0484.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0485.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0486.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0487.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0488.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0489.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0490.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0491.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0492.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0493.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0494.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0495.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0496.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0497.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0498.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0499.smt2 create mode 100644 non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0500.smt2 diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 deleted file mode 100644 index d06b8c241..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_500.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 deleted file mode 100644 index 3d1753d75..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_501.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 deleted file mode 100644 index 1774a4e97..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_502.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 deleted file mode 100644 index 8d52629e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_503.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 deleted file mode 100644 index c2b9cdade..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_504.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 deleted file mode 100644 index 979f93232..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_505.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 deleted file mode 100644 index 7064b1d72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_506.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 deleted file mode 100644 index 27910081c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_507.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 deleted file mode 100644 index 99df2b42e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_508.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 deleted file mode 100644 index a13320360..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_509.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 deleted file mode 100644 index 70f6bd091..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_510.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 deleted file mode 100644 index ad56a9d64..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_511.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 deleted file mode 100644 index 23ed9d4b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_512.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 deleted file mode 100644 index 87a9521ed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_513.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 deleted file mode 100644 index 857498f62..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_514.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 deleted file mode 100644 index b186b19bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_515.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 deleted file mode 100644 index f109e9fc8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_516.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 deleted file mode 100644 index 11c355837..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_517.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 deleted file mode 100644 index c1b924e3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_518.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 deleted file mode 100644 index 0f6c0e769..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_519.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 deleted file mode 100644 index 74bf9aeec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_520.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 deleted file mode 100644 index f78553784..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_521.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 deleted file mode 100644 index e763fbf53..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_522.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 deleted file mode 100644 index 67ecf5802..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_523.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 deleted file mode 100644 index c96708115..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_524.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 deleted file mode 100644 index 0a8f8d070..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_525.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 deleted file mode 100644 index 813a16fac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_526.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 deleted file mode 100644 index eee6fe449..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_527.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 deleted file mode 100644 index b260b4b85..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_528.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 deleted file mode 100644 index 5407795f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_529.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 deleted file mode 100644 index 22797f13e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_530.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 deleted file mode 100644 index 39c450d65..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_531.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 deleted file mode 100644 index 58c86cbc6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_532.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 deleted file mode 100644 index cc550a57f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_533.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 deleted file mode 100644 index f9c8d4d10..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_534.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 deleted file mode 100644 index 0efce6a12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_535.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 deleted file mode 100644 index f3776c4c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_536.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 deleted file mode 100644 index 46d6f9683..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_537.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 deleted file mode 100644 index 3b3dc83f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_538.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 deleted file mode 100644 index c041c1b83..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_539.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 deleted file mode 100644 index 84e91ba0c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_540.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 deleted file mode 100644 index 6bc19df3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_541.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 deleted file mode 100644 index 93661fb80..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_542.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 deleted file mode 100644 index a7395211c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_543.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 deleted file mode 100644 index 5295aef33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_544.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 deleted file mode 100644 index b27aea512..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_545.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 deleted file mode 100644 index 7488571c2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_546.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 deleted file mode 100644 index f69d5ba33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_547.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 deleted file mode 100644 index 0d2031f08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_548.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 deleted file mode 100644 index a0abbc2b4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_549.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 deleted file mode 100644 index 5fda56591..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_550.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 deleted file mode 100644 index 333b0b641..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_551.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 deleted file mode 100644 index 710c8a555..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_552.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 deleted file mode 100644 index 723932be9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_553.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 deleted file mode 100644 index 5e7f8e239..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_554.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 deleted file mode 100644 index 25b1f5a5a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_555.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 deleted file mode 100644 index 96374228f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_556.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 deleted file mode 100644 index ce6742b52..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_557.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 deleted file mode 100644 index 1fc1edbf5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_558.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 deleted file mode 100644 index 0eb361a39..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_559.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 deleted file mode 100644 index 498bd5d43..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_560.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 deleted file mode 100644 index 155830075..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_561.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 deleted file mode 100644 index fe7e79139..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_562.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 deleted file mode 100644 index 2267ec032..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_563.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 deleted file mode 100644 index 1872b6f48..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_564.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 deleted file mode 100644 index b349de91e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_565.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 deleted file mode 100644 index 75a75c3ea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_566.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 deleted file mode 100644 index 93c2b10a1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_567.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 deleted file mode 100644 index 40fa21294..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_568.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 deleted file mode 100644 index 60b85cdac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_569.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 deleted file mode 100644 index 655a073dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_570.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 deleted file mode 100644 index bb8bdfad4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_571.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 deleted file mode 100644 index d5224bf07..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_572.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 deleted file mode 100644 index b0ea64a0b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_573.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 deleted file mode 100644 index 37a8bcbd9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_574.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 deleted file mode 100644 index a662f8fc8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_575.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 deleted file mode 100644 index b1ee0aa92..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_576.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 deleted file mode 100644 index 5c9a5da11..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_577.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 deleted file mode 100644 index 3523a059c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_578.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 deleted file mode 100644 index 5314c1fcf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_579.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 deleted file mode 100644 index 53486c226..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_580.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 deleted file mode 100644 index 370722e1e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_581.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 deleted file mode 100644 index 7faff6230..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_582.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 deleted file mode 100644 index 459eb1054..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_583.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 deleted file mode 100644 index 6336d6f32..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_584.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 deleted file mode 100644 index 0195a2c7b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_585.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 deleted file mode 100644 index 039d8163e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_586.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 deleted file mode 100644 index 6b8ac1a6b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_587.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 deleted file mode 100644 index 77b0c1e7c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_588.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 deleted file mode 100644 index 25aa804ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_589.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 deleted file mode 100644 index 148b4fcc8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_590.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 deleted file mode 100644 index 01e8bb1ec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_591.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 deleted file mode 100644 index 50273ee23..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_592.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 deleted file mode 100644 index dde240952..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_593.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 deleted file mode 100644 index b5ecf4d3b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_594.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 deleted file mode 100644 index 74ba43369..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_595.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 deleted file mode 100644 index e7244bcee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_596.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 deleted file mode 100644 index eadd68d4f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_597.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 deleted file mode 100644 index 2941998b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_598.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 deleted file mode 100644 index 63947f9d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_599.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 deleted file mode 100644 index dbf56fadf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_600.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 deleted file mode 100644 index a5d2af586..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_601.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 deleted file mode 100644 index 8c0737e68..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_602.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 deleted file mode 100644 index d7ec7a4ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_603.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 deleted file mode 100644 index a05acbeff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_604.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 deleted file mode 100644 index e7e5c1b30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_605.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 deleted file mode 100644 index 24ac15ad9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_606.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 deleted file mode 100644 index 1cb874ae2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_607.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 deleted file mode 100644 index e489dcfb5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_608.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 deleted file mode 100644 index 00024d670..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_609.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 deleted file mode 100644 index 9ac4e29ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_610.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 deleted file mode 100644 index a09b3fb2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_611.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 deleted file mode 100644 index e380536dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_612.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 deleted file mode 100644 index e94ca6ed8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_613.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 deleted file mode 100644 index bf5ac75cf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_614.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 deleted file mode 100644 index 33d1d6276..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_615.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 deleted file mode 100644 index 103bb8a08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_616.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 deleted file mode 100644 index df83410c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_617.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 deleted file mode 100644 index 7c94d6976..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_618.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 deleted file mode 100644 index 72c42d0f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_619.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 deleted file mode 100644 index 02dc7406c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_620.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 deleted file mode 100644 index 191a8aaed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_621.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 deleted file mode 100644 index 9d76cb53c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_622.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 deleted file mode 100644 index 89da5d317..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_623.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 deleted file mode 100644 index 713a94371..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_624.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 deleted file mode 100644 index 66d2f3704..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_625.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 deleted file mode 100644 index b75e8d749..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_626.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 deleted file mode 100644 index 61bb999b0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_627.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 deleted file mode 100644 index 0d134a1e7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_628.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 deleted file mode 100644 index 7f79628da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_629.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 deleted file mode 100644 index 32604832f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_630.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 deleted file mode 100644 index 720a98c73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_631.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 deleted file mode 100644 index caff200bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_632.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 deleted file mode 100644 index 262058f73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_633.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 deleted file mode 100644 index d05dbf293..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_634.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 deleted file mode 100644 index 650df40bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_635.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 deleted file mode 100644 index a5623ea42..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_636.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 deleted file mode 100644 index b2f05598c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_637.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 deleted file mode 100644 index c7525b613..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_638.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 deleted file mode 100644 index bab2109e5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_639.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 deleted file mode 100644 index 85f905b4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_640.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 deleted file mode 100644 index 5e1eccbf7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_641.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 deleted file mode 100644 index 3363822d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_642.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 deleted file mode 100644 index b210f4dea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_643.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 deleted file mode 100644 index 3a532d22f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_644.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 deleted file mode 100644 index 0f876d15f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_645.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 deleted file mode 100644 index 9e161b213..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_646.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 deleted file mode 100644 index 889843fed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_647.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 deleted file mode 100644 index 8d9b98923..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_648.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 deleted file mode 100644 index ee5f8a1ec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_649.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 deleted file mode 100644 index 5c6b3e266..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_650.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 deleted file mode 100644 index 28cc2923c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_651.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 deleted file mode 100644 index fe45d5726..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_652.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 deleted file mode 100644 index cc0a24fc4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_653.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 deleted file mode 100644 index 75c02eeb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_654.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 deleted file mode 100644 index fd9ff129f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_655.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 deleted file mode 100644 index 6014de730..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_656.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 deleted file mode 100644 index 2d05fd00d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_657.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 deleted file mode 100644 index 422f954e1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_658.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 deleted file mode 100644 index 73884e7e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_659.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 deleted file mode 100644 index 991191919..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_660.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 deleted file mode 100644 index f38cdbec8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_661.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 deleted file mode 100644 index 6e90a0920..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_662.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 deleted file mode 100644 index b703c010f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_663.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 deleted file mode 100644 index 77f93e989..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_664.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 deleted file mode 100644 index f264bd0bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_665.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 deleted file mode 100644 index 8df87a102..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_666.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 deleted file mode 100644 index 9d4e1f23f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_667.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 deleted file mode 100644 index 62fc26305..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_668.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 deleted file mode 100644 index d0c5aa827..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_669.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 deleted file mode 100644 index bc773903d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_670.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 deleted file mode 100644 index 3114c915c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_671.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 deleted file mode 100644 index 221dfeec4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_672.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 deleted file mode 100644 index de5c2c1ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_673.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 deleted file mode 100644 index a7d88711b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_674.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 deleted file mode 100644 index a6a08b912..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_675.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 deleted file mode 100644 index 6b9eb2ccc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_676.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 deleted file mode 100644 index bf3aec7f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_677.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 deleted file mode 100644 index 037a80e8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_678.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 deleted file mode 100644 index d3b8c8d3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_679.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 deleted file mode 100644 index 1e9aef65d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_680.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 deleted file mode 100644 index b25cb0c80..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_681.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 deleted file mode 100644 index 9918d4b33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_682.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 deleted file mode 100644 index 8d0d440f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_683.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 deleted file mode 100644 index 3dac1ed0d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_684.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 deleted file mode 100644 index f398dab00..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_685.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 deleted file mode 100644 index a03fe829d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_686.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 deleted file mode 100644 index f414b5fb6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_687.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 deleted file mode 100644 index b390d6b77..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_688.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 deleted file mode 100644 index e7175c755..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_689.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 deleted file mode 100644 index 23aaaebfc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_690.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 deleted file mode 100644 index a270baabf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_691.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 deleted file mode 100644 index b3654f695..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_692.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 deleted file mode 100644 index acad952be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_693.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 deleted file mode 100644 index b8279493b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_694.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 deleted file mode 100644 index 5fd7c190b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_695.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 deleted file mode 100644 index 478e01f9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_696.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 deleted file mode 100644 index 45b64ef84..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_697.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 deleted file mode 100644 index 9e3d60b78..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_698.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 deleted file mode 100644 index 3c24e1b08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_699.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 deleted file mode 100644 index 024d81dc1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_700.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 deleted file mode 100644 index e414cc654..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_701.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 deleted file mode 100644 index 9957225b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_702.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 deleted file mode 100644 index 96a900ca6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_703.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 deleted file mode 100644 index 9f3be373a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_704.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 deleted file mode 100644 index b0f257c0c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_705.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 deleted file mode 100644 index cddf2f605..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_706.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 deleted file mode 100644 index d56400343..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_707.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 deleted file mode 100644 index 6e690def4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_708.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 deleted file mode 100644 index 8c06355ee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_709.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 deleted file mode 100644 index 8be59ce55..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_710.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 deleted file mode 100644 index 60b8a4b60..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_711.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 deleted file mode 100644 index 175c5cafc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_712.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 deleted file mode 100644 index ee3a7167f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_713.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 deleted file mode 100644 index 2839cd336..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_714.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 deleted file mode 100644 index 29e180207..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_715.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 deleted file mode 100644 index 2d61213f6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_716.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 deleted file mode 100644 index e3b06b019..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_717.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 deleted file mode 100644 index cb21fda58..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_718.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 deleted file mode 100644 index c3b146fe1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_719.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 deleted file mode 100644 index 0cd38db83..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_720.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 deleted file mode 100644 index 08118a755..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_721.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 deleted file mode 100644 index 6bf0b2a49..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_722.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 deleted file mode 100644 index 7bd6d7e91..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_723.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 deleted file mode 100644 index 0f8d8dccf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_724.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 deleted file mode 100644 index 69a7eebbc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_725.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 deleted file mode 100644 index ec0724a16..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_726.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 deleted file mode 100644 index 882d8b511..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_727.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 deleted file mode 100644 index df768fb59..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_728.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 deleted file mode 100644 index b5c1cc23f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_729.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 deleted file mode 100644 index fce8eff8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_730.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 deleted file mode 100644 index c7bda0252..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_731.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 deleted file mode 100644 index 5cbdc5b5b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_732.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 deleted file mode 100644 index b5b6f5871..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_733.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 deleted file mode 100644 index 8620e0feb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_734.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 deleted file mode 100644 index 834b579b8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_735.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 deleted file mode 100644 index 7dc8ecf42..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_736.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 deleted file mode 100644 index 6ea149eef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_737.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 deleted file mode 100644 index 5342c044b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_738.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 deleted file mode 100644 index 46a9e6b36..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_739.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 deleted file mode 100644 index cc59cd5da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_740.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 deleted file mode 100644 index af4ebda58..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_741.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 deleted file mode 100644 index 17cc5345f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_742.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 deleted file mode 100644 index 33b007e09..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_743.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 deleted file mode 100644 index a2b4ca7fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_744.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 deleted file mode 100644 index 990a87852..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_745.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 deleted file mode 100644 index ef711297d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_746.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 deleted file mode 100644 index ec7f801b3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_747.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 deleted file mode 100644 index d5c907a37..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_748.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 deleted file mode 100644 index 647da47a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_749.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 deleted file mode 100644 index ac15800be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_750.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 deleted file mode 100644 index b06b2d79f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_751.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 deleted file mode 100644 index 763ccda67..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_752.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 deleted file mode 100644 index 5cca0bfd4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_753.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 deleted file mode 100644 index 5fc4ca319..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_754.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 deleted file mode 100644 index 003e3c2d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_755.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 deleted file mode 100644 index b3b2cc393..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_756.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 deleted file mode 100644 index dc492474c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_757.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 deleted file mode 100644 index 35445ed12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_758.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 deleted file mode 100644 index a095c7fe4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_759.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 deleted file mode 100644 index 74c920d30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_760.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 deleted file mode 100644 index 9b4264847..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_761.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 deleted file mode 100644 index 68165f322..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_762.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 deleted file mode 100644 index 77741be1c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_763.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 deleted file mode 100644 index 2a1e24ce5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_764.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 deleted file mode 100644 index 886ab8bba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_765.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 deleted file mode 100644 index b818d9ae5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_766.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 deleted file mode 100644 index 04347a105..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_767.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 deleted file mode 100644 index 941f065c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_768.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 deleted file mode 100644 index 4135c24a3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_769.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 deleted file mode 100644 index 249803687..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_770.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 deleted file mode 100644 index 62db0a00a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_771.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 deleted file mode 100644 index 78fd5c52b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_772.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 deleted file mode 100644 index 5fcd363c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_773.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 deleted file mode 100644 index d725e16cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_774.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 deleted file mode 100644 index c352e1413..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_775.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 deleted file mode 100644 index f7a1270cf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_776.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 deleted file mode 100644 index d4dd8f144..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_777.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 deleted file mode 100644 index 781b31593..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_778.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 deleted file mode 100644 index 474039508..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_779.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 deleted file mode 100644 index dcd5a848c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_780.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 deleted file mode 100644 index 55f6cc73f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_781.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 deleted file mode 100644 index 7438d87db..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_782.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 deleted file mode 100644 index a0b2d0b50..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_783.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 deleted file mode 100644 index 4cda319c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_784.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 deleted file mode 100644 index 3399cbc1a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_785.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 deleted file mode 100644 index 4bd5bf48f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_786.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 deleted file mode 100644 index 77823d510..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_787.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 deleted file mode 100644 index 2d8aef7a9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_788.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 deleted file mode 100644 index 2c7a27132..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_789.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 deleted file mode 100644 index 8738b9de2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_790.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 deleted file mode 100644 index 463c583f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_791.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 deleted file mode 100644 index e619c4db1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_792.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 deleted file mode 100644 index 1bb5cd824..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_793.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 deleted file mode 100644 index 1662be576..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_794.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 deleted file mode 100644 index 44a445b34..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_795.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 deleted file mode 100644 index 0a2c091b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_796.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 deleted file mode 100644 index 9ea3747c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_797.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 deleted file mode 100644 index 4aa180fd3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_798.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 deleted file mode 100644 index 5d5dbacd5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_799.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 deleted file mode 100644 index cacafb949..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_800.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 deleted file mode 100644 index c5f87e85c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_801.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 deleted file mode 100644 index e635c848a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_802.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 deleted file mode 100644 index b1e81a5a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_803.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 deleted file mode 100644 index 5c2571cbc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_804.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 deleted file mode 100644 index eaac29e72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_805.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 deleted file mode 100644 index cd3d93df1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_806.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 deleted file mode 100644 index 409ed2bb7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_807.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 deleted file mode 100644 index 717805b5a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_808.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 deleted file mode 100644 index 84354bee4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_809.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 deleted file mode 100644 index dbb915460..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_810.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 deleted file mode 100644 index c5891e1f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_811.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 deleted file mode 100644 index 58e985a9e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_812.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 deleted file mode 100644 index 61828bdbf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_813.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 deleted file mode 100644 index a32d0709b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_814.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 deleted file mode 100644 index 6fecf6e94..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_815.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 deleted file mode 100644 index 569b84814..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_816.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 deleted file mode 100644 index efa105fc9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_817.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 deleted file mode 100644 index 3d04f6659..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_818.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 deleted file mode 100644 index ccda6c5f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_819.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 deleted file mode 100644 index 7a6853a0b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_820.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 deleted file mode 100644 index f544d30a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_821.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 deleted file mode 100644 index ac90e9d3b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_822.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 deleted file mode 100644 index 1087b1188..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_823.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 deleted file mode 100644 index 8dccad886..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_824.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 deleted file mode 100644 index 2b512c370..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_825.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 deleted file mode 100644 index 3ac6b10b8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_826.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 deleted file mode 100644 index 057669d25..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_827.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 deleted file mode 100644 index d15b9e783..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_828.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 deleted file mode 100644 index e7314eade..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_829.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 deleted file mode 100644 index a8648e412..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_830.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 deleted file mode 100644 index 5555fe60f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_831.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 deleted file mode 100644 index 170c54737..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_832.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 deleted file mode 100644 index 1337c091d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_833.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 deleted file mode 100644 index 6f174767b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_834.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 deleted file mode 100644 index 8a2e04e66..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_835.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 deleted file mode 100644 index d5d9d92b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_836.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 deleted file mode 100644 index 9e47c241b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_837.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 deleted file mode 100644 index 235f332b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_838.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 deleted file mode 100644 index 6449bf027..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_839.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 deleted file mode 100644 index 212abee91..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_840.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 deleted file mode 100644 index 9f7ab1362..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_841.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 deleted file mode 100644 index e94425d0e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_842.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 deleted file mode 100644 index 052ebec56..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_843.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 deleted file mode 100644 index 747f78761..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_844.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 deleted file mode 100644 index f9782ed89..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_845.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 deleted file mode 100644 index a41cae19f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_846.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 deleted file mode 100644 index d4b26aede..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_847.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 deleted file mode 100644 index 88ee8476e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_848.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 deleted file mode 100644 index 5a78527ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_849.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 deleted file mode 100644 index f1659238b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_850.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 deleted file mode 100644 index 1a5521943..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_851.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 deleted file mode 100644 index b08ea5907..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_852.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 deleted file mode 100644 index dd08f3650..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_853.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 deleted file mode 100644 index 429bac3a9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_854.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 deleted file mode 100644 index becaa30c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_855.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 deleted file mode 100644 index accb1e509..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_856.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 deleted file mode 100644 index 32b3d602a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_857.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 deleted file mode 100644 index b9c31446b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_858.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 deleted file mode 100644 index 64fba4730..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_859.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 deleted file mode 100644 index a27438928..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_860.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 deleted file mode 100644 index 6f033bd2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_861.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 deleted file mode 100644 index afd4085f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_862.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 deleted file mode 100644 index f2b41ed0d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_863.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 deleted file mode 100644 index c00ddbf51..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_864.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 deleted file mode 100644 index 1bd3585ee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_865.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 deleted file mode 100644 index ca0d4088c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_866.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 deleted file mode 100644 index 8f5b65889..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_867.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 deleted file mode 100644 index 89400ca24..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_868.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 deleted file mode 100644 index 56b08ac4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_869.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 deleted file mode 100644 index 09bac8c4b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_870.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 deleted file mode 100644 index c5b285a93..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_871.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 deleted file mode 100644 index be5aa44ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_872.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 deleted file mode 100644 index 4864d4aa5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_873.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 deleted file mode 100644 index 31e7757c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_874.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 deleted file mode 100644 index 349711ef5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_875.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 deleted file mode 100644 index f6ecd8fd9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_876.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 deleted file mode 100644 index 738736444..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_877.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 deleted file mode 100644 index 2de4bbaa7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_878.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 deleted file mode 100644 index 0960f522b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_879.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 deleted file mode 100644 index 64e534fcf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_880.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 deleted file mode 100644 index a53180f3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_881.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 deleted file mode 100644 index 690304cce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_882.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 deleted file mode 100644 index b631692ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_883.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 deleted file mode 100644 index b0a47177c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_884.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 deleted file mode 100644 index 5c292f669..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_885.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 deleted file mode 100644 index 2bb6c57ae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_886.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 deleted file mode 100644 index 1a6c766bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_887.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 deleted file mode 100644 index bf6bdd88b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_888.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 deleted file mode 100644 index d0b688939..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_889.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 deleted file mode 100644 index ee26fadda..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_890.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 deleted file mode 100644 index 0bcd6205e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_891.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 deleted file mode 100644 index f3acdfe8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_892.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 deleted file mode 100644 index d9872712f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_893.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 deleted file mode 100644 index 30d4e50bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_894.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 deleted file mode 100644 index 2e4b42193..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_895.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 deleted file mode 100644 index 2779cee76..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_896.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 deleted file mode 100644 index d1c0f1732..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_897.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 deleted file mode 100644 index 92e61e7bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_898.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 deleted file mode 100644 index def5a484f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_899.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 deleted file mode 100644 index 301758d66..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_900.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 deleted file mode 100644 index cc6547a2d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_901.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 deleted file mode 100644 index 5260b36ef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_902.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 deleted file mode 100644 index b6eddd7ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_903.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 deleted file mode 100644 index 40ec74999..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_904.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 deleted file mode 100644 index 6a30a833a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_905.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 deleted file mode 100644 index 6fb9755cc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_906.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 deleted file mode 100644 index 75936c439..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_907.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 deleted file mode 100644 index 71ac47f5e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_908.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 deleted file mode 100644 index 51803f5a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_909.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 deleted file mode 100644 index a48ab9835..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_910.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 deleted file mode 100644 index 7fb445f3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_911.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 deleted file mode 100644 index 327c92321..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_912.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 deleted file mode 100644 index dae477db3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_913.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 deleted file mode 100644 index 96fb00d72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_914.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 deleted file mode 100644 index 4a9d5ce07..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_915.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 deleted file mode 100644 index f0fd23bdb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_916.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 deleted file mode 100644 index 4fe57da18..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_917.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 deleted file mode 100644 index 38f79380a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_918.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 deleted file mode 100644 index fbc0f6917..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_919.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 deleted file mode 100644 index 432057e9f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_920.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 deleted file mode 100644 index 4f5b0fb9c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_921.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 deleted file mode 100644 index dd7cc5884..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_922.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 deleted file mode 100644 index deeeb05ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_923.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 deleted file mode 100644 index ec7f24cde..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_924.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 deleted file mode 100644 index ede36adea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_925.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 deleted file mode 100644 index 8d97818fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_926.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 deleted file mode 100644 index 0a5ec5d86..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_927.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 deleted file mode 100644 index 0cac06bbc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_928.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 deleted file mode 100644 index 7f0260882..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_929.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 deleted file mode 100644 index acdf5612f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_930.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 deleted file mode 100644 index 3d87bc2b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_931.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 deleted file mode 100644 index 31cac8587..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_932.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 deleted file mode 100644 index 4f37ab3f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_933.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 deleted file mode 100644 index 143ae5c8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_934.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 deleted file mode 100644 index 1e2d6376c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_935.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 deleted file mode 100644 index d209705c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_936.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 deleted file mode 100644 index 1f1c05e62..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_937.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 deleted file mode 100644 index 93fecc508..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_938.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 deleted file mode 100644 index d652f8e77..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_939.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 deleted file mode 100644 index 830992653..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_940.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 deleted file mode 100644 index 9a2d06ede..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_941.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 deleted file mode 100644 index 5c46ebc65..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_942.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 deleted file mode 100644 index 35a263995..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_943.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 deleted file mode 100644 index cf035ae65..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_944.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 deleted file mode 100644 index a4fd6522c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_945.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 deleted file mode 100644 index 5ec014d21..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_946.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 deleted file mode 100644 index 32c193b36..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_947.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 deleted file mode 100644 index 88bcf20ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_948.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 deleted file mode 100644 index 7ff7742be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_949.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 deleted file mode 100644 index 1d8d39bdb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_950.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 deleted file mode 100644 index a7758fe5d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_951.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 deleted file mode 100644 index bedb2f7ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_952.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 deleted file mode 100644 index 19c121845..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_953.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 deleted file mode 100644 index 4d535225c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_954.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 deleted file mode 100644 index a9d64da3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_955.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 deleted file mode 100644 index 0d51d6cbf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_956.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 deleted file mode 100644 index a8a0cd927..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_957.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 deleted file mode 100644 index a955d8d9a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_958.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 deleted file mode 100644 index d1618df54..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_959.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 deleted file mode 100644 index f3b9173ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_960.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 deleted file mode 100644 index af7d6bc8a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_961.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 deleted file mode 100644 index f05dccc30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_962.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 deleted file mode 100644 index b1bdf5dbd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_963.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 deleted file mode 100644 index 3ac331524..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_964.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 deleted file mode 100644 index d5b12fd4e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_965.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 deleted file mode 100644 index 3406741ed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_966.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 deleted file mode 100644 index e2b7eacd4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_967.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 deleted file mode 100644 index 48e716dc6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_968.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 deleted file mode 100644 index 89df7871a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_969.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 deleted file mode 100644 index 6b564bb07..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_970.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 deleted file mode 100644 index 01456794b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_971.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 deleted file mode 100644 index 4c0c9f556..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_972.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 deleted file mode 100644 index b00c45ab7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_973.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 deleted file mode 100644 index bdceaf4f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_974.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 deleted file mode 100644 index 9e57b89ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_975.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 deleted file mode 100644 index dd3157486..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_976.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 deleted file mode 100644 index b421e304c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_977.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 deleted file mode 100644 index e0251f2a6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_978.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 deleted file mode 100644 index 986096506..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_979.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 deleted file mode 100644 index e9f0b0eb2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_980.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 deleted file mode 100644 index cba7d80e0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_981.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 deleted file mode 100644 index 4fcbb5929..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_982.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 deleted file mode 100644 index cc9eea04a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_983.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 deleted file mode 100644 index 8db358bf9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_984.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 deleted file mode 100644 index 7b52fbcb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_985.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 deleted file mode 100644 index 3c89efd6f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_986.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "000")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 deleted file mode 100644 index 3868ae2d2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_987.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 deleted file mode 100644 index 0d177332e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_988.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 deleted file mode 100644 index e2c1c7547..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_989.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 deleted file mode 100644 index 302c1cdc4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_990.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 deleted file mode 100644 index 420682dc6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_991.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "011")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 deleted file mode 100644 index d90bfd8c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_992.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 deleted file mode 100644 index 32293ec41..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_993.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 deleted file mode 100644 index d8c1f11f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_994.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 deleted file mode 100644 index 0af728130..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_995.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "111")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "111")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 deleted file mode 100644 index e205842fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_996.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 deleted file mode 100644 index 8ff028274..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_997.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 deleted file mode 100644 index d59991914..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_998.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 b/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 deleted file mode 100644 index 101164d90..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_999.smt2 +++ /dev/null @@ -1,53 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. -Most benchmarks expected to be unsat. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 deleted file mode 100644 index 1d60160b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1000.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 deleted file mode 100644 index 4f8703931..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1001.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 deleted file mode 100644 index 00c7721e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1002.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 deleted file mode 100644 index f8d6d766a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1003.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 deleted file mode 100644 index 090ebca3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1004.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 deleted file mode 100644 index 13da290b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1005.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 deleted file mode 100644 index efb824d0d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1006.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 deleted file mode 100644 index 027d8136d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1007.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 deleted file mode 100644 index 9de409ca5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1008.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 deleted file mode 100644 index 7e90a9a3f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1009.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 deleted file mode 100644 index 495fa6300..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1010.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 deleted file mode 100644 index 6b04e4746..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1011.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 deleted file mode 100644 index 7267574ae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1012.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 deleted file mode 100644 index 5df2ff680..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1013.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 deleted file mode 100644 index 7ea7e1aef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1014.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 deleted file mode 100644 index cc7a8a478..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1015.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 deleted file mode 100644 index de1fbedd2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1016.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 deleted file mode 100644 index 7a1f87493..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1017.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 deleted file mode 100644 index fcd4cdbf0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1018.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 deleted file mode 100644 index 83813c6b3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1019.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 deleted file mode 100644 index 0627304fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1020.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 deleted file mode 100644 index 1598ff3a6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1021.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 deleted file mode 100644 index 1c8898183..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1022.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 deleted file mode 100644 index 50b97c53c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1023.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 deleted file mode 100644 index 60fb489e5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1024.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 deleted file mode 100644 index 96d98d9a6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1025.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 deleted file mode 100644 index d5b41f597..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1026.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 deleted file mode 100644 index 343adcbb2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1027.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 deleted file mode 100644 index c7570340e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1028.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 deleted file mode 100644 index 161e66b73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1029.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 deleted file mode 100644 index 6c0614ee8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1030.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 deleted file mode 100644 index 66e1aa230..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1031.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 deleted file mode 100644 index 3c541c40d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1032.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 deleted file mode 100644 index 89c7f6d9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1033.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 deleted file mode 100644 index ce314874d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1034.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 deleted file mode 100644 index 17b457fc1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1035.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 deleted file mode 100644 index fe8b5abc4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1036.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 deleted file mode 100644 index 79c3d17f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1037.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 deleted file mode 100644 index c790a3309..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1038.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 deleted file mode 100644 index 542a85592..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1039.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 deleted file mode 100644 index 9c490d45d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1040.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 deleted file mode 100644 index 5d596caff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1041.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 deleted file mode 100644 index dfe725264..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1042.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 deleted file mode 100644 index b47a60abe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1043.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 deleted file mode 100644 index b30325a1a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1044.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 deleted file mode 100644 index cafa9eb9a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1045.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 deleted file mode 100644 index 72a773dfd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1046.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 deleted file mode 100644 index 2fb4e4770..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1047.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 deleted file mode 100644 index a92f9a872..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1048.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 deleted file mode 100644 index 08959c61e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1049.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 deleted file mode 100644 index 23d8a8aeb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1050.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 deleted file mode 100644 index dc7f79ad1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1051.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 deleted file mode 100644 index 15a10d363..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1052.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 deleted file mode 100644 index f706d50fe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1053.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 deleted file mode 100644 index 50c8697ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1054.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 deleted file mode 100644 index 177416ea2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1055.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 deleted file mode 100644 index aa70931aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1056.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 deleted file mode 100644 index a5f78178f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1057.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 deleted file mode 100644 index 43b6f2998..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1058.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 deleted file mode 100644 index 463c18c29..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1059.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 deleted file mode 100644 index 62ce297c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1060.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 deleted file mode 100644 index e728614c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1061.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 deleted file mode 100644 index 3a6aed591..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1062.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 deleted file mode 100644 index 75a690db4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1063.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 deleted file mode 100644 index 590aab2ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1064.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 deleted file mode 100644 index 3f701b921..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1065.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 deleted file mode 100644 index 3eda74ef0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1066.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 deleted file mode 100644 index 14dbe1cc9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1067.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 deleted file mode 100644 index ee7102848..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1068.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 deleted file mode 100644 index f0526f6ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1069.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 deleted file mode 100644 index 6f654e5b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1070.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 deleted file mode 100644 index f0fa58ef4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1071.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 deleted file mode 100644 index b24787493..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1072.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 deleted file mode 100644 index 6f1c14b89..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1073.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 deleted file mode 100644 index 5dd8610cf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1074.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 deleted file mode 100644 index 7d1b52b81..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1075.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 deleted file mode 100644 index 45f0828eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1076.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 deleted file mode 100644 index 4f1fe2ea4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1077.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 deleted file mode 100644 index b243d7c58..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1078.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 deleted file mode 100644 index 7b606107b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1079.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 deleted file mode 100644 index 21fb9e295..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1080.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 deleted file mode 100644 index 57e293b7e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1081.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 deleted file mode 100644 index 402803272..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1082.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 deleted file mode 100644 index 869a44788..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1083.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 deleted file mode 100644 index 8f222e90c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1084.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 deleted file mode 100644 index 23b8d59dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1085.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 deleted file mode 100644 index bdb22005f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1086.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 deleted file mode 100644 index 4befe51a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1087.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 deleted file mode 100644 index b11bf066c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1088.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 deleted file mode 100644 index 90704d7ed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1089.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 deleted file mode 100644 index 5e5ceb862..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1090.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 deleted file mode 100644 index 9fbf8d1cc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1091.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 deleted file mode 100644 index 1559fd36a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1092.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 deleted file mode 100644 index 1a687b9df..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1093.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 deleted file mode 100644 index 4462b9452..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1094.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 deleted file mode 100644 index 49afc775a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1095.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 deleted file mode 100644 index 994dc7d73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1096.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 deleted file mode 100644 index 6f444e798..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1097.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 deleted file mode 100644 index a79ec9246..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1098.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 deleted file mode 100644 index 7dede19b4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1099.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 deleted file mode 100644 index a49205087..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1100.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 deleted file mode 100644 index 06b3e43a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1101.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 deleted file mode 100644 index 8836f9d9f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1102.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 deleted file mode 100644 index 62e21622d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1103.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 deleted file mode 100644 index 3054832b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1104.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 deleted file mode 100644 index 4ca666f7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1105.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 deleted file mode 100644 index af811fde3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1106.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 deleted file mode 100644 index f42587c6d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1107.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 deleted file mode 100644 index c7f3417c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1108.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 deleted file mode 100644 index 14523b63e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1109.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 deleted file mode 100644 index 5ad9950f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1110.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 deleted file mode 100644 index dda5e3188..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1111.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 deleted file mode 100644 index 0cab768d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1112.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 deleted file mode 100644 index 2affbe05c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1113.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 deleted file mode 100644 index 60f690232..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1114.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 deleted file mode 100644 index 3a57b0d83..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1115.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 deleted file mode 100644 index 8ecaf9493..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1116.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 deleted file mode 100644 index e0422fb9a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1117.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 deleted file mode 100644 index 4d0fe07e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1118.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 deleted file mode 100644 index bd2bacf21..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1119.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 deleted file mode 100644 index 885c54566..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1120.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 deleted file mode 100644 index 7c5f9a7d4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1121.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 deleted file mode 100644 index 4e1f4a70b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1122.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 deleted file mode 100644 index 2fceb68aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1123.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 deleted file mode 100644 index bd2f9d4db..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1124.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 deleted file mode 100644 index d7270e457..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1125.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 deleted file mode 100644 index e2d32425c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1126.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 deleted file mode 100644 index eefe55de1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1127.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 deleted file mode 100644 index a9e0e5b96..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1128.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 deleted file mode 100644 index 19b65c9ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1129.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 deleted file mode 100644 index 02919e698..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1130.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 deleted file mode 100644 index 22aab1468..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1131.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 deleted file mode 100644 index 7bda3cbc0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1132.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 deleted file mode 100644 index 0ad965677..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1133.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 deleted file mode 100644 index b99d350ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1134.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 deleted file mode 100644 index 73d46f3dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1135.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 deleted file mode 100644 index 4f17c3602..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1136.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 deleted file mode 100644 index 4f2688a08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1137.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 deleted file mode 100644 index 0363a6d67..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1138.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 deleted file mode 100644 index f243fb3c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1139.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 deleted file mode 100644 index 52f47ccc4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1140.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 deleted file mode 100644 index d8ed683c8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1141.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 deleted file mode 100644 index 6107db4f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1142.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 deleted file mode 100644 index 0fc773198..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1143.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 deleted file mode 100644 index 84a9baf5f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1144.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 deleted file mode 100644 index d8f31c0cc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1145.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 deleted file mode 100644 index b41360b93..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1146.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 deleted file mode 100644 index 62b994d5e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1147.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 deleted file mode 100644 index 8fd4f302c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1148.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 deleted file mode 100644 index b21b925f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1149.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 deleted file mode 100644 index 627492e16..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1150.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 deleted file mode 100644 index 4d341222b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1151.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 deleted file mode 100644 index f8064a4d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1152.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 deleted file mode 100644 index 4cfcb0bf1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1153.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 deleted file mode 100644 index 2fb604551..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1154.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 deleted file mode 100644 index 3c48baea4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1155.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 deleted file mode 100644 index ce4724212..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1156.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 deleted file mode 100644 index 24b0032b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1157.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 deleted file mode 100644 index d5d0bc765..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1158.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 deleted file mode 100644 index 1dafb087e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1159.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 deleted file mode 100644 index a8599d271..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1160.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 deleted file mode 100644 index 134a0dd1d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1161.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 deleted file mode 100644 index 421e91afe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1162.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 deleted file mode 100644 index 19ac7c11d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1163.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 deleted file mode 100644 index 74106e522..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1164.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 deleted file mode 100644 index fad38a0f5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1165.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 deleted file mode 100644 index 6ad5f638e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1166.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 deleted file mode 100644 index e6937c6fe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1167.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 deleted file mode 100644 index 8b5a81f8f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1168.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 deleted file mode 100644 index 8e4356156..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1169.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 deleted file mode 100644 index d47171919..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1170.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 deleted file mode 100644 index d533ea775..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1171.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 deleted file mode 100644 index 4021339ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1172.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 deleted file mode 100644 index 1d90188e1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1173.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 deleted file mode 100644 index 343af78c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1174.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 deleted file mode 100644 index 13cdf7323..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1175.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 deleted file mode 100644 index 140f89cd3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1176.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 deleted file mode 100644 index 5ad2da4d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1177.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 deleted file mode 100644 index 699880630..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1178.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 deleted file mode 100644 index c48f1ae12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1179.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 deleted file mode 100644 index 074e0d47a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1180.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 deleted file mode 100644 index b66e57ddc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1181.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 deleted file mode 100644 index 79d368848..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1182.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 deleted file mode 100644 index a827b0501..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1183.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 deleted file mode 100644 index 06eb37e4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1184.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 deleted file mode 100644 index 3902e629a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1185.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 deleted file mode 100644 index acdd475f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1186.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 deleted file mode 100644 index d3771e3ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1187.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 deleted file mode 100644 index 581422c2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1188.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 deleted file mode 100644 index 3748e5e3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1189.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 deleted file mode 100644 index ede2c396a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1190.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 deleted file mode 100644 index d1deecb56..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1191.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 deleted file mode 100644 index 51a72daf7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1192.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 deleted file mode 100644 index 701da8d9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1193.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 deleted file mode 100644 index 4b1d45ac1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1194.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 deleted file mode 100644 index 837c8fbf5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1195.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 deleted file mode 100644 index a6df4ab2f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1196.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 deleted file mode 100644 index 73b1353ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1197.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 deleted file mode 100644 index 91034ee8b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1198.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 deleted file mode 100644 index 260c502ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1199.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 deleted file mode 100644 index 50480af2f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1200.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 deleted file mode 100644 index 7e0bf4075..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1201.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 deleted file mode 100644 index b8408829f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1202.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 deleted file mode 100644 index f210eb978..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1203.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 deleted file mode 100644 index 027bd1e9c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1204.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 deleted file mode 100644 index c3904c191..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1205.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 deleted file mode 100644 index a357858ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1206.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 deleted file mode 100644 index 8249dfa71..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1207.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 deleted file mode 100644 index 26353fe4f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1208.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 deleted file mode 100644 index 3870dde0e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1209.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 deleted file mode 100644 index f79f948a7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1210.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 deleted file mode 100644 index 3e1d09532..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1211.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 deleted file mode 100644 index edcd01363..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1212.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 deleted file mode 100644 index dce5d191d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1213.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 deleted file mode 100644 index d8ab65524..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1214.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 deleted file mode 100644 index 26d68fe8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1215.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 deleted file mode 100644 index 3d70fc389..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1216.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 deleted file mode 100644 index f30cbd0c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1217.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 deleted file mode 100644 index f6ba81e3a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1218.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 deleted file mode 100644 index ecec68583..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1219.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 deleted file mode 100644 index 929e8d724..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1220.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 deleted file mode 100644 index a6e77f3e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1221.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 deleted file mode 100644 index 0f2cc0c26..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1222.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 deleted file mode 100644 index 1afc5fbfc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1223.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 deleted file mode 100644 index ee447ead4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1224.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 deleted file mode 100644 index 892a7ffec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1225.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 deleted file mode 100644 index 328e9e926..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1226.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 deleted file mode 100644 index 9bcb3a19c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1227.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 deleted file mode 100644 index 2b4376e09..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1228.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 deleted file mode 100644 index 84b5fdcb5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1229.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 deleted file mode 100644 index f1027bdda..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1230.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 deleted file mode 100644 index ee009a222..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1231.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 deleted file mode 100644 index 317bc08a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1232.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 deleted file mode 100644 index 1c46708e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1233.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 deleted file mode 100644 index 0fc8c9e4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1234.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 deleted file mode 100644 index ccc640944..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1235.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 deleted file mode 100644 index b9e30d39d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1236.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 deleted file mode 100644 index 1869a249a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1237.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 deleted file mode 100644 index 26760f23d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1238.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 deleted file mode 100644 index bb5d5001a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1239.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 deleted file mode 100644 index 801eaecb4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1240.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 deleted file mode 100644 index 8085eeaed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1241.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 deleted file mode 100644 index 9cefe8818..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1242.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 deleted file mode 100644 index f42fe0fa3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1243.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 deleted file mode 100644 index 6283f43cf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1244.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 deleted file mode 100644 index b3dfe10dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1245.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 deleted file mode 100644 index 66f9fad14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1246.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 deleted file mode 100644 index 64f20938f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1247.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 deleted file mode 100644 index d6697b20c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1248.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 deleted file mode 100644 index 7b58d1836..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1249.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 deleted file mode 100644 index 76d585ba8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1250.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 deleted file mode 100644 index bec1ea42a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1251.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 deleted file mode 100644 index 9f628edc2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1252.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 deleted file mode 100644 index 8b484c1b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1253.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 deleted file mode 100644 index 6cb3cefd7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1254.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 deleted file mode 100644 index f49eaf857..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1255.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 deleted file mode 100644 index aa4860b4d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1256.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 deleted file mode 100644 index b62415a53..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1257.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 deleted file mode 100644 index 324a78f35..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1258.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 deleted file mode 100644 index d046a1a62..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1259.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 deleted file mode 100644 index a29527865..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1260.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 deleted file mode 100644 index a9ce3bbf2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1261.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 deleted file mode 100644 index bff2e655e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1262.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 deleted file mode 100644 index cea2b8a2f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1263.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 deleted file mode 100644 index 4ebd9dfc4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1264.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 deleted file mode 100644 index ba84dc33e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1265.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 deleted file mode 100644 index a92607fa5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1266.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 deleted file mode 100644 index 7f39d5ee2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1267.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 deleted file mode 100644 index efa992c2f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1268.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 deleted file mode 100644 index 2173f864d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1269.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 deleted file mode 100644 index 32b816001..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1270.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 deleted file mode 100644 index 978241481..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1271.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 deleted file mode 100644 index 27dac7556..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1272.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 deleted file mode 100644 index 831e03271..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1273.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 deleted file mode 100644 index ca6e6e116..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1274.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 deleted file mode 100644 index 1f9e9bb72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1275.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 deleted file mode 100644 index 33931b1e7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1276.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 deleted file mode 100644 index bc94d0c69..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1277.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 deleted file mode 100644 index 74b18ad05..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1278.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 deleted file mode 100644 index 6ea62db55..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1279.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 deleted file mode 100644 index 452a2082d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1280.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 deleted file mode 100644 index 754677b6d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1281.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 deleted file mode 100644 index 4d0c6ff21..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1282.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 deleted file mode 100644 index 0d5c08b96..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1283.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 deleted file mode 100644 index d7f77feac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1284.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 deleted file mode 100644 index 983cfc265..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1285.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 deleted file mode 100644 index f6e6662b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1286.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 deleted file mode 100644 index 9d17f2007..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1287.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 deleted file mode 100644 index 0aa8436f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1288.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 deleted file mode 100644 index 201c6c58e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1289.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 deleted file mode 100644 index b5a17867e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1290.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 deleted file mode 100644 index 47ef7ab2c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1291.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 deleted file mode 100644 index 05c497e29..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1292.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 deleted file mode 100644 index 35fd1dc89..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1293.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 deleted file mode 100644 index ecaf72680..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1294.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 deleted file mode 100644 index f5c241062..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1295.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 deleted file mode 100644 index c74d7b464..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1296.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 deleted file mode 100644 index 34ad6f890..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1297.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 deleted file mode 100644 index 0683a23d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1298.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 deleted file mode 100644 index db4016792..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1299.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 deleted file mode 100644 index 090b6b670..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1300.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 deleted file mode 100644 index 48bc77474..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1301.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 deleted file mode 100644 index 0d4b04bd1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1302.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 deleted file mode 100644 index aea32afd7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1303.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 deleted file mode 100644 index 1f0e0b26e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1304.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 deleted file mode 100644 index 6e9d0d55d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1305.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 deleted file mode 100644 index 3798f5d2c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1306.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 deleted file mode 100644 index 2adbf6752..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1307.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 deleted file mode 100644 index 4744d7100..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1308.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 deleted file mode 100644 index 232f8c2cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1309.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 deleted file mode 100644 index 7c8fb2c51..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1310.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 deleted file mode 100644 index 55222fd0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1311.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 deleted file mode 100644 index d9f833cec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1312.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 deleted file mode 100644 index a03b2ea74..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1313.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 deleted file mode 100644 index 04c8dd9b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1314.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 deleted file mode 100644 index ea935d976..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1315.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 deleted file mode 100644 index 273a7dede..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1316.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 deleted file mode 100644 index 0f8bb4f02..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1317.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 deleted file mode 100644 index e4c75ca66..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1318.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 deleted file mode 100644 index 2a8a31583..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1319.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 deleted file mode 100644 index 4297a28d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1320.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 deleted file mode 100644 index 092711134..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1321.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 deleted file mode 100644 index 7b0770114..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1322.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 deleted file mode 100644 index a3ea8d09e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1323.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 deleted file mode 100644 index a1925493e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1324.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 deleted file mode 100644 index a8670b66c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1325.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 deleted file mode 100644 index 203b700cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1326.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 deleted file mode 100644 index d0602060a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1327.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 deleted file mode 100644 index 685cc1122..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1328.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 deleted file mode 100644 index 4c7e4e2f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1329.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 deleted file mode 100644 index a4a571ddc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1330.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 deleted file mode 100644 index 609bf0ab1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1331.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 deleted file mode 100644 index ec827c84d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1332.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 deleted file mode 100644 index 64f42b36e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1333.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 deleted file mode 100644 index 33699f703..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1334.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 deleted file mode 100644 index fb10f0f55..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1335.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 deleted file mode 100644 index 6b0481c8a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1336.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 deleted file mode 100644 index 6ef3e887d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1337.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 deleted file mode 100644 index 8de9611d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1338.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 deleted file mode 100644 index 35bf40237..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1339.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 deleted file mode 100644 index a8b10d665..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1340.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 deleted file mode 100644 index e5e4ca688..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1341.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 deleted file mode 100644 index 762b2d4a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1342.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 deleted file mode 100644 index 2c4568a27..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1343.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 deleted file mode 100644 index d7d7af39c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1344.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 deleted file mode 100644 index 540013903..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1345.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 deleted file mode 100644 index 33fb32d14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1346.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 deleted file mode 100644 index 091a3cda0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1347.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 deleted file mode 100644 index 5f4df772e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1348.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 deleted file mode 100644 index 7e5ea1755..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1349.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 deleted file mode 100644 index 67e88d717..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1350.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 deleted file mode 100644 index 804828f19..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1351.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 deleted file mode 100644 index cd0f1251d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1352.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 deleted file mode 100644 index 5df468718..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1353.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 deleted file mode 100644 index 09b6ecd15..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1354.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 deleted file mode 100644 index 4b526b7dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1355.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 deleted file mode 100644 index 00510e1df..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1356.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 deleted file mode 100644 index 11b27aed9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1357.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 deleted file mode 100644 index 2e37242b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1358.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 deleted file mode 100644 index c953b6dfc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1359.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 deleted file mode 100644 index e249a16ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1360.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 deleted file mode 100644 index e2e743f53..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1361.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 deleted file mode 100644 index da190b4af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1362.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 deleted file mode 100644 index 77bfad6bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1363.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 deleted file mode 100644 index 673612caf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1364.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 deleted file mode 100644 index bd5fa4363..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1365.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 deleted file mode 100644 index d249e9c08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1366.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 deleted file mode 100644 index 2b36e7392..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1367.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 deleted file mode 100644 index 0ea5de342..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1368.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 deleted file mode 100644 index 235c31d20..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1369.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 deleted file mode 100644 index a3a0b2641..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1370.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 deleted file mode 100644 index f543118a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1371.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 deleted file mode 100644 index 06a90be68..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1372.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 deleted file mode 100644 index 3a7ad6bf7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1373.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 deleted file mode 100644 index f4888121e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1374.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 deleted file mode 100644 index 752a6e50c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1375.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 deleted file mode 100644 index 271fd9fea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1376.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 deleted file mode 100644 index 51a947d0b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1377.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 deleted file mode 100644 index 4812c0a62..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1378.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 deleted file mode 100644 index 0fcdd48f6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1379.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 deleted file mode 100644 index dc80bff98..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1380.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 deleted file mode 100644 index 92ef27284..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1381.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 deleted file mode 100644 index f7e40dc62..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1382.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 deleted file mode 100644 index 08e05136f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1383.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 deleted file mode 100644 index b8f9b1b9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1384.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 deleted file mode 100644 index eabf7a80b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1385.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 deleted file mode 100644 index 26b95800d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1386.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 deleted file mode 100644 index c2083a5ed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1387.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 deleted file mode 100644 index b716eae0e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1388.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 deleted file mode 100644 index c4045e6a7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1389.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 deleted file mode 100644 index 46bfdb4fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1390.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 deleted file mode 100644 index 395deb7c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1391.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 deleted file mode 100644 index 53e7d97ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1392.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 deleted file mode 100644 index f166854aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1393.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 deleted file mode 100644 index bbc35baf4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1394.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 deleted file mode 100644 index e5a878154..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1395.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 deleted file mode 100644 index afabbe6d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1396.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 deleted file mode 100644 index 7b16fb8f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1397.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 deleted file mode 100644 index 3b5607229..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1398.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 deleted file mode 100644 index 3af14172b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1399.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 deleted file mode 100644 index 1a21f6541..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1400.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 deleted file mode 100644 index 727b9a436..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1401.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 deleted file mode 100644 index 1d5f54efe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1402.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 deleted file mode 100644 index a12ec2135..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1403.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 deleted file mode 100644 index 654124e31..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1404.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 deleted file mode 100644 index 9da23df4f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1405.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 deleted file mode 100644 index c9904b4b2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1406.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 deleted file mode 100644 index 916924712..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1407.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 deleted file mode 100644 index b143cfcc4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1408.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 deleted file mode 100644 index 5517439a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1409.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 deleted file mode 100644 index 2a382464e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1410.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 deleted file mode 100644 index 04927439a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1411.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 deleted file mode 100644 index 5947b0996..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1412.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 deleted file mode 100644 index 703fb2fa4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1413.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 deleted file mode 100644 index 48e472c8d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1414.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 deleted file mode 100644 index 4c30ac5c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1415.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 deleted file mode 100644 index cb62d90db..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1416.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 deleted file mode 100644 index fd10c2a6b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1417.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 deleted file mode 100644 index 75a46fab3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1418.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 deleted file mode 100644 index 07f20f29c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1419.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 deleted file mode 100644 index 639fad9dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1420.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 deleted file mode 100644 index 750b3d79d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1421.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 deleted file mode 100644 index b64a44fc0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1422.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 deleted file mode 100644 index 58a3987f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1423.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 deleted file mode 100644 index 0d3227559..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1424.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 deleted file mode 100644 index 15e2e5751..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1425.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 deleted file mode 100644 index ca7ab94be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1426.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 deleted file mode 100644 index 8642ede87..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1427.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 deleted file mode 100644 index f105740af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1428.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 deleted file mode 100644 index 298f1c851..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1429.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 deleted file mode 100644 index 8a0892766..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1430.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 deleted file mode 100644 index 2dc9fa85b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1431.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 deleted file mode 100644 index fb38773ae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1432.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 deleted file mode 100644 index 3b3b94a4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1433.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 deleted file mode 100644 index ee6c2206b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1434.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 deleted file mode 100644 index 09e019c05..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1435.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 deleted file mode 100644 index db111b22d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1436.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 deleted file mode 100644 index 0d6acfa31..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1437.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 deleted file mode 100644 index f43ec31d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1438.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 deleted file mode 100644 index 25e4db928..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1439.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 deleted file mode 100644 index 9fc61771f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1440.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 deleted file mode 100644 index 64f98b988..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1441.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 deleted file mode 100644 index 57b208716..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1442.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 deleted file mode 100644 index 526f70440..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1443.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 deleted file mode 100644 index b01fd9709..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1444.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 deleted file mode 100644 index 2a8084d63..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1445.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 deleted file mode 100644 index ac2f7122f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1446.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 deleted file mode 100644 index c433fba41..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1447.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 deleted file mode 100644 index 544bc2d30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1448.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 deleted file mode 100644 index d5ac7c19e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1449.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 deleted file mode 100644 index fc0d27334..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1450.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 deleted file mode 100644 index f35509d5e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1451.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 deleted file mode 100644 index 1f9f9520c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1452.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 deleted file mode 100644 index a9314cda7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1453.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 deleted file mode 100644 index 2b9405de9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1454.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 deleted file mode 100644 index b8e5c30fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1455.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 deleted file mode 100644 index 222503ba1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1456.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 deleted file mode 100644 index a51ab0083..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1457.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 deleted file mode 100644 index 0bcab85e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1458.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 deleted file mode 100644 index 6ddeac649..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1459.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 deleted file mode 100644 index 0fa78d139..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1460.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 deleted file mode 100644 index 7943b471b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1461.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 deleted file mode 100644 index 2501b47b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1462.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 deleted file mode 100644 index 33b252ffb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1463.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 deleted file mode 100644 index 0594ef7ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1464.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 deleted file mode 100644 index cbeb5f9a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1465.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 deleted file mode 100644 index a7d7dca3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1466.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 deleted file mode 100644 index 956b0ac2e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1467.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 deleted file mode 100644 index b8521a9f5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1468.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 deleted file mode 100644 index e12927c98..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1469.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 deleted file mode 100644 index 6b47d5de2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1470.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 deleted file mode 100644 index 3fa703e14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1471.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 deleted file mode 100644 index b032073a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1472.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 deleted file mode 100644 index f03e0ae4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1473.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 deleted file mode 100644 index 2ee0073bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1474.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 deleted file mode 100644 index 9f4ca6e84..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1475.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 deleted file mode 100644 index 13f253f1f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1476.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 deleted file mode 100644 index 754b292e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1477.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 deleted file mode 100644 index 867a32cd8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1478.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 deleted file mode 100644 index 47333c81c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1479.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 deleted file mode 100644 index 7e5c03cc1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1480.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 deleted file mode 100644 index 362dca282..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1481.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 deleted file mode 100644 index 27198ebed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1482.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 deleted file mode 100644 index 014860083..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1483.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 deleted file mode 100644 index bc0d65dfb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1484.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 deleted file mode 100644 index 436aa59ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1485.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 deleted file mode 100644 index f2fa9a2b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1486.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 deleted file mode 100644 index edb3c403a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1487.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 deleted file mode 100644 index 78b99e567..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1488.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 deleted file mode 100644 index 9c239503f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1489.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 deleted file mode 100644 index 7588da4c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1490.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 deleted file mode 100644 index 9c1b6a1cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1491.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 deleted file mode 100644 index 87a10320f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1492.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 deleted file mode 100644 index 651752c47..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1493.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 deleted file mode 100644 index 141a22681..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1494.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 deleted file mode 100644 index 3df828071..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1495.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 deleted file mode 100644 index 6b8cd659c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1496.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 deleted file mode 100644 index 4203380fd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1497.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 deleted file mode 100644 index 2e653006c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1498.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 deleted file mode 100644 index 0f540b211..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1499.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 deleted file mode 100644 index 6b2013744..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1500.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 deleted file mode 100644 index 085f9b613..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1501.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 deleted file mode 100644 index 8dc70da56..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1502.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 deleted file mode 100644 index 00b998d43..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1503.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 deleted file mode 100644 index 42d5ace2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1504.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 deleted file mode 100644 index 332e5ad16..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1505.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 deleted file mode 100644 index 7c6a177e3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1506.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 deleted file mode 100644 index defe0d8d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1507.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 deleted file mode 100644 index d0c1ed0d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1508.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 deleted file mode 100644 index daa0f42fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1509.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 deleted file mode 100644 index 27a0c7bf5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1510.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 deleted file mode 100644 index ce908d91d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1511.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 deleted file mode 100644 index a3abc4ba0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1512.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 deleted file mode 100644 index ecea4e275..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1513.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 deleted file mode 100644 index fbe7b27b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1514.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 deleted file mode 100644 index 4425f3684..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1515.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 deleted file mode 100644 index 8320936f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1516.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 deleted file mode 100644 index b5f1fe0bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1517.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 deleted file mode 100644 index 17c6cac30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1518.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 deleted file mode 100644 index 863e686fd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1519.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 deleted file mode 100644 index 2c9d1dbd6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1520.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 deleted file mode 100644 index 47a7a43a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1521.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 deleted file mode 100644 index f7094a4e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1522.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 deleted file mode 100644 index 99a2b3558..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1523.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 deleted file mode 100644 index a8ffe9742..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1524.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 deleted file mode 100644 index 482a86010..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1525.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 deleted file mode 100644 index 3a4cd02b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1526.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 deleted file mode 100644 index 391df312e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1527.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 deleted file mode 100644 index 998b10eb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1528.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 deleted file mode 100644 index d5e87cab3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1529.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 deleted file mode 100644 index be1e586ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1530.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 deleted file mode 100644 index 8ea73f0d2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1531.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 deleted file mode 100644 index b2308a0ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1532.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 deleted file mode 100644 index c417d40dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1533.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 deleted file mode 100644 index 921e53533..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1534.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 deleted file mode 100644 index 9bafa8dea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1535.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 deleted file mode 100644 index b5fc5dc3b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1536.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 deleted file mode 100644 index f3bd1da59..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1537.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 deleted file mode 100644 index 02b2463f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1538.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 deleted file mode 100644 index 5375a6157..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1539.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 deleted file mode 100644 index ff6e730a1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1540.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 deleted file mode 100644 index e536f090b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1541.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 deleted file mode 100644 index 0ddd41e90..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1542.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 deleted file mode 100644 index e607b949c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1543.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 deleted file mode 100644 index 09fbe402d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1544.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 deleted file mode 100644 index 7a20cf695..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1545.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 deleted file mode 100644 index afe1465c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1546.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 deleted file mode 100644 index 9ec9d0914..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1547.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 deleted file mode 100644 index 2742c7ca2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1548.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 deleted file mode 100644 index 073199761..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1549.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 deleted file mode 100644 index f7549a04c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1550.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 deleted file mode 100644 index 840da9e81..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1551.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 deleted file mode 100644 index eabf944ed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1552.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 deleted file mode 100644 index 409ab44e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1553.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 deleted file mode 100644 index f093f56b0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1554.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 deleted file mode 100644 index c6da36226..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1555.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 deleted file mode 100644 index aa2aa9f98..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1556.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 deleted file mode 100644 index 809c3a877..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1557.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 deleted file mode 100644 index d67b4968e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1558.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 deleted file mode 100644 index 4c41016cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1559.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 deleted file mode 100644 index 0efd50b54..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1560.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 deleted file mode 100644 index 17bce6255..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1561.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 deleted file mode 100644 index c547ceefb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1562.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 deleted file mode 100644 index 78ffab8ef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1563.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 deleted file mode 100644 index 6116336a8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1564.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 deleted file mode 100644 index 673eca342..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1565.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 deleted file mode 100644 index 775080771..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1566.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 deleted file mode 100644 index f59f6a520..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1567.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 deleted file mode 100644 index 205a64fd9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1568.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 deleted file mode 100644 index 25850a882..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1569.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 deleted file mode 100644 index bfac28e1d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1570.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 deleted file mode 100644 index 5fbd13188..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1571.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 deleted file mode 100644 index 8228eda55..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1572.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 deleted file mode 100644 index f24e7f974..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1573.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 deleted file mode 100644 index 21ac5702c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1574.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 deleted file mode 100644 index 5cfcd7448..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1575.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 deleted file mode 100644 index 90ceb4957..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1576.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 deleted file mode 100644 index ce18c3b1c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1577.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 deleted file mode 100644 index b954f1ebb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1578.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 deleted file mode 100644 index 180daf31d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1579.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 deleted file mode 100644 index f3c564881..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1580.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 deleted file mode 100644 index 28c901e11..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1581.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 deleted file mode 100644 index f9553ca60..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1582.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 deleted file mode 100644 index 61976bd66..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1583.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 deleted file mode 100644 index cfe150524..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1584.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 deleted file mode 100644 index aab650200..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1585.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 deleted file mode 100644 index e56600084..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1586.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 deleted file mode 100644 index 14b804e46..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1587.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 deleted file mode 100644 index 856fb17a1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1588.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 deleted file mode 100644 index 5e43f8268..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1589.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 deleted file mode 100644 index b06cbf220..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1590.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 deleted file mode 100644 index 80dcfb932..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1591.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 deleted file mode 100644 index 0fc82b81e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1592.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 deleted file mode 100644 index e00a43859..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1593.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 deleted file mode 100644 index c8fa157c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1594.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 deleted file mode 100644 index 9345c8d24..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1595.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 deleted file mode 100644 index 665f688a7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1596.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 deleted file mode 100644 index 7e768354e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1597.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 deleted file mode 100644 index c952decbe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1598.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 deleted file mode 100644 index adc63ab9d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1599.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 deleted file mode 100644 index b62b9046b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1600.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 deleted file mode 100644 index c106466ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1601.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 deleted file mode 100644 index ffa09339d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1602.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 deleted file mode 100644 index 102cf7294..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1603.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 deleted file mode 100644 index 7043ac5ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1604.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 deleted file mode 100644 index 4f5838218..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1605.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 deleted file mode 100644 index b42b1daf7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1606.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 deleted file mode 100644 index 60d5456a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1607.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 deleted file mode 100644 index 352791d4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1608.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 deleted file mode 100644 index f6b761c23..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1609.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 deleted file mode 100644 index 9d6ce8d30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1610.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 deleted file mode 100644 index 6e92df2ef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1611.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 deleted file mode 100644 index 7f9b3f536..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1612.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 deleted file mode 100644 index fb8627663..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1613.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 deleted file mode 100644 index 781e13190..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1614.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 deleted file mode 100644 index 5238e4547..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1615.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 deleted file mode 100644 index def01180e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1616.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 deleted file mode 100644 index d7cc64562..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1617.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 deleted file mode 100644 index 843c69fef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1618.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 deleted file mode 100644 index b6acf9cfd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1619.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 deleted file mode 100644 index cf9e175d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1620.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 deleted file mode 100644 index 713adddd6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1621.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 deleted file mode 100644 index c7d3b78e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1622.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 deleted file mode 100644 index 1ba6eb4eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1623.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 deleted file mode 100644 index f1dc78413..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1624.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 deleted file mode 100644 index 45c3d125b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1625.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 deleted file mode 100644 index dadae26bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1626.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 deleted file mode 100644 index 74a7b113e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1627.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 deleted file mode 100644 index 8d00a7e8d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1628.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 deleted file mode 100644 index bceaaf0e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1629.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 deleted file mode 100644 index ecb697168..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1630.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 deleted file mode 100644 index bc6a2fd39..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1631.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 deleted file mode 100644 index aa36a6f67..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1632.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 deleted file mode 100644 index a305a4edd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1633.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 deleted file mode 100644 index 583a6b089..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1634.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 deleted file mode 100644 index 4b6ddaf1d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1635.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 deleted file mode 100644 index bb7003b3e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1636.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 deleted file mode 100644 index e2c2fa8fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1637.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 deleted file mode 100644 index 2a9854276..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1638.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 deleted file mode 100644 index e2f6bbdae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1639.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 deleted file mode 100644 index bb94a408d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1640.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 deleted file mode 100644 index 4b7738123..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1641.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 deleted file mode 100644 index 121940fd0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1642.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 deleted file mode 100644 index 246244d5e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1643.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 deleted file mode 100644 index a00f60b7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1644.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 deleted file mode 100644 index 328b47911..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1645.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 deleted file mode 100644 index 4524c3e46..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1646.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 deleted file mode 100644 index 12ef9f4ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1647.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 deleted file mode 100644 index 9281662df..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1648.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 deleted file mode 100644 index cbea682c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1649.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 deleted file mode 100644 index 4700a591c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1650.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 deleted file mode 100644 index fd44c3cc7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1651.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 deleted file mode 100644 index 15557e196..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1652.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 deleted file mode 100644 index 59f335393..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1653.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 deleted file mode 100644 index f8fea969f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1654.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 deleted file mode 100644 index ab4597cb5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1655.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 deleted file mode 100644 index 2990ca4c8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1656.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 deleted file mode 100644 index 8805de0dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1657.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 deleted file mode 100644 index ec4bcc07f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1658.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 deleted file mode 100644 index b450e7dee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1659.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 deleted file mode 100644 index afdf22295..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1660.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 deleted file mode 100644 index b3c02954d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1661.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 deleted file mode 100644 index 6e3fb2b14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1662.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 deleted file mode 100644 index 0cf85812b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1663.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 deleted file mode 100644 index 735cf5769..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1664.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 deleted file mode 100644 index 9b887ad6f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1665.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 deleted file mode 100644 index 4b6c13ba6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1666.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 deleted file mode 100644 index dcd5d4816..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1667.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 deleted file mode 100644 index 79f251db2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1668.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 deleted file mode 100644 index e30b586df..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1669.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 deleted file mode 100644 index 28fa65c53..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1670.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 deleted file mode 100644 index e6d92c1f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1671.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 deleted file mode 100644 index 179f66688..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1672.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 deleted file mode 100644 index 0b64a0770..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1673.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 deleted file mode 100644 index 68e069d63..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1674.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 deleted file mode 100644 index 3bc7949a9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1675.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 deleted file mode 100644 index d003a6f27..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1676.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 deleted file mode 100644 index bb9c394b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1677.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 deleted file mode 100644 index d2a7d98da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1678.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 deleted file mode 100644 index 825bab624..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1679.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 deleted file mode 100644 index dffc0dbd8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1680.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 deleted file mode 100644 index 64c1ffa7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1681.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 deleted file mode 100644 index aba711633..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1682.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 deleted file mode 100644 index 78494c90d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1683.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 deleted file mode 100644 index 8f7143c08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1684.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 deleted file mode 100644 index 19cf6f4f6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1685.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 deleted file mode 100644 index 4a45aeabe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1686.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 deleted file mode 100644 index 982267a42..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1687.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 deleted file mode 100644 index 58bf5f0a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1688.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 deleted file mode 100644 index b2e7b079e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1689.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 deleted file mode 100644 index 76753ad47..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1690.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 deleted file mode 100644 index c7c918d3a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1691.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 deleted file mode 100644 index 5a85a7992..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1692.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 deleted file mode 100644 index 867d7bef7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1693.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 deleted file mode 100644 index 098ba718c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1694.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 deleted file mode 100644 index fa8b5cc7e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1695.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 deleted file mode 100644 index f1f8a0b52..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1696.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 deleted file mode 100644 index a543360c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1697.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 deleted file mode 100644 index 1ab7e4739..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1698.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 deleted file mode 100644 index 7cb681b19..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1699.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 deleted file mode 100644 index 62e7cf71f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1700.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 deleted file mode 100644 index ce702f546..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1701.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 deleted file mode 100644 index 8189f2ac1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1702.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 deleted file mode 100644 index a2a0068e0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1703.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 deleted file mode 100644 index 63d7fa847..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1704.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 deleted file mode 100644 index cc578fdc7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1705.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 deleted file mode 100644 index 3bbac9c2f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1706.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 deleted file mode 100644 index 48b256b31..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1707.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 deleted file mode 100644 index 32b785e2c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1708.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 deleted file mode 100644 index 5bfee1956..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1709.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 deleted file mode 100644 index c70ed9d2a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1710.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 deleted file mode 100644 index 0979a6492..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1711.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 deleted file mode 100644 index a02c5b94c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1712.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 deleted file mode 100644 index b393092e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1713.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 deleted file mode 100644 index 2252a546e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1714.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 deleted file mode 100644 index ea07eb88c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1715.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 deleted file mode 100644 index 47edbdea6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1716.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 deleted file mode 100644 index e2303390a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1717.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 deleted file mode 100644 index 54499f42a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1718.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 deleted file mode 100644 index 271cde7cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1719.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 deleted file mode 100644 index e20f3078e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1720.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 deleted file mode 100644 index ec781765e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1721.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 deleted file mode 100644 index 49ba6e2eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1722.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 deleted file mode 100644 index 5f7742956..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1723.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 deleted file mode 100644 index d0bd2ede7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1724.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 deleted file mode 100644 index d3dc5ed88..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1725.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 deleted file mode 100644 index 0b15da6a6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1726.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 deleted file mode 100644 index 7b6b3f90b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1727.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 deleted file mode 100644 index 9d5ff4944..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1728.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 deleted file mode 100644 index 87a0903e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1729.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 deleted file mode 100644 index 108442f8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1730.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 deleted file mode 100644 index 6db7870e7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1731.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 deleted file mode 100644 index 5d29222db..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1732.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 deleted file mode 100644 index 79ce178c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1733.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 deleted file mode 100644 index 86746f033..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1734.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 deleted file mode 100644 index 812f93cf5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1735.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 deleted file mode 100644 index b6bfc1a93..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1736.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 deleted file mode 100644 index acca42464..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1737.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 deleted file mode 100644 index 322cc7b05..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1738.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 deleted file mode 100644 index f8e4190f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1739.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 deleted file mode 100644 index 073808704..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1740.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 deleted file mode 100644 index 65fbbc93d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1741.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 deleted file mode 100644 index 3b0f251e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1742.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 deleted file mode 100644 index 1d9fbcc9f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1743.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 deleted file mode 100644 index 540cb12c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1744.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 deleted file mode 100644 index 709fb1760..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1745.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 deleted file mode 100644 index 812ae77cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1746.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 deleted file mode 100644 index 256206deb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1747.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 deleted file mode 100644 index 145c77a73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1748.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 deleted file mode 100644 index 8fa14f4ef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1749.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 deleted file mode 100644 index 9a3c3a826..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1750.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 deleted file mode 100644 index d2d1d7d8d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1751.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 deleted file mode 100644 index ff6191a3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1752.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 deleted file mode 100644 index 9ac371e23..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1753.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 deleted file mode 100644 index 54d94ac0c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1754.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 deleted file mode 100644 index c962cbcd3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1755.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 deleted file mode 100644 index 5b71463a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1756.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 deleted file mode 100644 index fac44606e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1757.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 deleted file mode 100644 index 0dabd1330..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1758.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 deleted file mode 100644 index 0fd7293f0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1759.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 deleted file mode 100644 index 13c86b91e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1760.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 deleted file mode 100644 index cfd552ecb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1761.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 deleted file mode 100644 index dca0c59f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1762.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 deleted file mode 100644 index 061d1e000..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1763.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 deleted file mode 100644 index 6ca98b1f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1764.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 deleted file mode 100644 index 4d23066ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1765.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 deleted file mode 100644 index 26f7c72e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1766.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 deleted file mode 100644 index f079e14b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1767.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 deleted file mode 100644 index 1485e3e81..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1768.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 deleted file mode 100644 index 1ba773907..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1769.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 deleted file mode 100644 index c187b7308..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1770.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 deleted file mode 100644 index 2dea6e552..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1771.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 deleted file mode 100644 index 4a1a26e75..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1772.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 deleted file mode 100644 index 1da804a7d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1773.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 deleted file mode 100644 index 71e677238..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1774.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 deleted file mode 100644 index 15661646a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1775.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 deleted file mode 100644 index 42f70d230..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1776.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 deleted file mode 100644 index 3ff2d9fe9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1777.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 deleted file mode 100644 index cbdd325c5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1778.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 deleted file mode 100644 index 1ff3196bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1779.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 deleted file mode 100644 index 6f1af1b00..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1780.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 deleted file mode 100644 index ef0977275..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1781.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 deleted file mode 100644 index 90f2cae39..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1782.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 deleted file mode 100644 index 485a9c2bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1783.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 deleted file mode 100644 index df836e51a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1784.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 deleted file mode 100644 index 1e8814357..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1785.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 deleted file mode 100644 index b6c18be3f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1786.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 deleted file mode 100644 index ab1004d98..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1787.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 deleted file mode 100644 index 18802f491..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1788.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 deleted file mode 100644 index 28a159e11..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1789.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 deleted file mode 100644 index 700752f03..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1790.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 deleted file mode 100644 index 06d1bcf25..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1791.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 deleted file mode 100644 index 77fc6e638..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1792.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 deleted file mode 100644 index 3529b81af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1793.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 deleted file mode 100644 index 31107e2b2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1794.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 deleted file mode 100644 index 82e160074..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1795.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 deleted file mode 100644 index 9831c50c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1796.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 deleted file mode 100644 index e182c4b7f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1797.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 deleted file mode 100644 index 948b21d51..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1798.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 deleted file mode 100644 index 384b3e54b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1799.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 deleted file mode 100644 index e27b26467..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1800.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 deleted file mode 100644 index 5895cc9ea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1801.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 deleted file mode 100644 index 4a80260cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1802.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 deleted file mode 100644 index 05316815b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1803.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 deleted file mode 100644 index 03396e8ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1804.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 deleted file mode 100644 index fddb83940..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1805.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 deleted file mode 100644 index 71f35ba22..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1806.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 deleted file mode 100644 index 5d91653df..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1807.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 deleted file mode 100644 index d43ba2132..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1808.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 deleted file mode 100644 index 8cf60755a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1809.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 deleted file mode 100644 index e9eecd931..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1810.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 deleted file mode 100644 index 9de14c213..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1811.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 deleted file mode 100644 index 756ccde99..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1812.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 deleted file mode 100644 index 096fcd55f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1813.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 deleted file mode 100644 index de64ff0e3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1814.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 deleted file mode 100644 index d27821c0b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1815.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 deleted file mode 100644 index 25ad4fc31..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1816.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 deleted file mode 100644 index 7b2f793ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1817.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 deleted file mode 100644 index 97da30a44..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1818.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 deleted file mode 100644 index b7f6b680d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1819.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 deleted file mode 100644 index d492a49fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1820.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 deleted file mode 100644 index cefe5e735..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1821.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 deleted file mode 100644 index e11f76e01..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1822.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 deleted file mode 100644 index 078445189..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1823.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 deleted file mode 100644 index bcb645f1c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1824.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 deleted file mode 100644 index e79ce7cdb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1825.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 deleted file mode 100644 index 01d856654..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1826.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 deleted file mode 100644 index cfba53e4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1827.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 deleted file mode 100644 index 4271ee8ae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1828.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 deleted file mode 100644 index 48cf19684..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1829.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 deleted file mode 100644 index b05c7ab54..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1830.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 deleted file mode 100644 index 6499fd4fe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1831.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 deleted file mode 100644 index 5a046e0b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1832.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 deleted file mode 100644 index f8725d249..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1833.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 deleted file mode 100644 index 40235939c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1834.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 deleted file mode 100644 index e64798916..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1835.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 deleted file mode 100644 index 05646f0c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1836.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 deleted file mode 100644 index 056d5bf4d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1837.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 deleted file mode 100644 index 75d22500f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1838.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 deleted file mode 100644 index 3e64005fe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1839.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 deleted file mode 100644 index 76da48dfa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1840.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 deleted file mode 100644 index 020c95d0e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1841.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 deleted file mode 100644 index 2d1acf3b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1842.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 deleted file mode 100644 index d97128d1b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1843.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 deleted file mode 100644 index a4d14149d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1844.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 deleted file mode 100644 index 67f031aae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1845.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 deleted file mode 100644 index 33163e7e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1846.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 deleted file mode 100644 index 345858251..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1847.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 deleted file mode 100644 index c23d2f79c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1848.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 deleted file mode 100644 index ea5938915..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1849.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 deleted file mode 100644 index 160113163..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1850.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 deleted file mode 100644 index 6bdd58b23..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1851.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 deleted file mode 100644 index 57ad492be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1852.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 deleted file mode 100644 index 4862be44a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1853.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 deleted file mode 100644 index a05605ab5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1854.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 deleted file mode 100644 index 5e4d628c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1855.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 deleted file mode 100644 index 567e8de8d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1856.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 deleted file mode 100644 index 144d8fc64..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1857.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 deleted file mode 100644 index 2e05fd9a8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1858.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 deleted file mode 100644 index 5953ae4b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1859.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 deleted file mode 100644 index 2243c2caa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1860.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 deleted file mode 100644 index f7b9312ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1861.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 deleted file mode 100644 index f15ff1a09..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1862.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 deleted file mode 100644 index 3b00627f5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1863.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 deleted file mode 100644 index 43f5cb57b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1864.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 deleted file mode 100644 index 6cf394d8a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1865.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 deleted file mode 100644 index 33d0a5f81..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1866.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 deleted file mode 100644 index 2ac2f2fa8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1867.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 deleted file mode 100644 index de3e11488..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1868.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 deleted file mode 100644 index c6ba2badf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1869.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 deleted file mode 100644 index e609c7057..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1870.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 deleted file mode 100644 index 5c641899a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1871.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 deleted file mode 100644 index 2340bf540..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1872.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 deleted file mode 100644 index a75f80775..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1873.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 deleted file mode 100644 index 13696afc8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1874.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 deleted file mode 100644 index 84846a1d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1875.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 deleted file mode 100644 index 2d931af2d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1876.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 deleted file mode 100644 index 76dd775bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1877.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 deleted file mode 100644 index a70d7df5f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1878.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 deleted file mode 100644 index 2f5772790..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1879.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 deleted file mode 100644 index d773b5d3f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1880.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 deleted file mode 100644 index 047292407..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1881.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 deleted file mode 100644 index 005ada7dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1882.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 deleted file mode 100644 index acbb16655..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1883.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 deleted file mode 100644 index 1bfb321a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1884.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 deleted file mode 100644 index 7782e7341..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1885.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 deleted file mode 100644 index d15713e85..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1886.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 deleted file mode 100644 index 5a1b38343..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1887.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 deleted file mode 100644 index f7d74e742..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1888.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 deleted file mode 100644 index ebbdc262e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1889.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 deleted file mode 100644 index d92fe27b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1890.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 deleted file mode 100644 index b3e4c5456..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1891.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 deleted file mode 100644 index 1a36646fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1892.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 deleted file mode 100644 index b06e6411a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1893.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 deleted file mode 100644 index bb171d6bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1894.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 deleted file mode 100644 index 9993526f6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1895.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 deleted file mode 100644 index b37018fb4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1896.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 deleted file mode 100644 index 8acee4c11..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1897.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 deleted file mode 100644 index 01660afa7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1898.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 deleted file mode 100644 index 31f398685..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1899.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 deleted file mode 100644 index b13d49459..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1900.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 deleted file mode 100644 index d0eac3802..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1901.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 deleted file mode 100644 index bbaca5110..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1902.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 deleted file mode 100644 index 97990e93b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1903.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 deleted file mode 100644 index e46d05974..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1904.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 deleted file mode 100644 index 2428fb55a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1905.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 deleted file mode 100644 index 82d96a2c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1906.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1110")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 deleted file mode 100644 index bced1dee4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1907.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 deleted file mode 100644 index 865881209..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1908.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 deleted file mode 100644 index c8d00939a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1909.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 deleted file mode 100644 index 645babd81..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1910.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 deleted file mode 100644 index baa045ca4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1911.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 deleted file mode 100644 index c8bc1a7f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1912.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 deleted file mode 100644 index ef8e1422a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1913.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 deleted file mode 100644 index 7cf6a9c76..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1914.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 deleted file mode 100644 index 1e0401844..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1915.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 deleted file mode 100644 index cc956dd02..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1916.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 deleted file mode 100644 index fa71e68b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1917.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 deleted file mode 100644 index 2b888befd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1918.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 deleted file mode 100644 index 165c2a474..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1919.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 deleted file mode 100644 index ca5dc73f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1920.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 deleted file mode 100644 index da560fe19..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1921.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 deleted file mode 100644 index 50e49a3fc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1922.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 deleted file mode 100644 index 431db86a7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1923.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 deleted file mode 100644 index 43a769bd2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1924.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 deleted file mode 100644 index 860597623..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1925.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 deleted file mode 100644 index 3e604c1e3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1926.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 deleted file mode 100644 index 58c15d2bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1927.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 deleted file mode 100644 index 0f5c87daf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1928.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 deleted file mode 100644 index d1f9b3dff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1929.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 deleted file mode 100644 index cec611547..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1930.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 deleted file mode 100644 index 26bcecec7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1931.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 deleted file mode 100644 index 7896ea9a8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1932.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 deleted file mode 100644 index 736a11c23..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1933.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 deleted file mode 100644 index 7c54e543a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1934.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 deleted file mode 100644 index b29160cd4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1935.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 deleted file mode 100644 index 62274faab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1936.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 deleted file mode 100644 index 33aeb7158..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1937.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 deleted file mode 100644 index fbfb5849c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1938.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 deleted file mode 100644 index 427caddae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1939.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 deleted file mode 100644 index 0ac978069..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1940.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 deleted file mode 100644 index 96c358f17..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1941.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 deleted file mode 100644 index c8b56fbe3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1942.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 deleted file mode 100644 index ed7585f86..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1943.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 deleted file mode 100644 index a608785c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1944.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 deleted file mode 100644 index 184a27239..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1945.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 deleted file mode 100644 index 241c3582e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1946.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 deleted file mode 100644 index aaaddd7a6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1947.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 deleted file mode 100644 index 695bbe9a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1948.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 deleted file mode 100644 index fb92afca3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1949.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 deleted file mode 100644 index 09a521e66..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1950.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 deleted file mode 100644 index 7cd7ec422..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1951.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 deleted file mode 100644 index f9a69e58e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1952.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 deleted file mode 100644 index fbd77561c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1953.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 deleted file mode 100644 index 2817e1516..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1954.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 deleted file mode 100644 index 518113832..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1955.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 deleted file mode 100644 index d2a91ea9e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1956.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 deleted file mode 100644 index eef540627..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1957.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 deleted file mode 100644 index 43717b660..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1958.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 deleted file mode 100644 index c51abf7fc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1959.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 deleted file mode 100644 index 0ecf6fced..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1960.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 deleted file mode 100644 index b3aca3263..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1961.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 deleted file mode 100644 index a6484eb88..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1962.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 deleted file mode 100644 index 63346ef5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1963.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 deleted file mode 100644 index a095f3015..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1964.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 deleted file mode 100644 index a2d0c93c8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1965.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 deleted file mode 100644 index f851b9a23..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1966.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 deleted file mode 100644 index 5bdb62c2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1967.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 deleted file mode 100644 index bb8a0b713..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1968.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 deleted file mode 100644 index 598a8310e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1969.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 deleted file mode 100644 index 0c1f167f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1970.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 deleted file mode 100644 index 8c9591c11..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1971.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 deleted file mode 100644 index 57fc3503b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1972.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 deleted file mode 100644 index 9cfb968d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1973.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 deleted file mode 100644 index 7ee223ee8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1974.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 deleted file mode 100644 index f5249932f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1975.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 deleted file mode 100644 index c899463b3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1976.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 deleted file mode 100644 index 3c3eec309..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1977.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 deleted file mode 100644 index 6055a088b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1978.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 deleted file mode 100644 index 2edd04db2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1979.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 deleted file mode 100644 index ebc1a9c38..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1980.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 deleted file mode 100644 index 62183ebd7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1981.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 deleted file mode 100644 index b8d978240..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1982.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 deleted file mode 100644 index 671ceea3f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1983.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 deleted file mode 100644 index 6e95715ae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1984.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 deleted file mode 100644 index 01b4c0151..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1985.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 deleted file mode 100644 index 292a03188..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1986.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 deleted file mode 100644 index 65819393a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1987.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 deleted file mode 100644 index a030122c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1988.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 deleted file mode 100644 index b156ba7cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1989.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 deleted file mode 100644 index 39f3370c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1990.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 deleted file mode 100644 index d6b104427..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1991.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 deleted file mode 100644 index c7f6c9b5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1992.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 deleted file mode 100644 index bc4030ccc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1993.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 deleted file mode 100644 index ec6cd5a9e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1994.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 deleted file mode 100644 index 3e1548ea7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1995.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 deleted file mode 100644 index 144be1e64..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1996.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 deleted file mode 100644 index 65d8676f5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1997.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 deleted file mode 100644 index 8772c5ca6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1998.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 deleted file mode 100644 index e198fc4ed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1999.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 deleted file mode 100644 index fb92169b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2000.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 deleted file mode 100644 index 658ed006f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2001.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 deleted file mode 100644 index 26e98d630..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2002.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 deleted file mode 100644 index f59f1645b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2003.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 deleted file mode 100644 index 185151e4d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2004.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 deleted file mode 100644 index 4c7861fd0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2005.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 deleted file mode 100644 index b22ad43a1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2006.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 deleted file mode 100644 index a994dd1d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2007.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 deleted file mode 100644 index 35f55b3d5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2008.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 deleted file mode 100644 index 69f1ca035..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2009.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 deleted file mode 100644 index 90b04122e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2010.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 deleted file mode 100644 index 141499b88..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2011.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 deleted file mode 100644 index b3fb3c048..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2012.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 deleted file mode 100644 index 217a86a44..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2013.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 deleted file mode 100644 index 2e0ff025e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2014.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 deleted file mode 100644 index 724c1a092..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2015.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 deleted file mode 100644 index 4204347e4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2016.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 deleted file mode 100644 index f4c41c867..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2017.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 deleted file mode 100644 index e4cdf888a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2018.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 deleted file mode 100644 index e2eb5032e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2019.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 deleted file mode 100644 index ac2cc11ea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2020.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 deleted file mode 100644 index 6c59d57bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2021.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 deleted file mode 100644 index c43fdbe24..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2022.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 deleted file mode 100644 index 9af52eb12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2023.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 deleted file mode 100644 index b33b2a758..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2024.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 deleted file mode 100644 index 62bb0c3f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2025.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 deleted file mode 100644 index e35758133..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2026.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 deleted file mode 100644 index abe94636b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2027.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 deleted file mode 100644 index b4d57f860..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2028.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 deleted file mode 100644 index f107662fd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2029.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 deleted file mode 100644 index 5ef035d0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2030.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 deleted file mode 100644 index fa0bc8e14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2031.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 deleted file mode 100644 index a27bb9e69..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2032.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 deleted file mode 100644 index c86544c94..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2033.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 deleted file mode 100644 index bb3c516e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2034.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 deleted file mode 100644 index e6eef132a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2035.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 deleted file mode 100644 index 538069922..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2036.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 deleted file mode 100644 index bf06e2d19..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2037.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 deleted file mode 100644 index 4acab7d27..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2038.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 deleted file mode 100644 index ff2d40599..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2039.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 deleted file mode 100644 index 5710f7720..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2040.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 deleted file mode 100644 index 285b91f3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2041.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 deleted file mode 100644 index a3c9ca39d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2042.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 deleted file mode 100644 index 7df467d3a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2043.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 deleted file mode 100644 index 6af5348ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2044.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 deleted file mode 100644 index a9235315c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2045.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 deleted file mode 100644 index 2efe57675..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2046.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 deleted file mode 100644 index 5d35e1cf6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2047.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 deleted file mode 100644 index c6364c93b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2048.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 deleted file mode 100644 index b5ce51d35..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2049.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 deleted file mode 100644 index 99ea6d7e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2050.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 deleted file mode 100644 index 98c528daf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2051.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 deleted file mode 100644 index 0bb783ed2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2052.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 deleted file mode 100644 index 69b039322..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2053.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 deleted file mode 100644 index 3bd60ce2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2054.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 deleted file mode 100644 index 6a02e0169..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2055.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 deleted file mode 100644 index 6516f9cbc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2056.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 deleted file mode 100644 index 7fc56fe28..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2057.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 deleted file mode 100644 index 84accabd8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2058.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 deleted file mode 100644 index 10083e4f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2059.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 deleted file mode 100644 index 58413491e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2060.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 deleted file mode 100644 index 358689260..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2061.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 deleted file mode 100644 index d9ba619c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2062.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 deleted file mode 100644 index 46a3e0ef9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2063.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 deleted file mode 100644 index 44db875f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2064.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 deleted file mode 100644 index b741fb805..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2065.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 deleted file mode 100644 index 97170beb4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2066.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 deleted file mode 100644 index 4620ee235..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2067.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 deleted file mode 100644 index da35044f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2068.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 deleted file mode 100644 index 238aa28a9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2069.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 deleted file mode 100644 index bcf586132..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2070.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 deleted file mode 100644 index 701bd59eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2071.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 deleted file mode 100644 index d2ef16245..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2072.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 deleted file mode 100644 index 093ee04de..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2073.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 deleted file mode 100644 index 1c237bb24..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2074.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 deleted file mode 100644 index 1e2efb6bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2075.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 deleted file mode 100644 index 434915f02..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2076.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 deleted file mode 100644 index 019c27556..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2077.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 deleted file mode 100644 index f72274550..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2078.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 deleted file mode 100644 index 5bdc4a3db..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2079.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 deleted file mode 100644 index a064c44c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2080.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 deleted file mode 100644 index 190b85c87..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2081.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 deleted file mode 100644 index 770476392..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2082.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 deleted file mode 100644 index e36193674..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2083.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 deleted file mode 100644 index 0948333f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2084.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 deleted file mode 100644 index a26662287..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2085.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 deleted file mode 100644 index 9419228ea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2086.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 deleted file mode 100644 index 64a4bf8b3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2087.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 deleted file mode 100644 index c3bea0116..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2088.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 deleted file mode 100644 index e621e13fc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2089.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 deleted file mode 100644 index 37e4d1aa0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2090.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 deleted file mode 100644 index 712b8d898..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2091.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 deleted file mode 100644 index adfbb6647..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2092.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 deleted file mode 100644 index d6e838cc5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2093.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 deleted file mode 100644 index c1ddb6fa8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2094.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 deleted file mode 100644 index 88372bed8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2095.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 deleted file mode 100644 index 8cadff4b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2096.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 deleted file mode 100644 index c7027d9b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2097.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 deleted file mode 100644 index ddfc6f2c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2098.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 deleted file mode 100644 index 1073d63ee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2099.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 deleted file mode 100644 index c6ae89da8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2100.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 deleted file mode 100644 index 031412421..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2101.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 deleted file mode 100644 index fddf9d05b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2102.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 deleted file mode 100644 index cbd987ed7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2103.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 deleted file mode 100644 index 69735da8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2104.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 deleted file mode 100644 index 96da977ea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2105.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 deleted file mode 100644 index 7624e06d5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2106.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 deleted file mode 100644 index 74b80e694..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2107.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 deleted file mode 100644 index 3e2016190..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2108.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 deleted file mode 100644 index f49b2d0aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2109.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 deleted file mode 100644 index 42f9508b8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2110.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 deleted file mode 100644 index b38a48117..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2111.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 deleted file mode 100644 index bdffb811a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2112.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 deleted file mode 100644 index f3de15ef1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2113.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 deleted file mode 100644 index 36696f2c5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2114.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 deleted file mode 100644 index 61b0ff564..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2115.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 deleted file mode 100644 index c06c93a92..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2116.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 deleted file mode 100644 index c64b779f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2117.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 deleted file mode 100644 index aab2420ae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2118.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 deleted file mode 100644 index 63e578ad5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2119.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 deleted file mode 100644 index fc590b65b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2120.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 deleted file mode 100644 index 97abf8140..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2121.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 deleted file mode 100644 index fe038ceb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2122.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 deleted file mode 100644 index 7322d2b29..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2123.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 deleted file mode 100644 index 2fc729f74..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2124.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 deleted file mode 100644 index bbdf8e93f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2125.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 deleted file mode 100644 index 2d40fc357..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2126.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 deleted file mode 100644 index bf4b5cd70..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2127.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 deleted file mode 100644 index 8c0274711..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2128.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 deleted file mode 100644 index b4dd598b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2129.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 deleted file mode 100644 index 4dcd87853..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2130.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 deleted file mode 100644 index 4dcf0d7bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2131.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 deleted file mode 100644 index f0afc7c5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2132.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 deleted file mode 100644 index 0364706c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2133.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 deleted file mode 100644 index 23f4f1d77..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2134.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 deleted file mode 100644 index 0a03068f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2135.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 deleted file mode 100644 index bbac23321..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2136.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 deleted file mode 100644 index d9a1ca84d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2137.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 deleted file mode 100644 index 45933c36f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2138.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 deleted file mode 100644 index 2a3ec0459..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2139.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 deleted file mode 100644 index 64fd5879f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2140.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 deleted file mode 100644 index ddd8b9f74..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2141.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 deleted file mode 100644 index 33abce3c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2142.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 deleted file mode 100644 index f0facc00a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2143.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 deleted file mode 100644 index 15b191e4e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2144.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 deleted file mode 100644 index bae519b88..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2145.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 deleted file mode 100644 index 330e0f430..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2146.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 deleted file mode 100644 index b93b81d60..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2147.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 deleted file mode 100644 index 2b95566e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2148.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 deleted file mode 100644 index 6f6a7e716..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2149.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 deleted file mode 100644 index 9b554c3fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2150.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 deleted file mode 100644 index 6eb2a77c5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2151.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 deleted file mode 100644 index eb4304245..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2152.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 deleted file mode 100644 index 6308de9c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2153.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 deleted file mode 100644 index 955f6aa8b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2154.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 deleted file mode 100644 index 3088c6ffd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2155.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 deleted file mode 100644 index 8f7a16ffe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2156.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 deleted file mode 100644 index 7ad62540c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2157.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 deleted file mode 100644 index 51a643d49..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2158.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 deleted file mode 100644 index 0bf7e06e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2159.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 deleted file mode 100644 index 22d310bfc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2160.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 deleted file mode 100644 index c2b9c7b06..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2161.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 deleted file mode 100644 index 3d8cb4e98..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2162.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 deleted file mode 100644 index 0da66c999..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2163.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 deleted file mode 100644 index ccaac931c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2164.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 deleted file mode 100644 index e7e4dda96..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2165.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 deleted file mode 100644 index 1141e06ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2166.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 deleted file mode 100644 index 05ca8bad5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2167.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 deleted file mode 100644 index c21037c9a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2168.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 deleted file mode 100644 index bd50b985b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2169.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 deleted file mode 100644 index 86184895c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2170.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 deleted file mode 100644 index bbcde4ccf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2171.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 deleted file mode 100644 index 98c17bafc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2172.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 deleted file mode 100644 index d28a4f5c5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2173.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 deleted file mode 100644 index a6439a0e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2174.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 deleted file mode 100644 index 670c4d674..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2175.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 deleted file mode 100644 index 07cbf17d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2176.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 deleted file mode 100644 index ca55e80fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2177.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 deleted file mode 100644 index 7aee40c27..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2178.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 deleted file mode 100644 index 32f0ca235..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2179.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 deleted file mode 100644 index 7b52e0864..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2180.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 deleted file mode 100644 index 9eca9c379..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2181.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 deleted file mode 100644 index d002780d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2182.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 deleted file mode 100644 index ff44af7c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2183.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 deleted file mode 100644 index be018c569..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2184.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 deleted file mode 100644 index c0fdbb067..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2185.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 deleted file mode 100644 index 4bccdd182..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2186.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 deleted file mode 100644 index 5ca0b33d4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2187.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 deleted file mode 100644 index 2f9203c35..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2188.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 deleted file mode 100644 index 38582cc96..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2189.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 deleted file mode 100644 index 6022f09d6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2190.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 deleted file mode 100644 index c3fd8a7da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2191.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 deleted file mode 100644 index fa8efc6eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2192.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 deleted file mode 100644 index a77fc1ab7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2193.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 deleted file mode 100644 index 35c554bf3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2194.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 deleted file mode 100644 index 209195799..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2195.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 deleted file mode 100644 index 6318f317a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2196.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 deleted file mode 100644 index fcc8648ef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2197.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 deleted file mode 100644 index 79a17c2b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2198.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 deleted file mode 100644 index 23ccf6cf3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2199.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 deleted file mode 100644 index 572ba1ca2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2200.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 deleted file mode 100644 index 2107adb27..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2201.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 deleted file mode 100644 index 4dc6be0bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2202.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 deleted file mode 100644 index e101955ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2203.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 deleted file mode 100644 index d689a84e7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2204.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 deleted file mode 100644 index be523cacc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2205.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 deleted file mode 100644 index 0afecddcb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2206.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 deleted file mode 100644 index e8689703e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2207.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 deleted file mode 100644 index 1f2d6624b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2208.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 deleted file mode 100644 index d6b574905..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2209.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 deleted file mode 100644 index 85994a5dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2210.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 deleted file mode 100644 index baf52571e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2211.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 deleted file mode 100644 index abc07131e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2212.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 deleted file mode 100644 index 60244c344..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2213.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 deleted file mode 100644 index 17fffe79d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2214.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 deleted file mode 100644 index 09508d140..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2215.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 deleted file mode 100644 index 780394314..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2216.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 deleted file mode 100644 index e9bfbdf0f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2217.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 deleted file mode 100644 index c066f4238..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2218.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 deleted file mode 100644 index 0a86ad7c5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2219.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 deleted file mode 100644 index 01b93e7f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2220.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 deleted file mode 100644 index bef578894..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2221.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 deleted file mode 100644 index 500f1a801..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2222.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 deleted file mode 100644 index 5f8e32c5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2223.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 deleted file mode 100644 index e477e93cc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2224.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 deleted file mode 100644 index 755c42ce2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2225.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 deleted file mode 100644 index d75f081a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2226.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 deleted file mode 100644 index 347c66cad..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2227.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 deleted file mode 100644 index dc2325bd9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2228.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 deleted file mode 100644 index 44cf96c4f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2229.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 deleted file mode 100644 index 9114bc66a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2230.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 deleted file mode 100644 index 8206a0992..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2231.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 deleted file mode 100644 index effb812c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2232.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 deleted file mode 100644 index a4c2b026f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2233.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 deleted file mode 100644 index 0689c6124..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2234.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 deleted file mode 100644 index 7b3843ea8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2235.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 deleted file mode 100644 index 53cc6d017..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2236.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 deleted file mode 100644 index 86b68e905..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2237.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 deleted file mode 100644 index fffcaf6d4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2238.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 deleted file mode 100644 index d6af09ee6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2239.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 deleted file mode 100644 index ff95c19d2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2240.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 deleted file mode 100644 index a125fbcf7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2241.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 deleted file mode 100644 index 60c491705..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2242.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 deleted file mode 100644 index 859e381b4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2243.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 deleted file mode 100644 index 639c527df..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2244.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 deleted file mode 100644 index 375c4b46c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2245.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 deleted file mode 100644 index 67a9d246d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2246.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 deleted file mode 100644 index c5c7a9398..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2247.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 deleted file mode 100644 index 40487230f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2248.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 deleted file mode 100644 index da4c2f6fe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2249.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 deleted file mode 100644 index f14dbddec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2250.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 deleted file mode 100644 index 0d67d929b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2251.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 deleted file mode 100644 index 180fe513e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2252.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 deleted file mode 100644 index 95c8c1890..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2253.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 deleted file mode 100644 index 980520fed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2254.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 deleted file mode 100644 index b46ac0cb1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2255.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 deleted file mode 100644 index e5cd8e2dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2256.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 deleted file mode 100644 index e3d17270a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2257.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 deleted file mode 100644 index b246f70eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2258.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 deleted file mode 100644 index 7077cc114..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2259.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 deleted file mode 100644 index 13bb1f0fc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2260.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 deleted file mode 100644 index 240772af0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2261.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 deleted file mode 100644 index 963e9b55f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2262.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 deleted file mode 100644 index 985cacda2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2263.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 deleted file mode 100644 index da7c38aef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2264.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 deleted file mode 100644 index cdcf0d493..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2265.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 deleted file mode 100644 index e4163c578..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2266.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 deleted file mode 100644 index 19964af89..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2267.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 deleted file mode 100644 index 77d359673..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2268.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 deleted file mode 100644 index 07d0e135a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2269.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 deleted file mode 100644 index 268c2f1ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2270.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 deleted file mode 100644 index 9fa01614b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2271.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 deleted file mode 100644 index ec9ca5a57..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2272.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 deleted file mode 100644 index c23793202..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2273.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 deleted file mode 100644 index 99ad71991..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2274.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 deleted file mode 100644 index b83397edd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2275.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 deleted file mode 100644 index 8409b58b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2276.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 deleted file mode 100644 index f7aa02539..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2277.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 deleted file mode 100644 index 194744c5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2278.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 deleted file mode 100644 index 1e4087456..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2279.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 deleted file mode 100644 index ab8b65cee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2280.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 deleted file mode 100644 index 7015129be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2281.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 deleted file mode 100644 index e1bd5b9d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2282.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 deleted file mode 100644 index 5804afb0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2283.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 deleted file mode 100644 index 0a1578a68..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2284.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 deleted file mode 100644 index b592c4103..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2285.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 deleted file mode 100644 index 605e437a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2286.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 deleted file mode 100644 index 4dc19277d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2287.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 deleted file mode 100644 index a9cea4062..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2288.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 deleted file mode 100644 index 4ec598792..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2289.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 deleted file mode 100644 index e15ea5084..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2290.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 deleted file mode 100644 index eaf63d070..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2291.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 deleted file mode 100644 index 077e0e6c8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2292.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 deleted file mode 100644 index 1f2aa63bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2293.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 deleted file mode 100644 index 516fb0441..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2294.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 deleted file mode 100644 index 8d7e11d2a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2295.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 deleted file mode 100644 index 5c2f90c5b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2296.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 deleted file mode 100644 index 9279e9897..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2297.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 deleted file mode 100644 index 22fadaaab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2298.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 deleted file mode 100644 index ae0cc3dcf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2299.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 deleted file mode 100644 index 3a98e9b5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2300.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 deleted file mode 100644 index 430fc6816..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2301.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 deleted file mode 100644 index 6e1d7d020..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2302.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 deleted file mode 100644 index f9d5df163..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2303.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 deleted file mode 100644 index 857c376d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2304.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 deleted file mode 100644 index 433733179..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2305.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 deleted file mode 100644 index 82225f70e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2306.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 deleted file mode 100644 index 59913d3e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2307.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 deleted file mode 100644 index fb8b0d664..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2308.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 deleted file mode 100644 index 256d0cb92..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2309.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 deleted file mode 100644 index 86579bf9d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2310.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 deleted file mode 100644 index 96d784e26..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2311.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 deleted file mode 100644 index 1607b053e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2312.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 deleted file mode 100644 index 037860a9f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2313.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 deleted file mode 100644 index e0c83a723..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2314.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 deleted file mode 100644 index 938d32e4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2315.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 deleted file mode 100644 index cf1ae36a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2316.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 deleted file mode 100644 index c47cf600c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2317.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 deleted file mode 100644 index abfe1cf94..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2318.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 deleted file mode 100644 index 63028484e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2319.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 deleted file mode 100644 index b95c8367b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2320.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 deleted file mode 100644 index b76a6ce2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2321.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 deleted file mode 100644 index 11f947374..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2322.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 deleted file mode 100644 index 299a287c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2323.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 deleted file mode 100644 index 02604f606..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2324.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 deleted file mode 100644 index 9bd82917f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2325.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 deleted file mode 100644 index 6cd69a740..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2326.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 deleted file mode 100644 index 32e64eb74..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2327.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 deleted file mode 100644 index fb416ea62..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2328.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 deleted file mode 100644 index 59f6493d6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2329.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 deleted file mode 100644 index 2d4949f72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2330.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 deleted file mode 100644 index 7ac6e8bac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2331.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 deleted file mode 100644 index cb0c7177a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2332.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 deleted file mode 100644 index 67f7d11d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2333.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 deleted file mode 100644 index 8353410e0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2334.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 deleted file mode 100644 index ab919dd30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2335.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 deleted file mode 100644 index c8f0587ae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2336.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 deleted file mode 100644 index 98498a724..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2337.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 deleted file mode 100644 index 5ccd10018..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2338.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 deleted file mode 100644 index 7aa465a87..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2339.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 deleted file mode 100644 index c77c53d9c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2340.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 deleted file mode 100644 index f26339a08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2341.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 deleted file mode 100644 index ed1578796..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2342.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 deleted file mode 100644 index b0db2c259..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2343.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 deleted file mode 100644 index 14944c530..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2344.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 deleted file mode 100644 index c8d58e931..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2345.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 deleted file mode 100644 index 4a5535f32..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2346.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 deleted file mode 100644 index 6d0115b09..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2347.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 deleted file mode 100644 index 539208b4e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2348.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 deleted file mode 100644 index 27d8412e7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2349.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 deleted file mode 100644 index c7957a896..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2350.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 deleted file mode 100644 index 3be50dc90..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2351.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 deleted file mode 100644 index 5ba1645c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2352.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 deleted file mode 100644 index b4eac927a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2353.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 deleted file mode 100644 index ab8d9de8f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2354.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 deleted file mode 100644 index 1b6f6c8fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2355.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 deleted file mode 100644 index 587118b0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2356.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 deleted file mode 100644 index 8046ca0fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2357.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 deleted file mode 100644 index 088564fce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2358.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 deleted file mode 100644 index c8c694609..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2359.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 deleted file mode 100644 index b1cea9ded..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2360.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 deleted file mode 100644 index 631ab000d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2361.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 deleted file mode 100644 index 57e80ac43..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2362.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 deleted file mode 100644 index 860df716b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2363.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 deleted file mode 100644 index 3de1ac1ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2364.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 deleted file mode 100644 index ec894f193..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2365.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 deleted file mode 100644 index 7999c2a30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2366.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 deleted file mode 100644 index f66aa0d81..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2367.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 deleted file mode 100644 index 367be81a8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2368.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 deleted file mode 100644 index efd34e789..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2369.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 deleted file mode 100644 index 908096635..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2370.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 deleted file mode 100644 index 5c15803e4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2371.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 deleted file mode 100644 index 00446ef09..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2372.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 deleted file mode 100644 index 9d03ee6a6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2373.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 deleted file mode 100644 index f20479dc6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2374.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 deleted file mode 100644 index 72ba179ee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2375.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 deleted file mode 100644 index 1eb1fb75c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2376.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 deleted file mode 100644 index a5e70aba8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2377.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 deleted file mode 100644 index 3ba2f94ec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2378.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 deleted file mode 100644 index 92ac7d5db..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2379.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 deleted file mode 100644 index fd0d4e0e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2380.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 deleted file mode 100644 index 0a2d913aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2381.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 deleted file mode 100644 index c531bc7ad..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2382.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 deleted file mode 100644 index 5e4d845bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2383.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 deleted file mode 100644 index 6430fe12b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2384.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 deleted file mode 100644 index f58bb01c8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2385.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 deleted file mode 100644 index 570a47f9d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2386.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 deleted file mode 100644 index 67c0eff7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2387.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 deleted file mode 100644 index 05daccc0d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2388.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 deleted file mode 100644 index c87e8f73f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2389.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 deleted file mode 100644 index 1c8393002..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2390.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 deleted file mode 100644 index d34ddc3c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2391.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 deleted file mode 100644 index 404a6c412..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2392.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 deleted file mode 100644 index 09f9f560c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2393.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 deleted file mode 100644 index 6da8a07a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2394.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 deleted file mode 100644 index 22c9c0859..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2395.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 deleted file mode 100644 index aadded745..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2396.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 deleted file mode 100644 index a41d4a0c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2397.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 deleted file mode 100644 index e60c64d5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2398.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 deleted file mode 100644 index e407444fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2399.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 deleted file mode 100644 index 650db130a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2400.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 deleted file mode 100644 index 127a96186..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2401.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 deleted file mode 100644 index 4d20b84f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2402.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 deleted file mode 100644 index 5709b87c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2403.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 deleted file mode 100644 index f1afdf2c8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2404.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 deleted file mode 100644 index 230c55381..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2405.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 deleted file mode 100644 index 86f7d4bc5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2406.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 deleted file mode 100644 index f402a9ce1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2407.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 deleted file mode 100644 index d8bd825f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2408.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 deleted file mode 100644 index 59d2c30fb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2409.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 deleted file mode 100644 index 3f25b9362..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2410.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 deleted file mode 100644 index 269e189dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2411.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 deleted file mode 100644 index 68fd1e910..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2412.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 deleted file mode 100644 index 423c10177..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2413.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 deleted file mode 100644 index 86c522a33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2414.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 deleted file mode 100644 index 85a156d40..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2415.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 deleted file mode 100644 index 2b09b9a7e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2416.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 deleted file mode 100644 index 52cd5086a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2417.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 deleted file mode 100644 index 654cb19cf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2418.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 deleted file mode 100644 index 7d1511d01..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2419.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1101")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 deleted file mode 100644 index 73a92359b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2420.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 deleted file mode 100644 index 831d34396..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2421.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1010")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 deleted file mode 100644 index d2fecad3e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2422.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 deleted file mode 100644 index 85bf2468c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2423.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 deleted file mode 100644 index ecda8695b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2424.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 deleted file mode 100644 index 4c4548704..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2425.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 deleted file mode 100644 index d11392a9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2426.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 deleted file mode 100644 index ea66c40f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2427.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "0011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 deleted file mode 100644 index 6fec5f417..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2428.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 deleted file mode 100644 index e351df5d4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2429.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 deleted file mode 100644 index ac4ebfa67..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2430.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 deleted file mode 100644 index d403d1e1b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2431.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 deleted file mode 100644 index e3d9f1dc3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2432.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 deleted file mode 100644 index b873c4d79..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2433.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 deleted file mode 100644 index 7f6f080d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2434.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 deleted file mode 100644 index 900331e01..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2435.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 deleted file mode 100644 index 649d57667..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2436.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 deleted file mode 100644 index 4c9e6fe4e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2437.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 deleted file mode 100644 index 7e11809ea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2438.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 deleted file mode 100644 index 83a5837e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2439.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 deleted file mode 100644 index caec4d519..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2440.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 deleted file mode 100644 index d4821a215..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2441.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 deleted file mode 100644 index 0a114848d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2442.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 deleted file mode 100644 index d6419cd35..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2443.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 deleted file mode 100644 index 4b890cd02..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2444.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 deleted file mode 100644 index 17c5813c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2445.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 deleted file mode 100644 index 4efe2e41e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2446.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 deleted file mode 100644 index d7bbf99cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2447.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 deleted file mode 100644 index ec707d883..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2448.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 deleted file mode 100644 index 3e55628b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2449.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 deleted file mode 100644 index 33afeae69..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2450.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 deleted file mode 100644 index fabfd881e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2451.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 deleted file mode 100644 index 3b23cbf55..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2452.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 deleted file mode 100644 index 77595cbd2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2453.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 deleted file mode 100644 index e2db77ea2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2454.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 deleted file mode 100644 index 519470ddb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2455.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 deleted file mode 100644 index 01282bf6e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2456.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 deleted file mode 100644 index 1addcc247..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2457.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 deleted file mode 100644 index 2d69d1683..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2458.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 deleted file mode 100644 index 365ea962e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2459.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 deleted file mode 100644 index 5be4079e0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2460.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 deleted file mode 100644 index b0ffb33f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2461.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 deleted file mode 100644 index 20db72650..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2462.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 deleted file mode 100644 index c6d6d9a34..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2463.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 deleted file mode 100644 index 8f166804d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2464.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 deleted file mode 100644 index 72b49db3b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2465.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 deleted file mode 100644 index 6a3f149af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2466.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 deleted file mode 100644 index 4e5075ad0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2467.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 deleted file mode 100644 index 330f10333..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2468.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 deleted file mode 100644 index 4b937bc78..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2469.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 deleted file mode 100644 index f6ecd11fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2470.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 deleted file mode 100644 index 81b935a08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2471.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 deleted file mode 100644 index e00224f3a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2472.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 deleted file mode 100644 index e559572b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2473.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 deleted file mode 100644 index 394632847..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2474.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 deleted file mode 100644 index 65aa4a7e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2475.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 deleted file mode 100644 index 3799e6bb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2476.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 deleted file mode 100644 index 3018b44f6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2477.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 deleted file mode 100644 index d1417ec43..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2478.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 deleted file mode 100644 index 1205be703..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2479.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 deleted file mode 100644 index bd59be986..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2480.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 deleted file mode 100644 index 0117fde0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2481.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 deleted file mode 100644 index 056500880..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2482.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 deleted file mode 100644 index ed218089b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2483.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 deleted file mode 100644 index 2ad965a20..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2484.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 deleted file mode 100644 index 9714b9c19..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2485.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 deleted file mode 100644 index cd6dc589f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2486.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 deleted file mode 100644 index d0d3ad018..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2487.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 deleted file mode 100644 index 7dfdc584b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2488.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 deleted file mode 100644 index 77b6fda12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2489.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 deleted file mode 100644 index 871b86c4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2490.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 deleted file mode 100644 index 4ace650c5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2491.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 deleted file mode 100644 index deb4ea77c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2492.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 deleted file mode 100644 index 9f78dde22..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2493.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 deleted file mode 100644 index c75b8c242..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2494.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 deleted file mode 100644 index e60883389..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2495.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 deleted file mode 100644 index a366e24a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2496.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 deleted file mode 100644 index f5a1a7245..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2497.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 deleted file mode 100644 index ed8ba56e7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2498.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 deleted file mode 100644 index ca6530ffb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2499.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 deleted file mode 100644 index 455bcbfe2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2500.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 deleted file mode 100644 index fbfb866d5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2501.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 deleted file mode 100644 index 03c27e2b3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2502.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 deleted file mode 100644 index cd7a729d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2503.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 deleted file mode 100644 index cf059029e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2504.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 deleted file mode 100644 index 97e41bd03..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2505.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 deleted file mode 100644 index 16376dddc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2506.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 deleted file mode 100644 index 4a32246c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2507.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 deleted file mode 100644 index 8bfcf8550..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2508.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 deleted file mode 100644 index 538b5137f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2509.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 deleted file mode 100644 index 74cac0adf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2510.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 deleted file mode 100644 index 8fd7b0243..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2511.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 deleted file mode 100644 index de5c0a4bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2512.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 deleted file mode 100644 index 686fae29a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2513.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 deleted file mode 100644 index 685d1ba44..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2514.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 deleted file mode 100644 index 66fb8a22d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2515.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 deleted file mode 100644 index e4a8ec089..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2516.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 deleted file mode 100644 index 9f8232ebf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2517.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 deleted file mode 100644 index d902c033d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2518.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 deleted file mode 100644 index bc3e924c7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2519.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 deleted file mode 100644 index d99332595..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2520.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 deleted file mode 100644 index bc82518fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2521.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 deleted file mode 100644 index 3e3e9c91a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2522.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 deleted file mode 100644 index 8cc0c97eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2523.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 deleted file mode 100644 index 0bff8c077..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2524.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 deleted file mode 100644 index a4eaab37d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2525.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 deleted file mode 100644 index f2ca907e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2526.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 deleted file mode 100644 index 6d413d061..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2527.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 deleted file mode 100644 index c9fcd6ba0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2528.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 deleted file mode 100644 index 03c08eeb8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2529.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 deleted file mode 100644 index 6eebfee1a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2530.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 deleted file mode 100644 index bc0d3ebdc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2531.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 deleted file mode 100644 index b7e0ddc48..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2532.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 deleted file mode 100644 index a60e21626..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2533.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 deleted file mode 100644 index 643db5579..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2534.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 deleted file mode 100644 index 7997e2f49..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2535.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 deleted file mode 100644 index 3c018790b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2536.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 deleted file mode 100644 index 3d9e32944..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2537.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 deleted file mode 100644 index fc917d9ea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2538.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 deleted file mode 100644 index 915324737..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2539.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 deleted file mode 100644 index 01c573a9c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2540.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 deleted file mode 100644 index de3b0eec5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2541.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 deleted file mode 100644 index bbb8d7769..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2542.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 deleted file mode 100644 index 0a51c0ffc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2543.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 deleted file mode 100644 index ab2fe5571..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2544.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 deleted file mode 100644 index 497c7543f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2545.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 deleted file mode 100644 index 5c6c0846b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2546.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 deleted file mode 100644 index 536ae182d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2547.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 deleted file mode 100644 index 188706c34..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2548.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 deleted file mode 100644 index 8ef70fabb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2549.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 deleted file mode 100644 index bbaaf9f0d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2550.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 deleted file mode 100644 index b07868508..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2551.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 deleted file mode 100644 index 4047806ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2552.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 deleted file mode 100644 index ed9d849c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2553.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 deleted file mode 100644 index 5f5a26776..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2554.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 deleted file mode 100644 index ae91c701f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2555.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 deleted file mode 100644 index 20db5e173..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2556.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 deleted file mode 100644 index 2e27e82c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2557.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 deleted file mode 100644 index 2dd78ea85..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2558.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 deleted file mode 100644 index b02e837d1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2559.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 deleted file mode 100644 index b436379eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2560.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 deleted file mode 100644 index 272ad59ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2561.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 deleted file mode 100644 index 545e70088..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2562.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 deleted file mode 100644 index 938494a71..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2563.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 deleted file mode 100644 index 1d5e18ca6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2564.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 deleted file mode 100644 index 805576e99..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2565.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 deleted file mode 100644 index 46add993d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2566.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 deleted file mode 100644 index 789e233fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2567.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 deleted file mode 100644 index f6e34098e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2568.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 deleted file mode 100644 index 1df14e0de..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2569.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 deleted file mode 100644 index 7e404e8c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2570.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 deleted file mode 100644 index 8f3829a54..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2571.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 deleted file mode 100644 index 554ff8593..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2572.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 deleted file mode 100644 index 16136cfde..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2573.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 deleted file mode 100644 index 65d919017..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2574.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 deleted file mode 100644 index ad959b83d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2575.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 deleted file mode 100644 index 26c73d88a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2576.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 deleted file mode 100644 index d6b6b3422..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2577.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 deleted file mode 100644 index 68d671cc7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2578.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 deleted file mode 100644 index 8875453eb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2579.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 deleted file mode 100644 index 18ea62599..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2580.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 deleted file mode 100644 index aedc204d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2581.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 deleted file mode 100644 index 43733a0d3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2582.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 deleted file mode 100644 index d9ce3db6e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2583.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 deleted file mode 100644 index 3a5e52eab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2584.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 deleted file mode 100644 index 673ba5e78..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2585.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 deleted file mode 100644 index f6cf3ffab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2586.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 deleted file mode 100644 index 6566e338c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2587.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 deleted file mode 100644 index a637f6d95..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2588.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 deleted file mode 100644 index d6303ed6e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2589.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 deleted file mode 100644 index 39be7de4b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2590.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 deleted file mode 100644 index 2e575607f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2591.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 deleted file mode 100644 index 13077ec19..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2592.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 deleted file mode 100644 index c0d08c068..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2593.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 deleted file mode 100644 index 3cf774635..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2594.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 deleted file mode 100644 index b420eb782..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2595.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 deleted file mode 100644 index 1b7cbfe19..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2596.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 deleted file mode 100644 index a80b91c2d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2597.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 deleted file mode 100644 index e20b93a4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2598.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 deleted file mode 100644 index c80d344e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2599.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 deleted file mode 100644 index 8f79cd2ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2600.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 deleted file mode 100644 index 5f9e1d008..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2601.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 deleted file mode 100644 index c8ed21f7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2602.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 deleted file mode 100644 index 1b753b6ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2603.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 deleted file mode 100644 index 715778399..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2604.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 deleted file mode 100644 index 7eec55e2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2605.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 deleted file mode 100644 index 8f84b5d34..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2606.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 deleted file mode 100644 index 94f272421..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2607.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 deleted file mode 100644 index f8188f5c2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2608.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 deleted file mode 100644 index e5b988efe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2609.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 deleted file mode 100644 index 72af38c1a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2610.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 deleted file mode 100644 index 963083072..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2611.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 deleted file mode 100644 index dc39634d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2612.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1100")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 deleted file mode 100644 index 1c31421fd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2613.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1001")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 deleted file mode 100644 index a9190d31a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2614.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "0101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 deleted file mode 100644 index 980990f0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2615.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 deleted file mode 100644 index 53cc9805d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2616.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 deleted file mode 100644 index 07acc3e3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2617.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 deleted file mode 100644 index 78286139d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2618.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 deleted file mode 100644 index 418fa3e14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2619.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 deleted file mode 100644 index 1b931529d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2620.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 deleted file mode 100644 index 4e2d25311..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2621.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 deleted file mode 100644 index cb3ccb7c2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2622.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 deleted file mode 100644 index cd36d28e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2623.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 deleted file mode 100644 index f6e4ddd71..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2624.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 deleted file mode 100644 index 0b57bf2d0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2625.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 deleted file mode 100644 index 732fafe8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2626.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 deleted file mode 100644 index ddee7c768..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2627.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 deleted file mode 100644 index 85f278fe3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2628.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 deleted file mode 100644 index 3e7afcdc7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2629.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 deleted file mode 100644 index 9c66b8a7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2630.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 deleted file mode 100644 index 88aee65c8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2631.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 deleted file mode 100644 index 149b293e1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2632.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 deleted file mode 100644 index 486d33386..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2633.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 deleted file mode 100644 index 7b7950cfc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2634.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 deleted file mode 100644 index 19b2fd5ca..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2635.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 deleted file mode 100644 index d94eec6ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2636.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 deleted file mode 100644 index f277f6e98..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2637.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 deleted file mode 100644 index acf5545af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2638.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 deleted file mode 100644 index 4fae99a15..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2639.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 deleted file mode 100644 index d3098385e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2640.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 deleted file mode 100644 index f2edf9afd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2641.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 deleted file mode 100644 index c41afe3c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2642.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 deleted file mode 100644 index 8e13f19d5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2643.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 deleted file mode 100644 index 1392110e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2644.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 deleted file mode 100644 index 82d1f52e3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2645.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 deleted file mode 100644 index 01d931629..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2646.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 deleted file mode 100644 index 7fdc2cad2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2647.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 deleted file mode 100644 index 448fef37e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2648.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 deleted file mode 100644 index 5b7249411..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2649.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 deleted file mode 100644 index 348ff7993..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2650.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 deleted file mode 100644 index d04fed6be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2651.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 deleted file mode 100644 index a39dac555..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2652.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 deleted file mode 100644 index 4505870da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2653.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 deleted file mode 100644 index 310d9403a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2654.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 deleted file mode 100644 index 81a0942a3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2655.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 deleted file mode 100644 index d795c5eed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2656.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 deleted file mode 100644 index a56703910..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2657.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 deleted file mode 100644 index ebdf355f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2658.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 deleted file mode 100644 index e3dae194e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2659.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 deleted file mode 100644 index bc7f24f2c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2660.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 deleted file mode 100644 index e4772d185..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2661.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 deleted file mode 100644 index b4b4e113a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2662.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 deleted file mode 100644 index 43660fbd8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2663.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 deleted file mode 100644 index 9d97e8e45..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2664.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 deleted file mode 100644 index e0e92fc4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2665.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 deleted file mode 100644 index 6a493e34f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2666.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 deleted file mode 100644 index 4b1d0f99a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2667.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 deleted file mode 100644 index 8df6af9a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2668.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 deleted file mode 100644 index 5e88b34b0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2669.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 deleted file mode 100644 index 3ce682e34..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2670.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 deleted file mode 100644 index 42e7f26de..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2671.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 deleted file mode 100644 index d323ea112..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2672.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 deleted file mode 100644 index 64807a01a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2673.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 deleted file mode 100644 index 42d434734..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2674.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 deleted file mode 100644 index 16726e889..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2675.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 deleted file mode 100644 index 0b462cd77..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2676.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 deleted file mode 100644 index d55e08318..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2677.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 deleted file mode 100644 index c93e61cf4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2678.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 deleted file mode 100644 index ac7381eda..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2679.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 deleted file mode 100644 index d6bd6adf1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2680.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 deleted file mode 100644 index c30e758c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2681.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 deleted file mode 100644 index b0cd88e14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2682.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 deleted file mode 100644 index 3b8ed32b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2683.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 deleted file mode 100644 index 640f5357c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2684.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 deleted file mode 100644 index ff81df4a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2685.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 deleted file mode 100644 index 9e5cfb8ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2686.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 deleted file mode 100644 index 862154953..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2687.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 deleted file mode 100644 index e8f00f237..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2688.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 deleted file mode 100644 index f19ffa4d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2689.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 deleted file mode 100644 index 95b0bf96b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2690.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 deleted file mode 100644 index f170edc45..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2691.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 deleted file mode 100644 index 236017e7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2692.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 deleted file mode 100644 index dfc218ce1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2693.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 deleted file mode 100644 index 150416743..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2694.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 deleted file mode 100644 index a2ac87b61..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2695.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "011")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 deleted file mode 100644 index f96e395f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2696.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 deleted file mode 100644 index 0d505abf7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2697.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 deleted file mode 100644 index 74a769cc0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2698.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 deleted file mode 100644 index d7fcb34f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2699.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 deleted file mode 100644 index 65614b8a7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2700.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 deleted file mode 100644 index d9cbc49d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2701.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 deleted file mode 100644 index 337d592a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2702.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 deleted file mode 100644 index 22bc77204..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2703.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 deleted file mode 100644 index 1efe55285..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2704.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 deleted file mode 100644 index 9c2a50c87..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2705.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 deleted file mode 100644 index 0529f08ad..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2706.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 deleted file mode 100644 index d9daab2d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2707.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 deleted file mode 100644 index 0055c0da1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2708.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 deleted file mode 100644 index cd77dbc20..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2709.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 deleted file mode 100644 index 6cac1554e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2710.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 deleted file mode 100644 index 347b51f79..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2711.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 deleted file mode 100644 index f7f3e5642..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2712.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 deleted file mode 100644 index 622003b1f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2713.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 deleted file mode 100644 index d2d1eb070..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2714.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 deleted file mode 100644 index 044887e8b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2715.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 deleted file mode 100644 index 291c74206..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2716.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 deleted file mode 100644 index 1e9eea641..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2717.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 deleted file mode 100644 index 8f760efc9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2718.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 deleted file mode 100644 index 6919a9305..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2719.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 deleted file mode 100644 index bad6b8725..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2720.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 deleted file mode 100644 index 938cc1876..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2721.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 deleted file mode 100644 index 977abe572..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2722.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 deleted file mode 100644 index 8514ac03f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2723.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 deleted file mode 100644 index c8b632aac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2724.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 deleted file mode 100644 index 53683a9f5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2725.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 deleted file mode 100644 index b7071f7cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2726.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 deleted file mode 100644 index da257b11e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2727.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 deleted file mode 100644 index d3e5dc786..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2728.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 deleted file mode 100644 index 4b9305aa1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2729.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 deleted file mode 100644 index 408da78d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2730.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 deleted file mode 100644 index 1468c55d8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2731.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 deleted file mode 100644 index dac9554e7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2732.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 deleted file mode 100644 index c18c807b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2733.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 deleted file mode 100644 index 217783c5a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2734.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 deleted file mode 100644 index d7af246b3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2735.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 deleted file mode 100644 index 79a2eccde..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2736.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 deleted file mode 100644 index 7bd0c9b4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2737.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 deleted file mode 100644 index 052c0a9a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2738.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 deleted file mode 100644 index 736ed9ac0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2739.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 deleted file mode 100644 index 4d57fa837..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2740.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 deleted file mode 100644 index 59137c285..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2741.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 deleted file mode 100644 index 8521439c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2742.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 deleted file mode 100644 index 258f35b20..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2743.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 deleted file mode 100644 index 3c2e24977..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2744.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 deleted file mode 100644 index b7c745923..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2745.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 deleted file mode 100644 index 7eeb3a6e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2746.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 deleted file mode 100644 index 350c481f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2747.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 deleted file mode 100644 index 213156e73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2748.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 deleted file mode 100644 index 062c89aa4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2749.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 deleted file mode 100644 index 5a8a29a1e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2750.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 deleted file mode 100644 index 2eb5272f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2751.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 deleted file mode 100644 index 61e491585..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2752.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 deleted file mode 100644 index 82701a1be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2753.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 deleted file mode 100644 index 11f3d63b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2754.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 deleted file mode 100644 index ee27c1a77..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2755.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 deleted file mode 100644 index eb29ac609..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2756.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 deleted file mode 100644 index c74a54ee1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2757.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 deleted file mode 100644 index 922c1b6f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2758.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 deleted file mode 100644 index 2719d078b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2759.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 deleted file mode 100644 index 911df6f2a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2760.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 deleted file mode 100644 index 9ee1effdf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2761.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 deleted file mode 100644 index 18d5bb0ef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2762.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 deleted file mode 100644 index 73794173d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2763.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 deleted file mode 100644 index cd212e6f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2764.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 deleted file mode 100644 index 45d46fc4e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2765.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 deleted file mode 100644 index 040a9c92d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2766.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 deleted file mode 100644 index 44b77dfcb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2767.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 deleted file mode 100644 index e03074f34..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2768.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 deleted file mode 100644 index 7a97806b2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2769.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 deleted file mode 100644 index bb94997c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2770.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 deleted file mode 100644 index 123c21b58..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2771.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 deleted file mode 100644 index 2d9b0d07a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2772.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 deleted file mode 100644 index 4c278ad32..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2773.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 deleted file mode 100644 index 7ee89f2e1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2774.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 deleted file mode 100644 index 1c5b63f6e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2775.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 deleted file mode 100644 index 821ff94a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2776.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 deleted file mode 100644 index 4960bb91b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2777.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 deleted file mode 100644 index 30c8781c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2778.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 deleted file mode 100644 index e9c9e87dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2779.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 deleted file mode 100644 index 29dd7a418..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2780.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 deleted file mode 100644 index 8cabc56cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2781.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 deleted file mode 100644 index ce5fce671..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2782.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 deleted file mode 100644 index f24333752..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2783.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 deleted file mode 100644 index eb185b20d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2784.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 deleted file mode 100644 index 861b104d0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2785.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 deleted file mode 100644 index e02d7ae63..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2786.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 deleted file mode 100644 index 9e773910c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2787.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 deleted file mode 100644 index 071f0573a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2788.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 deleted file mode 100644 index 71f0cd8bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2789.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 deleted file mode 100644 index f027a361f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2790.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 deleted file mode 100644 index 5be7b01e3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2791.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 deleted file mode 100644 index a38871595..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2792.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 deleted file mode 100644 index 884081cea..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2793.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 deleted file mode 100644 index a5c66c3be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2794.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 deleted file mode 100644 index ed44b5213..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2795.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 deleted file mode 100644 index 638c28265..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2796.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 deleted file mode 100644 index 2f1af8f12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2797.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 deleted file mode 100644 index 3165e0de9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2798.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 deleted file mode 100644 index af171d2dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2799.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 deleted file mode 100644 index 8c65883e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2800.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 deleted file mode 100644 index 1b9825c73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2801.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 deleted file mode 100644 index d2b5806bb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2802.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 deleted file mode 100644 index cc43dec4b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2803.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 deleted file mode 100644 index 7989fe67b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2804.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 deleted file mode 100644 index 5ab121a32..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2805.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 deleted file mode 100644 index 1e2ac3b92..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2806.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 deleted file mode 100644 index 3a55f160f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2807.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 deleted file mode 100644 index 7fb4db754..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2808.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 deleted file mode 100644 index 2213ac8ad..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2809.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 deleted file mode 100644 index 9480969c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2810.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 deleted file mode 100644 index 1b79623b2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2811.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 deleted file mode 100644 index c50686a6f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2812.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 deleted file mode 100644 index 2a58c3db2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2813.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 deleted file mode 100644 index 74d159df5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2814.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 deleted file mode 100644 index bbe1347e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2815.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 deleted file mode 100644 index 494281043..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2816.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 deleted file mode 100644 index 78ff46b24..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2817.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 deleted file mode 100644 index 05e6aab78..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2818.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 deleted file mode 100644 index 8ee643647..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2819.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 deleted file mode 100644 index cda9f5036..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2820.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 deleted file mode 100644 index d5f19aceb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2821.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 deleted file mode 100644 index 41fb7b84b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2822.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 deleted file mode 100644 index 0d80574a3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2823.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 deleted file mode 100644 index 99355dae6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2824.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 deleted file mode 100644 index 2b7cb6bcf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2825.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 deleted file mode 100644 index 1d3935187..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2826.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 deleted file mode 100644 index 9376adba3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2827.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 deleted file mode 100644 index a4d996bce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2828.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 deleted file mode 100644 index edee350a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2829.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 deleted file mode 100644 index 7a20c53bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2830.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 deleted file mode 100644 index 424682dc9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2831.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 deleted file mode 100644 index c91340054..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2832.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 deleted file mode 100644 index 16cad6a92..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2833.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 deleted file mode 100644 index 05654d700..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2834.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 deleted file mode 100644 index 2aaf76acf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2835.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 deleted file mode 100644 index 95ba2490d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2836.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 deleted file mode 100644 index 1bf0f3937..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2837.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 deleted file mode 100644 index 7cb1938dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2838.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 deleted file mode 100644 index 7e06c7bb8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2839.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 deleted file mode 100644 index 261d15775..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2840.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 deleted file mode 100644 index 5e1c9df12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2841.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 deleted file mode 100644 index 8df6e7785..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2842.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 deleted file mode 100644 index ec058ecdb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2843.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 deleted file mode 100644 index 48b3ec054..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2844.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 deleted file mode 100644 index b16aa35e3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2845.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 deleted file mode 100644 index 96b812a8b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2846.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 deleted file mode 100644 index e174e07ac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2847.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 deleted file mode 100644 index 7abcb3cba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2848.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 deleted file mode 100644 index 3368f8d3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2849.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 deleted file mode 100644 index d394c6875..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2850.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 deleted file mode 100644 index bdbf29aab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2851.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 deleted file mode 100644 index a46b59e5b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2852.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 deleted file mode 100644 index 929f3f2e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2853.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 deleted file mode 100644 index fe86a04b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2854.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 deleted file mode 100644 index c2c2dd5ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2855.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 deleted file mode 100644 index b385abeb8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2856.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 deleted file mode 100644 index 3ae8d95f0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2857.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 deleted file mode 100644 index 479cc7f2e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2858.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 deleted file mode 100644 index 8ac852aff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2859.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 deleted file mode 100644 index 33e56d69b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2860.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 deleted file mode 100644 index 366be655d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2861.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 deleted file mode 100644 index 2b2947f13..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2862.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 deleted file mode 100644 index 18a646f58..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2863.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 deleted file mode 100644 index 788a1b679..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2864.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 deleted file mode 100644 index a61ccca5d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2865.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 deleted file mode 100644 index 2d67c1744..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2866.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 deleted file mode 100644 index 6acddb633..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2867.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 deleted file mode 100644 index 81a4798b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2868.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 deleted file mode 100644 index f63127280..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2869.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 deleted file mode 100644 index 4c8266b3b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2870.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 deleted file mode 100644 index 39dbfacda..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2871.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 deleted file mode 100644 index 65541079c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2872.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 deleted file mode 100644 index eceb9057b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2873.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 deleted file mode 100644 index a15aff587..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2874.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 deleted file mode 100644 index 20c5a6953..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2875.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 deleted file mode 100644 index 92b401c2e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2876.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 deleted file mode 100644 index f8f60539c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2877.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 deleted file mode 100644 index 7f48f704d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2878.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 deleted file mode 100644 index c5700fd8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2879.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 deleted file mode 100644 index 1865d0a0e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2880.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 deleted file mode 100644 index d55e401ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2881.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 deleted file mode 100644 index 7d2d528f3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2882.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 deleted file mode 100644 index 9a301acf1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2883.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 deleted file mode 100644 index 1f872b2f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2884.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 deleted file mode 100644 index 061e9f546..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2885.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 deleted file mode 100644 index 1f9f7a125..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2886.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 deleted file mode 100644 index 7c98279b4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2887.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 deleted file mode 100644 index 1ec3dac6b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2888.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 deleted file mode 100644 index 6eefb7a41..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2889.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 deleted file mode 100644 index 7f548c755..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2890.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 deleted file mode 100644 index e4e8fdee8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2891.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 deleted file mode 100644 index 5b62edf6f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2892.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 deleted file mode 100644 index 132b95d65..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2893.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 deleted file mode 100644 index ec99609fe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2894.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 deleted file mode 100644 index 35f46660f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2895.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 deleted file mode 100644 index 73a1adea2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2896.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 deleted file mode 100644 index edfb2c7f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2897.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 deleted file mode 100644 index d82756591..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2898.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 deleted file mode 100644 index 206a1491f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2899.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 deleted file mode 100644 index 8ce3397cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2900.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 deleted file mode 100644 index 497711bba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2901.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 deleted file mode 100644 index 51f86fb8b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2902.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 deleted file mode 100644 index 92d989611..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2903.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 deleted file mode 100644 index 1e633adb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2904.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 deleted file mode 100644 index 19a430416..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2905.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 deleted file mode 100644 index fad86330c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2906.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 deleted file mode 100644 index 7ca454ae4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2907.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 deleted file mode 100644 index 5def8d889..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2908.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 deleted file mode 100644 index bd93dea7f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2909.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 deleted file mode 100644 index 785d19701..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2910.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 deleted file mode 100644 index 16bd068bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2911.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 deleted file mode 100644 index dbdac5260..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2912.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 deleted file mode 100644 index 127e2b69d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2913.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 deleted file mode 100644 index 86badfcb2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2914.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 deleted file mode 100644 index 3d89c1b07..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2915.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 deleted file mode 100644 index 630b05b26..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2916.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 deleted file mode 100644 index 2d3927d53..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2917.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 deleted file mode 100644 index 335de04f8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2918.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 deleted file mode 100644 index 4e54c5900..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2919.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 deleted file mode 100644 index b2916191c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2920.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 deleted file mode 100644 index 8ea512051..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2921.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 deleted file mode 100644 index 8304ac8db..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2922.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 deleted file mode 100644 index 7c7a0bba4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2923.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 deleted file mode 100644 index fe546b15f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2924.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 deleted file mode 100644 index 4346d3d9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2925.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 deleted file mode 100644 index 80693c837..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2926.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 deleted file mode 100644 index 662f9ef98..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2927.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 deleted file mode 100644 index d5cf808b8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2928.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 deleted file mode 100644 index 38074c722..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2929.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 deleted file mode 100644 index d6affff3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2930.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 deleted file mode 100644 index ce694da3e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2931.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 deleted file mode 100644 index d869dbb8c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2932.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 deleted file mode 100644 index 8300dd689..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2933.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 deleted file mode 100644 index 2f81909f6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2934.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 deleted file mode 100644 index f48e20fc3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2935.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 deleted file mode 100644 index 276bd8698..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2936.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 deleted file mode 100644 index ddce0365d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2937.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 deleted file mode 100644 index 18ddcc4a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2938.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 deleted file mode 100644 index 97b79fe0e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2939.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 deleted file mode 100644 index 3e2729969..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2940.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 deleted file mode 100644 index b999f6e0d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2941.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 deleted file mode 100644 index bc2e0dbe0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2942.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 deleted file mode 100644 index 1f6d1b769..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2943.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 deleted file mode 100644 index 50d554f83..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2944.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 deleted file mode 100644 index 06a0e8894..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2945.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 deleted file mode 100644 index a504f3979..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2946.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 deleted file mode 100644 index 05eabe4b2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2947.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 deleted file mode 100644 index f9b00d9cc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2948.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 deleted file mode 100644 index 199a09905..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2949.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 deleted file mode 100644 index db7a92663..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2950.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 deleted file mode 100644 index 72919c76f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2951.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 deleted file mode 100644 index 7b8937db2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2952.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 deleted file mode 100644 index a017e5d13..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2953.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 deleted file mode 100644 index 87b5d6b5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2954.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 deleted file mode 100644 index b45403d9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2955.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 deleted file mode 100644 index 4892214f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2956.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 deleted file mode 100644 index 2c50f97a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2957.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 deleted file mode 100644 index 57efc4cb8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2958.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 deleted file mode 100644 index b2a035d38..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2959.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 deleted file mode 100644 index 05244fb3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2960.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 deleted file mode 100644 index 3e2a0e265..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2961.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 deleted file mode 100644 index 0082f24b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2962.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 deleted file mode 100644 index 408f28476..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2963.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 deleted file mode 100644 index 2f9e34b7a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2964.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 deleted file mode 100644 index 604cfa6de..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2965.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 deleted file mode 100644 index 595e2e7cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2966.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 deleted file mode 100644 index f94d23a08..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2967.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 deleted file mode 100644 index c5d00999d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2968.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 deleted file mode 100644 index 1c8a70f61..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2969.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 deleted file mode 100644 index 4d48d912a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2970.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 deleted file mode 100644 index 335f1efa7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2971.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 deleted file mode 100644 index aef0c9b35..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2972.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 deleted file mode 100644 index 093b2890a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2973.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 deleted file mode 100644 index 3f9b12b11..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2974.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 deleted file mode 100644 index a51502c67..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2975.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 deleted file mode 100644 index 0464a63e0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2976.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 deleted file mode 100644 index 8e0618119..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2977.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 deleted file mode 100644 index fe43e3bc3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2978.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 deleted file mode 100644 index 28bae2aa4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2979.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 deleted file mode 100644 index de215e588..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2980.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 deleted file mode 100644 index 80211c65f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2981.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 deleted file mode 100644 index 808a192ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2982.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 deleted file mode 100644 index f7e85b483..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2983.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 deleted file mode 100644 index 00c0300ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2984.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 deleted file mode 100644 index 191a1aed1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2985.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 deleted file mode 100644 index b511ada67..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2986.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 deleted file mode 100644 index 61bfb3d0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2987.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 deleted file mode 100644 index c191bfe57..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2988.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 deleted file mode 100644 index 2b71795f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2989.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 deleted file mode 100644 index 4491bfb16..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2990.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 deleted file mode 100644 index 032f710d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2991.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 deleted file mode 100644 index a364105ee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2992.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 deleted file mode 100644 index 2d6999c8a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2993.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 deleted file mode 100644 index 6d030f7fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2994.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 deleted file mode 100644 index afbe44462..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2995.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 deleted file mode 100644 index c67578be6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2996.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 deleted file mode 100644 index 9ae39eb6a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2997.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 deleted file mode 100644 index a3b4c84a1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2998.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 deleted file mode 100644 index 479a88bbe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2999.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 deleted file mode 100644 index 6cd0ab10f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3000.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 deleted file mode 100644 index b0fe0a754..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3001.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 deleted file mode 100644 index fcbd0305d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3002.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 deleted file mode 100644 index 980a23082..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3003.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 deleted file mode 100644 index 5a7191676..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3004.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 deleted file mode 100644 index ef66c8108..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3005.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 deleted file mode 100644 index d0198bcf0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3006.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 deleted file mode 100644 index 44729269f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3007.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 deleted file mode 100644 index 4efd2e987..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3008.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 deleted file mode 100644 index 9a19cbeeb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3009.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 deleted file mode 100644 index 477c2235d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3010.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 deleted file mode 100644 index 5f4825a33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3011.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 deleted file mode 100644 index 09b9ccb61..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3012.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 deleted file mode 100644 index 1f98362c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3013.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 deleted file mode 100644 index c9f50b4d2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3014.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 deleted file mode 100644 index 19b8940c0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3015.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 deleted file mode 100644 index e0d760cf3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3016.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 deleted file mode 100644 index 9d740b692..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3017.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 deleted file mode 100644 index 4b99e1cd4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3018.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 deleted file mode 100644 index 14b223876..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3019.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 deleted file mode 100644 index 4d7855edb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3020.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 deleted file mode 100644 index 26b6fa495..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3021.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 deleted file mode 100644 index d9af6e44f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3022.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 deleted file mode 100644 index a985cc783..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3023.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 deleted file mode 100644 index de73db916..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3024.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 deleted file mode 100644 index 628e37064..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3025.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 deleted file mode 100644 index f849c0b96..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3026.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 deleted file mode 100644 index 6c692e44e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3027.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 deleted file mode 100644 index fc90bbbd5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3028.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 deleted file mode 100644 index 0af81e3da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3029.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 deleted file mode 100644 index 54b4133f0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3030.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 deleted file mode 100644 index ee921c729..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3031.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 deleted file mode 100644 index 6d78ac0e0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3032.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 deleted file mode 100644 index e27609773..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3033.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 deleted file mode 100644 index e992bca56..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3034.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 deleted file mode 100644 index 109082663..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3035.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 deleted file mode 100644 index 36f599d02..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3036.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 deleted file mode 100644 index c10a3538b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3037.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 deleted file mode 100644 index 40a638eb4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3038.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 deleted file mode 100644 index e6b67c31e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3039.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 deleted file mode 100644 index 031b7d22d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3040.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 deleted file mode 100644 index c5794cec5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3041.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 deleted file mode 100644 index 7c5f53041..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3042.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 deleted file mode 100644 index 42b413a20..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3043.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "01")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 deleted file mode 100644 index 3fefe4fdc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3044.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 deleted file mode 100644 index 9d5db9c4f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3045.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 deleted file mode 100644 index fd3b58d94..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3046.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 deleted file mode 100644 index ab6a1fb17..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3047.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 deleted file mode 100644 index 9b8ba2e72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3048.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 deleted file mode 100644 index 8f73fd6dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3049.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 deleted file mode 100644 index 1b0a9102b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3050.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 deleted file mode 100644 index f8e509d75..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3051.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 deleted file mode 100644 index eceb3d8b8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3052.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 deleted file mode 100644 index 0651cb494..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3053.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 deleted file mode 100644 index edbefb714..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3054.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 deleted file mode 100644 index fc0e28887..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3055.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 deleted file mode 100644 index ac481d00f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3056.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 deleted file mode 100644 index de890f328..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3057.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 deleted file mode 100644 index c180a57ee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3058.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 deleted file mode 100644 index dde3ecad8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3059.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 deleted file mode 100644 index 71a67b14c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3060.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 deleted file mode 100644 index cc9dc66cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3061.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 deleted file mode 100644 index d3599b0a9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3062.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 deleted file mode 100644 index 65eb89d0c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3063.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 deleted file mode 100644 index be5f4d774..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3064.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 deleted file mode 100644 index 7ed31488a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3065.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 deleted file mode 100644 index 51f08c141..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3066.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 deleted file mode 100644 index fe1ea15c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3067.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 deleted file mode 100644 index 5eb0a86f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3068.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 deleted file mode 100644 index 0874db601..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3069.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 deleted file mode 100644 index fbd969789..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3070.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 deleted file mode 100644 index e0cb19c87..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3071.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 deleted file mode 100644 index a026f578a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3072.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 deleted file mode 100644 index 0a68daeb6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3073.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 deleted file mode 100644 index 6e46793d2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3074.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 deleted file mode 100644 index 507ae6a9a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3075.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 deleted file mode 100644 index d302af4d4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3076.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1010")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 deleted file mode 100644 index bd7869f20..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3077.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 deleted file mode 100644 index f239adba9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3078.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "111")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 deleted file mode 100644 index a98f35086..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3079.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "110")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 deleted file mode 100644 index 144d68b13..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3080.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "101")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 deleted file mode 100644 index 147630e55..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3081.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 deleted file mode 100644 index 71cd57347..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3082.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 deleted file mode 100644 index 7b9bf4af7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3083.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "100")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 deleted file mode 100644 index b93dd0a15..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3084.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 deleted file mode 100644 index 36515041f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3085.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "000")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 deleted file mode 100644 index 776ad3948..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3086.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 deleted file mode 100644 index b391ef78d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3087.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 deleted file mode 100644 index 69ee56e64..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3088.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 deleted file mode 100644 index 139301e23..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3089.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 deleted file mode 100644 index d44b3082e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3090.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 deleted file mode 100644 index ccd438fc1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3091.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 deleted file mode 100644 index 075404af7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3092.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 deleted file mode 100644 index 33f7a54aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3093.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 deleted file mode 100644 index d64b73318..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3094.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 deleted file mode 100644 index 48286d9d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3095.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 deleted file mode 100644 index 9660bc1b3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3096.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 deleted file mode 100644 index 3dfef7db8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3097.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 deleted file mode 100644 index c987e3a94..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3098.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 deleted file mode 100644 index 29d21cbd0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3099.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 deleted file mode 100644 index a5afa22ec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3100.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 deleted file mode 100644 index d08fa3eb5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3101.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 deleted file mode 100644 index b0a1bceb4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3102.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 deleted file mode 100644 index 6318d7ee6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3103.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 deleted file mode 100644 index 5e7cab744..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3104.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 deleted file mode 100644 index 8f0181486..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3105.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 deleted file mode 100644 index 1b55e6275..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3106.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 deleted file mode 100644 index f123f6c16..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3107.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 deleted file mode 100644 index 862c5ce71..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3108.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 deleted file mode 100644 index 8d66d312c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3109.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 deleted file mode 100644 index 46ad12c2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3110.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 deleted file mode 100644 index c6ca73d3d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3111.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 deleted file mode 100644 index 4bd62d02b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3112.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 deleted file mode 100644 index 91717fee1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3113.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 deleted file mode 100644 index 30157ab94..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3114.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 deleted file mode 100644 index 5bf339671..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3115.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 deleted file mode 100644 index 3e08da216..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3116.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 deleted file mode 100644 index ff015a338..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3117.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 deleted file mode 100644 index bb36b37df..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3118.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 deleted file mode 100644 index a7ff77a58..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3119.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 deleted file mode 100644 index 4c821fcd8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3120.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 deleted file mode 100644 index 8f964c553..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3121.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 deleted file mode 100644 index 4baa35e5a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3122.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 deleted file mode 100644 index 70e947708..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3123.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 deleted file mode 100644 index a47556ca6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3124.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 deleted file mode 100644 index b20bd3504..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3125.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 deleted file mode 100644 index c3918551f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3126.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 deleted file mode 100644 index 70f8aa8bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3127.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 deleted file mode 100644 index d239500a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3128.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 deleted file mode 100644 index 1746c1431..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3129.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 deleted file mode 100644 index 16fd0dc17..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3130.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 deleted file mode 100644 index 9251ab57e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3131.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 deleted file mode 100644 index 15c63b06e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3132.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 deleted file mode 100644 index 40cdf970f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3133.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 deleted file mode 100644 index 8237eb2b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3134.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 deleted file mode 100644 index b884b9b87..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3135.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 deleted file mode 100644 index 6d351687a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3136.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 deleted file mode 100644 index 6a002288c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3137.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 deleted file mode 100644 index a576856c1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3138.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 deleted file mode 100644 index b8096f3f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3139.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 deleted file mode 100644 index 81ed7846a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3140.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 deleted file mode 100644 index 7776af340..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3141.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 deleted file mode 100644 index c1759e1a5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3142.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 deleted file mode 100644 index a785f01b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3143.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 deleted file mode 100644 index f7e1c46d6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3144.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 deleted file mode 100644 index 1039a20d2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3145.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 deleted file mode 100644 index 4361987cb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3146.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 deleted file mode 100644 index de37e31fd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3147.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 deleted file mode 100644 index 59b565a2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3148.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 deleted file mode 100644 index 0d3311c33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3149.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 deleted file mode 100644 index e0daa963b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3150.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 deleted file mode 100644 index 89217c166..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3151.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 deleted file mode 100644 index 6e745d85f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3152.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 deleted file mode 100644 index 34e326e48..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3153.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 deleted file mode 100644 index 0182b4fe6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3154.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 deleted file mode 100644 index 18898562b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3155.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 deleted file mode 100644 index 947b9dfe9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3156.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 deleted file mode 100644 index fb7d0ef25..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3157.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 deleted file mode 100644 index 2348b4cc2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3158.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 deleted file mode 100644 index 6709c6375..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3159.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 deleted file mode 100644 index 7b1a36741..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3160.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 deleted file mode 100644 index 74828dbd3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3161.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 deleted file mode 100644 index 836d5fbda..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3162.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 deleted file mode 100644 index a2e6636d6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3163.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 deleted file mode 100644 index fb7cfad7b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3164.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 deleted file mode 100644 index 227b8293a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3165.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 deleted file mode 100644 index 28caf50dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3166.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 deleted file mode 100644 index 2d033da84..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3167.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 deleted file mode 100644 index 18c16b339..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3168.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 deleted file mode 100644 index 5a3e98797..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3169.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1001")) -(assert (= Bottom_0 "0")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 deleted file mode 100644 index f1314be73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_500.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 deleted file mode 100644 index dc8ccb58c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_501.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 deleted file mode 100644 index af47b742f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_502.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 deleted file mode 100644 index 54b9cef2f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_503.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 deleted file mode 100644 index 12ab13259..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_504.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 deleted file mode 100644 index 86cc2c104..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_505.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 deleted file mode 100644 index ce1be41d0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_506.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 deleted file mode 100644 index a3b052249..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_507.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 deleted file mode 100644 index 6538850e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_508.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 deleted file mode 100644 index 3f407e100..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_509.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 deleted file mode 100644 index e80cd6f4e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_510.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 deleted file mode 100644 index 5d37deb5f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_511.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 deleted file mode 100644 index de9338958..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_512.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 deleted file mode 100644 index 6ec463b95..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_513.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 deleted file mode 100644 index b28958448..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_514.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 deleted file mode 100644 index 1501ee224..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_515.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 deleted file mode 100644 index 412f22fef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_516.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 deleted file mode 100644 index 81c413c97..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_517.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 deleted file mode 100644 index 1bf32d593..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_518.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 deleted file mode 100644 index eed4b58fe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_519.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 deleted file mode 100644 index 465b19087..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_520.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 deleted file mode 100644 index 8fea9c241..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_521.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 deleted file mode 100644 index f9af10f40..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_522.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 deleted file mode 100644 index 4bbe0edf4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_523.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 deleted file mode 100644 index 993e42044..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_524.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 deleted file mode 100644 index 9b62c627f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_525.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 deleted file mode 100644 index eb8e5b448..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_526.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 deleted file mode 100644 index 31f2010bf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_527.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 deleted file mode 100644 index 138be6fe9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_528.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 deleted file mode 100644 index bb06bc554..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_529.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 deleted file mode 100644 index 115bf964a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_530.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 deleted file mode 100644 index 878bee1fd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_531.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 deleted file mode 100644 index c27c7a6a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_532.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 deleted file mode 100644 index 16afa0b94..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_533.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 deleted file mode 100644 index 9c0eb8eb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_534.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 deleted file mode 100644 index 9bd267677..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_535.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 deleted file mode 100644 index c7eda0d5b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_536.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 deleted file mode 100644 index 3a0c35862..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_537.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 deleted file mode 100644 index b929e643b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_538.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 deleted file mode 100644 index 975ff5657..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_539.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 deleted file mode 100644 index 3fba6fd49..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_540.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 deleted file mode 100644 index 027042a4a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_541.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 deleted file mode 100644 index 9f9cda43a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_542.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 deleted file mode 100644 index 39fd639d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_543.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "111")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 deleted file mode 100644 index 02247760e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_544.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 deleted file mode 100644 index ccdb963f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_545.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 deleted file mode 100644 index b0a247f9e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_546.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 deleted file mode 100644 index ba5359cee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_547.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 deleted file mode 100644 index e88c4fbdd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_548.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 deleted file mode 100644 index 24ba6c5b6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_549.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 deleted file mode 100644 index f4427795a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_550.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 deleted file mode 100644 index c09dcff2d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_551.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 deleted file mode 100644 index ec8495227..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_552.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 deleted file mode 100644 index 2fba26c65..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_553.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 deleted file mode 100644 index a2229803d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_554.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 deleted file mode 100644 index 258dc616e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_555.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 deleted file mode 100644 index 18e0537a7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_556.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 deleted file mode 100644 index 4a085a130..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_557.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 deleted file mode 100644 index 552de6423..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_558.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 deleted file mode 100644 index 2167a58ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_559.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 deleted file mode 100644 index c3eefd8e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_560.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 deleted file mode 100644 index d3a8e828f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_561.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 deleted file mode 100644 index 70045248f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_562.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 deleted file mode 100644 index 966d15447..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_563.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 deleted file mode 100644 index 7650e9e64..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_564.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 deleted file mode 100644 index 41489a9c5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_565.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 deleted file mode 100644 index a0a2f86c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_566.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 deleted file mode 100644 index a908675ee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_567.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 deleted file mode 100644 index 27056f1af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_568.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 deleted file mode 100644 index abcf09d89..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_569.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 deleted file mode 100644 index 6ec05ea74..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_570.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 deleted file mode 100644 index 8776673d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_571.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 deleted file mode 100644 index c42569568..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_572.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 deleted file mode 100644 index 5e340b6a6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_573.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 deleted file mode 100644 index ebdc143e1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_574.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 deleted file mode 100644 index 3218e5dfa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_575.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 deleted file mode 100644 index f96673b0d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_576.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 deleted file mode 100644 index eb38dc23c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_577.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 deleted file mode 100644 index 08d8e3283..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_578.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 deleted file mode 100644 index 10af17f5c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_579.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 deleted file mode 100644 index 3240e36e1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_580.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 deleted file mode 100644 index 4e1c33598..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_581.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 deleted file mode 100644 index c30345acc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_582.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 deleted file mode 100644 index 21dcce7f9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_583.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 deleted file mode 100644 index a0c205804..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_584.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 deleted file mode 100644 index ae959ff9e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_585.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 deleted file mode 100644 index 5a39ab82e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_586.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 deleted file mode 100644 index 81f424aef..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_587.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 deleted file mode 100644 index 8eab7c958..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_588.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 deleted file mode 100644 index 39529c83b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_589.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 deleted file mode 100644 index 1cad04a54..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_590.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 deleted file mode 100644 index 532b222e6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_591.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 deleted file mode 100644 index 569541915..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_592.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 deleted file mode 100644 index 7205ba725..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_593.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 deleted file mode 100644 index 1b2057b70..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_594.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 deleted file mode 100644 index 7fd5bbee8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_595.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 deleted file mode 100644 index 9ece190bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_596.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 deleted file mode 100644 index aff18c4f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_597.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 deleted file mode 100644 index 56ea0fb0a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_598.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 deleted file mode 100644 index f3f2533b0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_599.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 deleted file mode 100644 index f4775e4b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_600.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 deleted file mode 100644 index d3372c036..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_601.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 deleted file mode 100644 index d7a944665..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_602.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 deleted file mode 100644 index ba4485844..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_603.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 deleted file mode 100644 index 81c802f4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_604.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 deleted file mode 100644 index 11ac08d9c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_605.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 deleted file mode 100644 index a411b95de..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_606.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 deleted file mode 100644 index a70119e25..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_607.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 deleted file mode 100644 index 7c9f3aad2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_608.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 deleted file mode 100644 index ed0dcdf44..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_609.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 deleted file mode 100644 index db591fe8b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_610.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 deleted file mode 100644 index 210b99810..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_611.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 deleted file mode 100644 index 1e3689d8a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_612.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 deleted file mode 100644 index c2c3822bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_613.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 deleted file mode 100644 index 50248438d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_614.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 deleted file mode 100644 index 82c49637d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_615.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 deleted file mode 100644 index 4c65592f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_616.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 deleted file mode 100644 index 8d7b6a254..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_617.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 deleted file mode 100644 index cd5e79ea6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_618.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 deleted file mode 100644 index 610b3f76b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_619.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 deleted file mode 100644 index f4e86d0a7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_620.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 deleted file mode 100644 index d824b9821..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_621.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 deleted file mode 100644 index 8cf1d034d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_622.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 deleted file mode 100644 index 8fc95168d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_623.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 deleted file mode 100644 index e3a2dcefa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_624.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 deleted file mode 100644 index b92f94dde..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_625.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 deleted file mode 100644 index 1f7a9c4af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_626.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 deleted file mode 100644 index 08ee8d368..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_627.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 deleted file mode 100644 index f014e57ab..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_628.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 deleted file mode 100644 index 90ed11729..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_629.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 deleted file mode 100644 index 6da9985f7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_630.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 deleted file mode 100644 index 29b04d065..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_631.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 deleted file mode 100644 index ea45632ba..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_632.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 deleted file mode 100644 index cf900c567..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_633.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 deleted file mode 100644 index e7291cdcb..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_634.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 deleted file mode 100644 index 91397c002..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_635.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 deleted file mode 100644 index fff9b28e0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_636.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 deleted file mode 100644 index 7ab159aa7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_637.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 deleted file mode 100644 index 983e8ed40..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_638.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 deleted file mode 100644 index e31950197..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_639.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 deleted file mode 100644 index 378ce4f9b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_640.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 deleted file mode 100644 index b40f49cbf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_641.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 deleted file mode 100644 index 1e6db406e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_642.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 deleted file mode 100644 index 3dc149b1c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_643.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 deleted file mode 100644 index 27c2363c4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_644.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 deleted file mode 100644 index 5f419fd5d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_645.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 deleted file mode 100644 index db87f950d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_646.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 deleted file mode 100644 index 66b049453..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_647.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 deleted file mode 100644 index 5020b97d5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_648.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 deleted file mode 100644 index d56b5594c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_649.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 deleted file mode 100644 index 9299df8e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_650.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 deleted file mode 100644 index 20929bc5e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_651.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 deleted file mode 100644 index 617e16ea1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_652.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 deleted file mode 100644 index d51b7753d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_653.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 deleted file mode 100644 index e198dcbf5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_654.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 deleted file mode 100644 index 835ba59b5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_655.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 deleted file mode 100644 index f3db8cd3c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_656.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "0100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 deleted file mode 100644 index 8fa359263..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_657.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 deleted file mode 100644 index aa2cd241b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_658.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 deleted file mode 100644 index 98f5c70d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_659.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 deleted file mode 100644 index 0bb6d34b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_660.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 deleted file mode 100644 index 88b6c5f1d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_661.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 deleted file mode 100644 index 6125541b8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_662.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 deleted file mode 100644 index 347969faf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_663.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 deleted file mode 100644 index 74a6f00fc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_664.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 deleted file mode 100644 index 5d139c84f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_665.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "11")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0")) -(assert (= Bottom_1 "100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 deleted file mode 100644 index 9ae45dcc0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_666.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 deleted file mode 100644 index 016f93fda..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_667.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 deleted file mode 100644 index dbd8e76c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_668.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 deleted file mode 100644 index 09f823dac..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_669.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 deleted file mode 100644 index 7d22e06cf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_670.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 deleted file mode 100644 index 40d99aa60..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_671.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 deleted file mode 100644 index 673b7a2a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_672.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 deleted file mode 100644 index 1bec93311..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_673.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 deleted file mode 100644 index 7aee669be..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_674.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 deleted file mode 100644 index 26469b207..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_675.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 deleted file mode 100644 index f0036cd64..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_676.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 deleted file mode 100644 index 650a77a77..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_677.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 deleted file mode 100644 index b8aaf957e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_678.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 deleted file mode 100644 index 4427cc1f1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_679.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 deleted file mode 100644 index 61215fbaa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_680.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 deleted file mode 100644 index be2c06aa4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_681.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 deleted file mode 100644 index 2ec789d58..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_682.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 deleted file mode 100644 index f7db28559..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_683.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 deleted file mode 100644 index 5e9f7b737..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_684.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 deleted file mode 100644 index e611c9759..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_685.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 deleted file mode 100644 index f1fdc159a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_686.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0111")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 deleted file mode 100644 index 01bac4929..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_687.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 deleted file mode 100644 index fdc109223..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_688.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 deleted file mode 100644 index bb9d8598d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_689.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 deleted file mode 100644 index a7a267504..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_690.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 deleted file mode 100644 index 7bec1d955..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_691.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 deleted file mode 100644 index 38735a134..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_692.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 deleted file mode 100644 index 125cbc6dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_693.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 deleted file mode 100644 index dedd3157b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_694.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 deleted file mode 100644 index e71d21329..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_695.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 deleted file mode 100644 index a098694c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_696.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 deleted file mode 100644 index 3e3a64dcc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_697.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 deleted file mode 100644 index 99197209b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_698.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 deleted file mode 100644 index 2ccdbb521..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_699.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0011")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 deleted file mode 100644 index 7ea6dd79c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_700.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 deleted file mode 100644 index 31a364046..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_701.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 deleted file mode 100644 index 9cb816dae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_702.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 deleted file mode 100644 index 8daf96014..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_703.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 deleted file mode 100644 index 1430c5dd3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_704.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 deleted file mode 100644 index 88859192f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_705.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 deleted file mode 100644 index df6f6ac29..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_706.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 deleted file mode 100644 index 8d162b9a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_707.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 deleted file mode 100644 index 2a4b5b844..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_708.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 deleted file mode 100644 index 9f1cba8da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_709.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 deleted file mode 100644 index 0fb6814af..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_710.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 deleted file mode 100644 index 52499f25c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_711.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 deleted file mode 100644 index 5385dec1e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_712.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 deleted file mode 100644 index 2826d680b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_713.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 deleted file mode 100644 index 59d1caa92..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_714.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 deleted file mode 100644 index e84e58f1a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_715.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 deleted file mode 100644 index c54eeda8e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_716.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 deleted file mode 100644 index c4beda998..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_717.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 deleted file mode 100644 index 5440c0709..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_718.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 deleted file mode 100644 index 079c5a450..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_719.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 deleted file mode 100644 index 74f33f32d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_720.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 deleted file mode 100644 index 23b73ded5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_721.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 deleted file mode 100644 index 957306f6d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_722.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "011")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 deleted file mode 100644 index cc91997ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_723.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 deleted file mode 100644 index fc2ad9a54..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_724.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 deleted file mode 100644 index 22bf1ca36..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_725.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 deleted file mode 100644 index 2a69c799a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_726.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 deleted file mode 100644 index 34be0ea34..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_727.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 deleted file mode 100644 index 48da1fb31..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_728.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 deleted file mode 100644 index 32043251e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_729.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 deleted file mode 100644 index c8739ce33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_730.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 deleted file mode 100644 index 978a52001..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_731.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 deleted file mode 100644 index 030597aa2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_732.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 deleted file mode 100644 index 3f9ace6dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_733.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "01")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 deleted file mode 100644 index 6c12be5f4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_734.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 deleted file mode 100644 index 01393d39a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_735.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "10")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 deleted file mode 100644 index 32227d592..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_736.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 deleted file mode 100644 index 8babfec0e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_737.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 deleted file mode 100644 index b129453c9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_738.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 deleted file mode 100644 index 6481f7ccf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_739.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 deleted file mode 100644 index b94b6abb1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_740.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 deleted file mode 100644 index 35b57178b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_741.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 deleted file mode 100644 index dc351f8d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_742.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 deleted file mode 100644 index 795ca3584..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_743.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 deleted file mode 100644 index a154da46b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_744.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 deleted file mode 100644 index 2f812e27f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_745.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 deleted file mode 100644 index 9fba87d6d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_746.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 deleted file mode 100644 index 8177066ed..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_747.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 deleted file mode 100644 index e2fbc7b14..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_748.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "00")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 deleted file mode 100644 index bede7371e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_749.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 deleted file mode 100644 index 84b07b00d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_750.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 deleted file mode 100644 index 0666a1ea9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_751.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 deleted file mode 100644 index 987fa1a89..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_752.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 deleted file mode 100644 index f3961b035..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_753.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 deleted file mode 100644 index 13b32258e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_754.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 deleted file mode 100644 index d71847f40..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_755.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 deleted file mode 100644 index 6f168a2cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_756.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 deleted file mode 100644 index 6ce883c72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_757.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 deleted file mode 100644 index 59071ad61..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_758.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 deleted file mode 100644 index 3f6ee4cee..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_759.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 deleted file mode 100644 index 216defbf7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_760.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 deleted file mode 100644 index ad5699cf2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_761.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 deleted file mode 100644 index f1bea9d72..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_762.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 deleted file mode 100644 index 08ae362ce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_763.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 deleted file mode 100644 index 74ae749a9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_764.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 deleted file mode 100644 index 063bd6938..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_765.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 deleted file mode 100644 index 8ed84009e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_766.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 deleted file mode 100644 index 96b89e1a1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_767.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 deleted file mode 100644 index 66c9cef00..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_768.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 deleted file mode 100644 index 739f880dd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_769.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 deleted file mode 100644 index d038a8e36..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_770.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 deleted file mode 100644 index c82271f60..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_771.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 deleted file mode 100644 index 8ed92b1aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_772.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 deleted file mode 100644 index 932fcd6d7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_773.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 deleted file mode 100644 index 2df6e0c87..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_774.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 deleted file mode 100644 index cbaf62a2d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_775.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 deleted file mode 100644 index d3903639c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_776.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 deleted file mode 100644 index efd6a1822..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_777.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 deleted file mode 100644 index 87be7feb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_778.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 deleted file mode 100644 index 1f71bec11..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_779.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 deleted file mode 100644 index 0e816ea61..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_780.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "01")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 deleted file mode 100644 index 06a135dc2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_781.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 deleted file mode 100644 index ca754bb67..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_782.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 deleted file mode 100644 index 1695e17e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_783.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 deleted file mode 100644 index 2a12020dc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_784.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 deleted file mode 100644 index 67dea8d79..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_785.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 deleted file mode 100644 index 84dcabdbe..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_786.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 deleted file mode 100644 index eaba606a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_787.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1001")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 deleted file mode 100644 index 4e4611c73..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_788.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 deleted file mode 100644 index c97367eaf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_789.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 deleted file mode 100644 index 67a8a93ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_790.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 deleted file mode 100644 index 60c351c26..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_791.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 deleted file mode 100644 index bc7ba7ae7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_792.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 deleted file mode 100644 index 9e33ca3bf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_793.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 deleted file mode 100644 index 4df1c11f0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_794.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 deleted file mode 100644 index c3f75bd46..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_795.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 deleted file mode 100644 index 5741f8f1d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_796.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "1000")) -(assert (= Bottom_1 "00")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 deleted file mode 100644 index 962c82a4f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_797.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 deleted file mode 100644 index 992f79fd5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_798.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 deleted file mode 100644 index e8aaf2179..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_799.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 deleted file mode 100644 index a35337de1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_800.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 deleted file mode 100644 index 60d4e3f1e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_801.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 deleted file mode 100644 index fd44d5754..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_802.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 deleted file mode 100644 index 9566b8016..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_803.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 deleted file mode 100644 index cf50b104f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_804.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 deleted file mode 100644 index 0de55b47e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_805.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 deleted file mode 100644 index eb9f671e8..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_806.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 deleted file mode 100644 index 586d4a361..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_807.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 deleted file mode 100644 index 5c9cbbf1b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_808.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 deleted file mode 100644 index 98a6d210e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_809.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 deleted file mode 100644 index e9b96cb90..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_810.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 deleted file mode 100644 index f9b2526ad..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_811.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "0100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 deleted file mode 100644 index d9f49aee4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_812.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "110")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 deleted file mode 100644 index 9f209d059..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_813.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 deleted file mode 100644 index 6bfbb0d3f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_814.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 deleted file mode 100644 index 5d49afe1d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_815.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 deleted file mode 100644 index 57439bfce..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_816.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 deleted file mode 100644 index 3014c280c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_817.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 deleted file mode 100644 index c3b04c15b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_818.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 deleted file mode 100644 index 9c411c2fa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_819.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 deleted file mode 100644 index 840aaea7c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_820.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 deleted file mode 100644 index 30adab347..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_821.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 deleted file mode 100644 index fcf1ff29d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_822.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 deleted file mode 100644 index aa562ba4e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_823.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 deleted file mode 100644 index f20588615..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_824.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 deleted file mode 100644 index 037b12e09..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_825.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "011")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 deleted file mode 100644 index 7789772f6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_826.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 deleted file mode 100644 index 060ef373e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_827.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 deleted file mode 100644 index 162494d33..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_828.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 deleted file mode 100644 index 923175f51..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_829.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 deleted file mode 100644 index f04b91785..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_830.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 deleted file mode 100644 index 039b7eef9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_831.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 deleted file mode 100644 index 97519769b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_832.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 deleted file mode 100644 index 17dac2947..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_833.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 deleted file mode 100644 index 883a8ea5a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_834.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 deleted file mode 100644 index cea63cbae..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_835.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 deleted file mode 100644 index 4151925f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_836.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 deleted file mode 100644 index fde12a0d9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_837.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 deleted file mode 100644 index b13152463..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_838.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 deleted file mode 100644 index 89862354f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_839.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "11")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 deleted file mode 100644 index cc749def2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_840.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 deleted file mode 100644 index 79df445d3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_841.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 deleted file mode 100644 index 5d1060d83..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_842.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 deleted file mode 100644 index f542b406e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_843.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "110")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 deleted file mode 100644 index e848e8072..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_844.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "101")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 deleted file mode 100644 index a3fe4897e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_845.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 deleted file mode 100644 index f9bf9155a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_846.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 deleted file mode 100644 index 1944055a4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_847.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 deleted file mode 100644 index ac3619d82..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_848.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 deleted file mode 100644 index 4924aea4d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_849.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 deleted file mode 100644 index ca3422a89..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_850.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 deleted file mode 100644 index 487d5a5b7..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_851.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 deleted file mode 100644 index 1f7674d2a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_852.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 deleted file mode 100644 index 02989b67f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_853.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 deleted file mode 100644 index 094ddb0fd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_854.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 deleted file mode 100644 index 2ddaff47d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_855.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 deleted file mode 100644 index e68b6c7a0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_856.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 deleted file mode 100644 index 7869e8130..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_857.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 deleted file mode 100644 index ac97923b1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_858.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 deleted file mode 100644 index e8e89eb2b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_859.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 deleted file mode 100644 index 7e3dbf07b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_860.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "101")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 deleted file mode 100644 index 177116242..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_861.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "100")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 deleted file mode 100644 index d32c40fd4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_862.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 deleted file mode 100644 index 379e8e093..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_863.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 deleted file mode 100644 index c84b0ed93..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_864.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 deleted file mode 100644 index b8ebcece1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_865.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 deleted file mode 100644 index 9622fbff4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_866.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 deleted file mode 100644 index 2eff2f6ec..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_867.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 deleted file mode 100644 index c5dadcf9f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_868.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 deleted file mode 100644 index b3a4cf81f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_869.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 deleted file mode 100644 index 4323add10..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_870.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "001")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 deleted file mode 100644 index 85c44fc9a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_871.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 deleted file mode 100644 index 8be642721..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_872.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 deleted file mode 100644 index 1e6b41a5b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_873.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 deleted file mode 100644 index 86ba00f37..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_874.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 deleted file mode 100644 index 2b978cc32..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_875.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1001")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 deleted file mode 100644 index b1507d207..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_876.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 deleted file mode 100644 index bd8fe386f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_877.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 deleted file mode 100644 index cc7ea6d96..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_878.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 deleted file mode 100644 index 6eb46a1e9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_879.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 deleted file mode 100644 index 8bfb405fc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_880.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 deleted file mode 100644 index bb28e5eda..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_881.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 deleted file mode 100644 index 1ffe6ed2a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_882.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 deleted file mode 100644 index 56b2bcaf9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_883.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 deleted file mode 100644 index 016760d21..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_884.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 deleted file mode 100644 index e8bafafa1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_885.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 deleted file mode 100644 index c0b3c3dcf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_886.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 deleted file mode 100644 index 57856cadc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_887.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 deleted file mode 100644 index 519747123..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_888.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "100")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 deleted file mode 100644 index 645916bcf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_889.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 deleted file mode 100644 index b2de78fa6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_890.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "010")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 deleted file mode 100644 index 6c9d851b0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_891.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 deleted file mode 100644 index 329299a9f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_892.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 deleted file mode 100644 index 519ead27b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_893.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 deleted file mode 100644 index 151bbf17f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_894.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 deleted file mode 100644 index e49f95949..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_895.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 deleted file mode 100644 index 797f62a22..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_896.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 deleted file mode 100644 index f6be899bd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_897.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 deleted file mode 100644 index 803769aa4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_898.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 deleted file mode 100644 index 8fc968ddc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_899.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 deleted file mode 100644 index 72e84880f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_900.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 deleted file mode 100644 index a008a9c85..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_901.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 deleted file mode 100644 index 415509887..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_902.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 deleted file mode 100644 index 74e5babfd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_903.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 deleted file mode 100644 index 030caccd1..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_904.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 deleted file mode 100644 index df137103f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_905.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 deleted file mode 100644 index 54d7682a9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_906.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 deleted file mode 100644 index 2ad6c74c6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_907.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 deleted file mode 100644 index 2e3cd32f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_908.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "0101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 deleted file mode 100644 index 66659a336..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_909.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 deleted file mode 100644 index 775239003..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_910.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 deleted file mode 100644 index 590acdb64..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_911.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 deleted file mode 100644 index f1ab5e372..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_912.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "010")) -(assert (= Bottom_1 "0")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 deleted file mode 100644 index 2ea88a048..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_913.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "000")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 deleted file mode 100644 index 339fdf222..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_914.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 deleted file mode 100644 index 0cd685141..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_915.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 deleted file mode 100644 index 84d215b2d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_916.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 deleted file mode 100644 index 2a3249ce4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_917.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 deleted file mode 100644 index 67b570cf2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_918.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 deleted file mode 100644 index ce58e64cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_919.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 deleted file mode 100644 index 7885cd915..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_920.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 deleted file mode 100644 index ffc2bf916..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_921.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 deleted file mode 100644 index 553aefb4c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_922.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "10")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 deleted file mode 100644 index d3cf9d1bc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_923.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "000")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 deleted file mode 100644 index 9f892f6da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_924.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 deleted file mode 100644 index 843afd10f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_925.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 deleted file mode 100644 index 14b62236f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_926.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 deleted file mode 100644 index f84a41f61..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_927.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 deleted file mode 100644 index a28bd5ca5..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_928.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 deleted file mode 100644 index 8209e533c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_929.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 deleted file mode 100644 index 94c69bfa0..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_930.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 deleted file mode 100644 index 73711d7ff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_931.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 deleted file mode 100644 index 550ca8f17..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_932.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "11")) -(assert (= Bottom_1 "0110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 deleted file mode 100644 index cfdcfd9a2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_933.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 deleted file mode 100644 index ad3791fb3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_934.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 deleted file mode 100644 index 6392730da..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_935.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 deleted file mode 100644 index 4afb16155..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_936.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 deleted file mode 100644 index de9bc872f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_937.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 deleted file mode 100644 index 8f6ea136a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_938.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 deleted file mode 100644 index fe7546f75..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_939.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 deleted file mode 100644 index db5c18096..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_940.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 deleted file mode 100644 index 2219322cc..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_941.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 deleted file mode 100644 index 175cb3383..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_942.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 deleted file mode 100644 index cea61c536..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_943.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "1100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 deleted file mode 100644 index 08110b612..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_944.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1011")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 deleted file mode 100644 index 27228b621..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_945.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 deleted file mode 100644 index 38b295738..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_946.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 deleted file mode 100644 index 27a1fad12..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_947.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 deleted file mode 100644 index b79e49474..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_948.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 deleted file mode 100644 index bbf339991..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_949.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 deleted file mode 100644 index da04c07cd..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_950.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1010")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 deleted file mode 100644 index 8f1655f82..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_951.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 deleted file mode 100644 index f5e620d9f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_952.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 deleted file mode 100644 index 9c812be75..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_953.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 deleted file mode 100644 index 177540499..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_954.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 deleted file mode 100644 index 38c49535e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_955.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 deleted file mode 100644 index 4d73f3544..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_956.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 deleted file mode 100644 index 754efd30a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_957.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 deleted file mode 100644 index 62fd04f88..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_958.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 deleted file mode 100644 index 371aa5042..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_959.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 deleted file mode 100644 index 00fdafd5f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_960.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "0100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "11")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 deleted file mode 100644 index f779c7dff..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_961.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 deleted file mode 100644 index 5888b1f48..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_962.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 deleted file mode 100644 index 4770c943a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_963.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 deleted file mode 100644 index 768e1e5b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_964.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 deleted file mode 100644 index 043db6eb6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_965.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 deleted file mode 100644 index 6102ee310..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_966.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 deleted file mode 100644 index 160a7c8d4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_967.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 deleted file mode 100644 index 973cdfd81..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_968.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 deleted file mode 100644 index 24796223a..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_969.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "0001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 deleted file mode 100644 index 3cb569b8d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_970.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 deleted file mode 100644 index edbadd38d..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_971.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 deleted file mode 100644 index ea198fea6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_972.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "00")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 deleted file mode 100644 index 44873cd6c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_973.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "10")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 deleted file mode 100644 index a6bf27e52..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_974.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 deleted file mode 100644 index c0c8f089e..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_975.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "001")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 deleted file mode 100644 index 7e52b26c2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_976.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "110")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "01")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 deleted file mode 100644 index 27e63802c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_977.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "01")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 deleted file mode 100644 index 99b7796b9..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_978.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "100")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 deleted file mode 100644 index e6c5281cf..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_979.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "101")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "10")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 deleted file mode 100644 index aadd75588..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_980.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 deleted file mode 100644 index 4fb6ba1d6..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_981.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 deleted file mode 100644 index e912c5484..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_982.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 deleted file mode 100644 index 9c897832b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_983.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 deleted file mode 100644 index 3974ebaa4..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_984.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 deleted file mode 100644 index ad4edc4aa..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_985.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "11")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 deleted file mode 100644 index e84356f99..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_986.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 deleted file mode 100644 index 33ddb2056..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_987.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 deleted file mode 100644 index 853698e96..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_988.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "1011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 deleted file mode 100644 index afa9cda99..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_989.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "0111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 deleted file mode 100644 index 00d7f50c3..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_990.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "110")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 deleted file mode 100644 index af5486c2c..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_991.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "101")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 deleted file mode 100644 index cf15d809b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_992.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "1")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 deleted file mode 100644 index 0b3e78d30..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_993.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "10")) -(assert (= Bottom_1 "1")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1010")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 deleted file mode 100644 index 1453bc55f..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_994.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "00")) -(assert (= Bottom_2 "0011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 deleted file mode 100644 index 4ed7b8637..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_995.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1100")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "011")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 deleted file mode 100644 index d947da94b..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_996.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 deleted file mode 100644 index cb0c320e2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_997.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "111")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 deleted file mode 100644 index 83bb7f3f2..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_998.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "1000")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 b/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 deleted file mode 100644 index 4d4e74009..000000000 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_999.smt2 +++ /dev/null @@ -1,57 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH -Time limit: 60.0 -Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper -'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different -techniques like Parikh Automata and Model Checking but String Solvers have not been tested. -Most benchmarks expected to be unsat. -Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and -Proof Generation -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unknown) - -(declare-fun TopStr () String) -(declare-fun BottomStr () String) - -(declare-fun Top_0 () String) -(declare-fun Bottom_0 () String) -(assert (= Top_0 "1111")) -(assert (= Bottom_0 "1")) -(declare-fun Top_1 () String) -(declare-fun Bottom_1 () String) -(assert (= Top_1 "00")) -(assert (= Bottom_1 "111")) -(declare-fun Top_2 () String) -(declare-fun Bottom_2 () String) -(assert (= Top_2 "0")) -(assert (= Bottom_2 "1000")) -(declare-fun replace () String) -(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4"))))) - -(declare-fun x () String) -(declare-fun y () String) -(declare-fun x_0 () String) -(declare-fun y_0 () String) -(declare-fun x_1 () String) -(declare-fun y_1 () String) -(declare-fun x_2 () String) -(declare-fun y_2 () String) -(assert (= x_1 (str.replace_all x_0 "2" Top_0))) -(assert (= x_2 (str.replace_all x_1 "3" Top_1))) -(assert (= x (str.replace_all x_2 "4" Top_2))) -(assert (= y_1 (str.replace_all y_0 "2" Bottom_0))) -(assert (= y_2 (str.replace_all y_1 "3" Bottom_1))) -(assert (= y (str.replace_all y_2 "4" Bottom_2))) -(assert (= x_0 replace)) -(assert (= y_0 replace)) - -(assert (= x y)) -(check-sat) -(exit) diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_0.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_0.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_0.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_0.smt2 index 688775281..bad938003 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_0.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_0.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_1.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_1.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_1.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_1.smt2 index 3d016f653..c9c9e879d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_1.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_1.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_10.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_10.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_10.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_10.smt2 index 903f2cc7a..c4c1d6854 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_10.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_10.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_100.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_100.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_100.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_100.smt2 index 992523ca7..4aeff7e22 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_100.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_100.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_101.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_101.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_101.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_101.smt2 index 6674e1b1a..d7b849dfb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_101.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_101.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_102.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_102.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_102.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_102.smt2 index 1a2932bb4..56889e611 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_102.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_102.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_103.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_103.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_103.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_103.smt2 index c56df0942..0cce11290 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_103.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_103.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_104.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_104.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_104.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_104.smt2 index 1022648ff..ac22612ed 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_104.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_104.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_105.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_105.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_105.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_105.smt2 index b04c1b78d..b3b516d08 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_105.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_105.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_106.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_106.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_106.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_106.smt2 index 89052af62..e4e17ffb9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_106.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_106.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_107.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_107.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_107.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_107.smt2 index 00037c5a9..bb23295ad 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_107.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_107.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_108.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_108.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_108.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_108.smt2 index 9dfb53e5a..61a187a28 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_108.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_108.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_109.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_109.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_109.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_109.smt2 index 323a3a6ed..eaa24c7d9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_109.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_109.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_11.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_11.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_11.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_11.smt2 index 0566ab2cb..12763c364 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_11.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_11.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_110.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_110.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_110.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_110.smt2 index 426d61489..f67291155 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_110.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_110.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_111.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_111.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_111.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_111.smt2 index 9a6c5655e..5e1622325 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_111.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_111.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_112.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_112.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_112.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_112.smt2 index 2d101ce1a..a53d6d1f8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_112.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_112.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_113.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_113.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_113.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_113.smt2 index 84d76c2b9..c0227a03d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_113.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_113.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_114.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_114.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_114.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_114.smt2 index bc7c2e770..b208a9135 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_114.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_114.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_115.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_115.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_115.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_115.smt2 index 79d2efc6a..4dfc3327c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_115.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_115.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_116.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_116.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_116.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_116.smt2 index 7d7b8b436..9107834e0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_116.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_116.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_117.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_117.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_117.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_117.smt2 index b5fcaf905..675080f40 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_117.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_117.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_118.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_118.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_118.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_118.smt2 index 200acbb46..eae4f0b5f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_118.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_118.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_119.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_119.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_119.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_119.smt2 index dc5ad43c8..a5eb030ba 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_119.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_119.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_12.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_12.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_12.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_12.smt2 index d745791f5..f6ad2bcb9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_12.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_12.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_120.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_120.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_120.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_120.smt2 index 68ebf03e5..84d6f060c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_120.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_120.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_121.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_121.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_121.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_121.smt2 index 5fe34bfb2..6651d6de4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_121.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_121.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_122.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_122.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_122.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_122.smt2 index da72a1ea8..c39b85881 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_122.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_122.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_123.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_123.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_123.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_123.smt2 index 1ac2313ed..2a4383dfc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_123.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_123.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_124.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_124.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_124.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_124.smt2 index c92ac5d18..629fdba08 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_124.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_124.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_125.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_125.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_125.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_125.smt2 index 0687f401f..e8e553145 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_125.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_125.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_126.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_126.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_126.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_126.smt2 index c3e0b61b2..e2423011e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_126.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_126.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_127.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_127.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_127.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_127.smt2 index 72d8aa75a..2b7b7d238 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_127.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_127.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_128.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_128.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_128.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_128.smt2 index 159f46a7d..9408a6203 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_128.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_128.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_129.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_129.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_129.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_129.smt2 index 48c137beb..8a5e744d9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_129.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_129.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_13.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_13.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_13.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_13.smt2 index a2b092012..40edff044 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_13.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_13.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_130.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_130.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_130.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_130.smt2 index 252e90c4d..1a979af90 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_130.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_130.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_131.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_131.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_131.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_131.smt2 index 54fbed004..63186accf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_131.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_131.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_132.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_132.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_132.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_132.smt2 index 4b5934f32..48919be26 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_132.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_132.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_133.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_133.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_133.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_133.smt2 index 71971db9b..8a3297a81 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_133.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_133.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_134.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_134.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_134.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_134.smt2 index c226fe72f..ee9a6ee0a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_134.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_134.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_135.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_135.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_135.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_135.smt2 index a24e1a4b7..7da608f4f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_135.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_135.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_136.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_136.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_136.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_136.smt2 index 799337ac4..ff59e6ede 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_136.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_136.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_137.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_137.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_137.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_137.smt2 index 0fe00e27b..2b960481b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_137.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_137.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_138.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_138.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_138.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_138.smt2 index 7b8c88b14..dadd94af6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_138.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_138.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_139.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_139.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_139.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_139.smt2 index 6cc55125d..7132e8897 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_139.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_139.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_14.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_14.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_14.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_14.smt2 index e3dbe041e..1281a0de4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_14.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_14.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_140.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_140.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_140.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_140.smt2 index 8871eeb9d..125afd823 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_140.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_140.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_141.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_141.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_141.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_141.smt2 index 4c7674b03..cd5c7d811 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_141.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_141.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_142.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_142.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_142.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_142.smt2 index 290d81970..690e3c46b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_142.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_142.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_143.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_143.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_143.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_143.smt2 index e8112f2cb..86f2d7214 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_143.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_143.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_144.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_144.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_144.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_144.smt2 index b0ff21adf..6ac1ea244 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_144.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_144.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_145.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_145.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_145.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_145.smt2 index a4cf76623..9afc56ce7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_145.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_145.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_146.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_146.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_146.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_146.smt2 index 27b92523a..dc8e09a95 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_146.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_146.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_147.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_147.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_147.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_147.smt2 index aefcc370c..52b88f2f9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_147.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_147.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_148.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_148.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_148.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_148.smt2 index 97ae04370..0603be851 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_148.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_148.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_149.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_149.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_149.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_149.smt2 index dabd123aa..e27217c78 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_149.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_149.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_15.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_15.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_15.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_15.smt2 index 57bccccf6..feec4d517 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_15.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_15.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_150.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_150.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_150.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_150.smt2 index 6e8589daa..1222993ae 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_150.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_150.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_151.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_151.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_151.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_151.smt2 index c66eeb63d..7ab443d06 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_151.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_151.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_152.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_152.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_152.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_152.smt2 index b1afa363d..83e359d16 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_152.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_152.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_153.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_153.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_153.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_153.smt2 index 813ecb9b3..2a4babf04 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_153.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_153.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_154.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_154.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_154.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_154.smt2 index 4aa46104e..2b3fe5183 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_154.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_154.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_155.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_155.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_155.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_155.smt2 index bfacae467..c54d8113b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_155.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_155.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_156.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_156.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_156.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_156.smt2 index 0b278641e..159848554 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_156.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_156.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_157.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_157.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_157.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_157.smt2 index 3dbfdef40..01de0f0c1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_157.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_157.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_158.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_158.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_158.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_158.smt2 index ca2a8c116..0055ef4d3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_158.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_158.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_159.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_159.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_159.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_159.smt2 index 328c5edd6..befe6ef35 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_159.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_159.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_16.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_16.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_16.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_16.smt2 index 642d0dad5..c20c8cd80 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_16.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_16.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_160.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_160.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_160.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_160.smt2 index 0443479f8..9b4b0ef0a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_160.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_160.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_161.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_161.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_161.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_161.smt2 index 895742811..7747ec942 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_161.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_161.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_162.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_162.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_162.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_162.smt2 index c741454fb..63a55bdb5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_162.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_162.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_163.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_163.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_163.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_163.smt2 index fe7e465c2..9423c9194 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_163.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_163.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_164.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_164.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_164.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_164.smt2 index 8991ae97f..f81c3b053 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_164.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_164.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_165.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_165.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_165.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_165.smt2 index 2918a9f21..72cffafc0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_165.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_165.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_166.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_166.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_166.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_166.smt2 index f96c5b43c..afe083a8e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_166.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_166.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_167.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_167.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_167.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_167.smt2 index c4769f4a0..0d761fa43 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_167.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_167.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_168.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_168.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_168.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_168.smt2 index 3e90a4c93..006526f45 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_168.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_168.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_169.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_169.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_169.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_169.smt2 index e967e2dcd..3296851e5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_169.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_169.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_17.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_17.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_17.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_17.smt2 index 58030365f..a0c663bc9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_17.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_17.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_170.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_170.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_170.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_170.smt2 index 767619ced..9d5a29bcb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_170.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_170.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_171.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_171.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_171.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_171.smt2 index 4ad8f5058..c28779b21 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_171.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_171.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_172.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_172.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_172.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_172.smt2 index eb179b75a..e341e432c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_172.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_172.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_173.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_173.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_173.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_173.smt2 index 946a0ad07..29c8cf230 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_173.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_173.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_174.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_174.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_174.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_174.smt2 index c94981345..63aed9cc3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_174.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_174.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_175.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_175.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_175.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_175.smt2 index 3e3cc1685..54c0e4b8b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_175.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_175.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_176.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_176.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_176.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_176.smt2 index d9a16e4b9..d32fd8021 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_176.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_176.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_177.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_177.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_177.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_177.smt2 index b1b9674e2..5fea66116 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_177.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_177.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_178.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_178.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_178.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_178.smt2 index b8facaf8f..70db2c99c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_178.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_178.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_179.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_179.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_179.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_179.smt2 index 2456d3e4e..79d329d15 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_179.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_179.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_18.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_18.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_18.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_18.smt2 index d92f4fa7b..798b11b5b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_18.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_18.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_180.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_180.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_180.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_180.smt2 index caedbd29c..c0afa4dcd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_180.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_180.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_181.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_181.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_181.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_181.smt2 index c9ccfb1cd..36b163154 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_181.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_181.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_182.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_182.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_182.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_182.smt2 index cb2275b46..288606777 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_182.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_182.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_183.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_183.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_183.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_183.smt2 index e13040d01..856fe97db 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_183.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_183.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_184.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_184.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_184.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_184.smt2 index cfc20516a..cdd209144 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_184.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_184.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_185.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_185.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_185.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_185.smt2 index b8e7003e4..07224ff1f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_185.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_185.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_186.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_186.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_186.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_186.smt2 index 0a2f849c4..c5222263c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_186.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_186.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_187.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_187.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_187.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_187.smt2 index e7ca90630..7cb0bd280 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_187.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_187.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_188.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_188.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_188.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_188.smt2 index 9833c0d4c..cef4e52bb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_188.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_188.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_189.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_189.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_189.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_189.smt2 index 68df247cd..c73fac96a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_189.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_189.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_19.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_19.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_19.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_19.smt2 index 5f903ec99..5d65a7c8d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_19.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_19.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_190.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_190.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_190.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_190.smt2 index 141288fa7..c58717d57 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_190.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_190.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_191.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_191.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_191.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_191.smt2 index ceeb4ed24..13e6b0a08 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_191.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_191.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_192.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_192.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_192.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_192.smt2 index 911bf8c56..b14dd6b23 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_192.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_192.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_193.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_193.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_193.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_193.smt2 index 615fa5dff..15d498b5b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_193.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_193.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_194.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_194.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_194.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_194.smt2 index 1b45c7469..345a6507d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_194.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_194.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_195.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_195.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_195.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_195.smt2 index c464ea763..b41b83ff1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_195.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_195.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_196.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_196.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_196.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_196.smt2 index 1dc2f6514..76f281eb7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_196.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_196.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_197.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_197.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_197.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_197.smt2 index 630a41d4e..ccf3fc5ec 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_197.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_197.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_198.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_198.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_198.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_198.smt2 index 9485678d3..5b66d7623 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_198.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_198.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_199.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_199.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_199.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_199.smt2 index 3188321e6..62e8f77b1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_199.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_199.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_2.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_2.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_2.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_2.smt2 index 8b6a76475..03b47fb41 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_2.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_2.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_20.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_20.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_20.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_20.smt2 index 80f86d355..4fa967a84 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_20.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_20.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_200.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_200.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_200.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_200.smt2 index f28819d3d..b73f20223 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_200.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_200.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_201.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_201.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_201.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_201.smt2 index 413544149..f6b4e1a19 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_201.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_201.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_202.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_202.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_202.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_202.smt2 index 9c5ab42b2..cc57aa304 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_202.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_202.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_203.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_203.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_203.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_203.smt2 index f444f0805..b9fd6b042 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_203.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_203.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_204.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_204.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_204.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_204.smt2 index e3e4773ca..64c74be1c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_204.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_204.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_205.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_205.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_205.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_205.smt2 index c4a3e82e7..e2ab78e02 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_205.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_205.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_206.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_206.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_206.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_206.smt2 index aa1bf9143..91770146d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_206.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_206.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_207.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_207.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_207.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_207.smt2 index 5c4a97f5d..87efd44d6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_207.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_207.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_208.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_208.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_208.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_208.smt2 index e288b3ca6..e7a87fb47 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_208.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_208.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_209.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_209.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_209.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_209.smt2 index c7c5a17cf..878323937 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_209.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_209.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_21.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_21.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_21.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_21.smt2 index 11c7c577c..5213315fe 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_21.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_21.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_210.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_210.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_210.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_210.smt2 index 2498619dc..1c47a40d0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_210.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_210.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_211.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_211.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_211.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_211.smt2 index 1e161c832..0a41727e0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_211.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_211.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_212.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_212.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_212.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_212.smt2 index 2c55f0192..327d6571f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_212.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_212.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_213.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_213.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_213.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_213.smt2 index cf75a57ef..23cd2c490 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_213.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_213.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_214.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_214.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_214.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_214.smt2 index 7baa6bf55..a0d8fefe3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_214.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_214.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_215.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_215.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_215.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_215.smt2 index 78e3ae46d..787b03b17 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_215.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_215.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_216.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_216.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_216.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_216.smt2 index a14d175d4..a6103edd0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_216.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_216.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_217.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_217.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_217.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_217.smt2 index 78e8a6280..24fe59083 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_217.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_217.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_218.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_218.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_218.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_218.smt2 index 387ba90d3..f4dcb7ed5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_218.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_218.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_219.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_219.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_219.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_219.smt2 index d561b2009..de7775805 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_219.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_219.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_22.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_22.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_22.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_22.smt2 index 2f8e53b44..dc5860131 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_22.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_22.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_220.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_220.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_220.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_220.smt2 index d2152c43a..77a92709d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_220.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_220.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_221.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_221.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_221.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_221.smt2 index daaeae6dd..7d4e5d7fb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_221.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_221.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_222.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_222.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_222.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_222.smt2 index 2a8c96825..65913fb9a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_222.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_222.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_223.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_223.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_223.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_223.smt2 index 852f7112c..7d624a17c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_223.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_223.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_224.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_224.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_224.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_224.smt2 index bf0a5e0b7..e5542732f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_224.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_224.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_225.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_225.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_225.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_225.smt2 index 53701ead7..83991626d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_225.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_225.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_226.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_226.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_226.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_226.smt2 index cf5fd7be9..014f5f717 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_226.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_226.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_227.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_227.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_227.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_227.smt2 index 7e8bd66fd..a6b17fc3e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_227.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_227.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_228.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_228.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_228.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_228.smt2 index 97eb5eff5..4fa36e316 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_228.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_228.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_229.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_229.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_229.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_229.smt2 index 484a0d990..2833e1301 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_229.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_229.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_23.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_23.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_23.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_23.smt2 index 9660dc900..be4ea3429 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_23.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_23.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_230.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_230.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_230.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_230.smt2 index fc10a3d5d..6668d16a1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_230.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_230.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_231.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_231.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_231.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_231.smt2 index 761ba5e81..508de8056 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_231.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_231.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_232.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_232.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_232.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_232.smt2 index f7e5f885d..1329675f5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_232.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_232.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_233.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_233.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_233.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_233.smt2 index b8795b09c..620790a22 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_233.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_233.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_234.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_234.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_234.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_234.smt2 index a75d8c3af..3b88a8164 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_234.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_234.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_235.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_235.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_235.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_235.smt2 index 3ccc464bd..b6686ed0b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_235.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_235.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_236.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_236.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_236.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_236.smt2 index 905698b56..9d939a1f5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_236.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_236.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_237.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_237.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_237.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_237.smt2 index 9301b1164..ef48ceb15 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_237.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_237.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_238.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_238.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_238.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_238.smt2 index 043f6f981..65ba482d5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_238.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_238.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_239.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_239.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_239.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_239.smt2 index 27884aa5d..efcae4ad4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_239.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_239.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_24.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_24.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_24.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_24.smt2 index 220904071..4437f595d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_24.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_24.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_240.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_240.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_240.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_240.smt2 index 262cfe793..54a1d984d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_240.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_240.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_241.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_241.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_241.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_241.smt2 index e99d368cd..01743dda2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_241.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_241.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_242.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_242.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_242.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_242.smt2 index 6143da8b3..3fc3497f2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_242.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_242.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_243.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_243.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_243.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_243.smt2 index df711dbce..8cccf0d5d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_243.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_243.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_244.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_244.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_244.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_244.smt2 index 10beeabc6..c9163ae5e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_244.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_244.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_245.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_245.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_245.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_245.smt2 index c68f75128..9afaab16b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_245.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_245.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_246.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_246.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_246.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_246.smt2 index 2a0c38cf6..a80856593 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_246.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_246.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_247.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_247.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_247.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_247.smt2 index 75c18e785..6b9e555df 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_247.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_247.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_248.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_248.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_248.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_248.smt2 index 080b016eb..272219571 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_248.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_248.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_249.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_249.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_249.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_249.smt2 index 59178dec8..9fc8491f9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_249.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_249.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_25.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_25.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_25.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_25.smt2 index 2be7f55ab..223c8ffd7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_25.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_25.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_250.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_250.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_250.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_250.smt2 index 504fd41d3..9abdf9ab5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_250.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_250.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_251.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_251.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_251.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_251.smt2 index 1636cb496..c60cb3da0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_251.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_251.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_252.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_252.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_252.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_252.smt2 index 4ad81ec39..8b841617f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_252.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_252.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_253.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_253.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_253.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_253.smt2 index 4a3db927b..cb6423ddf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_253.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_253.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_254.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_254.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_254.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_254.smt2 index cde920ff7..e30526913 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_254.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_254.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_255.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_255.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_255.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_255.smt2 index baea72d43..a168aadae 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_255.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_255.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_256.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_256.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_256.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_256.smt2 index 258dff405..fff9d2070 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_256.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_256.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_257.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_257.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_257.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_257.smt2 index 65f28c10d..464f937a0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_257.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_257.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_258.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_258.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_258.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_258.smt2 index 10f839430..49cd0bec3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_258.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_258.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_259.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_259.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_259.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_259.smt2 index 2dd697124..ad127c16b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_259.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_259.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_26.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_26.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_26.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_26.smt2 index 24b2eff55..f5460f417 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_26.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_26.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_260.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_260.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_260.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_260.smt2 index 7a7a70216..8e6674914 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_260.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_260.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_261.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_261.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_261.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_261.smt2 index 879317a11..eaae699a9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_261.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_261.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_262.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_262.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_262.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_262.smt2 index 437eef7c7..e13945863 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_262.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_262.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_263.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_263.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_263.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_263.smt2 index 92c702eda..f5b4e24b1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_263.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_263.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_264.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_264.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_264.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_264.smt2 index 1c8899a4a..b8dc48e21 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_264.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_264.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_265.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_265.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_265.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_265.smt2 index 76db4ff61..9f7d545da 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_265.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_265.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_266.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_266.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_266.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_266.smt2 index ef73492cd..ccc088ad4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_266.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_266.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_267.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_267.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_267.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_267.smt2 index 0ea6c7642..cf8cda4c5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_267.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_267.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_268.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_268.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_268.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_268.smt2 index 0d4cf4c01..f6fd4345f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_268.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_268.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_269.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_269.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_269.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_269.smt2 index 5018d3088..bbe9fef26 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_269.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_269.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_27.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_27.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_27.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_27.smt2 index 9f795d8e5..f6dfe993c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_27.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_27.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_270.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_270.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_270.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_270.smt2 index fa9f99a7a..ae38d7a21 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_270.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_270.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_271.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_271.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_271.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_271.smt2 index 431819f95..8da1159be 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_271.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_271.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_272.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_272.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_272.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_272.smt2 index c3aa6a8c2..7ec1bf77c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_272.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_272.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_273.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_273.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_273.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_273.smt2 index e8791f93f..c189fb8a8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_273.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_273.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_274.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_274.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_274.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_274.smt2 index 543caebd0..5a58d5096 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_274.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_274.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_275.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_275.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_275.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_275.smt2 index 456bddbbe..4d7c0cbf5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_275.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_275.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_276.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_276.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_276.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_276.smt2 index a97750bcd..7f8725240 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_276.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_276.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_277.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_277.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_277.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_277.smt2 index b3835c809..e66a0a4c6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_277.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_277.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_278.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_278.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_278.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_278.smt2 index f688c894e..bdc3b8262 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_278.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_278.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_279.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_279.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_279.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_279.smt2 index c52fd92a6..04fe4d726 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_279.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_279.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_28.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_28.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_28.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_28.smt2 index 4e5b47a7f..1530edcfc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_28.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_28.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_280.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_280.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_280.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_280.smt2 index 74093ca37..3e8c398e8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_280.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_280.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_281.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_281.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_281.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_281.smt2 index ec3a751b8..904014414 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_281.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_281.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_282.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_282.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_282.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_282.smt2 index 293777c17..76e094b84 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_282.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_282.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_283.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_283.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_283.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_283.smt2 index f1a377421..6bb065190 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_283.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_283.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_284.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_284.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_284.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_284.smt2 index 13d8c0d82..496966605 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_284.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_284.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_285.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_285.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_285.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_285.smt2 index 9f5b465c2..ff3545008 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_285.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_285.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_286.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_286.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_286.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_286.smt2 index c4f0d7487..943bddd57 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_286.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_286.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_287.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_287.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_287.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_287.smt2 index dc2da558c..2d8d95e3b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_287.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_287.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_288.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_288.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_288.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_288.smt2 index 396adfd23..dce1b257f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_288.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_288.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_289.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_289.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_289.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_289.smt2 index b1966798b..1ac5b898d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_289.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_289.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_29.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_29.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_29.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_29.smt2 index 765af5d5f..10211fef0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_29.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_29.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_290.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_290.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_290.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_290.smt2 index 846181dbb..1333716d1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_290.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_290.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_291.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_291.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_291.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_291.smt2 index 34bf0c19e..47f72b0e0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_291.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_291.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_292.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_292.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_292.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_292.smt2 index 0ab8ef8ed..150db9ccb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_292.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_292.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_293.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_293.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_293.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_293.smt2 index 15eedec95..0a99e1001 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_293.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_293.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_294.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_294.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_294.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_294.smt2 index ca6c6358e..25935bd49 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_294.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_294.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_295.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_295.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_295.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_295.smt2 index 9ff4bbc9a..13b2ae1a8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_295.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_295.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_296.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_296.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_296.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_296.smt2 index 63bf8de0b..21524ef5b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_296.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_296.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_297.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_297.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_297.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_297.smt2 index f6db6d2d9..e945a74ef 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_297.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_297.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_298.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_298.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_298.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_298.smt2 index 12a0f9b19..8a12ff8a2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_298.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_298.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_299.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_299.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_299.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_299.smt2 index 92f13b9b3..fd900bf42 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_299.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_299.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_3.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_3.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_3.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_3.smt2 index 9326e6031..9fb4e07f7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_3.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_3.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_30.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_30.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_30.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_30.smt2 index 9bc1ee45a..5e54f8021 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_30.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_30.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_300.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_300.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_300.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_300.smt2 index 42aa02325..2598d133b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_300.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_300.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_301.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_301.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_301.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_301.smt2 index 7b1a51e4d..1889f69f2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_301.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_301.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_302.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_302.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_302.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_302.smt2 index 8b9f56a83..67c7026fe 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_302.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_302.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_303.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_303.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_303.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_303.smt2 index eb1b7c0e5..641c2901a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_303.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_303.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_304.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_304.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_304.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_304.smt2 index 4056f1435..bd514017d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_304.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_304.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_305.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_305.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_305.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_305.smt2 index 5877e3f37..8bd12c24d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_305.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_305.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_306.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_306.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_306.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_306.smt2 index bee16aebd..2242cc5ea 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_306.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_306.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_307.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_307.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_307.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_307.smt2 index b545d4cda..a3cbf8fa4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_307.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_307.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_308.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_308.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_308.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_308.smt2 index ad39cce76..89e2fe82f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_308.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_308.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_309.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_309.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_309.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_309.smt2 index 6a3814cf9..773263b12 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_309.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_309.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_31.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_31.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_31.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_31.smt2 index a20453d03..1f1600b71 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_31.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_31.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_310.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_310.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_310.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_310.smt2 index 370b234b0..dc5edc238 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_310.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_310.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_311.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_311.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_311.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_311.smt2 index 4123e2aa2..d6f4e0551 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_311.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_311.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_312.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_312.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_312.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_312.smt2 index ba6394238..39dba5a7b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_312.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_312.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_313.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_313.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_313.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_313.smt2 index 03a99d896..3ba1a59a1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_313.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_313.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_314.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_314.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_314.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_314.smt2 index 19baebd72..56fbfb8b4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_314.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_314.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_315.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_315.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_315.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_315.smt2 index 5486363ac..b739e6f7b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_315.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_315.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_316.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_316.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_316.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_316.smt2 index be82ea6a4..a5f2ef2bf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_316.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_316.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_317.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_317.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_317.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_317.smt2 index 10c73a5dc..34b3fa907 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_317.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_317.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_318.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_318.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_318.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_318.smt2 index 83dc8ee5a..dc1ba2a01 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_318.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_318.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_319.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_319.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_319.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_319.smt2 index c5e3e5fbc..b19bd05df 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_319.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_319.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_32.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_32.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_32.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_32.smt2 index c30e8210d..e7db835d6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_32.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_32.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_320.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_320.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_320.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_320.smt2 index f4f02a2b0..ddd24d008 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_320.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_320.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_321.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_321.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_321.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_321.smt2 index 37bdbdeea..77b781b9a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_321.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_321.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_322.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_322.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_322.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_322.smt2 index 09e6a3601..13ee4ef82 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_322.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_322.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_323.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_323.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_323.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_323.smt2 index 711b6fb80..1906a5374 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_323.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_323.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_324.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_324.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_324.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_324.smt2 index 26ae92310..81de4ff0a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_324.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_324.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_325.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_325.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_325.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_325.smt2 index 3f97bc761..dd10f1407 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_325.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_325.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_326.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_326.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_326.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_326.smt2 index 48c3dd70d..eaae80f81 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_326.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_326.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_327.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_327.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_327.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_327.smt2 index f30ac6c87..d5c12b3b7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_327.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_327.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_328.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_328.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_328.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_328.smt2 index 37e434c31..75a0a921f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_328.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_328.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_329.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_329.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_329.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_329.smt2 index fa9cedcd2..8340ea45b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_329.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_329.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_33.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_33.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_33.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_33.smt2 index 763260d80..403f7f314 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_33.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_33.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_330.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_330.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_330.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_330.smt2 index fb92b08de..7fa3216b5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_330.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_330.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_331.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_331.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_331.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_331.smt2 index fe8b0c7e2..d3d0ca230 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_331.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_331.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_332.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_332.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_332.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_332.smt2 index 14f732004..fb7eadc78 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_332.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_332.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_333.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_333.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_333.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_333.smt2 index 9ec7943dc..fbc553197 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_333.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_333.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_334.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_334.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_334.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_334.smt2 index 93671222b..de4e957ac 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_334.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_334.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_335.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_335.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_335.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_335.smt2 index 7b5e4fe29..d2487864c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_335.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_335.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_336.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_336.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_336.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_336.smt2 index 0714fd185..685c66981 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_336.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_336.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_337.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_337.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_337.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_337.smt2 index fe55bcfc2..9e39c4aa8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_337.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_337.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_338.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_338.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_338.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_338.smt2 index 2742955fc..ed90027bb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_338.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_338.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_339.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_339.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_339.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_339.smt2 index 4a4651d2a..4bf66b26b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_339.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_339.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_34.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_34.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_34.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_34.smt2 index 04d415e29..090b1a79b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_34.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_34.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_340.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_340.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_340.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_340.smt2 index 9d3d65a3e..f09cde4c2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_340.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_340.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_341.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_341.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_341.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_341.smt2 index ea6ce4834..b24e0993f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_341.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_341.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_342.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_342.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_342.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_342.smt2 index f5793b4d5..e8d1d9856 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_342.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_342.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_343.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_343.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_343.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_343.smt2 index 03e69cb8b..4b098f205 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_343.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_343.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_344.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_344.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_344.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_344.smt2 index 7f827c972..8e23214ee 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_344.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_344.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_345.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_345.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_345.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_345.smt2 index 7107f5db6..dca815936 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_345.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_345.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_346.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_346.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_346.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_346.smt2 index c09a73e19..5ddc090a8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_346.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_346.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_347.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_347.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_347.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_347.smt2 index 80aaa0a8a..84450839b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_347.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_347.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_348.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_348.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_348.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_348.smt2 index 140031a2a..a04c16436 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_348.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_348.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_349.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_349.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_349.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_349.smt2 index 477634ed7..264f7c026 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_349.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_349.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_35.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_35.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_35.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_35.smt2 index d339f5251..94127a0fc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_35.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_35.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_350.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_350.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_350.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_350.smt2 index 9eb32b998..77d4a6850 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_350.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_350.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_351.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_351.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_351.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_351.smt2 index 31a8ba625..51a484708 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_351.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_351.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_352.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_352.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_352.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_352.smt2 index 222723bd8..85dfb23a7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_352.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_352.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_353.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_353.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_353.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_353.smt2 index e172d7c6b..150621713 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_353.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_353.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_354.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_354.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_354.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_354.smt2 index e791bc46f..eae243fd2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_354.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_354.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_355.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_355.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_355.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_355.smt2 index 057fcb1d4..e517664ed 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_355.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_355.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_356.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_356.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_356.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_356.smt2 index 55aaae230..c3fd89016 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_356.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_356.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_357.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_357.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_357.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_357.smt2 index 0ec802489..0ae6a1b75 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_357.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_357.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_358.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_358.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_358.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_358.smt2 index 04032df14..3c267928f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_358.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_358.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_359.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_359.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_359.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_359.smt2 index bb63db739..029efa528 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_359.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_359.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_36.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_36.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_36.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_36.smt2 index 6889b7832..b2030e300 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_36.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_36.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_360.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_360.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_360.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_360.smt2 index 3bf2eba7c..eb5e92235 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_360.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_360.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_361.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_361.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_361.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_361.smt2 index 0ded8bba3..34b94ac89 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_361.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_361.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_362.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_362.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_362.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_362.smt2 index 6c350c1ea..40ebc5c02 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_362.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_362.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_363.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_363.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_363.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_363.smt2 index acbc98a0b..2c44967ec 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_363.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_363.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_364.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_364.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_364.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_364.smt2 index 390fbd477..3d50632c5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_364.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_364.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_365.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_365.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_365.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_365.smt2 index a20ffe5a9..86f617a1c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_365.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_365.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_366.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_366.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_366.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_366.smt2 index dd96e2f99..b50284d52 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_366.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_366.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_367.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_367.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_367.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_367.smt2 index 91e780475..0960183fe 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_367.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_367.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_368.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_368.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_368.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_368.smt2 index 64051d809..0f473a9c8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_368.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_368.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_369.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_369.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_369.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_369.smt2 index fa642d4a2..fb37e1f76 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_369.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_369.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_37.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_37.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_37.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_37.smt2 index 2b47e8f7a..994ece26c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_37.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_37.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_370.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_370.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_370.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_370.smt2 index cea9ef0d9..ffddcdac6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_370.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_370.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_371.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_371.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_371.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_371.smt2 index ca1cd4666..6b1bfa580 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_371.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_371.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_372.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_372.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_372.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_372.smt2 index b18d58d81..80c539d51 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_372.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_372.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_373.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_373.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_373.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_373.smt2 index e0eb487a2..7b93f3e92 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_373.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_373.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_374.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_374.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_374.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_374.smt2 index 15e74eafd..4eb878644 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_374.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_374.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_375.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_375.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_375.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_375.smt2 index 840980dc5..c9a8b7fa2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_375.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_375.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_376.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_376.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_376.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_376.smt2 index a9aa238dd..db618d5bc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_376.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_376.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_377.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_377.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_377.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_377.smt2 index c9d66456b..6c810875d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_377.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_377.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_378.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_378.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_378.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_378.smt2 index 9d173f0cb..10fcc1bf7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_378.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_378.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_379.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_379.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_379.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_379.smt2 index 08bba66c5..cfcf0a1ed 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_379.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_379.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_38.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_38.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_38.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_38.smt2 index bdf481f59..4edac95de 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_38.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_38.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_380.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_380.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_380.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_380.smt2 index f78f19177..f4dc2e542 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_380.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_380.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_381.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_381.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_381.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_381.smt2 index 607b55cc1..bf72347ec 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_381.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_381.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_382.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_382.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_382.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_382.smt2 index dada6909d..7441b3804 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_382.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_382.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_383.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_383.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_383.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_383.smt2 index 02b96384b..987d1b5e5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_383.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_383.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_384.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_384.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_384.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_384.smt2 index a2511031e..ddee59424 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_384.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_384.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_385.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_385.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_385.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_385.smt2 index d0a473966..4b1dbbae9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_385.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_385.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_386.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_386.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_386.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_386.smt2 index c3384857b..eedc9c364 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_386.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_386.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_387.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_387.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_387.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_387.smt2 index 01b1c34c7..bab845e53 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_387.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_387.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_388.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_388.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_388.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_388.smt2 index 5e28f7a86..7b3c27a07 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_388.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_388.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_389.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_389.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_389.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_389.smt2 index 5a4a16fb4..9aaf9472d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_389.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_389.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_39.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_39.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_39.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_39.smt2 index 80e751168..bb3079b8c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_39.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_39.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_390.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_390.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_390.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_390.smt2 index 9292dd956..3cfee84c6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_390.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_390.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_391.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_391.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_391.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_391.smt2 index 95eaed72b..a588eeeb4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_391.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_391.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_392.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_392.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_392.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_392.smt2 index aada5708d..e9f322f95 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_392.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_392.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_393.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_393.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_393.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_393.smt2 index 7eda08330..377d57eac 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_393.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_393.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_394.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_394.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_394.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_394.smt2 index 67272e195..43020b054 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_394.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_394.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_395.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_395.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_395.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_395.smt2 index 8e1f064e6..2745e3500 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_395.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_395.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_396.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_396.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_396.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_396.smt2 index 85aef34a6..49bfd89c3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_396.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_396.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_397.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_397.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_397.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_397.smt2 index 76f32e6a8..e431d9068 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_397.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_397.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_398.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_398.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_398.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_398.smt2 index ea893eb5c..1cce61df7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_398.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_398.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_399.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_399.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_399.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_399.smt2 index 8099627ae..d6e65a80f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_399.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_399.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_4.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_4.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_4.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_4.smt2 index 56b1101f5..5d846875e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_4.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_4.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_40.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_40.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_40.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_40.smt2 index 20f150a84..69ffece9f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_40.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_40.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_400.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_400.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_400.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_400.smt2 index c3f0756e9..08cf5e423 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_400.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_400.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_401.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_401.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_401.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_401.smt2 index b5683c966..a80c242cd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_401.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_401.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_402.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_402.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_402.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_402.smt2 index 8f187df48..8e681eab2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_402.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_402.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_403.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_403.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_403.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_403.smt2 index 41db50b59..ec7a4636d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_403.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_403.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_404.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_404.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_404.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_404.smt2 index 47edb645c..d55047b22 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_404.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_404.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_405.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_405.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_405.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_405.smt2 index 5682f1788..e259ea274 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_405.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_405.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_406.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_406.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_406.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_406.smt2 index ec81624d6..85d6fe0f9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_406.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_406.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_407.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_407.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_407.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_407.smt2 index cf3e36f53..71c3ced9d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_407.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_407.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_408.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_408.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_408.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_408.smt2 index 6d7993c12..b20e85385 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_408.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_408.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_409.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_409.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_409.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_409.smt2 index 1700aaf31..09ae0909c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_409.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_409.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_41.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_41.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_41.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_41.smt2 index c4e87092d..9345c212d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_41.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_41.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_410.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_410.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_410.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_410.smt2 index d21a120fe..e1d9c7cf2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_410.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_410.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_411.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_411.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_411.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_411.smt2 index 893a08a2a..9d9854d0a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_411.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_411.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_412.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_412.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_412.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_412.smt2 index c3a3ee69a..1813ee3fe 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_412.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_412.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_413.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_413.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_413.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_413.smt2 index 697e10787..cfe62c21d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_413.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_413.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_414.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_414.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_414.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_414.smt2 index a9e25ef6c..35bccd7e5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_414.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_414.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_415.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_415.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_415.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_415.smt2 index 7e7d14f3a..8b2a18301 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_415.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_415.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_416.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_416.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_416.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_416.smt2 index 15ea0d01e..86a7f869f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_416.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_416.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_417.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_417.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_417.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_417.smt2 index 911881d21..2a1347aa1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_417.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_417.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_418.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_418.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_418.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_418.smt2 index 22e0f5d25..324b0c99c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_418.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_418.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_419.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_419.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_419.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_419.smt2 index fa27110f5..0f978f4f5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_419.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_419.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_42.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_42.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_42.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_42.smt2 index ac4c9df11..6da7570b0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_42.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_42.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_420.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_420.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_420.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_420.smt2 index 985cc467c..5d31f7164 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_420.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_420.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_421.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_421.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_421.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_421.smt2 index e9ef77996..5531eb532 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_421.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_421.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_422.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_422.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_422.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_422.smt2 index ac54eb57e..64bf5b9e3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_422.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_422.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_423.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_423.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_423.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_423.smt2 index 1ab11c70d..0c3559f22 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_423.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_423.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_424.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_424.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_424.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_424.smt2 index 689b61fc0..f0cc557bb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_424.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_424.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_425.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_425.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_425.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_425.smt2 index 98a71ae58..3d42a1c56 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_425.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_425.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_426.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_426.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_426.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_426.smt2 index 183a45319..4d86ff9ac 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_426.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_426.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_427.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_427.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_427.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_427.smt2 index 167272090..41cd57994 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_427.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_427.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_428.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_428.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_428.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_428.smt2 index 598990ddb..0c00ca75f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_428.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_428.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_429.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_429.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_429.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_429.smt2 index b144aff8b..630fb3089 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_429.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_429.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_43.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_43.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_43.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_43.smt2 index e86203246..081c2b464 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_43.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_43.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_430.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_430.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_430.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_430.smt2 index 5997a739f..56766cad7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_430.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_430.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_431.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_431.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_431.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_431.smt2 index 872d4e321..54c45d4f7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_431.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_431.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_432.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_432.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_432.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_432.smt2 index 3e4bf63d9..8e3c311f7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_432.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_432.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_433.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_433.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_433.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_433.smt2 index 4519a81ca..04af95876 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_433.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_433.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_434.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_434.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_434.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_434.smt2 index 466d684ce..6e64652c2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_434.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_434.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_435.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_435.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_435.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_435.smt2 index 788c7c74b..f993c53fb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_435.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_435.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_436.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_436.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_436.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_436.smt2 index 7075f3daa..612941206 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_436.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_436.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_437.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_437.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_437.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_437.smt2 index 50d60e11c..6bb9f2227 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_437.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_437.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_438.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_438.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_438.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_438.smt2 index aa60070ca..752edc4b2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_438.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_438.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_439.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_439.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_439.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_439.smt2 index b66b39a1d..21f91a96c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_439.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_439.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_44.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_44.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_44.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_44.smt2 index cc9c3edc2..dc2514cfe 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_44.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_44.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_440.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_440.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_440.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_440.smt2 index 5f7ab0138..f15bc2c29 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_440.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_440.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_441.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_441.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_441.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_441.smt2 index 66d32d7c2..fd132dae4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_441.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_441.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_442.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_442.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_442.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_442.smt2 index 42d87a7f6..f0666795b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_442.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_442.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_443.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_443.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_443.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_443.smt2 index c4eabbcfb..814536ec7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_443.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_443.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_444.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_444.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_444.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_444.smt2 index befec4927..ed9ddd3ec 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_444.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_444.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_445.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_445.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_445.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_445.smt2 index b48745510..aa518af04 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_445.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_445.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_446.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_446.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_446.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_446.smt2 index fe6cbc3bb..a8d3f53a0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_446.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_446.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_447.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_447.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_447.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_447.smt2 index bd81bb204..e486e00e6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_447.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_447.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_448.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_448.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_448.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_448.smt2 index 024fdb0b5..6d832e5cc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_448.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_448.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_449.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_449.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_449.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_449.smt2 index 4d4128710..e6f3f6717 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_449.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_449.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_45.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_45.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_45.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_45.smt2 index 459a28044..2eb3849a4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_45.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_45.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_450.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_450.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_450.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_450.smt2 index 40d64262d..7bd2f4a52 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_450.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_450.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_451.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_451.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_451.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_451.smt2 index ae8642869..bcb9f289d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_451.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_451.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_452.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_452.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_452.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_452.smt2 index e2822bfd2..0b74a5a12 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_452.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_452.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_453.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_453.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_453.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_453.smt2 index 2e0dce829..17da07cfa 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_453.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_453.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_454.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_454.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_454.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_454.smt2 index 61d64c78d..ec528c6fa 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_454.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_454.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_455.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_455.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_455.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_455.smt2 index 187e78cca..4846b6abd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_455.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_455.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_456.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_456.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_456.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_456.smt2 index 256a8813a..4e89dfce5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_456.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_456.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_457.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_457.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_457.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_457.smt2 index a0067c0ed..9e396995c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_457.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_457.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_458.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_458.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_458.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_458.smt2 index bc0682071..a7283664d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_458.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_458.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_459.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_459.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_459.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_459.smt2 index 88167128e..78041dac0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_459.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_459.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_46.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_46.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_46.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_46.smt2 index a37ab4b90..8483c05fa 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_46.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_46.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_460.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_460.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_460.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_460.smt2 index 1b5047f03..8ca5adf7d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_460.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_460.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_461.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_461.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_461.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_461.smt2 index cdf68b588..21f1470b8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_461.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_461.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_462.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_462.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_462.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_462.smt2 index c4befdeff..ee7bb72b1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_462.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_462.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_463.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_463.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_463.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_463.smt2 index de1d9b754..1e39fbad7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_463.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_463.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_464.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_464.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_464.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_464.smt2 index bd4894f9b..8026e809e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_464.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_464.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_465.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_465.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_465.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_465.smt2 index 4d8c4f190..6cfc7b91f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_465.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_465.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_466.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_466.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_466.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_466.smt2 index adf3ac5c2..029493d8a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_466.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_466.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_467.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_467.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_467.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_467.smt2 index 3b13b93cf..c3412f842 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_467.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_467.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_468.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_468.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_468.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_468.smt2 index eae27818e..d187cb510 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_468.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_468.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_469.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_469.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_469.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_469.smt2 index 2ce1a4b44..13d974ae0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_469.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_469.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_47.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_47.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_47.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_47.smt2 index d0b9e6a91..da35f4215 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_47.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_47.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_470.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_470.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_470.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_470.smt2 index 53985573f..5bef82f11 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_470.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_470.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_471.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_471.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_471.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_471.smt2 index b6ed286ea..fc5299def 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_471.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_471.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_472.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_472.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_472.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_472.smt2 index cee01597d..5e43d663d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_472.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_472.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_473.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_473.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_473.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_473.smt2 index be5b1fc82..ee2f0b19e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_473.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_473.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_474.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_474.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_474.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_474.smt2 index 2b7f19bad..25d1a259a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_474.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_474.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_475.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_475.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_475.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_475.smt2 index 5812caa86..01339dbc9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_475.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_475.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_476.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_476.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_476.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_476.smt2 index 9a675b1fd..b2d7e0cca 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_476.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_476.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_477.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_477.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_477.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_477.smt2 index f30c010a5..a3c5a0949 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_477.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_477.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_478.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_478.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_478.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_478.smt2 index d3f6919cd..c70a744dd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_478.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_478.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_479.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_479.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_479.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_479.smt2 index ec95538a7..1a7f083d9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_479.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_479.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_48.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_48.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_48.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_48.smt2 index 56dab0a95..00e9b3d2d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_48.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_48.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_480.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_480.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_480.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_480.smt2 index aede613f0..c70cdde9f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_480.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_480.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_481.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_481.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_481.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_481.smt2 index ad25ea57d..49ec3b58b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_481.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_481.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_482.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_482.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_482.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_482.smt2 index e08fed63f..7317c2f2e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_482.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_482.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_483.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_483.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_483.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_483.smt2 index 18686e430..7b42dafaf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_483.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_483.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_484.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_484.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_484.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_484.smt2 index f4f3611f0..64a7a0391 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_484.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_484.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_485.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_485.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_485.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_485.smt2 index 6054acceb..d2fccb3ab 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_485.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_485.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_486.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_486.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_486.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_486.smt2 index b3d31f593..33918db3d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_486.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_486.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_487.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_487.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_487.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_487.smt2 index 412dd8f07..3e516a2c5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_487.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_487.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_488.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_488.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_488.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_488.smt2 index 8654b0e2d..ac90adfca 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_488.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_488.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_489.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_489.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_489.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_489.smt2 index 0a7d814f4..af4b34d50 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_489.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_489.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_49.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_49.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_49.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_49.smt2 index 010cd9825..4c3a9880a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_49.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_49.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_490.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_490.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_490.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_490.smt2 index 9da228d03..c20147a98 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_490.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_490.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_491.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_491.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_491.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_491.smt2 index cc0af080d..edd057f56 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_491.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_491.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_492.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_492.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_492.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_492.smt2 index 8ccf72c2a..a3dcc6cec 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_492.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_492.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_493.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_493.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_493.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_493.smt2 index e3c3b6405..e0e84350c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_493.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_493.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_494.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_494.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_494.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_494.smt2 index e173962ce..7a7d92506 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_494.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_494.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_495.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_495.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_495.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_495.smt2 index 506c36d66..eccb78dc8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_495.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_495.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_496.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_496.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_496.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_496.smt2 index 1dd271820..cb21e4985 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_496.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_496.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_497.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_497.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_497.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_497.smt2 index 5a1b3d711..2855be3e9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_497.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_497.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_498.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_498.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_498.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_498.smt2 index 626240b10..326c193e6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_498.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_498.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_499.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_499.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_499.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_499.smt2 index ff7b2e487..8eba22acd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_499.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_499.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_5.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_5.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_5.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_5.smt2 index aa45d7040..ea59cfe79 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_5.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_5.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_50.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_50.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_50.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_50.smt2 index 019413d58..87fdcbf5e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_50.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_50.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_51.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_51.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_51.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_51.smt2 index 3ba2c8576..a65b4036d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_51.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_51.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_52.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_52.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_52.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_52.smt2 index a4714ff1b..8795330c9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_52.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_52.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_53.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_53.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_53.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_53.smt2 index 453d9bef8..3526ba226 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_53.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_53.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_54.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_54.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_54.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_54.smt2 index b223cb480..4aadda950 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_54.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_54.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_55.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_55.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_55.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_55.smt2 index 847cc147a..123deb4f4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_55.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_55.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_56.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_56.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_56.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_56.smt2 index 453992723..26f95058a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_56.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_56.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_57.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_57.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_57.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_57.smt2 index b30364c39..168a2c5c2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_57.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_57.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_58.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_58.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_58.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_58.smt2 index 3cd4f54aa..5770e69a1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_58.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_58.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_59.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_59.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_59.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_59.smt2 index c16f8e406..6f68beb58 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_59.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_59.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_6.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_6.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_6.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_6.smt2 index 539747665..fda4f8785 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_6.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_6.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_60.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_60.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_60.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_60.smt2 index 51b1bc9bc..559dd8fd0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_60.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_60.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_61.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_61.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_61.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_61.smt2 index 8b62ef379..ff425b483 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_61.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_61.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_62.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_62.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_62.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_62.smt2 index 03748806b..11cdc60e6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_62.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_62.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_63.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_63.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_63.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_63.smt2 index 8380a856f..96b31b314 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_63.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_63.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_64.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_64.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_64.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_64.smt2 index cf3461ec2..81c682a58 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_64.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_64.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_65.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_65.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_65.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_65.smt2 index e928c43dd..5b03a5947 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_65.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_65.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_66.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_66.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_66.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_66.smt2 index d437884bb..18d7326b8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_66.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_66.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_67.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_67.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_67.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_67.smt2 index bbaddad20..964336cee 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_67.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_67.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_68.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_68.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_68.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_68.smt2 index 8cb7be04b..8832de277 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_68.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_68.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_69.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_69.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_69.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_69.smt2 index 12856c6be..a92a5b596 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_69.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_69.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_7.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_7.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_7.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_7.smt2 index 1a4325556..346fc9e99 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_7.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_7.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_70.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_70.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_70.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_70.smt2 index 4273ccb6c..d719f99c8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_70.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_70.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_71.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_71.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_71.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_71.smt2 index 286c293aa..8d4b22ec3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_71.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_71.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_72.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_72.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_72.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_72.smt2 index a079e5b42..bc9fb2075 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_72.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_72.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_73.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_73.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_73.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_73.smt2 index 0741da2ba..68c0cbf6a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_73.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_73.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_74.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_74.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_74.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_74.smt2 index a05b10696..4ab245bf9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_74.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_74.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_75.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_75.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_75.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_75.smt2 index b9052ec20..4292061c9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_75.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_75.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_76.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_76.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_76.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_76.smt2 index 4bc9cca0b..aba789989 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_76.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_76.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_77.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_77.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_77.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_77.smt2 index 929e84776..7270c67de 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_77.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_77.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_78.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_78.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_78.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_78.smt2 index c5136c61c..0e4febfcc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_78.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_78.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_79.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_79.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_79.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_79.smt2 index 2116207fb..ae3c7c19f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_79.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_79.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_8.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_8.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_8.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_8.smt2 index d2fc9d372..5b832aebd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_8.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_8.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_80.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_80.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_80.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_80.smt2 index d02b1d51e..01d943a21 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_80.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_80.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_81.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_81.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_81.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_81.smt2 index cf0f1b6b5..f9ce02f39 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_81.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_81.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_82.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_82.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_82.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_82.smt2 index da461f460..18cb62ec9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_82.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_82.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_83.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_83.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_83.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_83.smt2 index 90dd4635c..62634777f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_83.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_83.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_84.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_84.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_84.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_84.smt2 index c5dcf2223..a4a2134a0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_84.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_84.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_85.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_85.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_85.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_85.smt2 index 8e67749a3..77eed4af5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_85.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_85.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_86.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_86.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_86.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_86.smt2 index 74b77b623..4f3b4c436 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_86.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_86.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_87.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_87.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_87.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_87.smt2 index 9caafa044..8ec89ad7b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_87.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_87.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_88.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_88.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_88.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_88.smt2 index d4fc1fc9e..2e757ce88 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_88.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_88.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_89.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_89.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_89.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_89.smt2 index 5c1b1ea84..054be1b3d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_89.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_89.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_9.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_9.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_9.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_9.smt2 index f30ed24cf..6105f86cd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_9.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_9.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_90.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_90.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_90.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_90.smt2 index a7744ab66..4b1c4913e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_90.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_90.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_91.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_91.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_91.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_91.smt2 index 4cd975c6b..1d585d2a4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_91.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_91.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_92.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_92.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_92.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_92.smt2 index 61dd3b7fc..9c7103745 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_92.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_92.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_93.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_93.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_93.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_93.smt2 index d415ef792..a13c46555 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_93.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_93.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_94.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_94.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_94.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_94.smt2 index debacf647..98f73f68b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_94.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_94.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_95.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_95.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_95.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_95.smt2 index fc6630259..7ee1b1268 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_95.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_95.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_96.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_96.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_96.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_96.smt2 index 20381db64..f9aa47146 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_96.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_96.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_97.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_97.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_97.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_97.smt2 index 02ddc9437..1d809759a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_97.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_97.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_98.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_98.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_98.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_98.smt2 index 3bf49586a..7622dd2bd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_98.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_98.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_99.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_99.smt2 similarity index 97% rename from non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_99.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_99.smt2 index f530b6c38..c1b0065f3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-3-random/pcp_instance_99.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_99.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3. Most benchmarks expected to be unsat. diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_0.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_0.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_0.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_0.smt2 index 63564c0d9..cc401a3cd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_0.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_0.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_1.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_1.smt2 index aaf28b1fb..497eeaff2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_1.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_1.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_10.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_10.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_10.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_10.smt2 index 1d5102030..f3fc70fec 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_10.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_10.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_100.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_100.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_100.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_100.smt2 index f38dc193d..9c6edac75 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_100.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_100.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_101.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_101.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_101.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_101.smt2 index 9653a3f33..6e9ef4aef 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_101.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_101.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_102.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_102.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_102.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_102.smt2 index 3d56995c7..01ead9acf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_102.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_102.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_103.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_103.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_103.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_103.smt2 index 0c5b86385..9a3a48eef 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_103.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_103.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_104.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_104.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_104.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_104.smt2 index 6cc4a920a..8825a60cf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_104.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_104.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_105.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_105.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_105.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_105.smt2 index 170987c74..3cf226c34 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_105.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_105.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_106.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_106.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_106.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_106.smt2 index 623f46865..af85d6fc2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_106.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_106.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_107.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_107.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_107.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_107.smt2 index 01989db9f..8b015315b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_107.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_107.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_108.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_108.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_108.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_108.smt2 index f59382801..aaebdc881 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_108.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_108.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_109.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_109.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_109.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_109.smt2 index 5abe8cfc6..8fa574de6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_109.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_109.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_11.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_11.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_11.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_11.smt2 index 1b58445b6..7a1b6ea5c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_11.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_11.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_110.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_110.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_110.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_110.smt2 index bc311b795..dedc6a414 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_110.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_110.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_111.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_111.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_111.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_111.smt2 index e84898f29..18c2be0f3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_111.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_111.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_112.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_112.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_112.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_112.smt2 index 430dc70ac..e11e7e014 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_112.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_112.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_113.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_113.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_113.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_113.smt2 index eb9c476aa..b39442e5c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_113.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_113.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_114.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_114.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_114.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_114.smt2 index 8af62a664..5a61b67f5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_114.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_114.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_115.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_115.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_115.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_115.smt2 index 1645ee2c2..841d633f9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_115.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_115.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_116.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_116.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_116.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_116.smt2 index d44c621e9..1d15bf8ce 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_116.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_116.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_117.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_117.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_117.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_117.smt2 index f067d80b6..2eb7403b8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_117.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_117.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_118.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_118.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_118.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_118.smt2 index b99c47796..ed9494ba1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_118.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_118.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_119.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_119.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_119.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_119.smt2 index 2b5f12b8c..f65f0c418 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_119.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_119.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_12.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_12.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_12.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_12.smt2 index ca993dae2..73979019b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_12.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_12.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_120.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_120.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_120.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_120.smt2 index b460216be..1b4674cd3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_120.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_120.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_121.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_121.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_121.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_121.smt2 index 233147c57..45d3a3384 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_121.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_121.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_122.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_122.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_122.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_122.smt2 index 6e277f4ea..f6558373a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_122.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_122.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_123.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_123.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_123.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_123.smt2 index d39c36b0e..7ab495d69 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_123.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_123.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_124.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_124.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_124.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_124.smt2 index bebcd2d81..9e2c01d0d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_124.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_124.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_125.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_125.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_125.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_125.smt2 index d68ebc62a..cccb2de3f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_125.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_125.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_126.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_126.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_126.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_126.smt2 index ae12a3db4..ef5ff85cb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_126.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_126.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_127.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_127.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_127.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_127.smt2 index d7037ff77..95330f3ce 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_127.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_127.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_128.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_128.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_128.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_128.smt2 index 09f71f4d6..906a6ef25 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_128.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_128.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_129.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_129.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_129.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_129.smt2 index 20be80a6f..6c4eb8b3b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_129.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_129.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_13.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_13.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_13.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_13.smt2 index d0e4219bc..80d7e2a5f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_13.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_13.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_130.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_130.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_130.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_130.smt2 index a8c89254d..0645748cc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_130.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_130.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_131.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_131.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_131.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_131.smt2 index e28d6fee4..41ee354a0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_131.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_131.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_132.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_132.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_132.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_132.smt2 index c1f53ab16..490fad202 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_132.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_132.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_133.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_133.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_133.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_133.smt2 index 4c42cbd76..1df74bc58 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_133.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_133.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_134.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_134.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_134.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_134.smt2 index fdbeb1674..c7593aaef 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_134.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_134.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_135.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_135.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_135.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_135.smt2 index 250e30184..0d8ab0fa5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_135.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_135.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_136.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_136.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_136.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_136.smt2 index 8f327b8d3..03a7220da 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_136.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_136.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_137.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_137.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_137.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_137.smt2 index 88e6bd569..bbee68664 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_137.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_137.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_138.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_138.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_138.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_138.smt2 index e5ca5388e..88993f091 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_138.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_138.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_139.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_139.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_139.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_139.smt2 index 4b433ea0b..c5497efba 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_139.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_139.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_14.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_14.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_14.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_14.smt2 index fe9f4016a..fb89e0088 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_14.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_14.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_140.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_140.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_140.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_140.smt2 index c66134eb3..4b76b6cba 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_140.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_140.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_141.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_141.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_141.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_141.smt2 index ac7863b58..cd30caf66 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_141.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_141.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_142.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_142.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_142.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_142.smt2 index 549b60eb0..1bc61c32a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_142.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_142.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_143.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_143.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_143.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_143.smt2 index c5f8edde5..6daf0adf3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_143.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_143.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_144.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_144.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_144.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_144.smt2 index 36c422d86..8060bae23 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_144.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_144.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_145.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_145.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_145.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_145.smt2 index d9afc43f1..9297590cf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_145.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_145.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_146.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_146.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_146.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_146.smt2 index 37cbdde91..8decb36bc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_146.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_146.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_147.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_147.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_147.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_147.smt2 index 1a718b377..89cb670ea 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_147.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_147.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_148.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_148.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_148.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_148.smt2 index 799a845dc..84e7c49ca 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_148.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_148.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_149.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_149.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_149.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_149.smt2 index 0e9d11340..90c3ef482 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_149.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_149.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_15.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_15.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_15.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_15.smt2 index 5d1665b3f..48fe570dd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_15.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_15.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_150.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_150.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_150.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_150.smt2 index 6fd86a351..41e87f56a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_150.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_150.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_151.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_151.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_151.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_151.smt2 index 6dac2a61e..2a7c61ed7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_151.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_151.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_152.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_152.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_152.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_152.smt2 index 179953fea..70ba93913 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_152.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_152.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_153.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_153.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_153.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_153.smt2 index 6fdf5b85c..0102d9636 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_153.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_153.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_154.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_154.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_154.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_154.smt2 index 5e63b2916..88a78d63e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_154.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_154.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_155.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_155.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_155.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_155.smt2 index 5d7677bf7..2c53c3acf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_155.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_155.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_156.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_156.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_156.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_156.smt2 index 632d87c62..ad8cebecc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_156.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_156.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_157.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_157.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_157.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_157.smt2 index afafc3640..52625c6b7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_157.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_157.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_158.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_158.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_158.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_158.smt2 index f6b28aebf..90c03507e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_158.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_158.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_159.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_159.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_159.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_159.smt2 index f802fd760..3dc1e6502 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_159.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_159.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_16.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_16.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_16.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_16.smt2 index ba84ddf44..3ef42c692 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_16.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_16.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_160.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_160.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_160.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_160.smt2 index eca9ff61a..aeac78cdc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_160.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_160.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_161.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_161.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_161.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_161.smt2 index 80314c793..2c337bdd7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_161.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_161.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_162.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_162.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_162.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_162.smt2 index 0fa7cccc2..ae61f9d40 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_162.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_162.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_163.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_163.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_163.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_163.smt2 index 457e930c1..9e09d52af 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_163.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_163.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_164.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_164.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_164.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_164.smt2 index e848392b7..630e274e8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_164.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_164.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_165.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_165.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_165.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_165.smt2 index 36f5ce8a8..2b2b55300 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_165.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_165.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_166.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_166.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_166.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_166.smt2 index 607b3f54a..5e6fda7e6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_166.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_166.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_167.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_167.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_167.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_167.smt2 index 76e2d7c2d..ca90414d6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_167.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_167.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_168.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_168.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_168.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_168.smt2 index 781de09be..0d267105c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_168.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_168.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_169.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_169.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_169.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_169.smt2 index e0f2ff1a2..d0e392feb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_169.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_169.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_17.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_17.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_17.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_17.smt2 index 6e9bf839b..df16a4d47 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_17.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_17.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_170.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_170.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_170.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_170.smt2 index d75fdc520..15e912415 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_170.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_170.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_171.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_171.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_171.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_171.smt2 index b327ce091..c06e64bf5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_171.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_171.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_172.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_172.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_172.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_172.smt2 index 5d4c31b25..d5455007b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_172.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_172.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_173.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_173.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_173.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_173.smt2 index 1305c7923..a04af40d1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_173.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_173.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_174.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_174.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_174.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_174.smt2 index 80e028842..9804b77b7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_174.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_174.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_175.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_175.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_175.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_175.smt2 index 50bc068c1..1a464ac69 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_175.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_175.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_176.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_176.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_176.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_176.smt2 index 9ea30f9a4..77ee0a97f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_176.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_176.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_177.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_177.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_177.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_177.smt2 index af00febdc..fa397b2ad 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_177.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_177.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_178.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_178.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_178.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_178.smt2 index 0b9c5885a..280c9ee7c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_178.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_178.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_179.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_179.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_179.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_179.smt2 index 022862078..4e6cedc5f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_179.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_179.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_18.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_18.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_18.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_18.smt2 index b56e00013..a76c92586 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_18.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_18.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_180.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_180.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_180.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_180.smt2 index d45a71a96..e60fbbabc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_180.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_180.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_181.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_181.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_181.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_181.smt2 index 15119fadd..ce52a385d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_181.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_181.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_182.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_182.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_182.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_182.smt2 index d0332bcc6..9bf5b40cd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_182.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_182.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_183.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_183.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_183.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_183.smt2 index 0ff40c92d..4096460c0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_183.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_183.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_184.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_184.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_184.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_184.smt2 index b7be2c9a1..d7d663262 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_184.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_184.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_185.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_185.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_185.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_185.smt2 index 2eea05e5f..314ed2fb4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_185.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_185.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_186.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_186.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_186.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_186.smt2 index 47539d19f..6cc4da04d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_186.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_186.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_187.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_187.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_187.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_187.smt2 index 2f0fee3bd..3b682ae86 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_187.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_187.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_188.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_188.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_188.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_188.smt2 index 30b3f08c4..11406bafc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_188.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_188.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_189.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_189.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_189.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_189.smt2 index 348024452..cd62b00f7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_189.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_189.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_19.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_19.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_19.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_19.smt2 index 9af340092..069a4c5fd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_19.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_19.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_190.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_190.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_190.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_190.smt2 index 35a0965a8..90e0be5b8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_190.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_190.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_191.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_191.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_191.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_191.smt2 index 1b3437b3c..bb6e6b8c7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_191.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_191.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_192.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_192.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_192.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_192.smt2 index d4b81ba35..2ebb0c942 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_192.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_192.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_193.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_193.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_193.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_193.smt2 index d29b6f006..be83cef47 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_193.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_193.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_194.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_194.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_194.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_194.smt2 index a79e8b414..d9fb40691 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_194.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_194.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_195.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_195.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_195.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_195.smt2 index 09672753a..b573430ff 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_195.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_195.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_196.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_196.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_196.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_196.smt2 index c323871bd..2d57c4c6f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_196.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_196.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_197.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_197.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_197.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_197.smt2 index e8d9d2791..cd30277d9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_197.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_197.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_198.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_198.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_198.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_198.smt2 index 2687879bb..655c97ac8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_198.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_198.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_199.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_199.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_199.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_199.smt2 index 6f9f1bec8..a088b6751 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_199.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_199.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_2.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_2.smt2 index 70d4bcfe2..f08b56647 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_2.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_2.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_20.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_20.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_20.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_20.smt2 index 60119b2c4..3bb8a90fd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_20.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_20.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_200.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_200.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_200.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_200.smt2 index 6446985bd..203d55861 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_200.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_200.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_201.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_201.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_201.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_201.smt2 index 92242044c..188dc94b3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_201.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_201.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_202.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_202.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_202.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_202.smt2 index 934480b2b..92a3a48e8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_202.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_202.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_203.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_203.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_203.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_203.smt2 index 9e5e713c9..3acd96280 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_203.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_203.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_204.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_204.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_204.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_204.smt2 index 62b126d72..6ec268115 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_204.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_204.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_205.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_205.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_205.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_205.smt2 index 994ae5dfd..25cd2c145 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_205.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_205.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_206.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_206.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_206.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_206.smt2 index 00e13bb0d..490f43372 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_206.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_206.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_207.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_207.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_207.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_207.smt2 index 43f1315ba..763f39800 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_207.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_207.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_208.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_208.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_208.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_208.smt2 index d70ac255b..9d9dd876d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_208.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_208.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_209.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_209.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_209.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_209.smt2 index f483f7c24..0cfadaf90 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_209.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_209.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_21.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_21.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_21.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_21.smt2 index d9a37b05d..6cc8c93ed 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_21.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_21.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_210.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_210.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_210.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_210.smt2 index f381c3c9d..f426e72a1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_210.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_210.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_211.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_211.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_211.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_211.smt2 index 3571a91cf..c91236619 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_211.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_211.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_212.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_212.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_212.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_212.smt2 index f840f938c..d8c13369e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_212.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_212.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_213.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_213.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_213.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_213.smt2 index 7bfafac8c..c68021772 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_213.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_213.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_214.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_214.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_214.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_214.smt2 index 8178571d4..2f841516c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_214.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_214.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_215.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_215.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_215.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_215.smt2 index 7c9ba843c..f079dcc64 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_215.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_215.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_216.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_216.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_216.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_216.smt2 index f58d41613..9fd3e59c4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_216.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_216.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_217.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_217.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_217.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_217.smt2 index 0a030fa38..03b25530e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_217.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_217.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_218.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_218.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_218.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_218.smt2 index 1343a0b13..1e7e124a7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_218.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_218.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_219.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_219.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_219.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_219.smt2 index 53201464b..72044146b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_219.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_219.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_22.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_22.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_22.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_22.smt2 index 91c2edf28..d440235b7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_22.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_22.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_220.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_220.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_220.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_220.smt2 index 9d96daa83..d1087c0c9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_220.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_220.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_221.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_221.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_221.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_221.smt2 index 1254dabce..a1beec048 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_221.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_221.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_222.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_222.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_222.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_222.smt2 index a5ca3f3bd..187ebb33e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_222.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_222.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_223.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_223.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_223.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_223.smt2 index 6f7867e21..8a239e1b5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_223.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_223.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_224.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_224.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_224.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_224.smt2 index 13648d221..7bf5c5f69 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_224.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_224.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_225.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_225.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_225.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_225.smt2 index 207c8c1b1..8ba46894d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_225.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_225.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_226.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_226.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_226.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_226.smt2 index 8482d0602..cfa315787 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_226.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_226.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_227.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_227.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_227.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_227.smt2 index 47a90efec..199c94f6a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_227.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_227.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_228.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_228.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_228.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_228.smt2 index 00cf1aafb..c432d2b31 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_228.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_228.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_229.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_229.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_229.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_229.smt2 index 96c53be58..b25508af7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_229.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_229.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_23.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_23.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_23.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_23.smt2 index 2df594345..0d726903a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_23.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_23.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_230.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_230.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_230.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_230.smt2 index ff70b760b..0ed00c66c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_230.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_230.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_231.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_231.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_231.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_231.smt2 index df099be85..56f292ee1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_231.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_231.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_232.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_232.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_232.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_232.smt2 index 741841249..f5af1f53b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_232.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_232.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_233.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_233.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_233.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_233.smt2 index 57324e2f9..73e9847fa 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_233.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_233.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_234.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_234.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_234.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_234.smt2 index a6e99eaf4..5d15c0cfb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_234.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_234.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_235.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_235.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_235.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_235.smt2 index ac01f1d47..346022b0c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_235.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_235.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_236.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_236.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_236.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_236.smt2 index 5587dfa9d..108699655 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_236.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_236.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_237.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_237.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_237.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_237.smt2 index f326220d6..cef20e7d0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_237.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_237.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_238.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_238.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_238.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_238.smt2 index a401d1855..d96070884 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_238.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_238.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_239.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_239.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_239.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_239.smt2 index 0630638e0..dbdb78a50 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_239.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_239.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_24.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_24.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_24.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_24.smt2 index f22fcfc95..3379dc8a3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_24.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_24.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_240.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_240.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_240.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_240.smt2 index d65951640..61ce1301a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_240.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_240.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_241.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_241.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_241.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_241.smt2 index 9c86bd0b1..67ee8a19b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_241.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_241.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_242.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_242.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_242.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_242.smt2 index deb0cc9a4..e69b914a1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_242.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_242.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_243.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_243.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_243.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_243.smt2 index 1c66b72bc..df8d40567 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_243.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_243.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_244.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_244.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_244.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_244.smt2 index 0ec81b945..d77438c2e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_244.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_244.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_245.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_245.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_245.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_245.smt2 index 8f375c149..b99d747c1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_245.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_245.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_246.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_246.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_246.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_246.smt2 index 153b22551..ed0f77c23 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_246.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_246.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_247.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_247.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_247.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_247.smt2 index a804d8517..148ee3ac4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_247.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_247.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_248.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_248.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_248.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_248.smt2 index 16c60bcee..450620103 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_248.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_248.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_249.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_249.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_249.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_249.smt2 index 4fd7c046d..9cae2531b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_249.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_249.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_25.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_25.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_25.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_25.smt2 index ddfed4abd..9a39f8aff 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_25.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_25.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_250.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_250.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_250.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_250.smt2 index 5b3259d63..cb6ed890f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_250.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_250.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_251.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_251.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_251.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_251.smt2 index ea48cb293..7e09ee483 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_251.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_251.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_252.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_252.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_252.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_252.smt2 index d29f575e2..87c09f4cf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_252.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_252.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_253.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_253.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_253.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_253.smt2 index d7c1c472c..ceeccd301 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_253.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_253.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_254.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_254.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_254.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_254.smt2 index 29e54c02e..6276a7ff0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_254.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_254.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_255.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_255.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_255.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_255.smt2 index 84830d22b..1e7c34ef3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_255.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_255.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_256.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_256.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_256.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_256.smt2 index 726cd63d2..7e26424d4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_256.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_256.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_257.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_257.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_257.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_257.smt2 index a53a71fe0..2df3903e2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_257.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_257.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_258.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_258.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_258.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_258.smt2 index c3a02583c..5142bf62e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_258.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_258.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_259.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_259.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_259.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_259.smt2 index 6d28461ef..9dd24ef63 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_259.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_259.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_26.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_26.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_26.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_26.smt2 index 1cfbf7fe0..d5db09ddc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_26.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_26.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_260.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_260.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_260.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_260.smt2 index 6f7c1a75d..16b484aeb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_260.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_260.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_261.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_261.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_261.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_261.smt2 index c258909a5..e26d07b14 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_261.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_261.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_262.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_262.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_262.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_262.smt2 index 12a612ef5..3858cec09 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_262.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_262.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_263.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_263.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_263.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_263.smt2 index 041314eb9..001c8ac0f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_263.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_263.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_264.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_264.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_264.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_264.smt2 index f5ba12222..6611272a8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_264.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_264.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_265.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_265.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_265.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_265.smt2 index c0cce0953..1d916a4fb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_265.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_265.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_266.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_266.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_266.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_266.smt2 index 6bf44c201..61b90271e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_266.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_266.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_267.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_267.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_267.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_267.smt2 index 78b9f921f..7ee67201b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_267.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_267.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_268.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_268.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_268.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_268.smt2 index b37200055..5065aa597 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_268.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_268.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_269.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_269.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_269.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_269.smt2 index 80c700722..80f0ba85b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_269.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_269.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_27.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_27.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_27.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_27.smt2 index 11f451b56..8d699330f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_27.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_27.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_270.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_270.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_270.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_270.smt2 index f0c3040a4..6e12aa190 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_270.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_270.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_271.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_271.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_271.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_271.smt2 index bfeb0c17d..39e529c9a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_271.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_271.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_272.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_272.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_272.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_272.smt2 index e9d7d288f..64b151103 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_272.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_272.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_273.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_273.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_273.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_273.smt2 index 83343c10f..3019503d7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_273.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_273.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_274.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_274.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_274.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_274.smt2 index 46d531a74..c7514e5d4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_274.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_274.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_275.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_275.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_275.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_275.smt2 index 319f177e1..df852fb6c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_275.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_275.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_276.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_276.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_276.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_276.smt2 index e0f7dc8dc..9d4efc455 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_276.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_276.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_277.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_277.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_277.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_277.smt2 index cba725f48..85f93491e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_277.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_277.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_278.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_278.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_278.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_278.smt2 index 8e93300dd..70e90a88d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_278.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_278.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_279.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_279.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_279.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_279.smt2 index d26fb1821..215f70582 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_279.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_279.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_28.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_28.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_28.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_28.smt2 index 1151d0380..1e60a9d6f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_28.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_28.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_280.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_280.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_280.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_280.smt2 index 01c348ddb..24391f238 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_280.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_280.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_281.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_281.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_281.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_281.smt2 index db1e98795..122d3d947 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_281.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_281.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_282.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_282.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_282.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_282.smt2 index cadb76108..26c4345d8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_282.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_282.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_283.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_283.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_283.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_283.smt2 index d36bcf75e..11e4fee6a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_283.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_283.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_284.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_284.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_284.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_284.smt2 index 15253a166..ed4c2ce3e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_284.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_284.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_285.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_285.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_285.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_285.smt2 index 94f048b9e..45b508a52 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_285.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_285.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_286.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_286.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_286.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_286.smt2 index 60c5c9ee1..10d5dd213 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_286.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_286.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_287.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_287.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_287.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_287.smt2 index 9cffddd12..eb03d30cf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_287.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_287.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_288.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_288.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_288.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_288.smt2 index b4f6ec9ba..2dff30705 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_288.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_288.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_289.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_289.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_289.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_289.smt2 index e00f88ac8..f16df6dea 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_289.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_289.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_29.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_29.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_29.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_29.smt2 index dab8285d7..b7d981f6b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_29.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_29.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_290.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_290.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_290.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_290.smt2 index 65b1b3fff..9ac02b604 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_290.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_290.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_291.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_291.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_291.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_291.smt2 index 04ac89543..728d5392c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_291.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_291.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_292.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_292.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_292.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_292.smt2 index 7f5bd367e..d57397ad1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_292.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_292.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_293.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_293.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_293.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_293.smt2 index 27b6486f2..46c3cfb78 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_293.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_293.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_294.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_294.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_294.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_294.smt2 index aefe34886..19858fa81 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_294.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_294.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_295.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_295.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_295.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_295.smt2 index a91cf7f78..472a5b248 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_295.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_295.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_296.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_296.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_296.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_296.smt2 index 922285025..a388d5a0f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_296.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_296.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_297.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_297.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_297.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_297.smt2 index e9b0c19b5..9bc069ef3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_297.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_297.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_298.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_298.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_298.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_298.smt2 index 4a0edc7a0..0cbc7c57b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_298.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_298.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_299.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_299.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_299.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_299.smt2 index a30a4168f..9080a6cdf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_299.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_299.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_3.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_3.smt2 index aaed6ae87..6d2010782 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_3.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_3.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_30.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_30.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_30.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_30.smt2 index c9eb33e30..9eb583473 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_30.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_30.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_300.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_300.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_300.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_300.smt2 index 3be64178b..77fdc5fd9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_300.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_300.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_301.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_301.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_301.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_301.smt2 index b1ece3fed..5386ce20a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_301.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_301.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_302.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_302.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_302.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_302.smt2 index 7d8e3f918..50556de99 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_302.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_302.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_303.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_303.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_303.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_303.smt2 index 1b5e77903..3cbbb316b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_303.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_303.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_304.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_304.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_304.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_304.smt2 index fdee4497d..80c2ea7d2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_304.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_304.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_305.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_305.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_305.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_305.smt2 index baecddbbc..aec3a3520 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_305.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_305.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_306.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_306.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_306.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_306.smt2 index efa886f65..b7b4c780e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_306.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_306.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_307.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_307.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_307.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_307.smt2 index 51f40a88b..7803f7a2f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_307.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_307.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_308.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_308.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_308.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_308.smt2 index 1920005ce..1b469ba87 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_308.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_308.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_309.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_309.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_309.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_309.smt2 index 9fa625469..9ab3c52f3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_309.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_309.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_31.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_31.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_31.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_31.smt2 index c6d2c31bf..66b862f13 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_31.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_31.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_310.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_310.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_310.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_310.smt2 index e74ad4293..569be3df9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_310.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_310.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_311.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_311.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_311.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_311.smt2 index 5b42f3325..9dc9f0ccf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_311.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_311.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_312.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_312.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_312.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_312.smt2 index 19ca905db..67408e99c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_312.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_312.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_313.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_313.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_313.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_313.smt2 index a78d174e4..075141e41 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_313.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_313.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_314.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_314.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_314.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_314.smt2 index bb49d4312..e02cadc5e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_314.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_314.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_315.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_315.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_315.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_315.smt2 index 4917576e5..adf9dfa60 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_315.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_315.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_316.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_316.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_316.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_316.smt2 index a5d924983..664e5a9c9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_316.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_316.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_317.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_317.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_317.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_317.smt2 index e2b2272e7..733662bb2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_317.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_317.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_318.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_318.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_318.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_318.smt2 index 547f55b64..7f34d8842 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_318.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_318.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_319.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_319.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_319.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_319.smt2 index bde905980..037fdfe04 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_319.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_319.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_32.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_32.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_32.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_32.smt2 index e080967ff..0795179be 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_32.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_32.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_320.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_320.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_320.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_320.smt2 index d580a2834..7048ad3a1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_320.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_320.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_321.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_321.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_321.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_321.smt2 index 036e90e3a..8fbd759db 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_321.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_321.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_322.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_322.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_322.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_322.smt2 index daa90ec58..959d5dae5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_322.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_322.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_323.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_323.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_323.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_323.smt2 index afe9e6c97..34ccf73d6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_323.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_323.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_324.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_324.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_324.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_324.smt2 index e735ec0f7..6ca9c481e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_324.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_324.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_325.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_325.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_325.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_325.smt2 index 741a96b06..ddf01d49f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_325.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_325.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_326.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_326.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_326.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_326.smt2 index 860de2b23..5497584b1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_326.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_326.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_327.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_327.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_327.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_327.smt2 index ecf0fe2e7..54042d8a9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_327.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_327.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_328.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_328.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_328.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_328.smt2 index 4f1f0764d..e3a47f824 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_328.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_328.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_329.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_329.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_329.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_329.smt2 index f2423feea..e0040fb28 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_329.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_329.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_33.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_33.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_33.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_33.smt2 index 1c2724d1d..4572b50ac 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_33.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_33.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_330.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_330.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_330.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_330.smt2 index 87996cbc7..938903845 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_330.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_330.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_331.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_331.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_331.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_331.smt2 index ca6c18fe2..b393fd42c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_331.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_331.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_332.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_332.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_332.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_332.smt2 index 74f34181c..f1d2d14d5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_332.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_332.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_333.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_333.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_333.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_333.smt2 index a4f7f2fad..69838b974 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_333.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_333.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_334.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_334.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_334.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_334.smt2 index 665d7e7de..09c776a5e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_334.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_334.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_335.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_335.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_335.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_335.smt2 index 45cfa9c0a..f93a6e703 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_335.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_335.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_336.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_336.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_336.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_336.smt2 index c3df4c068..9bd2b82aa 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_336.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_336.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_337.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_337.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_337.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_337.smt2 index 88d337257..5bb103284 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_337.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_337.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_338.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_338.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_338.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_338.smt2 index c4fc5e262..8e5c85e99 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_338.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_338.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_339.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_339.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_339.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_339.smt2 index 2be3b3e9e..f073995a6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_339.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_339.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_34.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_34.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_34.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_34.smt2 index 358d00647..0c5086f0a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_34.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_34.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_340.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_340.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_340.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_340.smt2 index a1122bb76..71e2d9576 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_340.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_340.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_341.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_341.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_341.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_341.smt2 index e5882210a..d74289fe5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_341.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_341.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_342.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_342.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_342.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_342.smt2 index 8d6cac8e4..c1b67687b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_342.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_342.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_343.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_343.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_343.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_343.smt2 index fbd51461c..5624abf01 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_343.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_343.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_344.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_344.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_344.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_344.smt2 index ab90345c8..4d7daa74a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_344.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_344.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_345.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_345.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_345.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_345.smt2 index f06f9c2d7..c8cddccd3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_345.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_345.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_346.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_346.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_346.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_346.smt2 index dd07efaad..0adc9ad32 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_346.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_346.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_347.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_347.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_347.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_347.smt2 index 9d251d709..4bd700fd5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_347.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_347.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_348.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_348.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_348.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_348.smt2 index 8665bf656..d194fef0b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_348.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_348.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_349.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_349.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_349.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_349.smt2 index df33010a4..4b7896ea9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_349.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_349.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_35.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_35.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_35.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_35.smt2 index dfbb379fa..6b28d270b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_35.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_35.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_350.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_350.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_350.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_350.smt2 index 72b4c7a1b..4730722df 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_350.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_350.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_351.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_351.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_351.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_351.smt2 index c85f40c96..a09354424 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_351.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_351.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_352.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_352.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_352.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_352.smt2 index e564df904..e5a3e409d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_352.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_352.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_353.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_353.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_353.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_353.smt2 index d072928a2..618cc52f1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_353.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_353.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_354.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_354.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_354.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_354.smt2 index 48ad0bdaf..0fa739b08 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_354.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_354.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_355.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_355.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_355.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_355.smt2 index 6375a9648..d55ef68d6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_355.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_355.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_356.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_356.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_356.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_356.smt2 index d60707656..0e9960218 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_356.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_356.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_357.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_357.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_357.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_357.smt2 index 79f87bc9e..bec66ee0d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_357.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_357.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_358.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_358.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_358.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_358.smt2 index a5e390c6e..41b12ecc4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_358.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_358.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_359.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_359.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_359.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_359.smt2 index 5d00ee746..5ac07e500 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_359.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_359.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_36.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_36.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_36.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_36.smt2 index 4d77af9ef..a0d85cc35 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_36.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_36.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_360.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_360.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_360.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_360.smt2 index ce7128c85..721174782 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_360.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_360.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_361.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_361.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_361.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_361.smt2 index c40365534..253ccb8a0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_361.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_361.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_362.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_362.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_362.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_362.smt2 index 568dd1874..81424bb78 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_362.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_362.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_363.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_363.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_363.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_363.smt2 index e7b1a6a1c..44b097a6a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_363.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_363.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_364.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_364.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_364.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_364.smt2 index 92c8a361a..d629d3484 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_364.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_364.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_365.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_365.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_365.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_365.smt2 index a8eaf99ce..ea582a82f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_365.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_365.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_366.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_366.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_366.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_366.smt2 index bab53be76..d94684c5e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_366.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_366.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_367.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_367.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_367.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_367.smt2 index abc043cca..cf47ddf75 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_367.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_367.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_368.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_368.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_368.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_368.smt2 index 7bfcdd0f0..5ec1aba3e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_368.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_368.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_369.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_369.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_369.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_369.smt2 index c7ba4909a..c6b2fb13d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_369.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_369.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_37.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_37.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_37.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_37.smt2 index 5d61d532b..0be6d2152 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_37.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_37.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_370.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_370.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_370.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_370.smt2 index 2a350191e..f1aaf7322 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_370.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_370.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_371.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_371.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_371.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_371.smt2 index 326c876b1..62b2f8a40 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_371.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_371.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_372.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_372.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_372.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_372.smt2 index 993955493..cd265ee16 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_372.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_372.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_373.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_373.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_373.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_373.smt2 index 32b399644..5cfc6cdd3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_373.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_373.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_374.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_374.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_374.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_374.smt2 index fee8e946f..9f0b39218 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_374.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_374.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_375.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_375.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_375.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_375.smt2 index 52d100a93..5c51e222f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_375.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_375.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_376.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_376.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_376.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_376.smt2 index 4b6816691..5be6be0e6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_376.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_376.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_377.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_377.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_377.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_377.smt2 index 1eb6700be..e8c4ece0d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_377.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_377.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_378.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_378.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_378.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_378.smt2 index 5885a04cd..0540447ce 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_378.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_378.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_379.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_379.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_379.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_379.smt2 index 44b8f0568..cdef576a1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_379.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_379.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_38.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_38.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_38.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_38.smt2 index 140a090fc..87b9edcd3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_38.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_38.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_380.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_380.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_380.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_380.smt2 index 2fd8f3904..d8231d574 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_380.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_380.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_381.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_381.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_381.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_381.smt2 index 03c046168..811795587 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_381.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_381.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_382.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_382.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_382.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_382.smt2 index 74fab5d2e..ecba751b3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_382.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_382.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_383.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_383.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_383.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_383.smt2 index 8c7f39ee5..3428e1c82 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_383.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_383.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_384.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_384.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_384.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_384.smt2 index 963b4fde0..4b9a895fd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_384.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_384.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_385.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_385.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_385.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_385.smt2 index 219c97056..5664975ba 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_385.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_385.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_386.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_386.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_386.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_386.smt2 index aadece817..c04b46bf5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_386.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_386.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_387.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_387.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_387.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_387.smt2 index 96c18131e..7d8ee3c82 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_387.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_387.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_388.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_388.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_388.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_388.smt2 index 129c0a87d..91ac4c721 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_388.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_388.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_389.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_389.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_389.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_389.smt2 index eb98c3c35..e25c7a8d7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_389.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_389.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_39.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_39.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_39.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_39.smt2 index f5c80bbea..eb624101f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_39.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_39.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_390.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_390.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_390.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_390.smt2 index 85f4331b9..44b181e81 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_390.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_390.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_391.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_391.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_391.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_391.smt2 index 288e8aadb..4d58ca0af 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_391.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_391.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_392.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_392.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_392.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_392.smt2 index aca4c2495..bd9e1d4d0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_392.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_392.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_393.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_393.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_393.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_393.smt2 index 964d3ddad..2a905b9d9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_393.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_393.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_394.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_394.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_394.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_394.smt2 index 7e1d993d8..d1b2ca8ab 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_394.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_394.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_395.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_395.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_395.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_395.smt2 index d49023c7b..eca2f2e36 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_395.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_395.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_396.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_396.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_396.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_396.smt2 index 6c8437fc6..d5ac0c5bd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_396.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_396.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_397.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_397.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_397.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_397.smt2 index efb7c3fb3..fa2b213d3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_397.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_397.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_398.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_398.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_398.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_398.smt2 index ee4f58a23..e58db78fa 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_398.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_398.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_399.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_399.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_399.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_399.smt2 index bc4004476..1a68d3e45 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_399.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_399.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_4.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_4.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_4.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_4.smt2 index 8e8b9af58..1492f5a58 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_4.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_4.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_40.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_40.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_40.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_40.smt2 index 690eaadae..9104f1d63 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_40.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_40.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_400.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_400.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_400.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_400.smt2 index 4d828ad53..b0426357e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_400.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_400.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_401.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_401.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_401.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_401.smt2 index 606b4dadd..7e06f9e6e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_401.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_401.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_402.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_402.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_402.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_402.smt2 index c394b865c..f9ad8acab 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_402.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_402.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_403.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_403.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_403.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_403.smt2 index be4e417bc..816dbc6c7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_403.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_403.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_404.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_404.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_404.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_404.smt2 index 2841c8580..5003434ed 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_404.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_404.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_405.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_405.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_405.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_405.smt2 index ae8caa2f9..10f231982 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_405.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_405.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_406.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_406.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_406.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_406.smt2 index bee3b98c6..ae2e3474f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_406.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_406.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_407.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_407.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_407.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_407.smt2 index c5a618354..75c9e5e5b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_407.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_407.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_408.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_408.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_408.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_408.smt2 index 8651a4b09..d6bfbafbd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_408.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_408.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_409.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_409.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_409.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_409.smt2 index 6658a00ee..c30588bc1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_409.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_409.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_41.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_41.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_41.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_41.smt2 index 82157d93f..7c5da59db 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_41.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_41.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_410.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_410.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_410.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_410.smt2 index ff7c7ea5f..8ace755ff 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_410.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_410.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_411.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_411.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_411.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_411.smt2 index 7a57ce111..9f9eb6465 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_411.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_411.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_412.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_412.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_412.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_412.smt2 index bbd02b9ca..03a7dd67f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_412.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_412.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_413.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_413.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_413.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_413.smt2 index 0c20dac00..35d117ce3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_413.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_413.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_414.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_414.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_414.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_414.smt2 index 0e65f8f25..3a4b4d40a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_414.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_414.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_415.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_415.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_415.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_415.smt2 index ed2feb553..b1a0fb99d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_415.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_415.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_416.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_416.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_416.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_416.smt2 index 93719a9ca..cb386b267 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_416.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_416.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_417.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_417.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_417.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_417.smt2 index 2fdddc4e2..7ba7da6f7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_417.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_417.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_418.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_418.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_418.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_418.smt2 index d4edcb02f..79330bec4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_418.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_418.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_419.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_419.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_419.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_419.smt2 index 983d38d30..cdb06c5f6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_419.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_419.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_42.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_42.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_42.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_42.smt2 index 29dd2fa49..a8680d578 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_42.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_42.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_420.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_420.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_420.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_420.smt2 index ff184c1f7..dd0768ce4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_420.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_420.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_421.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_421.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_421.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_421.smt2 index 42afde29b..79a88a898 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_421.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_421.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_422.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_422.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_422.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_422.smt2 index 99dde77fb..57552384e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_422.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_422.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_423.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_423.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_423.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_423.smt2 index 6963d0a2a..aee4fb795 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_423.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_423.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_424.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_424.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_424.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_424.smt2 index afe7c90ff..273f19ccd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_424.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_424.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_425.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_425.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_425.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_425.smt2 index 58b2bedff..2a7ba2f86 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_425.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_425.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_426.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_426.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_426.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_426.smt2 index 3e2ea70d4..334710db6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_426.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_426.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_427.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_427.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_427.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_427.smt2 index d40da7292..33b1ca16c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_427.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_427.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_428.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_428.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_428.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_428.smt2 index ee02c0db3..a73ed1346 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_428.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_428.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_429.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_429.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_429.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_429.smt2 index 08a53b9b1..d96be8919 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_429.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_429.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_43.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_43.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_43.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_43.smt2 index e4c3b6a4d..d2018c43c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_43.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_43.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_430.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_430.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_430.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_430.smt2 index ccc5c00f3..e2bc89320 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_430.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_430.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_431.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_431.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_431.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_431.smt2 index 1be90bcdd..74827fbfe 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_431.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_431.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_432.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_432.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_432.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_432.smt2 index f33324227..a61ae1175 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_432.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_432.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_433.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_433.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_433.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_433.smt2 index 478a8e266..fa5e5ef4a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_433.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_433.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_434.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_434.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_434.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_434.smt2 index 4fab57b1d..38ba0e126 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_434.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_434.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_435.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_435.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_435.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_435.smt2 index c12ec4682..9a5d35efc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_435.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_435.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_436.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_436.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_436.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_436.smt2 index 552a6e231..ac778d45b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_436.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_436.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_437.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_437.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_437.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_437.smt2 index 726e3d257..298e6c123 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_437.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_437.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_438.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_438.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_438.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_438.smt2 index 10beb7e8f..ab13d68e4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_438.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_438.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_439.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_439.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_439.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_439.smt2 index de4e5c15f..0cafc2b21 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_439.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_439.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_44.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_44.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_44.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_44.smt2 index 5c5b04def..86a34fdbe 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_44.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_44.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_440.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_440.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_440.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_440.smt2 index 4d96efc1e..db4d4639f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_440.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_440.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_441.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_441.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_441.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_441.smt2 index f6e1462d6..513b2784c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_441.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_441.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_442.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_442.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_442.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_442.smt2 index 98bee22fa..05969e9d4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_442.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_442.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_443.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_443.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_443.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_443.smt2 index 63613505f..88df50772 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_443.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_443.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_444.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_444.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_444.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_444.smt2 index 3731fcb99..ba70afb29 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_444.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_444.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_445.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_445.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_445.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_445.smt2 index 45a95b79a..37046a3aa 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_445.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_445.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_446.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_446.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_446.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_446.smt2 index f384e2fb2..eb56dc12f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_446.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_446.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_447.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_447.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_447.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_447.smt2 index d0863a375..cafd22b0a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_447.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_447.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_448.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_448.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_448.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_448.smt2 index ee13657f9..618b20808 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_448.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_448.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_449.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_449.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_449.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_449.smt2 index 8d6c81b29..b983d381e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_449.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_449.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_45.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_45.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_45.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_45.smt2 index 0e82d8318..f72c44c60 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_45.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_45.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_450.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_450.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_450.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_450.smt2 index 17f08d39b..bdac641a2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_450.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_450.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_451.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_451.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_451.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_451.smt2 index 8470fe227..dfcf8487d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_451.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_451.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_452.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_452.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_452.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_452.smt2 index 142f2ebc4..7d006021b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_452.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_452.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_453.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_453.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_453.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_453.smt2 index e7f0d4894..f3e9b2dea 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_453.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_453.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_454.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_454.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_454.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_454.smt2 index 2e5a301a6..983b99c67 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_454.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_454.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_455.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_455.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_455.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_455.smt2 index 393a08640..fafcd2d24 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_455.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_455.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_456.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_456.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_456.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_456.smt2 index 68ff140e8..850b0a982 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_456.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_456.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_457.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_457.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_457.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_457.smt2 index 5f9c3dda4..fe5731541 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_457.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_457.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_458.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_458.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_458.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_458.smt2 index e5d3980eb..c2a16b7a8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_458.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_458.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_459.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_459.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_459.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_459.smt2 index 6cfd2220e..6ae45f678 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_459.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_459.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_46.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_46.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_46.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_46.smt2 index daa2ce537..ba0de77f7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_46.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_46.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_460.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_460.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_460.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_460.smt2 index eeb28c6d7..68849e78c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_460.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_460.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_461.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_461.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_461.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_461.smt2 index 80860a8b9..6892dc961 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_461.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_461.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_462.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_462.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_462.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_462.smt2 index 4e1b9d038..8f31b4936 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_462.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_462.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_463.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_463.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_463.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_463.smt2 index d3e11b735..f7fe286ca 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_463.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_463.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_464.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_464.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_464.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_464.smt2 index a24db68e6..ac2786163 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_464.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_464.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_465.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_465.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_465.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_465.smt2 index edcd776ad..d0a98805d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_465.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_465.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_466.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_466.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_466.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_466.smt2 index 7a29734f6..be5f103a9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_466.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_466.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_467.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_467.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_467.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_467.smt2 index eda9ddcb5..3ee425a03 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_467.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_467.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_468.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_468.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_468.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_468.smt2 index 2cc7ab8ea..c3cf8257e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_468.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_468.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_469.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_469.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_469.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_469.smt2 index c2af96f48..bf3392d3d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_469.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_469.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_47.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_47.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_47.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_47.smt2 index 8aeb49a0b..0d32d6ca6 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_47.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_47.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_470.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_470.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_470.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_470.smt2 index 3a63e9b9c..207e770ce 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_470.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_470.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_471.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_471.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_471.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_471.smt2 index 5b3086c4a..965e5cd11 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_471.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_471.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_472.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_472.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_472.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_472.smt2 index f0df2857b..fa9e2e5c0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_472.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_472.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_473.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_473.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_473.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_473.smt2 index ef4c5d692..1c9fbcff8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_473.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_473.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_474.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_474.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_474.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_474.smt2 index 9cfbc6689..533de8832 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_474.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_474.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_475.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_475.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_475.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_475.smt2 index 25066fb10..8f40c0438 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_475.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_475.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_476.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_476.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_476.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_476.smt2 index f47cff02c..5fcee86a9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_476.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_476.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_477.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_477.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_477.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_477.smt2 index 16cf98fc4..9b4b3808f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_477.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_477.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_478.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_478.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_478.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_478.smt2 index e94ffd375..2b9bd7ea8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_478.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_478.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_479.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_479.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_479.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_479.smt2 index f4f3e0547..ac3429751 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_479.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_479.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_48.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_48.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_48.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_48.smt2 index 6afbbd6d3..0fe2b9913 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_48.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_48.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_480.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_480.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_480.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_480.smt2 index 7b90d5669..c59256c8b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_480.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_480.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_481.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_481.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_481.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_481.smt2 index acc4ad070..564d6b144 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_481.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_481.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_482.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_482.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_482.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_482.smt2 index 09dc42a84..5c3f30631 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_482.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_482.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_483.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_483.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_483.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_483.smt2 index dea8dfd1d..3092a9304 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_483.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_483.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_484.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_484.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_484.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_484.smt2 index f26bace91..8a3760d7e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_484.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_484.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_485.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_485.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_485.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_485.smt2 index aa86cb509..c2d037a01 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_485.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_485.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_486.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_486.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_486.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_486.smt2 index 93426a072..3088c9e2e 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_486.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_486.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_487.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_487.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_487.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_487.smt2 index d6ebfe10b..fa01df402 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_487.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_487.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_488.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_488.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_488.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_488.smt2 index 88a6ae771..9d5a3c392 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_488.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_488.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_489.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_489.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_489.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_489.smt2 index caba81822..5565b30cc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_489.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_489.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_49.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_49.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_49.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_49.smt2 index e6c74c1ae..eb4c7792f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_49.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_49.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_490.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_490.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_490.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_490.smt2 index 6ae84d5c1..03e3de402 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_490.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_490.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_491.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_491.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_491.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_491.smt2 index 5d597f6aa..60965bddb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_491.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_491.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_492.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_492.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_492.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_492.smt2 index 9eeda050a..f8fbadeac 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_492.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_492.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_493.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_493.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_493.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_493.smt2 index 99820208d..755689aac 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_493.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_493.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_494.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_494.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_494.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_494.smt2 index 476f29e4c..ed5854de4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_494.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_494.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_495.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_495.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_495.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_495.smt2 index ce58d2e8d..023e491c3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_495.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_495.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_496.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_496.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_496.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_496.smt2 index 083e27841..2870918fc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_496.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_496.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_497.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_497.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_497.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_497.smt2 index 6e1fff020..02ab7f4ca 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_497.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_497.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_498.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_498.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_498.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_498.smt2 index 8419e5958..474c2f78a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_498.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_498.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_499.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_499.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_499.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_499.smt2 index 0a19b4ce5..6e0ff5a74 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_499.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_499.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_5.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_5.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_5.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_5.smt2 index dd6bb228b..191e8aed7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_5.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_5.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_50.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_50.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_50.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_50.smt2 index f02f92d9e..7da18fb61 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_50.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_50.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_51.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_51.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_51.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_51.smt2 index f474d6c9f..7adaf5cde 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_51.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_51.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_52.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_52.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_52.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_52.smt2 index 40aeb776c..87c772dfb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_52.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_52.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_53.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_53.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_53.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_53.smt2 index 685054201..facf29e83 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_53.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_53.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_54.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_54.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_54.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_54.smt2 index 05bae7be6..3c1220fb5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_54.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_54.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_55.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_55.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_55.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_55.smt2 index 4e2a3f0cd..3cb5cd40b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_55.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_55.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_56.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_56.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_56.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_56.smt2 index 365c2d81e..517844bf2 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_56.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_56.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_57.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_57.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_57.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_57.smt2 index 73e940a0d..4bb84a61f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_57.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_57.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_58.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_58.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_58.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_58.smt2 index 4250073e6..a3a5b4cd8 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_58.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_58.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_59.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_59.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_59.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_59.smt2 index f2cc20cb6..fc5f9d449 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_59.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_59.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_6.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_6.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_6.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_6.smt2 index 2d02b3b78..5b5f28acd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_6.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_6.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_60.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_60.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_60.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_60.smt2 index c47b45740..e8ae11e54 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_60.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_60.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_61.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_61.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_61.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_61.smt2 index 80c4a5113..43a2d3766 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_61.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_61.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_62.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_62.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_62.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_62.smt2 index 0c88c3846..ab398d4bb 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_62.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_62.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_63.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_63.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_63.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_63.smt2 index 036e086d0..20fe00981 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_63.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_63.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_64.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_64.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_64.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_64.smt2 index 4811f7ab1..7cd6109df 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_64.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_64.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_65.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_65.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_65.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_65.smt2 index ae091f15e..a8d1cbf85 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_65.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_65.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_66.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_66.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_66.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_66.smt2 index 5c4794573..41541a641 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_66.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_66.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_67.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_67.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_67.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_67.smt2 index 22f3ac707..71b49f61a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_67.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_67.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_68.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_68.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_68.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_68.smt2 index 82b9efab3..c0d75fc19 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_68.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_68.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_69.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_69.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_69.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_69.smt2 index 7b627c226..af71f4ef3 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_69.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_69.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_7.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_7.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_7.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_7.smt2 index 0837e06b4..6f8d426bc 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_7.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_7.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_70.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_70.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_70.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_70.smt2 index b93fff72e..2d98e630a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_70.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_70.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_71.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_71.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_71.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_71.smt2 index a1d706a25..6d2a203f9 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_71.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_71.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_72.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_72.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_72.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_72.smt2 index f29281627..09cc504f1 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_72.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_72.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_73.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_73.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_73.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_73.smt2 index 5168f45ab..52dcfd869 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_73.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_73.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_74.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_74.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_74.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_74.smt2 index a7dba89a0..fd30be5f4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_74.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_74.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_75.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_75.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_75.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_75.smt2 index 3ae9db6f5..43b347eff 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_75.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_75.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_76.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_76.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_76.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_76.smt2 index ee5b80583..7cb41ee3b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_76.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_76.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_77.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_77.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_77.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_77.smt2 index 436a5f01c..ca318017a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_77.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_77.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_78.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_78.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_78.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_78.smt2 index b8d3c27c6..cb5609a6a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_78.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_78.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_79.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_79.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_79.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_79.smt2 index 0bf300cd6..9adf2ab41 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_79.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_79.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_8.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_8.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_8.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_8.smt2 index bc5e64b38..394d1ab4a 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_8.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_8.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_80.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_80.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_80.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_80.smt2 index 71831c474..5bef599a0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_80.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_80.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_81.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_81.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_81.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_81.smt2 index efe42a324..593f5b30b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_81.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_81.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_82.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_82.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_82.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_82.smt2 index 8c54b2954..18e09db59 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_82.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_82.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_83.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_83.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_83.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_83.smt2 index d1222f857..2b826c366 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_83.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_83.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_84.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_84.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_84.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_84.smt2 index a4b42fc8e..2e6069ac0 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_84.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_84.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_85.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_85.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_85.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_85.smt2 index 7760de8fb..b6485d455 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_85.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_85.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_86.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_86.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_86.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_86.smt2 index 37738c00f..df7a780f4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_86.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_86.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_87.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_87.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_87.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_87.smt2 index c45e11d65..11c8b5871 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_87.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_87.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_88.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_88.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_88.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_88.smt2 index ba8bc7567..937232f4c 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_88.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_88.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_89.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_89.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_89.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_89.smt2 index cd45538c4..c184b43ee 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_89.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_89.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_9.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_9.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_9.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_9.smt2 index f8df6b13d..76e8aba2f 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_9.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_9.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_90.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_90.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_90.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_90.smt2 index a600b76df..d2ee01e77 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_90.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_90.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_91.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_91.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_91.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_91.smt2 index cf779dde8..be7fd04e4 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_91.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_91.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_92.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_92.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_92.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_92.smt2 index 62cf7edd7..1109064d7 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_92.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_92.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_93.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_93.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_93.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_93.smt2 index 0d1bfa11a..9358d5cd5 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_93.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_93.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_94.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_94.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_94.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_94.smt2 index c28c7c5ad..7e7a5a182 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_94.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_94.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_95.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_95.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_95.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_95.smt2 index 09cccb9eb..001eaea56 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_95.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_95.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_96.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_96.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_96.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_96.smt2 index 77e814bdc..f828aff5d 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_96.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_96.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_97.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_97.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_97.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_97.smt2 index 8d75f0265..1cb11931b 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_97.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_97.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_98.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_98.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_98.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_98.smt2 index f78e4b41b..724b30cbd 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_98.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_98.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_99.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_99.smt2 similarity index 98% rename from non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_99.smt2 rename to non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_99.smt2 index bbd7ff0e7..36860a1bf 100644 --- a/non-incremental/QF_S/20250403-pcp-3-4-hard/unsolved_pcp_instance_99.smt2 +++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_99.smt2 @@ -4,7 +4,7 @@ Generated by: Oliver Markgraf Generated on: 2025-04-03 Application: Evaluation of String Solvers on PCP -Target solver: cvc5,Z3,OSTRICH +Target solver: cvc5, Z3, OSTRICH Time limit: 60.0 Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper 'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 deleted file mode 100644 index 9179aa8e7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0001.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCGCCCCCAGCCTCTAAACGTAGATCATCCTATAAGTCGTTTCTAACCTTCGCTTCGAATCGAGTAGAGAAACAACGAATGCTCGAGAAGCCTGACGTACTAACTTCTAAGTCCGCGACGCGATTGCCCTCTACGCAGGCGCTGATCCCTTGTGCGACGGCAATATGACTACACCTACTCCGGCGAACGATTACTTCCTA")) -(assert (= z "ucucu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 deleted file mode 100644 index 9992bce9d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0002.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTCCCTGCCAGTGGACAAGCTTGGCCGCTGCGTTACTATACTCTGCTACGTGACAGGGGACTAGAAGTAGGCTGAAGCTACTTGAAGATGGGCGGGAACCGGGAAGTTTCAACCGCCGGGGACTGCTCGGACTATTTACCTTCCTTCTTCCTAGGTAGACCTCTGCAACCCACACATCACCATGGCTCGCATCGTCTTCG")) -(assert (= z "agaaggauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 deleted file mode 100644 index d0ccfa409..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0003.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATAGGACTAAGGTCCGGACTGCTGCCAGGGAACCTCGAAGTGACTTGAGTATGGCTGTGACGCCTTAGGGGCCCCTGAGGGGCGTTTAAGTTGAGGTGAAGAGAGACAGTCATTGGCGACCTACTACATGTAGTACAATTTCTCCTCATAACGACACTGGCCATCCGCAAACTAATGCGCGCCAAATGGCAACAGGGCT")) -(assert (= z "guauug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 deleted file mode 100644 index b1569cc08..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0004.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAGTAATAGAAAGTCCAACTCTTCAAACCAGAGGAAAAACAGTGCGAACCGATCAGAGTTTATGCGCTCGTTCGGGTTGAAGGACATAGGTTGGGTTAGATAGGGAAGGGACGTGAGTGCCACGTTCCCGCCCTTCACTAAGTATCCTTGTACGACTCTTGTAGCTTCGGGTGAGCAGTCCGTCACGTCTTGGGGCGTAA")) -(assert (= z "cccug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 deleted file mode 100644 index 1de8463ff..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0005.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTGGGGCATCTTGGTATCCAATGTGCTAAAAGGCTGCGTTCATATAAGTACCACTCCCCTAGTGGTCAGGAACTCTGATCTACTAAGGTTGTGACGCCCAGAGCAGGTTAGATAGAGGATATCCATAACGATGTTGGTCGAGGTAATGCACTACGATGTACGGCCCCAGCTGTCGAAGCCCACCGTTTGCGTGAAGATAG")) -(assert (= z "gccgggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 deleted file mode 100644 index 61e6b794d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0006.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCCGAACAAAATCACGAAAACGGCACGGGTAGGGCGCAACGCAAACAGGTAGTCGATGTTCATATGTCCTGTTTCCGCAATATACATGAATAATCGGCCGTATCAAAACGATTTCATGGTGATGTCTTCGGAGCGCACCTGTGCGTCTTCCACTTGGTAGTGAGTTTGCCCCGCACGACTGAGGCGCTCCAACTTATTC")) -(assert (= z "acuuauuagccg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 deleted file mode 100644 index 30b9f646b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0007.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCTTCCGTACCGGGAGTGCTTCCGCCAGGACACCCAACGTGGAGTTTATGAAGGCTCTGGGAATTAAGGCCTAGTTCATAGGCAGGGCGTAAAACCAGACTGTCGTCTCCCCATACAATGAGCTCGAATAAACTTGCTTAGCGACGTTGAATTTACCGAGTAACGTCACGTAAACCGACAGGTGACCGTACCTACTTCCA")) -(assert (= z "guccuguggguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 deleted file mode 100644 index fad8d93f3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0008.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGATCAGACTGCATTAGTTTGGTGGACCATGGTAGGGATATGTTGCACCACGGGATAGATAGAAACATGACACGCCTAGGGCTCAATGGGAATGCAGTGGAGGCGTCCAGAGAAAAATTACCTGATAGCTCTGGCTCTTTATGTCTCTTCGGCCCCCCGTAAACCCGTTACAATCCAACACCTCACGGATCACAATCAA")) -(assert (= z "uacaacguggugcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 deleted file mode 100644 index 312a6edd5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0009.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACACAATCGGAGTATGATCTATAGCCATCCACGGACCAAGATAGTTTTTTGACCACGTATAATTCTGAGGTAACAATTTCGCCCCGAGCTATTTAGATTGTTGCTTTCGGAATGGTTTATTGTACGTTGCAACCAACTCACGGTATCACCAACCTACCTTCTAGTCATGGAATTGTCAGGCAGCTACTCTCGCCTTGATA")) -(assert (= z "gauggaagauca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 deleted file mode 100644 index 12b57cafe..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0010.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAGAATCTAGGCACGAAACTACCCTAGGGCTGAGCGACCCTCCTGCTAGCACAAACAGGGGAGGCTTGCTATAAAAACGTGAACGCTCTCCCGGCACTGGCGCCAGTTTTCTTTTTGGCCGCCCGAAAATATACTAAGACCGATGGGATACCACCTTGGATAAGGCGCACGGAATCACTCGCACACCTGTCTAATAGGT")) -(assert (= z "uggacag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 deleted file mode 100644 index 43710b751..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0011.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCACAATTCTTGCATGCATAGTTAACTGTTCCGTATTCTGTTGAGATGTTGCTTTGTGAACGCATGAACTAGCGAGTGCATACCGACAGGCCGTACACTATACAGACCGAATTAGAAATTGAGGCCTCCCCCCGGAGCGATTTTCAAGTATTCAGGGCCCGCATCTCGGGGGTGCCTCCGCTATAGACATATCCGTTCGT")) -(assert (= z "uggcuuaaucu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 deleted file mode 100644 index e980392c0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0012.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGAGGTTCATGCAGCACAACGATAAATTCGAGCCCTTCTTTGCCTGGCGGTCATACCTCGGCTCGAGCAGACCATATGCACCTTGAGAGTTCCCATTGGTAACGAAAAAAGACAAGTGGATTGAGAGACAGAGACGGTACTACTAAGAACTATGTACGAGTTGAAATATCGACTACCGAGTTATCGTTTCCTCGGGTACG")) -(assert (= z "uugcuuuuuuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 deleted file mode 100644 index da19c217f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0013.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAAAATGTCCTTCATAGTAACGATATCCGGAGTAGCGGCTAGACGGCGCTATCTCAAGAACTAAGTCACTACGTGCGACGATGTAGAATGACTACGAACCAATTCTCATCGGTATGCACTCCGTCTCTTTTAGTTCTGCTAGTACGTTCGAGATGCCTCATGATGCCAGAGTGTCACACGAATAGTACTGAGACCAGGT")) -(assert (= z "cuacggaguacuacggucuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 deleted file mode 100644 index 15e296768..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0014.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTTGTCCTCTAGACCTGGTTATCTCCATAGCTTAATTCCTGTTACCCTCGCCTCCCCTGAGTCTTTAGGGAGCTTGCATAGAATTCTAAGTCAACGGGTCGCACTGGCAAGCCGGTTCTTCCCTAGTCCTATTTCATGTGTAAAGATTGTCTATAGCAAGTCAGTTTTCTGTAGAATGCTATCCTTTGTCGTCTCAGCG")) -(assert (= z "cuuacga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 deleted file mode 100644 index 58671068f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0015.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTGTAACCCGTGCCTATACCTAATGGAGCCTGGTATTCGAACGGCTTCGTACCATGGCAATGTATACCGCGTTTTTAGAAGGACTGTCTTTCCGGGCGAGGTAAGGTATGCATTCGCTAAGTGCTCGGTAGGATAGAAGGCTGTCAGGTACGATACATTTTCTACTATGCCCCTGCTTTGGGTTCGCCCCCAAGTGAGCG")) -(assert (= z "aaaucuuccugac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 deleted file mode 100644 index e66ddd8d2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0016.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGCATATTAATACTTCATGGGCTGTTACTACCTATTACCTCCCCTAAGTGCCCTTACGTGCGCGGTCTTCTCTCCGTAGAAAAGCAGTTATAGATTCGCGGGAAGTCTCGCCCAGCAAACTATTACTCTTCCTTTGTCTTATGGCTGACGAAATCCCCCGTCCGTGGTAGAGACTTCAACCGCTTTGGGACCCATCGTGA")) -(assert (= z "auaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 deleted file mode 100644 index 4bd468c68..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0017.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATTTTGTAGATGAATGTAACTGGTATAGGATCTCAGCTTGCCCCCAGGAGGTTCTATGACTATTAAGTTATCCTCGACAGCGCTCGTTAGTTTGCCAGAGTTTGTGGGCACTTTAGGAAAAAGGTCAAGACGTGCAGACTGTATTAGTAGGATAAGAAGCTGTATAATCACCAACGTTACAAGGATTTAGGAGATAGAT")) -(assert (= z "ccgugaaauccuuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 deleted file mode 100644 index cd92e9d4e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0018.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATGATTAATTATTAGACAGTAATATTGATCCGTGGGCACAGAAATACGCACGTTTAAACCGTGAGCTTCAGGGGTATCCCCAAATTGGGCCCGCCCTGAAACGGCTCGATCAGGGCAATGCTTGACCGCACAGCTAAGAAGCTAATGGAGCTCTTCGGCCAGACGCTATGAACCGAAGCCTACTGAGCGGAACCCGTAGA")) -(assert (= z "ucccguua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 deleted file mode 100644 index 008e9a0dd..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0019.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAATCTGTACGGCGACTTTATTTAGACCGGACACTAGTAACACTCCCTTACCGTTGATACCCATCAAACGGGGTATGCGCAGTGGTTACAAAACTCATTGTAACACGACTAAGAGCCCCGACCCACAATTTACGTCATAATTACCACAACGCCTTCTACTTAAAACAGTCGAATGACCTAGCGAGGTCGTCAGAACCTGC")) -(assert (= z "aauguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 deleted file mode 100644 index fd807599a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0020.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGGCGAGACGGCGGGTTTGTGCATAGTCACTGATTTATAGGTCAGCAGAGCCGGCCAAAGATGGTGCACCTATTCCCCCGATTTAACAACCGATATGATTTTCCTCATGAAGTGTGTTCGCATCCGTTTTGAAATATCAGCGCGGCGCCTTATAACAGCGCGTAGTCTAATGCCAACGAGAACGAGTACTGGGAGCAGC")) -(assert (= z "gcucaugacccucg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 deleted file mode 100644 index 17a63618a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0021.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGCCAATGTTCGCCTAGCACACCATACCATTCCTTTTGAGACTTTAGCAGCTCGCAGGTGAAGGAGGTTTTTATACGGCCAGTTTTCCGGTATAGAGCAAACCCATAAGACCTTCTATGCATTGAATGGCGTCTTATTATGAGGAGAGTCGACTGTCCCCCGTAATGGTTTGCTCTGACGTATTCGTATGATGCCTCCA")) -(assert (= z "aaaacuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 deleted file mode 100644 index 181a3f9e5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0022.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGTACTCTCTTTTACCAATGCCCACGCCGCCCGTGGTGCCAAACTAATCCGAATCCCCCTAGCGACCGGTGGGGTTCTCAAATTAGTTTTTACCGCATGCGCGAGTATCAATTGCTATATTGTACCACGTAAAAAGGATAGTTTCCAACAGGCAATGCGCTGATTGGACCCATGCGCTGGGCCAATGTTTCTTGCCTAC")) -(assert (= z "aaaugguuacgggugcggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 deleted file mode 100644 index 93cec9234..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0023.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTAGTGACTGTCGTGAAGCCTGCTAAGAACCGGGTAACCTACCGAACGAACGGGCACATTGCCGACTGTCTCTTAGTCAGAGGGTCCGAAAGAGATCAGCTACCGCGTCCGTCGCGCACTGGCCGGCGAACCTCACGAGTGGTCAGCTAGCGTGCAAGCCGTCATAAAATCCGTGCTAGAGACGTGTCACACATAAGCAG")) -(assert (= z "gcccauuggauggcuugcu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 deleted file mode 100644 index b742f8b6b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0024.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAAATGCACTCCTAGGCCGCATCCATCGCATACGAGCCGTCATTAGGTAGAAACTAAGAGCGCGCACCTTACAGCGGCACAATCCGCATAATTGCAGTACGGGAACCGAGTTAGTAAACTTAGCCCCCCTACGTACGGCGTCCATGCACAACCACAAGAATACTACATATAATGTGCTCTGTTGTTGCCAGGGCCTATGA")) -(assert (= z "ugaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 deleted file mode 100644 index 305da28f8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0025.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGAAGATTTGCTCTTGTTTTACGGTGGCTCAAACTCGCACAGGATAATCGAACGATCTTACGCTGTAGATCTCATTATGCTGATCAAGTTATCAAATCGTTTGAAGTTTGAATTGTGTGTTAGGTTAATAAGGAGCGAAGTCGGACCTTCGTCCGCAGGTTTTATTTGTCTGATCCCCTGAATAAGGTACCCGTCTAAG")) -(assert (= z "uauuagcuugcuagaaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 deleted file mode 100644 index 5a7690d38..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0026.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTAGCAGAGACAGTGTAAGCTCTCATGGTACATGTCCACTATTGGGTGAGTCCTTCTACCCGTACGAATGAAGGTAAGTAGAATGTACGGTAAACGGATGACGGGGCGGTCGAACTAAAACTGGAGGACATTAGATCCACCAGTAAATAACAACGCGGCTATTCTAAAGGACTAAAGGGTCATTCACCACCTTGCTCGG")) -(assert (= z "cauuuauuguugcgccga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 deleted file mode 100644 index a20a33358..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0027.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTTCACCTAACTCACATTGTGGTCACAACCTACTTAAATATCAGACGACCGATCGAATACAGCTGTGTACTTATAACCTGCCTTCTCCTACTGGCGATACCCACCCCATGTAGTCACTGGCCGTTCAGTTGCACGGAACTGGCAAACCTCACACGCTCTCCGACATGAACGGCTAGATCTTATCAAGCGCTCACTATCT")) -(assert (= z "gugggguaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 deleted file mode 100644 index 313507e6f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0028.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGTTTGTCAGCGCGCTTAATAAAACCTCGACCCTAGAGCTATGACTATTGATTAACCTACGGGATTACCATCATTTGTTCTTATACCCCTATATTAGAAATATTGTGCGCAGGCCTATACGAACGAATTGGAAAAATATATCGTCTGTCCGGACCTGGACAAGTCAAGGACCGAAAGGGTTCTTAGAATCGCGGCACCA")) -(assert (= z "uuugga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 deleted file mode 100644 index b4292d609..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0029.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAAATACTTTCCCCGGTCATTCCGGTAGTCTAAAGGAACAAGGTGTGTCACCACCTCTGGGTGACTCGCGCGTTGGACATCACGCCAAGTGCATCAATTTGCCCCAAGCCGTTTGCATTAGTTTTCTTCATGACTAAGATGTTTGCCGCAAACCAGTAACTAATGCGCTTCCACGCTGTGGTTACCATCGCGCTGCCAGG")) -(assert (= z "auuuccuuguuccacac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 deleted file mode 100644 index 546b719e5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0030.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCCTTACTGAGTTCAACCTGGGATGCGGACAGGTGCGAAATTACTTAACACAACCTAAGCAAAAACCCAAAAGAGACCAGATAAAAGGTAGATTTGCATAACCTTCTACATTGCCGCCTGAAGTTGGCAAAATAAAATACCCTATTTTTGAGAAAAGTCAACGATCACTACATTCTTGCAAGGGCGTACATCAAACTGG")) -(assert (= z "uuuuauggga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 deleted file mode 100644 index 99703a09a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0031.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCTTTCACTGAACACAGATCGAAGATTTTAAGTGAGCGTATCGACAGAATGTCACTGCACTTCAAAGTTGGGGAGCCGAGCGCTAGTTCGATTTTGGCACGAGTCGTCCGCTCTTTTCACGGACTGTTGGCTCCCCACAACTGCTCTACGCTGTCAACCGTGCGAATAATAGTGCAAATTGTCCACATGCCTTGAACTC")) -(assert (= z "cccuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 deleted file mode 100644 index 32d724cbc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0032.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGAGTTGGGAATTTTAGGCTTCCCTGAGCTGCTCGAGTCACTAGTGGGATTTTTTCGCAGAAATATTACGGCAACAAATGCGATGGCGGGTCACTGGTATATTCACCCGACCCTTAAAAGATTGCCGAGCAGGTCTTGTGGTAGATCTGTCTGGAGGGCGGAATTACGAGCATGCGACCCTTGTAACTCTCGTTCTTAGT")) -(assert (= z "uuucuaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 deleted file mode 100644 index d961f1657..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0033.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCCCCGTGCGTCCGGCTTCTCCCCATGCTGAAGTATGGTATTTGGTAAGCAGCATAACCGGGTTGAGTCAAACATCTTAAACTATTCAACTCTCCAGCTACTTTAGTATTTGTGTCTTCCGTATCTTTTTCCCTTGCCATTTCTCAACAGGAAAGCACCTCGGGATACCCCTGTCCCGATATAAACACAGAATGGAAATG")) -(assert (= z "cguauuggcccaacucag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 deleted file mode 100644 index daf7e9d30..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0034.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GACATCCCTCTGCTAGTCCATCATAGGTCGTTCTGGTTGCTCTAAGGCATATCTGCTCTCCCTCTTCCCAAAACCATCCGAAATATCAGGCTACGTGATGGGCTACCAAATAGCAGTCTTTTACTGAGAGAGACGATGTGTGATATAACCACGGAATAACTCACGCCTCTTGTGTCGATGGACACATTTCTCTAAAACAG")) -(assert (= z "aaugacucucucugcuaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 deleted file mode 100644 index d4e62d396..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0035.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTATCTGTGTGATCACCAGCACACTCGAGTCTAAGAGATCTGGTAAATACCAGCGGTAGGTCAATCATGAGATGGCGCTCACACCAGAACCGGTTTTGGACAGCGACAACAGGCGCTCCCCTAATTGATGTTATACCCGAAACAAGACCATGGCTTTAAGTAATCGTAATGTCCGAACACGGAGGAGGTTTGGTTAGTGC")) -(assert (= z "cuagaccauuuau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 deleted file mode 100644 index d835fb88e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0036.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCCTGCCGGTAAAAAGTTGTGTGGGTCAGCAGTTTATTCGTGTACTATTCAAGGACAGTGACTCAGTGTCCTGTGATAGTTGCACCCGATAAGATCCATCTGCGATCGTGTTTCAACCTGTAACAGGACTACCCCGAGTTCCGTGTAGGCCTCTAGTAATTCAACCAACGGTGCATCCCTCAGCCGATGTCAGGAGAGA")) -(assert (= z "uuggacauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 deleted file mode 100644 index 95e7c20a2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0037.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTATGTTCCTAAAGAGACGACGATTGCCGAACGACTTTGAAAACACTGACTTTAACCGACTGGCCGCAATGTAGAGACCATTATGAGGATCACGTACCTATATGAGGCAGAACATTTACGCTATCGCTTCCATGGCGTTTGTGATATGGTTTTAGCTTAGTCATAAATGCACGCGAGCGATGAGCAGAGCTGTAAGGTG")) -(assert (= z "cgucucgacau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 deleted file mode 100644 index 7c403d9b7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0038.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCGTCGCGTTGCTAGAGTAACTTGAACGTAGCTCAGGAAGGTAAGGGACGAGTGTCGTCTTCGCCCGTGCTTGCATCTTTCCGGCTGTGGCCTCTAAAATCTTTGTCACAAGCTTTGCGTCTTTTTTCTGGATCAGCAAATAACCAGTTCCTCACGTAGCAGCTTCCGGTTAGTAATTATTACTATGGTTTGGCAGAAT")) -(assert (= z "ggccgacaccgg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 deleted file mode 100644 index e922a55ec..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0039.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGATTTAGTCTCTGCCATTCTACGGAGAACTAGGCGTGGGGGATAGTGTAATAGCGCCGATTCGGGGAGTCGGCTAACGGGAGCTGAGGGTGAAGACGGTCGCAAGTTCAATGGTCAGTTTATCACTGGTCTTAGGCGTCGATACTACGTACTTCAGAATGAGGTGGTATTATTTTACTAGAAGCCTCTAGGTAGCGGAG")) -(assert (= z "cugcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 deleted file mode 100644 index d9becf05b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0040.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCACGCGCTGGAACTAACGCCACGATCTTATCGGACAAGTTTGAAGACAAGTCAGGCGCGTTCGTCACGCATACATCGAGTGCCGGCACCGTGCCCTAGGGCGCAACACCGCAATTCGTTGGGTGGGAAGCTGACTACTCACACGGGATTGGGGCGGATTACCACCACTCCAAACTGCCTATTTGTGTCGAATGCGCAT")) -(assert (= z "accuugauugcggug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 deleted file mode 100644 index 31d59ffc2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0041.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAAGCGGGCAGTGACGGGCATCACTCGAGCTAAAAGATACGGAGTAAGGGTGGATAGGGTTCTCAGTCACGTTCCCTCAACCTACATCCGGGATGTTGATCATCGAAATAGGCACCTAAGAACGCGGGAGGGATGCCGTTTGATATTCGGATGAGCCTTGTGGCGGGTCAACATACAGGGGGGTGTACGGCATTTTCACC")) -(assert (= z "uacaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 deleted file mode 100644 index 5e6afbaf4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0042.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCAAATACGGATCATCCCTTTACTAAGTCCCGGATGGTGGACCCGGGATACAGCAATCAAAGGGGTTCATATAACAGGGCGGCTCTATCGTATTGAGGAAATCCCATTACTGGATGTCTACTCTCGAGCGATGAGTCAGACTGTTTAGGCGGATGCCCACCGCGCGGAAGACAATTAACAAACGGGTATTGTGCGATCAG")) -(assert (= z "cgcuaguc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 deleted file mode 100644 index 3a94e0139..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0043.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGCGCTTTCCGCCGATTCTGGGTAGTTAGGGCTAAGCTCACTGGTACCACCCTTAGGGTATGCGTCACTTGTGCACACGTATGTTATCAACATACTTCGCATATAGTTCTTGAACCATTACTGCACAAATATTACAAGGTGGTGGTCTTGGAGATTAAACGCCCGGCACTCAATGCACGCAGGCGATTCTAACTCAAGGT")) -(assert (= z "auucgagugaccauggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 deleted file mode 100644 index 91abdc2ac..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0044.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTTGTTCCTTGCGCCACAACAGCGCCTGATTATCTGGGCTATCAGCAATTTTATAAGGTGTCAAACGGGCTACATCCGGGGCGGACGTAGCCTAATGGGCGCCTGTCTCGCTCGAGAAGGCACGACATAATCCCCTCATCTGCAGCCAAGGCAATGATAAACGCTCGTCTGACTTGGTCAGGGAACAAGAGCTGAAGAT")) -(assert (= z "uccacaguuugcccgaugua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 deleted file mode 100644 index 9a08383a4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0045.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCAGTACCGGTTTTGAGCCTGTAGGATTGTGGGGTCACCTACGACCGCACCCACCCAGTTCGACGATTCCTTCGCCAGGGCCTCGATCCCACTACCCATCAGGCGCGACAATCTTTTAGAGCACATTAAACTGCCCAGGGCTCCCATCGTCGTCCAGCGATTGCCCGAGTAAAAGGGCACTGCGAATGTCAAGATGTCT")) -(assert (= z "gugacgcuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 deleted file mode 100644 index c064a03a4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0046.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGTAGCCTTCTGCGTGAGGTCACACATCCGCGGGGTGCTCGGCCACGGAGCCCCCGCCTCCGGGAGAACCCCGGTTTCCGCGTGACAAAGCCGGATAGTGTTTAGGTGGCTGACCCTAATTAGTCCTCAACAACAACTCGGTCGGAGTATACTACCCCGAAGTAAGTTTATCTGTTAGACTGTTAGCAGACGATATTCA")) -(assert (= z "gacugggauuaauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 deleted file mode 100644 index e514205fc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0047.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCCTGTGTTACCGGCTTCGCACTACACATCAAACAAGGATGTTTATGTGACTTTTGATCGCTACTATGCAACACTCTCTCTCTCGCGCGTTCCTACCACAAAGCGTCTGATTCATACCGTCCATCGTAGGAATCGGTTGTCTCCCTGACCCAACACAGGGTACCAGGCAAAGTTCTTCCTTCCGACTATAACCGGCTCT")) -(assert (= z "ugauauuggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 deleted file mode 100644 index b00bf0363..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0048.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTGCTGACCTATTAGCTTTTTCAGGATCTAACAAACTCGATCCGTCCGGGATCAATTGGACTCGGCAAGTCCATGCCTCGTACTGCGACACGCCAATAACCAAGCACTAACAGGATCACCTTGGGAGCGCATTACGGTCTGTAGGTTGTATCACATGCCAGTTACCTTTCGATTGACCAATCCCTATCGGGTTTTTCGT")) -(assert (= z "auuguuugagc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 deleted file mode 100644 index 7002a5f95..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0049.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTTGAGGTAGCCTGGATCGAGGAGGATTGGTGCAGTGTGCTATTGTTTTTCATTTCCCAGCGCAGCGGACCTTGCCGAATACTCAAGCACGGGTACCACATGGGCATGGGGGGGTTAAGACTACTAGCGCTAGTACCTCGAGGAGGTGTACCCGGGCTTCATAAAATTAGAGAAACTATTTTGGAGGTCACTTCCATTA")) -(assert (= z "cccccaauucuga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 deleted file mode 100644 index a8aa09ebc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0050.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTTGTGTAACAAACACAATTATGGCTACCTTCCTGTCGTTCTCGTCTAGAGAGGAGCTTATGTGTCCATAGCGCTCCAAGATCTACCTAATGCTCGTTAGCTACAGGAGAGCTGATGGCGGCCTTCTTATTGATCCAATACGATAATCATAAGCGAATAAGTACAAGTTACATGGATTACGGTAAATAGTAAGGATCCG")) -(assert (= z "uacacaggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 deleted file mode 100644 index 994a9da0f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0051.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGGGTAGCCTAGGCGTGCCATGGCATGGATGCTGGCGATACATCGTTTCTGCGCCGCGGGGGGAAAGGGGAGTCCTAGCTTAACTTGCGGACTATCCACGACCCAGGTCACCAGTTTCCACACCGGACAGCGCTATCACTGGCTAAAACGCCGCTTAATTATCTCTGGGCAGAAGAGATTCCAGGGTAAGTCGTAATAA")) -(assert (= z "cccauucagcauua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 deleted file mode 100644 index f236a8303..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0052.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATGCTTTTGATGTGTTTAAGTTAACTAATTGGCATCGTGGCATCGCGTTAAGAAAATTGTCCAACTCTATTGAGTGTCTCTATGAGAAAAGATGAATTCTACAATTCTCTAGGAGGTCGCCCTAAGAGCCAAAATAGTGCGGTTGAAGTTCCGCATTCTCTATGCCTGTCTACGAAGAAAAGGGTTGCTGGAAGTAAGCA")) -(assert (= z "gcaauucuuuuaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 deleted file mode 100644 index 49f1fb200..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0053.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATGCGGCTGCGCGTTGTTTAAAGTCTAAATAAAGACGCGGTTCGAAGAAGAGTTCGCAACGATTGCAGTAACGATGAGATGCTCCTAACTGCCCCACGATATACGGTGTACATAGAAGTCGAATATCTTCCAGAGTTTCCCCGCTGAAAATACACCTCAGGGGCCTCGAGCTGGGCATCCAGTGCGATGGCCTGGACACC")) -(assert (= z "cgcuaccggaccug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 deleted file mode 100644 index 762dfdfe6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0054.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGATGTGCGGGCCTGTGTATGTCACTAATGGCAGTCTATGAGACATATTTGTTATGGTAAGTATGCTCACCTAGCCATAAGTCGGCACCTCCGCGGGGTTCGAAATACTGCGTGGGCCTACAAATCTAGTTGACTAATAACTAATTGGGACCAGCCTGCGAGATAAGATTACGGACTCTTAATCGGTCTTGAGGAGCCAT")) -(assert (= z "acgcccggacacauacagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 deleted file mode 100644 index e01ba9566..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0055.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGAGGTGCCCACCCCAACCCTCATTCCAGCCATATTACAGCGACCTGGCCGCAACGGTGGCGACAGTCTCAACAGCCGGGCTGGGCGCGGCCTTGGCTAAGCTTTTTCTGTCGGTTTTAACTCGAAAGGGGCCGGCCTATGGAGTCTGGAGCTGGAGAATACCCCGTTAGCCGGCCAAATCAGCTTTAAAAATATCTGAG")) -(assert (= z "cacgggugggguugggagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 deleted file mode 100644 index c5fcbe6f7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0056.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTTTTGGCCAGTGACGTATCATTGGTAACCCCATTGGGAGCCCAAGTCAGAAATCGCTGCCACAGCTGTTGGTTCGGCGGCTTAACGCTACCCGCTCCCGGCTTGCTAATTATTTGAGGTGTTGGTAACTTTATCTGCTGACGGCCGCCCATAGGGACCGCGGTATGCGCTTCAAGGTCGAAGCGGCCTTTACTCTATAA")) -(assert (= z "gucacugcaua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 deleted file mode 100644 index 31ad09474..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0057.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCGGTCCCACTTGGCCTCAAAACGCACGGCATGAAATGTCAATACGAGATTGGACGCCTGGGTTACCGACGAACTTTGGGGTTATGCGTCGCCATGGTTAAGTTCCAGTTTTGTCCCAAGGTGAATTATTCATTCACGGGTGAGACTTCTCAATGCTTCCCACGTACTTTATCGTCTTTAGGGTGGTATGCTGTTAAAG")) -(assert (= z "ccacuuaauaaguaagug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 deleted file mode 100644 index 9c39e98f9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0058.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTGGGGCTTATTGTTTGCCAGCACTTAATGGTCGGCTGCTCGGTCGTCTACAGCTTTGACGGATAATTGAATGTGTAGATCAAAGCCTCCGCCGGAAGTAGAGACTCATAGTCAGGGGTATAGCGCATTTCGGACTTCACAAACTATTGGGTTAGTAACGGAGGTATAACCTCTTATATGTCACCGGTCGACTCTCTAA")) -(assert (= z "ucugaguauca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 deleted file mode 100644 index 6466f3e1b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0059.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCAACCCTATCTACTTATTCAGCTAAATCTTTCTAACATGGAAGAGGTCGATCATGTACCATATGTCAGATTGAAAGCGCAACCACGCCGGTTCAAGGGTAAGGAAATACGATCACTGTGCGGGGTCGATATTTGAGCCCGACAAAATGTCGGGTCAGCTCCCGTCTAGTCACGAATCGCCTAGGAGCAAGGCAAGCTC")) -(assert (= z "uagaugaauaagucga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 deleted file mode 100644 index c59704888..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0060.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATCCATAATGAGCCTTAGGTATTTCGGTACTTCAAGGTGCGAACCATTAACGGCGGAAATAAATTAGAACTTCATTGTCATCCCGCCAGATAGTCAGTAGTCAACGACCTCGACGCGCGATCCCCATGAAGGGACGCAGGGGCGCCTACTGATTAACATTGAATTCAATGATTATCCAGAGGGAGCCGGTCCGAAGCCC")) -(assert (= z "gucucccucggccaggcuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 deleted file mode 100644 index bfd1edcfc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0061.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCAAGGACCATCCAGCTATCGCTCTCACACGCTCATAGTCGACCATCTCCTCGTAAAGGCCCGGTATATTTGCTACGCTCCCCCGTGCGCCTGCTATTGAATAGGTAACCGGCCACGATCAGCATAATGCCTTAAGTAATAGATTACAAGCACCGTGGGGTACATTCAACACCGAGCGCAAGACGTTGTATCGAGACGTT")) -(assert (= z "uaaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 deleted file mode 100644 index 756cd3933..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0062.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTAGCACGTGTCAGCAATAGGCAATATGGTACTTTACCGACAGATTCTAGAGGCAACCGGTAACCCTATTATGTTGGTATAGTGCTCTATTCGGTTTAGTAACGCGCGTAGCTACCGTCCCCAAAGCGATATAACTACGCCACAACTTCGACCGACACGCATCGAGAAACCAGCGTTAGCCCCGCAGCTTGTGGAATGT")) -(assert (= z "aagccaaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 deleted file mode 100644 index f6748dc09..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0063.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTACCTGTATTACTGATGTTATAGTTGTGTATGCGTCGGGCGGGTCCTCCGCGCTCCCCTGGGCCATACCAATGAGCAGATACAAAGGCTTTACTACGAAAAATGCAGACCTTAACGAGTAGGTCGGCAGTATCATTGCTTTAAAAAACTTACAGCTAGACAATCAGGATCGCTGTCACCGCTTTGAACTGGCCTGGACC")) -(assert (= z "uggcgaaacuugac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 deleted file mode 100644 index cde30bb8e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0064.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTCTAGGCCAAAGTTGCTCTACCCCATTCACTGTGAGTGCGTGGGTGGGTCTTATCATGCGAGTGTAATATCATGTCCTAATGTTAATCTGCTTAGCGATCGGGGCTGTAACAGGTCACCAACAATCGAACTAATATGGACATCCTGAGATTTGTTTGCTCGGACTCTCTCTTTGTTGACTCGAAGTTTGGGATTCATG")) -(assert (= z "aguacgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 deleted file mode 100644 index 979f1d555..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0065.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATGCATTGGATATCAGTCGGCGTTCCCTCATTGTACAATACGGCGTCGGGACGACAGGTTGTCAGTTGAGACGAGGCTACGCGTTTTAGAGTCCATTAATATCAATAAGACACACTCGGATATCCTTGAGCGACCCCGTGCTTTGGGATTCTCCGCAATCAAGGGGCTTAGCGTTTCATAGTGGTCTGCTCGTTATCAG")) -(assert (= z "auagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 deleted file mode 100644 index 81091b54f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0066.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCTTGTTCGCATACACAGATAGTTGAGCTGGGTTCGTCAAGGGATAGTCTTCTTACGTCCAACAGGGGCACATACTGCGCTTTCAGAGCCTTTGATGATTGTCCTGGTGATGGACGTGGAAACCAGTATCCTTCCTTCCAGCACTAATTAACACTGCCGCCCCGGCCCGCCTAGGTCGATGTCCCACCGGGATCGACGAC")) -(assert (= z "ccaagcaguucccuauca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 deleted file mode 100644 index 6a846ec16..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0067.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCGACTGGCCCCAACCAAAAAATGCAGCTTAGTAGCTCCGGAAAAAACCGGCAGTCCTCCTAATACCTCCCCACATGCAGTGTGGGCCTATCTATAAGCCCACGGACACCGACACAAGACGATGTTGCGTAACGAGTGCATCCACTCCTCAGAGGTGTCGGCAACGGGGTCAGACTGTGTGTTCACTTCCTGATACGAG")) -(assert (= z "ggauagauauucgggugcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 deleted file mode 100644 index 76092637a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0068.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCATTCGAGCGCAGATGCACGTGTGATCCAACATGTGTAGACCAGACGCGGGCGCCAATAATGTGCACTGGGCCATTAAGAGGGTAATTGCTCGTTCACACGAGCTTGCTCGTAGCATTAGTCATGTGGGCTTTGTTCGATCACTCATGTTTGCCTTCTTGATCCACAGCTGTACGAAGTTTATGATCCCTACAGCCGAC")) -(assert (= z "caaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 deleted file mode 100644 index c66d0146e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0069.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCCTGCGAAAACGTCCACGAAACAAGCCAAACTGACATCGCAATAATCCTCGACTGTACGTCCAGGAGGAGTGACGCTCTGTGCGTCCGAGAGAGTCTCAGAAAGACCTTCGTAACGTGAACAACATACCCGATCAATTGTAATAGATCCGGCCCTGTGGCGCTTCGCATCCCAGTTCACCTCTTGCTCGGGTGTACAA")) -(assert (= z "ggugcuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 deleted file mode 100644 index 74820e178..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0070.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTCTATGACCAGCTTGTCCGCTTGTCCACCAGCCCCACACGCAAGCTACCCGTGAGTACTGCGAAGGATAAGAGAACAGGCGGGGGAGGTTGAAGTTACCATGCTGATAATTGTGATAGTGCCCATTCGAAATACATATCGCTAAGAGCACCACCAGCGACCGGGTTAAGTCCAGTTAGGTGCGAGCTATCCTGCGCCC")) -(assert (= z "uucgauggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 deleted file mode 100644 index 87539e0a3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0071.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGCTATCCGCACGGCAGCCCTCGAACTGGCCCAATACTATCTGGTCCCGCTTCCGTACCCACGTCCCTAAATCATACATCTAACATACCCTCAAGCTGAGCTCTACAATTGAAAAGGTGGCCTGCGATTATCCCTCTAAGTGGTCATAGGAAGGGTATTGATCTCCAAGGTCTGACCGTTTTGGATTTGCGCTCGGGCG")) -(assert (= z "cgugccgucggga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 deleted file mode 100644 index fa8c5cfeb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0072.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATGTGCATGGATTCCTTACGTCAGCCAGCAACAACTACTAAGTGCTGCTGGTTTGTCATACGTATTAGTCATCGCAGAATGGTACAACCAGTAGTAAGCTGTGCGCTAATCTGCCGTCTGTCCAGACGGGGTGTTGCTACTTTGGGCTTTGGTTTCCAATTTACGTGTCCCGGCACTTGTTCCTGTGCCAGAGATTTCT")) -(assert (= z "augcagucggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 deleted file mode 100644 index ff2c5bb7a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0073.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTTCTAAATCGGCTTCTGAGGTAGATCGTACCCCCATGTCATCACGTACGAGACGAGGTGAGTGACCGTCACAGTTGCGAAACCGTGCTTCTCAGCAGATTCAGTAGCATCCGTCACATTCCTAGTACGGTTCATTGGCTGAGCGCGGCCGTCATGCCAAGACTGGCTCAGATGCAACGTAGTAATGAATAATGTAACC")) -(assert (= z "ucgucu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 deleted file mode 100644 index 051a12af6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0074.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCAATATCGTTCGGGCTACGGAAATTTGGTGCCAAGCCGTACGACCGCCAGCCTTGCGATAGCGTCGGCGCGCACCGCGGTACGGCCGTATGGGTATACCTTGAGTACGTCCTGCCGGGCGGCATAGAAGGCACTGTTACACCACCATAAACAGGAGCCTTATATAGAATCAAGGTAGGTACATTTCTAGCGAATTGGT")) -(assert (= z "ccauccaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 deleted file mode 100644 index 914deef8a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0075.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTGGTGATGCCAGGTGGACTGAGTGACGGGACCTGGGTCACAATACCAGAGGCCTGTCCGAATGCGCGAAGGACAAGGTTTAATCTTATCAATTCTACGTCTACCTGTTCTCGTGCTCCCATCCGACATCCTTGCATTAGTCCGCGTATTAAGGCGCCATACGCTACAACACGCCAGTGCGGATTGGGTAGTAATTTCG")) -(assert (= z "guuauggucuccggacaggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 deleted file mode 100644 index 45eb9e50e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0076.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTTCCGGTTTTGGGACTGAGCCGTCCCTCGCTTAAATATGCTTTTGAGAAACAGATCTTCGTTGAGTCGAACGCACGCAGGAGCAAAGGAACCGCCCTTGCTCTAGGTACGCGTAATTGGCCAGAGCGACCCCCTTTAACCACGGCTGCTATGTCAAGGTCTAAATAGCTGCGGCCCGCAGGGTGTCAGCCTCCCGTCA")) -(assert (= z "gucuagaagcaacuca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 deleted file mode 100644 index 4986bcb41..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0077.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGACACCGTAGTAAATTCTACGCGTCTAGGAGTGGCTTTACGAACAAGGGGAAGACCTTCAGATCTTCACAAACGATGAGTTGATGACGCCTCCGCTAATGATGCTAGCTGACGAGGCAACCTGCCTTTCACACAATTAAAGAACACATTCTTCCCGTCTTTTAAACCGGCGACGATCCTGTACGTAGTCAATGATTGA")) -(assert (= z "cggaaaguguguuaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 deleted file mode 100644 index aad3a5172..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0078.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCATATGTCGTTAAAGCGGCATAAATAGAATCTGCACAGTGCACGTAACTCAGAGAGTGCTATCCCTGGCGGGGAAGAAGGGCCGTTGAGTAAGGAGTACAGAACGGCTCGATACGGACAGTCCTGCCCAGCAAGTGCTTTTACGAACAGACTCCAATAAAGATGCTTCATTAGTGTGTGCCATTTGACGTTTCCCGAA")) -(assert (= z "cgggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 deleted file mode 100644 index 1a73af903..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0079.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGGGGACGTAGGCCCTCCCTCGGCACTTTAGCGAGCATGCTCAGGTCCCATTGGCCTACTAAGATAACACCTGGGTCCTCGGGTGACTCTTGTCGGTCTAACTTCAGCAGGTCGTGCGGCAGAGCGGAAATGATATAAATATTATACGTACCTGCTTGATAAGCAGACTTCCCCCACTTGCTAAGGCACGTACGCACCT")) -(assert (= z "acuauucgucugaagggggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 deleted file mode 100644 index 7834bde3a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0080.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCTTTGGCTGAAGTGCGGTATTGCGCGCCCAACTGCTCTGCTATAACATGCTTCGTCCGCCGGACGACTCCATTGAGACGAAAGGGCTAGACTGCGCTGCACACCAAGTGGGGTACACCCTGATCACGCGGTAAGATTTAAGAAGGGTGGTACGTACTGTGTATTACTCGAAGGTACAATCGTCACCATAGTTACCTCA")) -(assert (= z "uuagc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 deleted file mode 100644 index dda16b908..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0081.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTCCGTAAGTCTTTAGATCTGCTCGCTAATTTCGCAATAGCCAGAACACGCACTGGACGAGCTGTCATTAGCATGCATCGCTCAAGTGTTATGTTCTAGACGATTAGTCGGGGATCACCATTCCTCCTCGAGTAACCACTCCGAGCGGGCTAGGCGCTTAGATGACATTCGATCCACCGTTCCCCGGCCGTTATTAAGC")) -(assert (= z "ggcucgcccgauccgcgaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 deleted file mode 100644 index 55860dc24..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0082.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAAAGGCGTGGTACCCGCGGGAACACGGCGTAATTGACTGAAAATGGCCCGGTTTTGGCCTTGTTAGTGCATGAATTCACGTGAACAATACTCGCGCAAGGATACCGAACTTGTCATACCGTAATAAAACAAGAAGGCCGCGCTGATGTTTTTCCTTGTTCTTGTAGTGTTCAATTTCATAGGAAGGAACCCGAGACTCG")) -(assert (= z "uggcauuauuuuguucuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 deleted file mode 100644 index e5be8c2a0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0083.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTAAAGTACGGTGCGTGGTATCATACTCCTGGGCATGTCCATTAGGACTGACGGCAAGCCACACGTCGCGCAGCCAATCAATTCCGTTTAAAATGAGCGCGACAACCACTTTCGCATACGGTCACGTCCAAGGATGTATGTGTTAAAACGTGTATGCTATAGAAAGCCTCGGACACTATCACGCTCTGCTTCGTGATTT")) -(assert (= z "cuaaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 deleted file mode 100644 index 5cb472859..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0084.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGTTCGATTTTGTGTACGCAGCCAGATGGACTTACTGAATGGGAAACCGGGGGCAGCAAGCGGCACTGTAAGGTTCTCTCGAGTGTGGGAGTAACGTGGACATAGGTTGTAGGGCACATCGAGAGACTTAATCGGGCCTTCGTTCTTATGTCTGCACGCTAGCGTATGTATAGAAATTCGTCTCCACTTTGCCTCTACCG")) -(assert (= z "cauugcaccugu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 deleted file mode 100644 index 0f2352bf5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0085.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAGGAGGGTAGTCGAGAGATTGGCATCAGGTACAAACGGTCTATCTCCGGCGAGCGCCACGACTGGTGTTTATATGCGACAGTTGGTATGTACACTAGACGCGTGACATCCGATTAGTTTACAACTACTATATGAGCCTCGATCGTCCTCCATATTTAGATTATAACTGTATACACGACCGTCCATTCCTTTCTCAACGC")) -(assert (= z "guugcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 deleted file mode 100644 index c5ad0410c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0086.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTTTTTCGATAGTTTACAAAAAAAACCCCCGTCGAAACTATGCGACTGGTCTTAGGTAGCGACGCTTAGACGAGAACTCGTCATCCCAGAAACGAGCTCTTCAATAGGGCAACATCTGACTCACCCAAGGATCTCGTAATACCAACCAGGTAATCCCGAGCCATTTGCCCACGATTAAGCGAAGTTCTTCCGTACATGT")) -(assert (= z "cuaucaaauguuuuuuuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 deleted file mode 100644 index b31e7cc8d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0087.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGCGACAGCCGTTATGTTTAGGCATGCGTTGTAAGGGCCCCGGAGTACCCACTACACCCCAGAGGTTTACCTACGTTATGTTTCCATGAGATAAACCATGAAGCCGGGGGCTATAGTCGACCACGTGCTTGCTCCTGTCCGATGTGGGGGCCTCAGAGACAGCCGGAAGCTTTTTCGGATACTACCAACTGAAACCTCC")) -(assert (= z "cuuuggagg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 deleted file mode 100644 index af6623f05..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0088.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGATCAACACTCCCCAGACCCGTCAAGGTGCCTTCTTGCCGCAATGCTGAGCCTAAGAGGCGAGTAATCTTGATTTATTTCTCACTGGACAGCTAGGTCGCCCACACGCGTCAGACCAACTCTCTTCAAATCCTGGTCGCCGCTCTCCTAAGGCAACCCCCGGTGAGACTGAAGGTTCATGGTTTTCAGGTGTAAGCCTC")) -(assert (= z "cggcguuacgacuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 deleted file mode 100644 index 1e8bd79dc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0089.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTGTGACCTCCTCGAAGGGGCATGAGAGGACACCATGGTTAAAGTTCGCTCTTCTGCCCCGCTTGTCACATCTGTGCCTTACGCCCATATACACAGGCTAAAGTCGCCCTAACGAATTATCCTTTTACGAAACAGAATCCGAGGGGCCGACTGGATATTTACCTCTCCAGATTTACCACGTATTGTCTGAGAAAAATGC")) -(assert (= z "caauuucaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 deleted file mode 100644 index e47f0e342..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0090.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTATCAGTTGTATTGCATGGGCAGGCTCAGCCCTCGGTGCTAACCTGCCTCAGCACAGGGTGGACGACAGTCCGAACTGGCGCTGGGGTAGTGTCTTAGTGGTACAATGCCTCGAGAGCTAGCAACCAGTCTTGCCTGGCGCGTTCTCTTACGAGCTCGTTATATATTCCAGCCGCATAATTAATTTACCGGATGCACAC")) -(assert (= z "uggacggagucguguccca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 deleted file mode 100644 index b163a0830..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0091.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATTATCTGTGAATCCCCCCGACCTGCATAAACCACCTACTCTGCCCCGCCAGCATGGACATCCCCACAAGCTTCGGTACGCTTTCACAATCTGAAGATTTATCGGCAACGACCGCATTGCAGTTAGAGGAACGCTGCGTGGCCCCTCAACATATTATGCAGACGGGGCTGGGGCGCCGCCATTAAATCCCCACTCACCA")) -(assert (= z "cgcggcgguaauuuagg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 deleted file mode 100644 index f68aa2eaa..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0092.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGGAAGAGCCGATGTTAATTTGTTACGCGTTCTTTGCTCGTCGCCCGCAACACGGTACCTGGGCGGACCAAGGGACGTCTCCCGGGATGTACTACCGGCATAGACGGCGGTCAAGCAGCCGATCCGGACTCTGGAAGACGTCGTTTTCTCGTTCAAAAACTGAAATTGTAGCTGTATGGCGATGTCAAGTCCGGACGCA")) -(assert (= z "ccgccugguucccugcagag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 deleted file mode 100644 index c7198844d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0093.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCAGTTGGACTCATCACCTGATGCACTCTTACAGCGCGGAGCAGTGCTGATGCTGCGGAAGTGGTGTGATCTTAATTGATCGGGAGTGCTGTCGCAGTAGGTCGATAAACGCGACCCCCTCTTAGTTTGCCGTAAACCATCAAGACTGGGTGACCGATAGGCCGCCATAACCGTTGGTAGAGCTAAGGGGCGTCAGCCC")) -(assert (= z "ccacuggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 deleted file mode 100644 index a9e405167..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0094.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTCCTACCAACCGAACATTTTGCTCTTTAACTACTATCGGAGATGCAAGCTGTGTTCGACGAGACTGACAGAATCCTTTCATACACACGGCAAAGGCTTTTCCTTAATCCTGACATGAATTTTACAAACTTCCTAATCAATACGTTTCACGTAGCCCGCGGCCCCTGGACGCTTGTTTGTGGTATCACGAGGGTGCAAT")) -(assert (= z "acgagaaauugauga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 deleted file mode 100644 index 416dbbd12..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0095.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAAAGGCCTCACCGTTCCTTCTTCCGGCGACTGTCGATGACAATGTTGTACACTGCCTGCAGGTTGTGGAGTTACGGGAGTGTGAAATGATGCGCGCTTCCTATGTGTTTGTCACCAGGACTATCAAGGTGCGTTAAGGTCTAGTCGATATTGTCACTTCTGTAAGTTTCATTAGACTTTGTTGAATTTGAATATCCGTC")) -(assert (= z "cacgcaauuccagau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 deleted file mode 100644 index 1b4fdb4f5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0096.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCCTTCGTGGCGTCCGGTACAAGCAACCTCTATACCTTGCATTGGCTTTGAGTTACATACGAATTTGTAATATTGGTGTCAAACTAGTAACTAGGACGCTAACAGTCCATACGGCTGTACGATGATAGCCTATGGGTTAAAACTCGGGGGGAGATGCTCTCGACACGTTCAAACTTTTGGAGCGCGTGACTCGACGATT")) -(assert (= z "uugucagguaugccgacau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 deleted file mode 100644 index caf506fc7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0097.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGAATCCGAAGCGTACATTTCATCAGCAATTTCAACACCTCAGCCCCTGGCGCCAAAGTGTCTTTTCCTGAGCCTGGCGGGACGGACTCGGTATTTTACATCTCGAGGCTTCATAGCTGTCAATCGGTACCACCGAAGAAACGCCTAACCTATGTTGTACCAACAACTTAGTCACAGTCCTGGGATGACGTCGCGCGATT")) -(assert (= z "gacccuacugca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 deleted file mode 100644 index 4bc5fe510..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0098.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGTATGTACCCGAGGCCTTAGTTCATTTGGGCTCGCGCCCGGCGGACAACACACGAAGTCATGTTATTCGCATCAAGTACGTTGCTACCCGTATAGTTCCTCCGTCACCGCTAGGCAACGGAGATAGTGCCGGGAAGTCGACGGGACCTCCGGAGTGCACACCGCGCCAGAGCGGCGGATTCCTCATTAAGCGGTAAGC")) -(assert (= z "aaacccgagcgcgggccgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 deleted file mode 100644 index 76cd2c067..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0099.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGAATTTGACAGTGAGCTCCGCAGGCAGCTTATTACGTGCAACCCGAAGCCATCTATCCGCAATTTACGCCATTATAACATCCCATTAGTACGCTCCAACTTGGTATCCCGGAGCTGGAGACGGTGGAAATTGACCCCAAAAATCGTTGATTAATTCTCATTCTAGCCGGCAAGAAGTAGTTTTTTATATGAGTGGTGTC")) -(assert (= z "uaagaguaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 deleted file mode 100644 index edb892a9f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0100.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCCTCTAACGAGCCTTACGCAAAGACCTGATCCCCAGCTTCGGGGCGCACTAGGACACTCCGATTGGCAAACCCCTATGGGCAATAGTTGCAAATCAGCCTCGGTTGCGTACGATTTCCTGTGCCGGGAAAGCTTAAGTTTTTGGCTTGTTGCCTAGATGTAATTGGGACCCATTCTAGTTCGTTAATCGTATTCTACG")) -(assert (= z "aaaccgaacaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 deleted file mode 100644 index 68388ce53..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0101.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTCCTATCACGCTCTAGACGGCTTTAATGGGGGCGCTTCCTGTCAGAGCGTCTTGATGTATACATCCGTGGTTACGATTAGTAATGAATCGGGCACAAGTTGAGTGCGGTCCCTGCAGGCTATTTCCGTTGAGAAATCATAGAGCTTAGCGTAAGCAAAAGTCGGGAACCAGGATGCATGTGGGATTGTTGGAAGCCGCC")) -(assert (= z "agaucugccgaaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 deleted file mode 100644 index a6eb23ff9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0102.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTACATATCGCCAGTTACCACCACTGTCGAATTCGGACAGCATCACTTCCGAGACAAGTCGGGTGTGCTCGGGCGGTCGGAAACGTAAGGCCCAGGGCCGCACGCGGTAGAAAGAGCTGACCGTAAGTACGTAGTTACGTGAGCCTTACTCTACCTTCATGAAATACAACCCACTCTCATTACTGTAGTTCGCTAGTCGT")) -(assert (= z "gaaggcucuguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 deleted file mode 100644 index fba77783e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0103.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGACGAAGGAACCTTAAGTATCGGAAGTGACGTCGTGGTCCAGGCACATTAGCTGACACACCTCGCCGGCATTCCAACTGTAGCCGCGAATATTGTACAGTACTGAACTATATCCATCTATGATAAGTCACCAATTGCGGAGACCCAACTGCGCTGCAAAATGTAACTGGGTGTAGGCGCATACAGTCGCCCTGGGAGGG")) -(assert (= z "ucgacugug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 deleted file mode 100644 index a28d70765..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0104.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCAGTGAACGTTAGGTACTTGTGACTGTCGTCTATCCGGGGACCAGGCCAACTCATCTCAGTTTGGGGACTGCTAGGACCCTCCTTGACTGGATTCGTTTCCCAGCCGTTGCGGTGCGGGGGAGGCTGTCGCCCAGAAAGGGTGATGCCCAACGAGCGCTTCGAATTGTGTCGACTATTGGGTTCCTTACACGTTGTGGG")) -(assert (= z "gcucgcga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 deleted file mode 100644 index d4ad6cb2e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0105.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATACGCCGCTTTAACTAGTGAATATTTTCGTAGTCTCGAGTCAGACCCCCCCTTGCAAAGCGAATACGCCTAATTTGGGATACTTTACGCCCCTATAACTGACTGCGAGCGAGCCTTACGAACGCTCCAAGTCCGCCACCCGTAGTGTTCAGATATGGCCCCCCATACTACCTCATACCCTTGTCAGCACCATGTGGCCG")) -(assert (= z "ugaugg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 deleted file mode 100644 index 0209140ff..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0106.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATGTCTCAACGATTGCGCAGGGTGCCGTAGCCGGTGTTTTGTCAGTGGGATTAAACCTCGATCATGACAATCATAAGGCTAAACGGGTTTGCTAACCATTCTATATTATGGTGACTTTCCAACACATGCATTGGCTCTTTCGCAGGTCCGTGATATGAACTGGTGTATGACCGTATACCCGACTTGAATCTGCAAATCC")) -(assert (= z "uuggagcuag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 deleted file mode 100644 index f6c0c67e4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0107.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGATTAGACGCGCTTGCGGTGCGAGGCATAGGGCTGAGAGTGTACGGGGCGGTTTACTCGGATGATACTTTGGAGACCTCGATCTTAGGTATTCCCCTTTCCCGGCCGGCTTGTAAGCGCACCGCGCGATTGTGCCGAAATCACACACTCGGTATCGCGTAAGACTCTAGTCAACGCCCATCGCTGAGAGATTCATAGGT")) -(assert (= z "gccuacuaugaaaccucu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 deleted file mode 100644 index 0bffa571e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0108.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAGTTCTCTTAAGTTAGCGGATTATTTTGCTGCAGGTGCGGGTTTGTCGGGTCATTCAGACTCCGCATCCGGTGTGTTATAGACTACGTAAGAGGCCAACTGTCAAGAGGGTAAGTGATAAAGTTCCTTTATTTACCTTCCGAACTGGGATGTCAATAGCAAAAACGCGCCATATGACCCATGGAGCACCCCTTCTAAT")) -(assert (= z "auaaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 deleted file mode 100644 index 4763545a5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0109.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCTTGGTATCGTTCTGGGCGCCGAGAGGGTCAAACATGCGTTATGTAATGATATATACCAATATGGATTATTTCGCGGGTGTATCCAACAGTCGTTGGCGTCCTATCACGGTCTATTTGACTAACTGTCAGGAGTCAAGTCTTCTGACAAGCCGTCGAAGTGACCAAAATGCTCAGCACCTTCCTATAGACCGGAAGCT")) -(assert (= z "uaccuaauaaagcgccca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 deleted file mode 100644 index 9083e7af4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0110.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATTCGAGTCTGTCGATTGGTTCGCTCATACCAGTACGGAACTCGGTCCCAAGTATTAGACTGCCACAGCGGATCAAGCGGGCATTCGGGACCTGCCAGTTGGTTTGTCTCTGTATACGACAGATTGTAAGCTCGGCTACCATTAAACTGGCGATTAGACACGGGGTTTTGCCGTCTGCGAAGCCACTTTGGGATGGATA")) -(assert (= z "agccc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 deleted file mode 100644 index bd1a1d8be..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0111.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCCGCTCCCTGACAACGTTGGAAAGTTCCTAGCGAACCAGATTCAGGCGCCGATGGAGAGTCTATGGCTACCCAACGGATTATATCCACATTTGTCGTATCACTAACATGCGATCCAATACGTTTAGGTCCCTGACGCTCACCACCTGATCTCTGAGGGCCCTGTGCGCACCAGCGTCCTCAATGGCCGCGTACCGTAC")) -(assert (= z "aucgcuuggucua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 deleted file mode 100644 index dd752ace0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0112.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CACTAGGTGACCTCGGGCTCATTCCATGCTGAAGTTCACAAAACCTGTTTGCATCGGAGAAACGCACGCGAGTGAACGCACGTCTTCTGCTGCCCATATTCTGGACGCAAGTTTCCAGATATCCTAATGACCTATGCCCAACACTTCAGCTCGCACTAAAACCAATTAGCGTTAAGCGCATAGTCGCTCAAGCTCATCTA")) -(assert (= z "guauaagaccugcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 deleted file mode 100644 index 1364bc224..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0113.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AACCGTAAGGCAATTCCTAGTTACAGCGAATTGGTCAATTATGACGTTGGCCCAACGCGAACCCGCGATAGGCGTGTTCGGCCGCTTCGCTGGATAGGGATCTCAGTCCTGGGCTTAAACGAGAAAGAAGACGTAGTCCGGGCGCCTTCCATTATAGAATCTCTTGAGGATAGAGTAGAGAAAGTTGTTTAATGGGAGAG")) -(assert (= z "gcccgcggaaggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 deleted file mode 100644 index d17126df0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0114.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTACGTTCTACCGAGAACTCCGGTACTGAGCAGGCTGAAGACGTCTTCCTCCGACTTATGCGGATACTTACTATCACCCGCTCACTCTGCCCTATTAGGCCCATTCGGTCCAAAGTAAGTGCTGGAGGATTCAAGTAACATCTGATTGCACTGTTTGATATTAGACTGGGCTGCCCTTATGTTTTGAAGAATTCCAACCT")) -(assert (= z "guaagccagguuuca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 deleted file mode 100644 index 3cbb62c3b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0115.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTAATCCTTTATCTGCACAGCTAAGTCTACCACGTTGATGAGCAATGACGCATTACCACACGCCAGCAGACTATCCAATCCTGTGTTAATCAGGGGTATTTACCTGGGGAGCAACTGTTTACCAGGTGGCGGTGAGAATCCTGTACTCCGACATATGCAGGGCCCGTGGCGGCAGATCCGTAGACTTTTAAGAACTTCAG")) -(assert (= z "gucgauucagaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 deleted file mode 100644 index 368ca5b30..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0116.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CACGGCGGCACCGATCCTCCGAGGCCCAATACCTCCGCTCGATCTGGGATTCCATCACAGACAGAATTAAGGAGCAGGTCCCGTGGTGGCGGTGGTAAGATAGTGACCTGCAACACTGCAAACGATGGCTGTATGCTCCTATATAAGAACGTATTCGGGCAACATAACACTAGACAGCTGTATGGCCTCGCGAGTCCCGG")) -(assert (= z "cgcucagggcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 deleted file mode 100644 index 33f7b5578..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0117.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATATGGGCGGAAACCAGTTATCGGCCTTTAGAACGAACGCTGCTTTCGGCTTGCGACGTGTTACGTCGCGCCCGTCAGATGTTTTATAGCTGAAGTGCCGTTCCCAGCTTGGGACGGGCCACATCGTAAACCATGTCAGCTGTGTATCACCATCTAGAGAAGCTAACATAGAAAGCGTGACCACCTGCGGATCAAGTAC")) -(assert (= z "cgacgaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 deleted file mode 100644 index 13502d90f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0118.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGGATTAAAGCTGGATAAGGCCGTCCGTAGAGAGTATACCGTCCACACCGGAATAGTGTTTGAAATGGGCCTCCCGTGGTCTGTGAATGATTTGCTATATTTCTGACCAACTGACTTCAACGGCCCACGCATTCCCTTCCTGATGGGCGGCTTCCTATTGAATCCTCAGCGTGAGGAATTCCTGTTTCTATGCCTAGAC")) -(assert (= z "ggacuacccgccgaaggaua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 deleted file mode 100644 index 34f5a5e18..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0119.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGGCTCGCCGCCCCCGGGAATCTTTTTCAGGAAACCTAGGATCAGACGGACGAGGATATATAAAAGCGAGACGACATTACTGCATGATTTTGTGACCGCGTTGTGGTTTATATGTACGTGTCGACCGATCGCTGAGTACGCTCGGAGTTCTTAGACGTAGACTCTGTTATCGGTTTGCAGCGTTTTATCCAAGTGTCGC")) -(assert (= z "gcaucugagacaauagcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 deleted file mode 100644 index 16bdf8396..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0120.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAGCTAGTAACCGGGGGACGTCAACCTCTGTACACTGACGTGGCTCAAAATAAGGTCGACTGCTCTGGGTCCCAGGTAGTAGGGCAAGTCTGAGTCATTCGGTTTATACAGGAGTCTGTAGACGGAGGATATATGATTCGGTTTCGCCAGCGGTGGGGAGAAACATCAGCGTCGTTCTGGAACCAAACGTGGTTTCCTCT")) -(assert (= z "augug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 deleted file mode 100644 index 6bec39848..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0121.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCAACACCGACGGTGGGTATTAAGTTGGGCTTAATGGTGCTTAGTTGGAATCCACTAACATATACCTTATGAAGTCTCCCGTTCACGCCTGATCAATAAGCTTCACGCAAAAGGCGACGAAATCCTTCTCCAAACGGCTTGTCTGAATAAGACCGTTAACGTGGCGAGCGGGACAAACCAAACGCAAGATAACGATCCTG")) -(assert (= z "gcaccgcucgcccugu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 deleted file mode 100644 index c32f763ae..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0122.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACCAACCCAAGTGTAAAGTGTATGAAACGCTCTGGGCAGTCGGCTGCGTTTGAGCCGTTACTTATCGATCAACTTAATTATCGCCACTCCTTGGGGTTTTACCGGGTAGCGCACAAATGGGGGAAACGGTAGGAAGATTAGACAGTTGAGGGTTCTGTATATAGGGCGTCCTGTATAGGTCGAGACAAAGACAATTGAAG")) -(assert (= z "caucgcguguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 deleted file mode 100644 index 6759a7115..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0123.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AATAGCGTTGCTTCACTCACGTTATCCCGGTGGCTCCCTCAATTGCGTTTACGATGGGGTGACTGGAACGTTCAGAGAAGGGAAGAAAGACACCTAATGCAAGAGGCCTTTCCGCCTGGAGCCTCGGTGTAGATGGCCCAGATTCTAGCCGACTCAGGATGGCCCTTGCGCTCCCCGTCGCACGTGGATCAGGCAACGAC")) -(assert (= z "gcaacgaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 deleted file mode 100644 index 93001584f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0124.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTGACGGTTCAGGGATTCGGGAGTCTCATTTTAAACGCTGGCGTTATAGTCTGGTATATCCGACTATTCATAGTTTGCCTGATAAGTTCAAGGCATCTTGCGAGCTTACCGGAAGATAGATGCTACTCTTGGATCAGTAAAGGGGCGCATACTACGATATGTAGTAAAGGATGTAACGCGTCGTCTGATGATCTATCATA")) -(assert (= z "acgaugagaaccuagucauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 deleted file mode 100644 index 81c559e25..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0125.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGAACATGAATCAAAAGGTAATTAGTCGGCTCTTCGAGTCACCAATTATCTCCGTTGCCCATTGAGCAATAAATTAATACGCCGGGTTGTGGACTCTAAAGGCACCATCTGATACAGCGTAACGGAGCGCATTCGAACGTCAAATGGGAATGTGGGTACCGCTCGGCTGGTCCATGTATGTCTAGCCGATCCCAGTATA")) -(assert (= z "auagaggcaacgg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 deleted file mode 100644 index c50871e08..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0126.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTAAAAGTGTTCCATGGAACGCGGGCATTGACGAGCGCCAGTCGCGAGCACTTATCCGAAACTTGAGTAAACCCTGGGATAACAGCCGTGCGAACTCTACCCTGATGCGTGCCCACTATGCCTCTTCAATTTATGCAGTTCCTAATTTACATTGGAAGTTGAGCTGCACGCGCCGAGGCCTTTTCGGAGCATATTGAAT")) -(assert (= z "ugcgcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 deleted file mode 100644 index 1df1cfa06..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0127.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGCTCGTTTGACAGCAGAGTAGAAAAATAGGAGGAAGCGCGGCCTCTGCACTCGATTTCTTTCCGGATGAGGAGCGCTTCGTCGAGCTGGTCTCGGCTACCGAGGTTGAGGGCAGTTTTGAGATAACAATCATGTCTCGCGGGTTAGCTTTCACATACTAATACGGATGCTTAGCAGTTTCCCGCATCGACGTTGTTAG")) -(assert (= z "ucgaaaguguaugauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 deleted file mode 100644 index 110568386..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0128.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCTTCATTCATAGTGCTGGTGACTACGACTGTTGTGTGGGGGACTCTACAGGCTTAAAAAAAAGCGATGACATAAGATCATGAACCTCAGATAGCTGAGTCCACATATAGTGGTGTCACACAACTTGATTTCGAGCACGGCCCCACTTCTGACACCGCCGCACCACACATGTCTGCCATATACAACCACCAGCTTAAGAT")) -(assert (= z "cugagaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 deleted file mode 100644 index 08da652f0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0129.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGTATGTCATCCTGCTAGCCGATTTACAACTAGGGCTTCGCGGTTGGGTGCCATAAGCATAAAATATTAGTGAACTGAAAGTCCATCAGTCATTAGTTCTTTATACCGACAGTCGCCTGTCGCACGGACGAGTACGACCGTAACAGATCCCACAACATTTACTTATGTAGTACGACTTCTGCGTGCCAGGGGACAACGTA")) -(assert (= z "ggcauugu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 deleted file mode 100644 index 91e568e7e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0130.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTGGCGTGTTTGCGACATTGTCCGACTTAGCATCGGCTTAAACTTGGCCGGTTGATGTCGTAACCGCCCCCCCATCAACAGAGCCTTACGGAGCTTCGTAAGACATCCTGGCACACCCATGAACGACATGCGGGTCAAACAAAAAAAGGGCTTAAACAGCTCAGCGTTTCCGCCACGTTTTCGTGTTCACTACGACGTTT")) -(assert (= z "acagcauuggcgggggggua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 deleted file mode 100644 index dc17cd32e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0131.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGAACCTCTAGCACGGCGACTAGGGCTCCAGGGGGACATTGATCTCGATACGTAAGCGCCCGTTCGCTCTGGCAGGCTTCCTCATAGATTCCACGATCTGCTTTGCTCTAATACCGGGGAAACTTTCTTTAATTGCACAACGCCATTTTGACGACTGGATCAATACGGGGATAATAGTACTAAAGTCCGAGGAAAGTTTT")) -(assert (= z "gaccguccgaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 deleted file mode 100644 index e8f585e83..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0132.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGCACTTCGCTTGAACCGGACAGCCGTCCGCTCCAATGATCTAGCAGTTGGAATCTCAAAGGCCAAAAGTTACTACCCACAGGTCGAAACTGTACAAACCTAGGTTTCCGCAATAACAGTCTAAGGTGAGGCATTCGGTGGCAATCACGCGATCTTGCAAATAATAGACCGATGCAAAAATCTGTGTACGACCTGTGGC")) -(assert (= z "agaucgucaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 deleted file mode 100644 index 4f9f35c60..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0133.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTCGACTAACCGCGTAATAACAAAAGTTATATACGAGGACTTGCACACAACGGCTCCTAGAGGAAACTAATTTGCTTAGGAGGCTATGAAAGGACCCAGAAAGTCCAGAAAGTGCTTCCCATTCTAGCCGGATTACAACCTGGACCGGCTTTCAACGGCGGATGCTAAACACTGAGCACATCTTTCAACCTAGTGGGTGG")) -(assert (= z "uaugcuccugaacgugug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 deleted file mode 100644 index f9d1f0dbd..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0134.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATGCTCGTGCTCTCTCCCCCTAACCACGATCCGAACCCCTGGAGGGCGCTTCCTATGAACGTAGGAAGCGGGCTTTGCACAGGTTCGGTTGTGAGTAGGTGGGACCCCAGCCCGACACGAGTCCAATACGCCGTACCAGTATGTCGTGCTATACGTCGGCAAGCTTGAGAAGCTGCTCGTACAGGGTCCGCCGCATAGTA")) -(assert (= z "gggggauuggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 deleted file mode 100644 index fcbfaafcc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0135.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAAGTGGCGTGGCCCTATTCCTCACTAACATAGGTACTTGGCGGTGGCCGTCGGCTAATGGAAGCAGGAGCTCGAACGAAAGGTATTGACATCTGATGTAGACACGTAAGACCGGCCTACCCTCTCTAAACAATGGTCTGAGTGACCATCGGAACGTTATTGCTGCCAACTGTTCATCAGAAGCGAGAAGATGTCCATGG")) -(assert (= z "ggaugggagagauuuguua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 deleted file mode 100644 index 2c7eb115d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0136.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGCCAATGGATTGATGGAAGAAGCTTCTGTGAATGTGGTACCTCACTGTCTACGAGAATCTCTAAAATTTAATTTCCAGGGGAGTACTGGAGTTTATTGACTGGAGCAAAACATGCCTTGCTACGCTCGACTTGGGACCATTTATTTACCTAGTGTATGCTCCGGCAGGTACTCTCTGATTAGCTCCTAACGCATGGTT")) -(assert (= z "uggua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 deleted file mode 100644 index a7a906354..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0137.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCCGCATATATATCCGCATCCGCTATACCTGAATTTAGGTTCCGCGTCGGTGCGTACTTCTATACGTGTCTAAGCACTGCCCGCCGCTGGCTAATGGGAAGGCCCTTTCTGCCGTCGTATTAGGCGGTTGCCCGAGCTCTGACTGAGGATGCGTTCGCATAGCCGTGGCATCTGATTTCAAGCTAATCGCTTCATAACCC")) -(assert (= z "gacuuaaauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 deleted file mode 100644 index da5db3fe7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0138.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACTTAGGGGAGACAATCACGCTGACCTAATAACCGGTGGGGAATGTAACGCGTGTTACGGCCTGTAGTCAATCCAGGAACGCGAATACTTGTAGGTGTAAGCTAGATAGACGGCGCCTGGAATTTAAAGGTGCAGTAAACAGCTCAGAGCGTCTTCTGCTACCGGTTTCGCATGGTCACTATGACTCGTGTGTGAGCCC")) -(assert (= z "ugaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 deleted file mode 100644 index 2f23993a7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0139.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAAGACCAACGAGCCGCGATCTTTTCACTTTAGGCCGCCCAAAGTTCAGGAGTCGCACGCAGGACAGTACCTGTTCGTAGCACGCAAAGGATTTACTTGTAACGTGCTGGATCAAGTGGTGGTACCGCTATTCAGTACACTCGGTTTAGCGGAGTGCGGACAAAGTTGGCCCCAGTGCCAGGGACTCTAGGCGATTAACG")) -(assert (= z "augugagccaaaucgcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 deleted file mode 100644 index 528235144..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0140.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGCGTTCTCCGACGAACTCTGAGAAGACCGAGAGGGTACTCTGCGGACCGGCGTTGTTTTGATGGACACAGGCCAAATTCGTAGGACGATCTACGGCGACCCAGGAGGTAATCAAAAACGACAAGGTTAGCCAACGCTCTACTCCAACACGCCTTTGCTCTAAGCGGCATTCCAGGATATTGTGCTTCTTTGTCTGAGG")) -(assert (= z "ggcucucccaugagacgcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 deleted file mode 100644 index 4e32ad32c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0141.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAACGTCGTACGCGATGCTACATGTTCGGTGACTAAACTATCAGGGATTAATATGTAAAATTTGGGACATCAATAGGATGTTCCAAACGTTGTAGATAATACCTGTGCGGGCCGCTACATCTTGAACCGCTGATGTTGGCATGCGCAGTTTCACTTCATACAGTCTACGGGGTCTACTTACATGGCTCGCTTGGCGTGT")) -(assert (= z "cgcaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 deleted file mode 100644 index 0470d33c1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0142.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGTAACAAGTCTCGACTTGCACCCTTGTAAAGGTACATAACATTACGAAGATGCAAACGACGCCACAGAATCTAGTAGGTCAACGAGAGGAGAGCGCAAGACGGCGTAAACAGAGGATGGGCCAGTTGCTCGGTTACAAATAACAGTTAATCGACCTTGGTATTACTGGCAACGTCCCGTGGCGAATACATCGCTCTCC")) -(assert (= z "uguaaugcuucuacgu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 deleted file mode 100644 index 5321eee2b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0143.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGCGCAGCGGACCAGGCTGAGATATCTTATTTATCTACGGTCACAATACTTTGAAATAGGAAGACTACTCCCATTTTGATGATATTATTCCGCGCCCTTTCACCGACTATCTACGTCTGGCTCACCGGTTGACATCACACTAGTTCTTATCAGGCCTCCGTAATTGCCCTAGCCGTTCTGACACTGGTGTGTCACCGGC")) -(assert (= z "aggca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 deleted file mode 100644 index 378727c5f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0144.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CATTGGCCTTGGGCCAACGCACCTCCACTTCACAAGCTACCATGTATACTCACGAATCGAATTGTATCGCCCGGTCGAACCAACAATCCTGTGTCCGGGTTCCGTTTCACAGACCTCCCTGCCTCTTTCTGTAGTTAGTCACAGTCTGCGACTCGTGTTGGTCCCGATCCTCTATAACTAATGAGGCACAACACTCGACA")) -(assert (= z "gacaucaaucag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 deleted file mode 100644 index c16d0dbfc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0145.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGTGCAAATTGTGTAGTATGGGTATCGGATGGCCCTATGTAGGATTTCTTTTCCGTGAGTCTTTAAACGCTCCACAAATTGCCCTGGACTCCGGCAGTACCGTCCCCGACTACGCACCCGACTAGCGCGTGTCGGACCTAGTGTGGAGCGGACTGAGATATCGTAAACTCAGTGCGGAACGGCTACGCTAAGACGGGTC")) -(assert (= z "acguuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 deleted file mode 100644 index 8a1aaca39..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0146.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACCGAATTTTCCCATTGTCCACCTGTGTTAGCTCGGTCCAATTTGAAAAAAAGAGTTTCCAAACCTTGCGCCGCGTTCGAAACGCGCTTTGGTGTCTTCCTTGGATCGGCTCGTTACCTATATCATGTTCTTCTTGCCTGGCAAGTGCGGTATTACTTACGGATTGTTCAGGACGGTCTTTTCGCGAGAGAGCAGTCAG")) -(assert (= z "ugaaugccuaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 deleted file mode 100644 index 64e3549f4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0147.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGATTATCCTACTGCGCAGTTACGTTGTCAAGCGGGTGTATCTGAACGGATTCTCACCTCTACCATGGACGGGCATACGTCCTGTCCCTGTAGTGTGTGACAATAAGTGAATGAATATGCTTGGATCTACGGGAGTTCGACTATTAGCACAGGCGACGCGTTGTTGACACCGGGATAAATAGTCCTTTTGCGATTTCCA")) -(assert (= z "uaaaggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 deleted file mode 100644 index f7c16e8fb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0148.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCACGGTATGAGGGCCGTATGATAGTGTTGCCGCTTAGTTCTGAGTCCACCGAGCGTAGCTGGCATTGCTTGGTGAACAACATTGAGTAGCAAGGGATAGACGCACTCGGCCATGGAAAACACGTACGTCATGGCAATATTACGTTCCTCACCAACTATTCTTTCTGTGGAGTGAGAGGTCGCTTTGGTTGACGTACATA")) -(assert (= z "gaacca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 deleted file mode 100644 index 8bcd6b2fa..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0149.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTTCAACTGGTCGACGAGTGTCAACCGGGGGCGCCTTGCTCGTGGACGCCCGTCGGTCCCATTGTTCACACGTTGGCATAGACGCCGACCGTTCTAAATAAAATATAGCCTAAATTACAGAATCGTTACGCGGTAAACCCCGGTCTGCCCAACGACGTCTAGAAGACCGGACACCAGATATTCCCGATCTGAGTACTAA")) -(assert (= z "uuagcaaugcgccau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 deleted file mode 100644 index 72f7977cc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0150.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGAGCGTTACTGGGAGGGTACTAGTTTTATATTCAAGACAACGACCATATCGCCGGTATACACCTTTATGGGGGAGCTTAGTTTGCTCAATCATGAACGCGTTTGCATCTGGATTATTCAAGACAAGGGGGATGGCCCGAAACACTGCATCTTAAACGAATATCCATTCGTATATGGTCCCTGGAGGATTTATTGCGCG")) -(assert (= z "uaccagggaccu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 deleted file mode 100644 index 6d61b02e1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0151.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACGAAGGCAGAAACGCTCCCGTATGACGAATTGGACGTTGGTTAGGGTTCCCTTTCATGACCAGTTTGACGGACTACTGGTCACGATACTTTGGGTTAGATTTGCGTCTGAACTGTGAAAAGCTAGAAATGTTAGACGGCCGTATTAATGGCGAGACAAAGCTGATCACCTCTGACCGTATACAGGACCCCGATAAGCT")) -(assert (= z "ugcaacca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 deleted file mode 100644 index 538fb5b7f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0152.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCACTGACGGGGCCGGTGGTTCTACTGGCTGCCAAAGGGTTCCGTCTGCGGAAGAGGCCTGCCAGACCAGGCAAGCGCCTCCTACGCGGTGGCGGTAAAGCCGATCGCGTCTTCGGGTCATTTCGACGAGCAGAACAAGTATTTTAAGGAGAAAGACCTCAGAGCGTTGTCACGGGCTGATGCGGCCACAGCATCGCCC")) -(assert (= z "acuacgccggugucguagc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 deleted file mode 100644 index 969cbef7f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0153.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCTGGTCTCTGTGGCGGAACAGTTTCGCTCACCTATCGGATAACTTTGCTAAAGACCAACCCCTTCCCTGCAAGGGTAAACGGGCGTATGCTCCTTACAAACAGTCGTATAGGGTCGGGGAGCAACTAATCAAGAACAGCAATGCCTTAGAATCCATTACATACGAGGTAAGTTGACGTACGGTTTCTCAAAGACTTCG")) -(assert (= z "gaggaauguuug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 deleted file mode 100644 index cddb878eb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0154.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATGTCCTCTAACGCGCTGCTAAAGACGTAGATACTACTTTCTTTGGGTGAACCTCGGAACTACAGTACCTACCCAGTTAGTTTTGTGATTTCTTGTGTTCTTGTCTTGAGCATTTAGCCGCCCTTTAGGTTAAGAGGCTCTCCAAATGGCTGATAAAATGACGCGACCTGCGGCTGCTCTCGTAAATTAAGGAGAAACA")) -(assert (= z "acuauuuuacugc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 deleted file mode 100644 index ce7e3ef2f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0155.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAAGTACGCCAAGCTGGCTGCACGACCACTAAATTTTCCGTGGCTGGTATGTTGTTGCTCCCTTCGCATGCGTTATAAGCCCCTTCAATTCCGTGGAGCACGTGCTGATGCTCGTTACCGAGACATCTAAAGACTTTCGGCTACTTTGTAGCTCACAACTTAACTTTAGAGCCTACTAGGCGCGAATTGGCAGTGGGATC")) -(assert (= z "gcuuaaccgucacccua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 deleted file mode 100644 index 1756630b5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0156.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATGAACAGTAATGGGCCTCGAGCACCTCAGCACTACGGCGCACATCAGTATCCTGTCACTCTTCAAAGAGCAGGGGGCCAAGCTGCTGGCGGCGTTCGGGGAATTACGGGATTCGCCGGAGATCCCACTAAGCATGCCAGTCGTTGCCCAGTGTCTCCGGTGAGACCGGTGCCCTCATACTGCTGGTCGTCTAGATGGT")) -(assert (= z "cgugg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 deleted file mode 100644 index 583458653..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0157.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGTTTACTTTGTTGCACACACACCCATAACTGAGGAGCTCTGGTCGCTTACCCTCGTCCTCGGAACGCTATGCGTTCCGTTGGGCTTGACTAGGAAACCGACCCTTCGCTCCGTACATCATGGTCGTAATTCGCGCCGTACACTCAGGCCAAGCACGGTCTTCTGGAGAACTGAAATCTCCTTTCCAATCGACTCGTAT")) -(assert (= z "ugggagcaggagccuug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 deleted file mode 100644 index bb85efcb4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0158.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGTGATTCTCTAACTAAACCGCCGGGCCCAAGTGTTGAGCGAGGATCCTACGGTTTAACCTACTAGTATCCTGCAATGGTCTCTCGACTACTTCAACACATATGGATATATATAGCTGGTCCCTCAGTTCTGCGACCCCAGATCACCCACGGTGCGAACCTTATCTAAGCCGGACCATCATCTAAGTGTTTACTATCTA")) -(assert (= z "uagauucacaaaugauaga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 deleted file mode 100644 index 534b7df27..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0159.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTCCCGGCAGTCTTCGTAGAGCGTCCTCAATAGGGTGAAATTGATGTCTACATCAGTAATGCAGTCTGTTAAGGTGAACTCGATCCCTCACCACGAGACGAAGGACTGGCGATAGCTAGAACGGGGCCCGTTAATCCGATCGCTTCTAGGGCAGAGCAATACTTCGCTATCAAGGGCGTCGTTACGGCAGAATGTTAGA")) -(assert (= z "cucugcuuccu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 deleted file mode 100644 index e57ffd51f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0160.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCTGCCGCCAACCTATGACCTAATAACTATCGCAGTTTAAGAGGGGCGGGGTTCTCATCCCGGGCGATAATTGCGACTATCGTAGCCCTTTAGTCAAGTTCGATTGAAAGGCGATATGCCTCAGTGCCCCGTCGCCGACCCGCGCTGTAATTGAGCCCAAGGCTCGGACTGTGTAAGGTCGGTACCGATAATATGGCTCT")) -(assert (= z "cuccccgcccca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 deleted file mode 100644 index e4de19ac5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0161.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CACGTTCACTGATGAGCTCATGGTACGTTCAGATAAGTAGCGCAGCACGCCCAAAAATTCTTTTCCACTTATAAGATTGCATACGATTCGAGCTAGATTTGGAATGTTAACTAATATCCAATGCATGCAGCAAGTATCTGTTCTAACGTAATAGGTAAGATAGAACGCTTGTACTTGGATGGTTTCGGCTCCTTCTACTT")) -(assert (= z "ugcaaguc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 deleted file mode 100644 index 893c8d522..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0162.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCGCAGTGAGTAAAGGGCAACTAAGTCATACGGCCAAGTAAAGTATCTTGGATCTCGCATATGTGATATTTTCCAGCAGACACAGGCGTATATAACGAGTCCGTCGGGGCCTTCGCACCCCTATATATCGAGCTGCGCAAACGGCCTAAGACTCGAGAGGCGCGGCCGAGTCATACAACTATCTACGACATGCACCTAT")) -(assert (= z "cccggaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 deleted file mode 100644 index 67c51d852..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0163.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTTTCGATAATCCGGTTGAATGACATGACTGTATGTGCGGTTCTGAACTGTGTACGACGTCTCAGCTTGCGTTTTAAAAATGACTCAAGGTCGCGTAGAGGTAGGTCAAACTCGTCGGAGGCTGCTTCTGCGCGTTATTCCGAATCGTCGGAATTCATCCACTTTAGGAACTTTTTGGATATATCGACTGTCTTGCGAA")) -(assert (= z "auuuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 deleted file mode 100644 index dfebe0ff8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0164.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTGGTCCAATGCTCTGTGGGGCGTCCGACTGACCTGCTGAGTGAGTATCGGCCGGCTTTCTCGCGGGCTATGCCCTCAGTACTGCCGCGTTCATCCATAGTGCTAGACAGTCCGTGGGCCGCGCTCTAGAACCTCGGCAGTTTCAAACTCCACGCCCTTCTAGGATAACAACCTTTGTCCTAATTTGAGCCAAGACGTGA")) -(assert (= z "cccgauacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 deleted file mode 100644 index c2b74a5e7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0165.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTGCGGGTATGGATATTGTTATATAGTCACTTGACGTGGGATGTTCAGGTAACGCGAGTCAGGTCTCAGTAATCCTGCGCCAGCAATTGAGAGATCTTCCCATCGTCGCGCTCGCCATCCCCAATGGGGGCGCTGGCTACACGAGATTTTGCATTCAAACGACGAGGTTCGCAAAATTGCCCCGGTGCTTTAGAGGGGT")) -(assert (= z "gguagcagcgcgagcgguag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 deleted file mode 100644 index d633fd689..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0166.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGGATTTAACGCCCACATGATGAGGGTGCGCTAGCCTCGTGCTTCGTCACCGCAAATATTTCTGGGACAAAAACTGCACGAGAAGCTCCTTCCGTTCCTATGAGGATGTGTTGCTTCCCCTTTCAGAAATTCACACTATGTTAAAATGAATCCCTGTCACCGTTATTTGCCTGTCGCCACTGTTACGGTCATTCTTCCG")) -(assert (= z "uacuccuacacaacgaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 deleted file mode 100644 index 30272f6e3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0167.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAAGCGATCGCTTCGGAGACAGTAGTAGCATTGGGTGGAGTGTAGGTCCGTGGGCGGTTGATAGAGGGAGGGTAAGGTCACCTAGCTTGCCCTGAATTTGTTGGATTTAACGCGTTGTCCTTATCCTGTGGCAACTCCCGATCTCGTTCTACGTCCGAAATATGGAGATATGGCTAAGGCAGTGTCGCGAACATCCTAAA")) -(assert (= z "uugcgcaacag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 deleted file mode 100644 index 438e30eac..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0168.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGCCCGTCAGGCACAAAACTTATAATCCGCGCGCCTGGAGTATCCACGCAGGTCTTTACGAACTCCATCCCTACAATTCGAGGATACTTGGTCAATCGATCCATATAATGGGATTCCAGTTGATTGGATCTCCATCCATTGACCTTTGTTCCAGTCTTTTTCAATCACTGAGTTTACCATAGCAGCACTACTCAATGCTG")) -(assert (= z "ugaacca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 deleted file mode 100644 index 1697e371d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0169.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCTGTGATAACGGATGAGGCGCTGTTCTGGACCTGCCCATTAGAACTACGTTTGGCCGGTAAAATAAAAAATCGAGGCTCCTCACACCCTTCACGTGGATTCCTGATAGTCTGCCGATTTTATTAGAGGCTGATTGATACTATAAACTGTGTCACGCTTATTACCTGATAAAAGGTGTGGGCGCGGATATAACACCCTT")) -(assert (= z "gacacagugcgaauaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 deleted file mode 100644 index 6e9fbe8c0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0170.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGAGGTACGAAACCTGTCACGGTAAGACACTTAGCTCAAGTACGACGTAGCGTAATGTTCCGGATCGATTTCATGTCAGGACGCGCTTAATTGGTGAAGCTCGCCTTACTTTACGTCGCTCCGTGTATGCGGTCGCGGTACGGGAAACGCTCTCGAGGCGGTAGTTCGTTTAAGTCAGGAGCGGTGTAGGCCAAACCAG")) -(assert (= z "uaaagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 deleted file mode 100644 index 0b8c947b0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0171.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGACATCTATAATACTACAGGAACATTACCGAACGTTCACTGACCAAAGGCCAACGGGATAATTGGGATCGCATGCTGGGGCCCATGATCAAGCCCGACGCATGGTCCTTATAGTTGGGAATGTGTCTTGCCGGACAAGGGGCCTATAAGTAGCTCAATTGAGCGCCATAACTGGAGGGATTATTTGTGCTGGCCCGGA")) -(assert (= z "acggccuguuccccggau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 deleted file mode 100644 index bc5ce6ade..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0172.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGTTATGACCCTATGTGTCGCCGATATTTGGCGCCGTAAAAAATAGGATACAGAACTCAGCTAGGAGAAGAAAGGGCTTGCCAGCGATCCACATCTGTAACTTGGGGGCGCAGGACGACAGGCCATAATCTTTTCGTGGGAACGGTAATCACTCCGTATGGTATCTGTTAGGTGATCGCTTTAATGACGGAGCTATGCG")) -(assert (= z "ugucuugagucga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 deleted file mode 100644 index 7f12f9fb5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0173.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAGTGGTCGATATGTGTCATGATCCACCCTCCGCTCGTTTTCGTCCTGGCTTCGTAAGGGTTCTAATTCCAAGATCTTTAGAATTAACAGGATTCAAATCGGGGGAACCCTCAAGGATCTGGAAATGCTACTGCACTACCGGTATCCTCACTACGGGGGATACTCAACATGCAGTATACACACGTCACCGTATGCCTCTG")) -(assert (= z "aagcagg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 deleted file mode 100644 index 330da18c1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0174.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAAGCCACAGGTTCTGCTGAAGACAAGAGGCTGGTCTGACTAAGTGGATAAATCGTAAGAAAGCCACGCCAAATGCACTGTCAGACCGTTATAGCCATTGATGCCGCGGAACGCCGGAAGAAAGCCCAGCATTAAAGTCGTACTTCCTGGACAGGCGATCGATCGTTCTGTTCCTAGCCCCGTAATCTATAAGTCCGTTT")) -(assert (= z "uaauuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 deleted file mode 100644 index 5ecf621f3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0175.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCACGGATTTACGTCCAGGCACAGTGCGGCTCTTTGTAACCACTTATACAACCTCCCTTTGTGCCGCTCCGACCCGTTCTTGCAAGATATCCTGGAAGCATTTGACTTCCGATAAGATGTTCGTATAACTTCAGCATGGCACATTCAGACCACCGTCTTGGATGTGCCGCGACGAGAGGTATCACCTATTCCACGTCACT")) -(assert (= z "uuggagggaaacacgg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 deleted file mode 100644 index e7e8b1c7f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0176.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGCGGGTGACGCAGCTTCAAGCTGACCGCGGCTAATATAATGTCGGAGATCGGATTATGTTCACTATGGCTTCTGCCCTTGATTCATAACCTGTTTAGGTTGTAAACCGCAGGGGTATGATCTTAGAGTTACGGCCGCGCACATGCACAGCCCTCAGGCCCACAGTCTCTGTTACTCGAGACCTGTCACTCATGAGAAC")) -(assert (= z "uuuggcguccccau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 deleted file mode 100644 index 7815bc37c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0177.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGTCAAAGATTGTCAAGGAACCTCACTGAACTCGCAACTAACTCCGCGTTATGCTCATCCGAGACTACAGCAGAAATCAATCAACTCGAAATACAGGTAGCCCCCTTCAGACAGCTTTTCCCTGTGATGAGAGGTACCACATGAGACGCAGGGTATATGTGTATACAGTTGAGCCGTGTTCCTGAGTATATGCGGTGCA")) -(assert (= z "ggagugacuugagcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 deleted file mode 100644 index c89b67316..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0178.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATAGCAGTACCACGCCGGCGAGCCAGTACAAGGTAAGCCTTCCTCGATAGTCTGCGAATAAAAGATCGCCCAACAGAGTCTACGGTCTGTATTCCGGTGTCTATAAACATGGTCTTGATAGTGACGCAGGTCATCGCGAAGCCCAAAGTACATCTGGAGGCTCGAGCATGCTTGACCTAGACTAGCATTGTTGGCGCTGT")) -(assert (= z "guaacaaccgcgaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 deleted file mode 100644 index aec1f15b7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0179.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACTACAACCCCCGAGTCATCGAATGTACCATAGGGGCAGGCTTTCTTATCACTTGCCGGTAGGGAAAGGCCGCTTAGCAGCCGCTGTTAGGGCATACTTGTCGTACGTTCCGCGGCACTTGTTCACGATAGACACTTCGTGAGGTCTTTCATTCGGGCTATGACGCAACACATCGACGTCGCGGAGGGCGGATGTCCAG")) -(assert (= z "gaaaga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 deleted file mode 100644 index 862dc6bcb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0180.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGACTGTCAGAGACTGCATCTACTTGACTTCGCCCTATAGAACAAAAGTTGTGCCGATACCACGCGTAGACCGTCGTGATTGACGAGACCTTCAGACCGATCTGTAGTGTCCAATCCTGCTGCTAGTGAACGCGGTATAATGCCCCCAAGTGGCTTCGGATGCAGATGAAACGCTCAGGCGTACGGATGTAAGCTCCGCC")) -(assert (= z "ggaagucuggcuagac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 deleted file mode 100644 index b6501e12c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0181.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTGTAAGCAACCTATGAGACTGTATGTCGCTCTCTTCACGTATGTACGGATGATTAGTACAAGTAGTTTACTGTCTAACTCTCCTATAGCCTAACTACTGTGGTCATGCGGTGCACATTTTGGGTAGCAATGACCTGGGCCGGAAGCGCCCACCCGGTCCCTAGCGTGTACAATTAGAGGCGGACATTGCGGTCGTCCG")) -(assert (= z "ugaugacaccaguacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 deleted file mode 100644 index eba83e0d6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0182.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCTATAACTCTGCTCAGTGCCTCATTGGGCGCTTCACAGGAGCCTCTAAGTGGGTGCTTCTATCAGAAAATCAAACAACGTAAGGACGCCGGATGATTTGGGATGCGCCCTCGCCCGGGGAGGCGTTGACTAAAGCACCCCCCGAATTCTAACTGGGTCAATCCCCGCGTTAAAGGACCTATAGCTCCGATAGATGGCC")) -(assert (= z "uuuguugcauuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 deleted file mode 100644 index 0e83a824d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0183.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AACGTCACGCGACAAAAGAAGCGTCAGCACTCCGTGAGACTAGATAGGTGGAACGCTAGGGATTTAATTCGAGGTAGACGTGAGAAAGAATACCTTCGGGCGATTCTGTTCGGGCAAGAAACTGCTGTAAGCAGTGAACACTGCATCCCTTGGTCTGGGTATATCTGAACTTTTCCTGCCCTGTTAACCCGACGAATAGC")) -(assert (= z "acaauugggcugc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 deleted file mode 100644 index e26d16c3e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0184.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTATATCAGCCTGGCAACAACAGGGTGTTCGGGGGGCAGTCTACTGTATTATGTGGTTGCGCAGGCGAGTATCAACACGGAGAGCGTCCCTAGGTTTTGGAACACATCACGTTTAGCAGGTAGAGATATAGGTATATGCTTTGCAGATCTCGAATAGAAGCCATCGCGCTCGATAACCTATCCGACATCATAGGGGGAC")) -(assert (= z "gcuuaucuucggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 deleted file mode 100644 index 342d4a1e6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0185.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGCTAAAAAGACTCCGAAGAGTTTTACGCTAGTCTATATATTGTTGCACCCCCGCTCCGGGCTACGGAGTCTATTCAACCATCAGGAGACCACGTTACAGTCGACCTACGCTTGTGCAGTAATATGCCACAGAGGGACGGTTCCGATAGACATAAAAACAGGGAAGTTTTAACGAGAATATCCGGCGTAGTCTGCGGGAC")) -(assert (= z "uguau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 deleted file mode 100644 index b67ea0976..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0186.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGCGATAACGTCAGGTCGAGTGCCGTACAGTTTTCTAGGCCCGTCTTGATTAGAATTCAGTGGGGAGTATCAGACTATCGAGCGTTAGGGGCACGGTTATCTGCTCTCAGTCTCTCCTTTCGATGGACTACTTCTATACAAGAACAGAGCACAACCATATCTTGTTGACAACCTCCGCGTGCCAATAGCAACCTCTTTAG")) -(assert (= z "uugguauagaacaacuguug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 deleted file mode 100644 index dde521991..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0187.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTGCGCACAAATGTCGTTGTGGTTGTACTAAAGGTTAGAGAGCGTGAATCGGGGTCTTCTCCTAGTATGTTACCACAGTGACATTCCAAAGTACCGCCGCAGGTTTCGAACCATGTGATTGTAGGCTGGGGTCGGCGTCTCTCCCGCCATCATGCAAAAAGCTTTGGCCGACATCGTATATCGTCCGCAGCAAGCTATG")) -(assert (= z "cacgcguguuuaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 deleted file mode 100644 index 73d2edebf..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0188.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGTTATAGTGCTTTATAAACCCCGCGAAAGGGTCAGAACTAAGGCGCCAGGTTATTGAATTAGTTTCAGCCGTTTTAGGGTACCCCAAGTGGTGCGACGAGTACGAATCCTAGTGTGCATTAAGCTGGGACGGGTTCCTTGCATCGAAGAACCGGACGCTCGCAAAGGAGGAGAAGCGAGGTCGGTAAGCTTCAACGTA")) -(assert (= z "uccucuucgcuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 deleted file mode 100644 index 5c408b9b4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0189.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTGTGGATATGGAAGAAAGCGCATCGTGACGGACACCCGGGCTAACGCAGCAAGATACTAGTTCCCCTGGAAATACAGATCCCTCGTTAACCTTCAATGTCGTTCATCTAAGAGGAAACCCTTGAAGAGGAGCTAGTACATCCTCTGCGCGGGATTTTTCGGGGTAGGCTGTACCATGGAGAACACAAGCCTTAACACTA")) -(assert (= z "ggaaguuacagcaaguagau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 deleted file mode 100644 index bfebb27f1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0190.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGTAATTTATTTGTTATCCGATCCTTGTGTCGTGTTCAGACGCGGACGAGGATGATATTTAGTCGACAATGGGCCATTATGTTGTATTAAAGGGGCCCTGAGCCACTGGTATTCAGATCTTCTTCTCCGGTCCCAATCTAAGGACCCGCGTACGATTACGCGTGCCGAGTGGTTGCGACTCGTCTGGCCTATAGTATCGT")) -(assert (= z "aaguc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 deleted file mode 100644 index f041be788..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0191.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAACGTGCCTGCAAATTACTCAATAGCCACGGCTATGACTGGGCGTGGGAAGAAAGCTTGGTAGTAAACCGGGTGCGAACGAATTTAAGCTTCGGAAAATCAACCGCGATCGTCCAGTAAGGGGTCACTGGCACTACCACTCCTCACCTTATCGACCAAAAAATCACAAGTATGCATGTCGGCAACTACCGCAGAAAACC")) -(assert (= z "cuuucgaaccaucau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 deleted file mode 100644 index 871c851f0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0192.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGCCTAAAACGCATAGGTATGGGTAACCATGCACAGGATGTGGTTGTAATCTGCGCCTTTGCCGTTCACACTGGCTACCGCTTCCAACCCGAGTTATCGTCGCCCGACCGCGACCCTCCCAGCAGCGGTTGCAGCTTGCGGGCCATTTTAATTCGGCTTTGATGAGTCCGATTTGTCTCACATAACCAAGCCGGCGCGT")) -(assert (= z "cgcugggagggucgu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 deleted file mode 100644 index 4f798fa83..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0193.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GACAGAGACTCGTCAGTTTGCAGGCAGCTCCGAGTTGAGTGGACCAGACCGACAAAATTAGTGATGTACTTTAAAGTTAATGAGGAGGTCGCCAGCTCAGAAAGTATTAGTTTCAAGGTCATTGCAGTGTGCGATGCATGAGATGAGTCCGGCTGGCACATCACACTGACACCCACCCTAGATTCGCTTGGGCAAATTGA")) -(assert (= z "guuccaguaacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 deleted file mode 100644 index 452895ab6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0194.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTTGCACTCCTACATGTCACAGAGCCTTTATTACCTCATTCACTAAGTGTGTGGGGGTACACCAGCATCAACTAGCGTAGCATTAGCTAACCTACGGAACCTGACCTAAATATAGACCTCTCCTATGAACTTAGTTAATTTAAAACTGTAGCCGACCCGTTGTTCGCGGAAGTTCCATTGACAGCAAACTGATAATGAAC")) -(assert (= z "ucuggagaggau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 deleted file mode 100644 index ddf3ac03c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0195.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AACTTTATCCTTTCGACGCGGCCTGAGCAGTACGACGGAAGCAACTTGGTCCAAAAGCTTGTACTTCTTCGACCGGCTGCCTCACTCCCCGCAGATGGGTGAGCTCGACTTCTTCAGAGCTCGGATGTGCTGGTCTCCCCCAGAAATACAATTCTCAACCAATAAAGTAAGGGTAAGGCGTTGGCCCAAGCCGCTACCTA")) -(assert (= z "agaggggguc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 deleted file mode 100644 index 0d6d6de47..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0196.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCAGTCTGGAAGGTTCTCTCTCTGGCAAGTAACTTATACAATGAGAGGTCCATAGCAGGACAATTTAAATCAGCATGCCTTAAAAAAACGACGACTCTGAGCTGGCTCTTGAATCATCCTCAGTAGCAGAGCCCTTCTCAGGTAGCAAAATGCTTACCTGCATAAGTCTCACTTACTCTGAACAGTGTACAAAGGAAAC")) -(assert (= z "ggaagaguccaucguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 deleted file mode 100644 index 190ebe041..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0197.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTCCAATCTACCTTGTTCGACAGGGCTTACGGAACTCCCTCTTCTGTCCTGAACTGAGCGGAGGCTTCCTTCGCGATATCACCGTTCTGTCGCGTCTGTTCACGGTCTGACGTCGGCCGCACAAATTCATGGCTCTTCGTTTTTCCAGACACTGAAGCGGCGTCCGCAAGGTAAGGTGGTCTGGAGGTTGACAGTCTCTC")) -(assert (= z "uccaacugucagagag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 deleted file mode 100644 index 67a72c0d7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0198.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATACTCAACCAGTGTCACACTGATCAAAGCGTCGTTGGGAAGGTCAACACGGGCAAATAACCGTGGTTCACGCACGCCTGAGACCTGTCCTACGACCGTACCCGACTGCGTTGGTGAATCTATGGCGATGCAATGACAACAGAGGTTGAGCCATAATGTAAAATAAGGCTTTGAGGTCCCATAGTGGCGAATCACGCTAG")) -(assert (= z "ucuggacaggaugcuggca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 deleted file mode 100644 index e6536b47b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0199.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATGGTCTCCGATGGACACAGCCCATGCTTGCTATACACGGTGGAGGGTGTGTCACCCAGCTCCGGGAGTCGATTAGCAGATTCGTGGAACAGGCCACTCAATATTGAGCCCCTTAAATGCCTATCCCTGCAATACCGTAGTTCTCGACTCCGGAGCGACGAATCGAACGGCTGTGCTCCCGGTGGAATTCAAAGCTCAG")) -(assert (= z "ccgacacgaggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 deleted file mode 100644 index ab297fcae..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0200.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATAGGCTCGAATTGTAGACGGCTGAGCGACCTTACCTTTAAGGTTTTAGCTGGTGAAAATACTAGGGTCATACGTTGTTCTAGTGTCAGGGCGGGTATACAACCAATTCCATCCCTTAATGGCTGAGCGTACGGGGGAAGGTGCCCACGCAGTTCTCGTCATCGGACGATGAATGTGCAAGTAGGTGCATGTACACGCCC")) -(assert (= z "gcaugcccccuuccacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 deleted file mode 100644 index 3cb6cc9a6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0201.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCCAAGGCCGAACCGGTGAGCGGGCTTACAGTAGTCACCTTAGTCAGGTCTTGTGTCCTCACCCTCAGCTGCAAAGTTCCCCTCCCGGACAGTTAATGGCCTATTTATTCCGGGGTATCAGACGTCTCTTTTTTAAGTTCTCTACGACTAAGCTTTAGAAAAAGTGACGAAAAACGTATGACTCATGGCCATTGAATAT")) -(assert (= z "gaugc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 deleted file mode 100644 index 6b7f72c5f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0202.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTTGTAAAACCCGGGCGCCACCCTACCTATGTCACATTTCGTGCGAATTAGTGCCATCCCGGCCTTTAGCCAGCCGAAGGTGAGCGCCAGGTGGTGGGCGTGTCACCAGGAGCAACTGTGCAAAGGCAATAGTATAATAACAGAGCTCGCCTTGTAAAAGCTACCCCTACCAAGTAGCGACACTTGCTGAGTGGGGACA")) -(assert (= z "acgcuuaaucacgguagggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 deleted file mode 100644 index 064214574..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0203.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGCGACAAAGGTTTGGGAGAAAACTGGGTCCCAAAACTTGGCCTAGTAGTTAAAATGTATTATAAAGCAAGTGTCGTGAAATAGCCACGTAACCAAGACCCGCCATACTGCTGGACGCGTTTATTACGTTGGTTTAGGAGTTGCTATGCTTGCCCGGAACCTTCGACAGTCTCTTCCTCGTAGAACGGGAGACTATTCTG")) -(assert (= z "acgac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 deleted file mode 100644 index 93353f9a0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0204.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCTTCCCTCCACTGAGGGGAGTCCTGAACTGGACGGACACAGCGTTACGAAGTTGAGATCAATTCAAAAGCCGGAAAGCTCGCGCGCTGGAGCTCGAACCGATCTACAAGGAGTTACTGGAAGGCCCGGACACTACCAGTATCCGTGTTGAGGGCAGGTGGCATACAGTAGTGTTGTGATCCGGGGTAGGGCTACCCGAA")) -(assert (= z "cccgauggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 deleted file mode 100644 index 6ba6f8677..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0205.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTTGCGAACATCGGACTGGGACAAGGATCTGCCCCGCCCCACGGCCGTAACTGCCACCTTATAGTGGCGCAGATACTTGGCTAATCTGAGAGGTTCACGACCTCCTCTTTAGATTCAAACCTATGATACCAGGAACGATCTGCGATCACCTGTGCTGGACGGCGTCGGACCTCCCCCAGAAGTGGAGCTCTGGAGTAGA")) -(assert (= z "agaaaucuaaguuuggauac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 deleted file mode 100644 index 2758a1dee..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0206.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCATCGCCGAGCAACATCTTACGAGGTCACTTGTCCGGAACCCGTGAGGTATAGCCCGGTGCGGTTGTATCGATAATCACAACGCATTCACGCACGTGTCAGTCATCTACGGTTTCATCCCCTGGCAGGTAGCGCCCAAAGCCCGCGGTAGAAGTGGCGGTCCGCTTACTTTTTTCTAAACCGGCTGACCGATCGTAATC")) -(assert (= z "guagg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 deleted file mode 100644 index 2667ff77f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0207.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTCTGTCTCCGAAATGCGTGTGCATCTCCCCATCGTGTTAGTTCCTAAGACCCGGTGACAAGTAGACGCCATTGGAAACGAACGTGCTAGGACCAAGATAGTTACGTCATCTCACTACCATCCATACCCATGCAAATCAACCTGAACGAGAGTGCTTAATTCACACTTGTCGTGTTAGTCTTAGGCGACGCTGCTCTGGA")) -(assert (= z "ucaaggauucuggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 deleted file mode 100644 index c7adddf56..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0208.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCAGTACCGGAAGTGTTGCAGGCTTCAAAGCTACACCGCCTATTTCAGCGCCTTAGGCAAAGGATGTGACTGCTAGGTAAGGGCAAGAGTAGAGTCATTACTGACGATCTCTCACGTATCGCGATATCTAGGCCCCGCGAGACCGTTGTCTTCTGTACCCATCTACTGATGGAAATTGATGTTCAGTGGCTATGGCGCT")) -(assert (= z "augacugcuagagagugca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 deleted file mode 100644 index e6c0fcb3e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0209.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGCGCCCATGAAGAAAGAAAGGCGCGCGTCCCTCGGTTGAACGTCAATCAGAACGGTAGATTGATTCCGAATCTGTTCCTATGAACTCCTTTATATGACGGTCGGCCATTGCCGCTGTCATGACGTGATTAATCTTATAATAGTAAATAGCGCTACTAATACCAGTATCGGCTCTTAAGTCTTTACAGAGCCGCACCAT")) -(assert (= z "uggucauagccgagaauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 deleted file mode 100644 index 409d6706a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0210.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCGTGTTCCTTCTGTCAATTACTTGCGCGAGTGAATCAATTCCGTAGTATGATCTACTTCAATTTGCAACAAGCTACACGTATTCAGTAGGGAATACCACACTACCGAGGACTGACGTAGTGTCAAACCTCACTGGATATCATACTTCTAACGCTAAATTGGCTACCCACCAAGGGCTCGCAAATATGGGTTGGGGGATC")) -(assert (= z "caucauacuagaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 deleted file mode 100644 index d6c3c62ca..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0211.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATATGCGACGATGGGTATGTAGCATGTGGTAACTTCGATATTAATCAGAGTGAAACCCATAAATGTAAATAATGATTACGCGCGATTAAGCGAAATTATAGAATGAGGCGCGCAATCGCGTGCAGGATGGTTAACCAACTCTGCTCTTAAATTGCTGATATCAATTCCTGTCAAGATTTTAATGACGGGTGAGGGTTCA")) -(assert (= z "gacuaua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 deleted file mode 100644 index 9123df7ad..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0212.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCTCGCGGCCTGTTTAGCACTCGACGAACAAGCGTTGTCTCTACCCATGGCGTCCATGATGCAAAGGACCTATCGCCTAAGATACAGGGCGTAATGTCATCTTAGCATTGTTCACTATAACCGATTACTGTTTAGTAATCTCTGGCCAGACGCTACCACTCTGGGTGTTCTATTGGTAACTAGTGGCGCTTGATCTAAAC")) -(assert (= z "ggucugcgauggugag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 deleted file mode 100644 index bf977e2cf..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0213.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATTAGTCCGCCATGATACATTTCCTGAGCAGTTACTAACAGTTTGTAGCTGTTCTTGTCCAATGGAGGCCTCGACCCCGTGCGGGAAATGCCGAGCTCAGGCCTCGATGAGCGTAGCGTTACGGTTAGTTGTTCGAAGGTAGCCCAAAAGGCATGGAACACGTGCCTCTCGCTTAACTCAAGGTTAGCGAAGTACCGTA")) -(assert (= z "caacaagcuuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 deleted file mode 100644 index baf4d78de..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0214.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGGAAGAATGGTATAGCCTGTAGGGCATCCCGGCTCCAGTGTAGGATAGGGAGGAGTTCAGCTACTCAATGTCCGGCCGTGCGCAGGGCAGGGAGCACCGCTTTGCCCTTAGTTATGCCTTACGACAATTATGGGCTGATGACCCTCAATCCATCGCACCGAACTTCGAGCCTCACCTGTCCTTAGTGTGCTCGGGAAG")) -(assert (= z "cgggaaucaaua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 deleted file mode 100644 index d0f6d2911..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0215.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATACTTAATTAGGCCCCTGCTATGGACCCACATCACTACGTATTCCGGCCCTCCCCAGCATATGTCTAAACATCCAAATACGCGCATTTGTGCGGCGTATACCTCAGGGACCATTCGAAACACAACCACAAGCTTACTCGCTCCAACCGTTAAGTATACCCTATTTTCTGAGAGGACTCACAGCAGATGACTGACACTAA")) -(assert (= z "ucgaauga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 deleted file mode 100644 index cb73ad616..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0216.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGACTTGACCTGACTTACATTAACTGTCCGGTTACAATAGAAATAGGCACCAGAATACCGCGTGTCTGGCAATGCAATGGCCTTAACGAGTTACTCCTGTCGTCCAGTAGGAAAGGTAAGCTGGGCAAACCTAGCCAACCAAGATTTTACTATGGGGAGCAATCGTCTTTAGCCGGATGGTCTCACGATGCTGAAACGAC")) -(assert (= z "uugcucaaugaggac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 deleted file mode 100644 index b03dcb9a7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0217.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCAACTAAACGTTTACCGATGGCAAAGGCTGACCCATCGTTGTCTAGACAGTTCAGCACTTAGGACCAGAACCCATCGTCAGTCCACACTATCGGTCACCATGAGTGGTGCAATTCTACAATAGAACGTTTGATGAAACGCCGTATTGGCCGGGCCCTTATGGTCCCGTGGACTCGAGGGCGGAGCTAGTTCTAACAGAG")) -(assert (= z "uggucuug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 deleted file mode 100644 index 5bba2b92a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0218.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGGAATTCCAGAGACACCATGAGACCGCCGCTCACACTGTTTGCAGGTACACATGTTTCGGGTTCAGCATTGTGCGCATAAATATCTTTAAATACTGCAATGAGTTGTGAGCTAATCAACAGGCGCCTCGCGACCGTATTCTGTAACGATGCGTGTGCATTAGGTTGTGTTGTCTTTCCACCAGCCCGGCTCCCTTTGA")) -(assert (= z "cuggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 deleted file mode 100644 index c6a413171..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0219.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTCGCAGTTGAATGTTGTCCGTGCCTGCATGTACGCCCAAAATGGGTTTGCTACGCGATTCGTAAGCGACCGTGAGTCGGTCCGGGTAAGTAACTGTCGCTCACATTATAGCGCACTGCTTTAGGGGGAGTGTGCAGCGAATTTGGAGCAGACTCAGATTCACAAGCCGGCGACACCCCGGATGAGTGACGTAGTAGAGG")) -(assert (= z "acgaugcgcuaagcauuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 deleted file mode 100644 index 7a29d1891..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0220.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCACGATCCAAATTAATTCCGCCGACGACAGCAGACTGCCAAATAGAAGACGAAGTTCCATTCGCGGTGACGCCTCGTCATGGTCGGAAGATCATACTTGCTGCCCCGAGTCACTTCTACTGGTGCAATCGGGTGCACTGAAACGCTCATGCCGTGATAAGATTTTACAGCGGATATTTGCTCCCGCCTAGCGAGGGCA")) -(assert (= z "uaaacgagggcggaucg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 deleted file mode 100644 index 7c41571b1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0221.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGTGCTCGGTACGGCACCTGGAAGATTCTGATGTTCTCACTTGTATAAAAACAGCAGACCTGCTCGCTAACACCAGGTCAAAGGAAGGTCATAATTCTTTCCGGCGCAAGGAGCGGGCCGAAGCCGTTACTTCAGCATCCACATTCCTGCCGATAAAGACGTATCAGAAGCCAGAATTGCCTTCACTGCACCACTAGGT")) -(assert (= z "cggcuauuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 deleted file mode 100644 index c45ee054d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0222.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGCTCGTAAGTTACAGCTATGTGATGCGAGCTGATGTGTAACTATTAGGCAGCGCTGTTGACGCAAAAACCTGGAGGTGGGACACCCCTAGCTTTTACCCTGGTAAGGCCCAGATTGTACCAAGTCGAGGCGACGGAAAGCCTGTTTTCTCTCGAAGGGTTGACGCTAGATTACACCCCGGTTCCGTGTGCGGGTTGTG")) -(assert (= z "aauccgucgcgacaacug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 deleted file mode 100644 index 6bca89baf..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0223.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GACCTCATGAGGCGTGTGTGTTCTTTCACATGTCTCTTTTCGTCCCCACAACGCTCTGAGTCTCGGGCCGATACTTGTCGAATAAGCCAGCCCTGAAGAGGCTGTAACCGGTATGGCCAGCTCGCATCGACAGCGGTCCTAGCAATACTGCCATCTTGCTAGGACAGTGTCAAAGATTATGATCCAGCAGATATATCGTC")) -(assert (= z "gaaaagcaggggug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 deleted file mode 100644 index f7f74e6e0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0224.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATATATCGAAATTTACGTCCGTCACGCCCAGCAGCTTGGCCATTAAGCCCTCCCTGCTCACCGGTTGGTAACCCGGAATTGCACGAATAATCCTAAGAGGATCTTGGACTCGCAGTATTGGCAACTCGTGGCTCCGAATTTGGAATTAAAGACCGAGAATCCAAAGGCACTAAGCATAAAAATCATTTTACGAGCTCTC")) -(assert (= z "auuucuggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 deleted file mode 100644 index 1f5d5a20a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0225.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAGCCTGCTACATTCACTCACTACAAGTATCCACCGAACTTTTAGGGGTCGGAGGGTCTCAACGAGTAATTATCCCTCCCCACGTTTATGAACGACTCCGTGTGGGCACGATCCACGGGTCCACTGGAGCGAGATACCATTCTGCCGCCTTTACGGCAGACGGACTTCCGGTGCGAATCTAGGGGCACTCATCCGAATGA")) -(assert (= z "guggcuugaaaauccccagc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 deleted file mode 100644 index f319c70e1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0226.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGTTGTGTGGTCCCGAAAACAAACACCGAAGCGCCGGCAGTCTGAATGGCGAAGCCCCTCTCACTTCTTGCTAGTTGAGATATGTGGATCGGACGGGGATTAGTAAACACGGTCATTTAGGGCCGCCGTCTACGAGTGGCTTTTTAGGCCTGGGCCGTCTGTTCACCACACGGTGATTACTAGCATGCTCTTCACAAGT")) -(assert (= z "ccacuaauga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 deleted file mode 100644 index 2c74027e9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0227.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTATCCTACAGTCCGGAGCTCAGCTCTCAGGCATTTGCCTTATAGAGGACTTTCAGTTAACGTAAATTACAGGATCAGCGTGGACTTGCATTTCTTCCCGATATGGCCATCCGAAAGCTAGGTTAAAGAATCGTAAAACTTTGGTTGGGTAGTGCTCTTGGACAGTTGTTGAGCTCATACCGCTTGAGAATCGGACCGG")) -(assert (= z "uaauguccuaguc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 deleted file mode 100644 index f0cc46570..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0228.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGATTTCTTTGCACTGGGTACAGCAGTAGGAGTGCAAAGGCGCACCAGACAGCAGAGCGGGTCCCAGGGATTGAAAGACCGGCTGGCAAGTACTTGCGCATCCGCTGTATTGTCTGCTGGACCGTTGCCGTTGGAGTGCTATGCGTAGGCTAATCGGAGGTAAAACTAGTGACTCCTCTACCTTCAGATTACGATACACA")) -(assert (= z "agacgaccuggcaacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 deleted file mode 100644 index cb3d8bd76..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0229.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTTCGGACAGGACTTTTTATCTTTGTGCTGAATCTGTGCAACTTAACGGTTCGGAGCGGAAAAATCGTCAAGCTATGAGGTACAGCTAGCTTGGGGTTGCCGGTGAGGGGAATAAGAGTGCTGTACACTCTGAGTCTACCCTGGCTCAGCGTGCTGAGGAGAAGTTCTTTTCATTAGTGCCTGAACCTAAGTTGGTCTG")) -(assert (= z "uagaaaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 deleted file mode 100644 index 037b80770..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0230.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGGTCAATCATCTATACACACGAATTGATCAGCCAACATGGTATCCTGGTTCAGGTAATCGTAAGAATGATCATCATCATCTGTCTTTAAAGCTGGGTTTACGACTCTGCTCACCAGAAGTGGTAGGGATTATTTACCGTGTGCTAGTTACCATTCTCGGGCTGTCCCGAGACACACTGTTCTAGCAATTCCCTATCAA")) -(assert (= z "cacgauca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 deleted file mode 100644 index 634ad988a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0231.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGCCAGGCGTCAGTGGCGTGTATCGGTCTATAATCTTCGGAACTCCAACTTGATGAGCTCAAGGGGGTGAAGAATCCATACGCCGAATGGGTTTTGGAGTCGTCTACTGCTGGAATATATTCCCCCTGCAAAGGTCTCAGGACTGAGGCATATCGGCCAGTATTGCACAAATTGCAAGGCATTGGCCTCACCTCGCAGGG")) -(assert (= z "ccucagcagaugac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 deleted file mode 100644 index 51323d110..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0232.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCACATTTGGGATTTGCTATTGCTCGTCAGCCAGCGGATCGCAAGATCACTACGAGCCGGTCTCGATGCTGTGGGATGATGATACGTGCCTAAGTCGCGTAGATGCGTGTTCTTGATAGATTTAACCCGGCGTGTCCTCAGCTCACCATATATCGTGGGCACAGCGTCCGCATATTCGAATGTGCCGTACAGCCAAAGAA")) -(assert (= z "acuacuaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 deleted file mode 100644 index 3a42e7095..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0233.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGAGTGCAACAACATCCAGCGCGGCACCACCAGATTTGTTTTAGGGAATCGCAGCTTTCTAAATGCTGAGGATCGTGCAAACAATATTTTAGGACTTACGTCCCGTAGCTCACTGCCATCTCAGGCGTCTATGTGGCATTTAGACTTGCTACGATTCAGTCTATAGCGTGAGTGGTGTACTGATGAAGCAGGGCCCTGAA")) -(assert (= z "guagaguccgcagauacac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 deleted file mode 100644 index ae3e17011..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0234.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGTCCGGTTTGTGCCTTGACCTATCAACGCCAGGGGTCCAGAGGTTTATAAAGGATTAATTAGCACCCAAACGATGAGGAACAGGACGCAGACGGTTGCGGGCAGCCGCTCATTTGGCGTCTACTGAGTATATAGGTGTATGTGCTTGAGGATGAACTGCAACTGAAAGACGAGGACCCTCCCTTCCGTCCCGGCCGCT")) -(assert (= z "ggguuugcuacuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 deleted file mode 100644 index 6ef976e4b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0235.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCTCTTCTATTACGGGATCAGCACACAAGGACATGATTCGAGCTTTTACGTTCGTAAGCCCTGGTATAGTGGACATAGGAGTTATATAGGGACCGCTCCCTAATCAGGCCGAATAAACACGAAAATTAGGCTTCAGAGACGAGTGAGAGCATCTTGATCTCTCTTTAACTATAGCAGGGGGAGCGCGAAATGTCATCGC")) -(assert (= z "uagagagaaauugauauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 deleted file mode 100644 index 178d422c6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0236.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGTTTGTGCTTATCCCTGCTCCGGGGAGGGATACTGGAGACCCGCTGCGAGCCACCATAACGGTCCCGCTTTAGGTCCTTAATCATAATTATCGGGCCCCAGTCCTCCACGCTCTGATCCATTTCTCGGCTATAGTGGTACTGAGTCCTAGCTTGCAAGCTACTGGACGCTAAGCCGCCTTGACAAGGTATAGACTTCG")) -(assert (= z "ggggucaggaggugcga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 deleted file mode 100644 index 2cd4924c2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0237.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTAAGTTGAACTAATCCCGCTGGCTGGGATGCTAGGAACATAAGCCACGAGTTGGATCAGACAGCAACTTCTGGTCATGTCAGGCTATGTAAGTTACTACCTGATCCAGAGGAGCCGCAAAAATGGACATTACCAAGCAAAGCCGATGTCTTTCAGCAACCAGAAATATACATGTGCGGCCTTCAGAAGGTAAGACGTTG")) -(assert (= z "agaccagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 deleted file mode 100644 index bcff60b54..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0238.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATGCTTTCGGAGAAGCGAGTTGAGTATTAAATGCTTACCTATACCAGAGGTAATCTGAATAGGGGTTTATGTGCTCCCAGAAGCCGTGTTCATTGCCGGCCGTTTTGCCTGGCGGCAACTCGTTCTGCATGGTAGCAGATCCATGCGCAAGTCTGCCACGAGCAGCTGTAAGCGAATTCATACTCTTTGGGCCGAGTCAA")) -(assert (= z "cauuagacu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 deleted file mode 100644 index f625cf5f2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0239.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGCCAGTGGCGGTGATTGGCCACCCATTCTGACTCGATAAGCAACCGTTTGAGATTGGTCTAGAAGAGAGGTCCACGCCCGCCTGTATAGCGCGATACTGAAACCCGCGCCACGCAGCTCGGGGATATTTGCATAGAGACCCTTGAGTCCGCGGGTTGGACTGGTTCCCTTCAACGCTACCATGAGGCTTGGTCCCCCGG")) -(assert (= z "gcgcuau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 deleted file mode 100644 index 8edf1d464..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0240.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCGAAGGGCGAGGGCATAATGGTTGCAGGGTACCTAACAAAGGCAATAAGCAGTTGCGACCACAACCAATATTGGCAATTCCCAATGCGAGATCCCCCGGGTGTGGATAGTTGTACCGGATAGCTGACCAAACAATTGGGTCGTATAAAATCTCAGTACATATACTGTCGTGGATAACTCGCACCTTTTGTTGGCGATG")) -(assert (= z "caaccgcu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 deleted file mode 100644 index b90cf0d06..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0241.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTGTGAATTATGGAGCTGATTGTCAGGCCCAGGCAGATGTGGGGCAACCCTTTATAGGGAGGCGTATTCATGTGGCCGGGCGAATCTCTTAACCGAAGTACCAAGGCCCACAGAATAGCTTCGATCTTATTCGACTAGCTGGTTACTGAGCTTGACATTAACACACTTATAGGCTATTGGTCGATACCTTTACACATTC")) -(assert (= z "uggcuucauggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 deleted file mode 100644 index 93396862c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0242.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTAGGCATTCAGACGCCGGCGTGTCACGAAGTGAGCGAGCATGATTCAACTCAAGGGCCTAACTTGGGAGATTGTTTATGCTCCTGTCGAACTCGTAAGGTTAAGTACCTCCAGCGGACTCTCGCCCTATGCAACACCATTTAAATAGTCAGATTGATCTTAGTCCCACTCGGCTGAGAGGACAAAGGGCTAGCAGATG")) -(assert (= z "gggauacguug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 deleted file mode 100644 index 001411be3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0243.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAAATCATGATGCACGGTATTTCGAGTCTGTTACTTTGATCGCGACTGACATCTTCAATCGGATGGTGATTTTAAATCGCAAGAATTTCCAGAAGTACGCGAATATAATCTGGTTTCGACCGGACGAGCTCGAAGCGAAACGCCGGATCAGCAAGCGGTCGAATTTCTGAGAGAGCGCCATTCTTCCGGGACGAATAATA")) -(assert (= z "cugcuuauuau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 deleted file mode 100644 index 4932eb452..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0244.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTACTATCAAGCCGACCAATCACTCACGCACTTGTGGATTGGCAAGAACTACTTGAATAGCTCTATAATGAATACATAAAGCATGTTCGTGAATCTTGAACTTTTTGTAAAATCCGGCCTAGCGCATCGGCCCGTCCAGGGCTACAACAACTAAACTACCTAGCAGGTTGCCGATCGGTATGGGTCTGCGAAGTACTTGG")) -(assert (= z "ugaacac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 deleted file mode 100644 index 3f5e89969..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0245.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGATAAGTCCCCCAAATACTTTCTTAACAATAAATCGGCTACTATACTCCGCAGCCCATAAGTACACGTATATTGCCCATCTATTTTCGCCAGCGTATCTTGGCGCCGGACTTCTAGTGGTGCAAGCCGGCTGAGAGAGTGTCGCATGAACCTCGCAGCTCTTTTCTGCGTAATCAGAACGGCACGTTCCTATAGTCAA")) -(assert (= z "uauuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 deleted file mode 100644 index 02212a9e9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0246.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGGCAAGCATTGCGAAATTGGGGTCGTGTGTTAGAGTGTCTACCGTGATCGTGCATATTGAATCTGTCCTGCCGTATGTATGAGTCGGTGGGCTCAGAAGGGCGACAGAAGCGCCTTGATCATTATGGTAAGCATTCCCACAATCCCCATAGGAAGACCTCCGCGCTCCATCCGCTCTACCTTATAAGGTAAACGTTCA")) -(assert (= z "cacuagcacguauaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 deleted file mode 100644 index db1b924dc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0247.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAGCGCAAAAGTGACTCGAACCATTTGTTTAAACCCGCTACGCATTCTTCACTGAAGATGGCGGCCTGTGCCACGGGGAACAATGCATTATCAAACAAACAGTACACCCGTTATCCGATAGGGCCTCGGAACACTGCATGCGCGGTGGCCAAATTCCTACGAGTTCAACTCGGCTAGGGTCGACCGATTTCGAGCGATAC")) -(assert (= z "ugacguacgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 deleted file mode 100644 index 8d8a076cd..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0248.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAATCTCCGACGTAGATTTTTAGCAGACATGCTCCCTGGCAGTAGTGTCATGGCTGGCCAAATTTTTAGCTTCCTAGCGCTGTGATCTGCAGGCCACCGCCCTGGTCGCTCCCCCTACTTCCGCCTGTAAATCTTCTTGGCTACAAGTACACGGACTGATGTTAGAAATTTAAAGGCCGCGGGCAACCTTGCGCCGACCT")) -(assert (= z "ggaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 deleted file mode 100644 index b09fa66c6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0249.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGCTGACTGTACGCGTTCGACTGGAAGGGCAGGGACTAGTCGTGCACCGGCCCTGTCCGACTCGTTCACCCCCTTTGAAGCATCCGACTTATCGATGTTGCACGTCCGGTGGACTATATTGATTAGCGTGAGGCACATGTACAAAAAATGATGACATACCAACGGTCAAAAGCTCGTTGACATTTCCAGACTCTTGCTT")) -(assert (= z "agcacguggccgggacaggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 deleted file mode 100644 index 35a6337bf..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0250.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACGTTTGCGACTTGATCGACCGTTCAAACCGTGGCCCCGGACTCAAAGTCTTCGCCCGTCTATTAGACCCCAACTTGAACACCTCAGAGACTCCACGATCATGTAATCGAGGGCCCAGTTCCCGCTGCAGGCACCTCATCTGCTGTGAGCTATGCGCTGGAAGGGTCTCATGTTGAGTCTTGACGTTGCCGTACTAGGA")) -(assert (= z "cgcgaccuuccca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 deleted file mode 100644 index ad2c6f7e2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0251.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCTCACGCTTTTACACGGTCTGGTCAATTTCTTCGTCGCCCCCTGCATGCCAGCCTCACAGTCGTTGATACCACGTAGTATTGCCAGACCTCTAGTCAAATAATATAAGTTATTTTGAAGCATGACTTTCCGTTCGGTCATATGGCGCAACGCTTCGGCCCGTGACTAGTAGGCAAACTGTTCCATCGTAGACAAATGT")) -(assert (= z "caagccaguauaccgcguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 deleted file mode 100644 index b3c5cecdc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0252.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CATCATCCTGTCCAGGGAGTAGTAGTAGCGTTTCACACCGTCTGTGTAACATATGATCGGGCATGGCCAGATGATATATTCCTCTAAGAGGAGCGAGGCACTAGCCACTCTCAATGCTGACTAGAGCCAGGCGTTAGCGGTCCCGTAAAGGGTTCTCTAAGTAGAATGAAGTACACAATAATATGCCAATATCTTATGCT")) -(assert (= z "cggugagaguua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 deleted file mode 100644 index 25b4eec4e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0253.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGTATCAACGACAACGCTAGTGGCCAGGCCTTACTAGGGACCGATAGTGAAGTAGTTAATGTCGAACTAAATTTTTAGGTCAACAAGAACGCCGGGAGTGTTAGTGTGTTGCGTACATAGCTGTGCTTACAGTTACGGGAAGATGGGTGGACAGGTCGATGCCGAATCAGACTACGGAGATCAACCGCGCGGAGCGACG")) -(assert (= z "cagcuugauuuaaaaaucc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 deleted file mode 100644 index 0526893ec..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0254.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCAGGCTGCAGACTCGAGTATTGTCAATGGCTCTTATGTTGAAGAGGAATGGCAGACGGACTGGACCGGGGTTAACGTTCTCGTGACACGCACAGTAGCGTTGCCGTAATTCTGAGGCAAAGTTAGCTACTTAAGCAACTGATGTATCGCTGGGCAGTGACAGAGCTCTCTTCTGTTTACTGAATGGAAAAAAATATCCC")) -(assert (= z "gagcucauaacaguuacc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 deleted file mode 100644 index 629c142f1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0255.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCCGTAATTTGGTATGAATCATTGGACCGTTCCATGTTGCGAGTAGATAAATTATTTTGGCCACGTCAGAGCGAGGACCCCATGCAACGCAACCGTCGTTCCGCAGCCAAGCCAAGTCTAACCCTTCAGACATAATTGGAGTATCCTGTCTGAACAAACTCTTGAATCCCACTCTGTTAAGCACGTATATATACAAACA")) -(assert (= z "ucuguauuaaccucauagg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 deleted file mode 100644 index 2cd944ea3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0256.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGCGCCAGCGTCGTTGCTGCAGATGTTTAATTTTATGAGGGTTACTTCCTTCACTGGGAAACTTCCAATCCGTCATTCAGTCCCTACGATCCGTCAGCGGCCGCAGGTCGGAGACACACCAAGAGCACGATCCCCGGGACATGCAACCTGCGTTCTCATAAAACGTTTGTATAGGAGTTACTCCCAACTTACAACACCA")) -(assert (= z "gucuacaaauuaaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 deleted file mode 100644 index 7d58c19b0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0257.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CATTGGTGTGTGCTGTTGCCCCGCACCGGTGAGCACGTTCTATACTTGTACAGGATTCTCGCACATTACTGACGTTTATCGTAAACCAACCCGTGAAACGCGCGTAGCACAATGCTGAGTCATAGAGGCTAAGGTAGATACCCACACTTCTCAAATAAGGGGCAGTCAGATTAAGCAGCGGTCCAAGCCCAAGGCCTTAC")) -(assert (= z "gggcacuuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 deleted file mode 100644 index 65aa90b7b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0258.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCAAGAGAGACGAGCAGATCACTGAACTAAAAGATGTAGGGCCGCCGCGGAGAGACGCTGTTTCATGCAATAGAACGGGCACGCCCGGGGGGGCAGAAATAAGCGCTCCAGGGCGCAATGCTCAAGGGGACTTGCCGTAATGGGCCGTTGGCCTGAAGATATATCTTGCGCGCCTACAACCGCTAGTCGGACGTTCTGG")) -(assert (= z "caagac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 deleted file mode 100644 index 2b952f82b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0259.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACAGGCAGGAGTGGACCTGCATCGACGGTAAGCAAACGTACCGCATGAAGTTGGCATCCTTAAGACTAGCTAATGCTCTAACCTTGAGGCGCTTGACCTTGTTTGGAGAACTTTTCTTCCTAGCCGCAATAAATGTAAGTGGGAAGCTGGAAGAGTGCTTTTCCACGACATGTTCCAGTCCAAATCGCGGAGCGACTGG")) -(assert (= z "uuugcauggcguacu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 deleted file mode 100644 index 72e471720..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0260.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCCGAACTCCACGAACCTAACTCGTTCGAACATCGCGGCGCTCGCATGCACTGTGAAGATGCTAAACTGGCATGAGAGATTCTGAAAGTCCAGAGTGTAGAGCAAAATCTATTCGAGCACCGCCTTTCGTTTATTATGCAATCGCCATTCAAATACACTGCTATATTTTCCCGCTTTTTTTATAGGGACGCTTCCGCTT")) -(assert (= z "ucacau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 deleted file mode 100644 index a07106325..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0261.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGCATCTGGTCTATGTCTGTCTATTCAGGCTAGGTTATTAGTGGCGTTGGTCCTGAGTAAACACGGTCAGCGGCTCCACAGGTGATGTCATCCAAATCGCGCCAACCTAGCTCGAGAAGCCAAACGTGCGGGGTTTAGCACGCCGGACTGGACTAGACCATCTTCGAGTGCAGCAGTACTGCTCGTGCACGAACGCGAA")) -(assert (= z "acgcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 deleted file mode 100644 index 0c06901df..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0262.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGCTGCAGTTCGGGGCCTCCGGAAATTAGATGACCCATTTTTCTTCACTATTCTAGGACGTACAATATCTCGGTCTCATAAAACACTGAACTTTCATCTGACCCCGTTCAAATCTGAAAAGTTCCTTTCTGTTCCATCCACATACGTTAGAAAGCTGGGGTGGTTACGTGCATAAAGCACCGGTTATTTCAGTGGACTA")) -(assert (= z "cggaggccu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 deleted file mode 100644 index 878663b6c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0263.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAAGAGCTGTTAAGATAGTTTCCACGAGCCGAGGATTTTGATCAAGTTGATTCACAGCTGTCTTAAGTGCATCCAGGTGCAGTTCACTCACTCTTACCAACTAAGGTGCCACATTAGCGCTAGCTGGGACATGCACTTTTACGGTGCGAACCAGGATAGCACCACGATACAACCGCATACAACGGGAACTCTTGGTATAT")) -(assert (= z "agaaugguugauuccac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 deleted file mode 100644 index 42ec0ee99..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0264.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTTTGTCCCCTTGAACACGCGCGTGGCCATGTCGTACTGTCCATTATAGAGACTCCCGCAGAAGCAAGAGATTTGGTATTCCTGCTTTTGGCTCTCAAACACCTAATTCCCGAATGGTTCCCTAGCGTGTTTAGCAACCCCGGTGGCGATTGACTATATCCTTGATTGACTCAATGGGGGAGACCCCCGAATAGCTGTG")) -(assert (= z "accgguacagcaugacag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 deleted file mode 100644 index 98a5e5245..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0265.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AATTTTCTCACAATGAGGCATGCTAAGGAATCAGAGACTCTTTGCGTCGCCGCTGGGACTCCTAAGGTCCAAAGAAATCGAGCACATGCAGCGGCCCTGGCGAGAAAGACACAGCTGTAGCGGTGGAACCACGGTTGACAATGATAGGTCAAGACTCTGCTTATATACGCAGCCGGCCTGCCATGATGCAGACGACCCCC")) -(assert (= z "uauaugcgucggccgg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 deleted file mode 100644 index afbb8754a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0266.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CATAACAATGGAAGTAAGATTGGCTGCCAGGCTCTATCCAAACGGGTGCCGGAGTTGAGGATTAATACCTTTATGGTACGGAACGGAGCAATGTAAGTCGGCAAATAGCATTGCATGAGGAAGGGGTTTTCGAACTCATATAATTGTAGATAGATTCATGAAGCGCATCTCGGGCCCTTCATTAAATACCCGGTAGGAAG")) -(assert (= z "accaugcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 deleted file mode 100644 index 68185ffeb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0267.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGCTGCTTTCCATATGTTGTTAGTCTCATCCTGTTCTGTGCCTGTGTATTGTGCATGGACATCTTGTCAGCTCGATTTGACTAGATCATGCACTACATTCATTTTGTGACGGATTGCTGCTTGGGAGGTGCGTGGGATGTCACACTGAGGCTGGCAGCACACCACGCGTAGATGTTCGCCTGGCCAGGGCGGCAACGTC")) -(assert (= z "acgaaagguauacaacaauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 deleted file mode 100644 index c92abd1b5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0268.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGATATCTTGTTGAATTGATAAGCAAGACAAATTCGGATTGGGATATACCAACAACGCAGGAAGAATTGGTCTGAGCTAAAAACGCGTAAGGTGCTCCCGGTTTTACGCATGGCATAAGCCTTGAGGGTTTATCAAACGCAGACGCCAGAGGGCGTTGGACCAACTCTGTACAGCTTTATTCAAGCGAGGTAGTAGAACC")) -(assert (= z "cgaggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 deleted file mode 100644 index 88e49deb1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0269.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCCCGCACAAAGACACTAACCCCACAGCATCCTGGCTCCCTAATTGCCTTAAGTTTCTGTCTTGGAAACCCATGGGCTATTGTGGACGTACATTATTGATGCTGCGCTCGATATTGAAGGGCCCGCTAGTTGAACAACTCTTGGGCTCGGCAGCATTAGTGTTATATAAGAAATAATAGAATAACACTAGCCAACCCTTG")) -(assert (= z "cacaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 deleted file mode 100644 index c6c198406..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0270.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCTTATTGCAGCTGGCGGTTATCCACGCAGGCCCACTTTTTGCTTCGACTGTTTGGCCATCTAATAGCTTCCCCATTTCGTATCAGACAGCCGCCCAAACCTGAATCCCGATCGAACAAAATTTAATTCGTGCCCCGATGTCCGCAATCTGCTTTGTATTACGTTCGCCTGGTCGATCGGGGGCATACGACTAGCAAATT")) -(assert (= z "aucguuuaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 deleted file mode 100644 index 74375d18f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0271.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATACCAGATGTTAATGGGTGCGCCGACATAATCCAAGCAAGTACGTTGGTTCCACGGATACTGTGTTGCCTTGGATTGGGAGCCGAGCTTTGAGATATGCCTGTGACGTTGCGGGCACCCGTTTCAAAAGAGGAGGGGCTGCCTGTGCCTGTCTCACACTTAAGACGTGGTCTATGAATTCTGTTAAGCCAGTGTTTTTT")) -(assert (= z "cccgug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 deleted file mode 100644 index a21754643..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0272.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGTCGGGGTTGTACGGCCCCGGGGGTCTAAGTGATTACATCTACAGTACAATGTTAGGGCGGATCCGTACACCTTGCACAGCAATCATACCCGGATTGCAAGTTATTATAGCGAAGAGGCCAGGAGTATGCGCATAACGACCTATCAACGGTCAACCCTACTCAATTGAGCTATGTAACGTCCCAGTACCACCCAATGG")) -(assert (= z "cggggccc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 deleted file mode 100644 index 40c2d3504..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0273.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGCGTCCCTCCCGACTCACCTAACCACACTCGGAACCGCAGAAGGGAAGAGTCTGTGGACTGTATAACGATGCAGTAGTCTCCCGGCAGCGAGAGAGCCGTACGCATCGCTCGCACGGACACTGATGAGAAGACCGAGGGTGATTTGTTGTTCCCCGGTTACATCGGGTCCCCTAAAGGATGAGGCTTATCAATCTAGC")) -(assert (= z "ugacauauugcuacgucauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 deleted file mode 100644 index faf766798..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0274.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAAGCGCATTAACCTATGTCTTGCTCCCTAGTCACTGGATCGTTCGCCTGCCATAGGCGAGCGGATGCAGCTCAGCTTCCTTGGTGTATTACCTGAGGGCGTTGCATTCTTTTGTCATCCCGATCTCGGATCATCGGGCCGTCTTTTCTCGCACGTAGTATGGTAGCAAGATCTTCTCACTCGAACTGCTAGAAATTTC")) -(assert (= z "guucuagaagagugagc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 deleted file mode 100644 index f22365d9e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0275.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAATTACTCCTGCAAACCCTATGATGAGTCAAAAGATCCCAACGTGTGATGGGTGTGCTGCTCACCGAACTAGCCATCGTCATGGCACTGGAAATAGCGGGTTACACAGGTATGGTCCCATTTGTCCTTATAATGTGGGACTACGGGATGTGGATCCCATAAGGGCCGTTCCCCAACCTTTGCGAAACGTCTGGACCATG")) -(assert (= z "gguugcaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 deleted file mode 100644 index b1674ceff..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0276.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAACACGCACGTCCGGTCATACGGGCGGCGTCAGGCCACGAAACGTTGGACGGCTAATGAACTTGCCGTGGTTTTAGGTTGCTGGAATATCCTCACAACCAAACGCTTTGCGATTATATCGTCGGTCCGTTTTATTGACGCTCACATAATACTCTGCTAGGACGTTCGCGCAAGGTCCCGATTTAATTGTCCCAATGTAT")) -(assert (= z "augagacgauccu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 deleted file mode 100644 index 5e7da9e09..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0277.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGAATGTTTCGAGGACATAAAGCAAGAGAAGCCCGATTCAAGTACACCCCTCGCCAGACTTCGTAAATACAAAATCGTCCTCAACAAAGGAACTAGAGGCCGTGGTTTCCAGGGCCTATCCAAGGCTAAGGCACAGCACGGACGCGAAGCAGCACCAATTGGGCGCCTGTGGTCTCATGGGGAGGCGTATGGGTGAGTC")) -(assert (= z "ggcaccaaaggucccggau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 deleted file mode 100644 index c69c8921a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0278.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGGCTACGTCTTACTAGTTGAAAAGCATCCTTATTATGCGGCATAATCCGGGTAAAGCTAAAATGCCCAGCGATTGTAGGTAGTGTACACTCTCGTGCGCCCTATTGGTATATCTTAGCTCCAGCCACTTCCATATCTTATATATCTCGTAATACCAATGAGTTTCCATAGTTGGGATTGGTTGAAGACCGGGCAGGGA")) -(assert (= z "cgaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 deleted file mode 100644 index 95f9e0d61..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0279.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCCACGTCGCCCCGTTCGACGGTTTTTGTGGGTCCGCTTCGCTCGCCGTGTGAACCAGGGGGGCATAAGCGCTATGTTGCCGCACCGCTCGCGACTCCCGAAAGGATACCGCGTGGTCACAGCTGTAGACTAATTAAACGGATCGGGTCACTCACAAGCTGAATTTCCGTTTCGCCACGTGGTTCGCGACAACGCGTTTC")) -(assert (= z "gcagcgggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 deleted file mode 100644 index 9ad224731..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0280.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATAACTTTCCTCCACAGCAGAGTGTAGGGGAGCATTTACACAACTTCCTGCTGTAGCGAATGGGAGTCCTGCTGACCGGGTACGTGGCCAGTGCGATGCCACTCATTGAGTGTAAACTCGTACATTCGGTGAACACTCCGCTTGCATAAGTCGCTTTCAATTGACTAGTGTCACTCTTGGAGTATTGAGTGTAAGGAATT")) -(assert (= z "uacccucagga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 deleted file mode 100644 index 82eb7c640..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0281.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGAGACGTGCCGCACAGAAGTCTCAGCATAAGAACGGATGAGAAATACTAGCAGTGACTTGTGAATTCTGTTCCCCCCGGCGACTGAGATGTATGTGTGCAAATCCTTCAGAGTCTTCCTTGACTACACAGCGGAGGGGACCTCCTTTGCCCCCAGCTACACTTCCGGAGAGTACCTACTAGCGCCTAAGGCAGGGGGAG")) -(assert (= z "cguuuaggaagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 deleted file mode 100644 index 56109a165..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0282.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATGCTTGCCCTGGTTCGACGCTAGCAACGGGTTGAATTGGGCCCCGAGATCATGTTTAGCGTGCTACCTTACGTACCACTTACTGTGTCGCAGCGTTGGATATATTGCTTATGCACATATATCGTGCAGACCGAATAGTAACCCTTAGTCATGGATGTGGTACATCCTCTCTCACTCTTGGTAGAAAGACGGATCTCTT")) -(assert (= z "aucauugggaaucagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 deleted file mode 100644 index 16ea639c1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0283.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGGGCTCACACGTTCATCTTCCCCTTTGGTAGGTGCGCAAATCCGAATGTCGGGTCCGTGAACATTGGGTAGCCTGGTCCCGATGAAGTCTCACAGAGAACATCGGTCCTCGATGACTTAAATTAAAACTATGCATGATTACTACTTACCCCAAACGTACCAGTCCGGTAGGTCAAGCACGTTAGACGACGGAAGTGGC")) -(assert (= z "ggcuua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 deleted file mode 100644 index 43ccaa271..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0284.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGCACGATCCATAGATTACGTAAATGGACGGTCTGGGGGCAGGCCGGGCTGAGTAATTAGGATACACGATGCTCAGAGTTGCACTTGCAGACTTCGTGGGGTTGTCAATCAGAGACAGCCATTGTCTGCAGGAAAACAGAAGTCCATAAGTTGAGAAGGTGCTCGCAAGCACCACCGACGAAAATCAATAAGCCTCTAG")) -(assert (= z "ccugccaga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 deleted file mode 100644 index 838cb60d2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0285.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCAAGAAGATGTCAGCACCAGCCACGAGCGCGACCGGTTAGGATGGGCACTCGTCCCCCACCTTCAAGCCTGCACGACGTCCGGATTCCGGACCTCATACTGGAGTGCGGACACAGTTTTTAACGGTAAATCAAGGCCGGACAAGAACTAGTGCCGCGAACTGACTAAAATGTAACTGGTTGGTGGAGCGGCTGATGAT")) -(assert (= z "uuacauuga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 deleted file mode 100644 index 7ebd3675f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0286.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTTGAACATTGACAGTGCCGAGGTCCAGCTCGTAGTCGGTTTTGCGTGAGTGGTCTTCCCGGAGTTTAACCTTAATACAGTTCCACACTCGCGACGACGTTAAAGAGTGAGACTAATGAGAGCGGCCTCTAGAGGTTGTGAACTGGACCAGCAAGTGGGTTCGCGACTCTATGGCCCTCTAGAACTGCGTCATTGCTAG")) -(assert (= z "auuucucacucugau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 deleted file mode 100644 index 14b1ab6b9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0287.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTCAGGTGACCACTTAAGACACCCACGTAGCCGCGAGCAGCATATCTGAAGGACCATAGCGTGAACCCGATGCCACCTCCAGTTTCACTCCGCTTGTTCGCTAGCGTCGCGTGAAATTCTTGCAGGCAGGTCTTTGTCGGTCCGAACTTTCAATAATGAGCGGTATGGTACGAGTTCCAGAAATATAGTTCGCTTCGCGT")) -(assert (= z "auucu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 deleted file mode 100644 index 2c0e9a379..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0288.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAAGCCTGCAATGGACACTTGCACTTTCTTCTAGGAGCGCGCTTCAACCCTAATGCATCGTTGGAAGCGCCAAGAGCACCAAGTTCCGTTCAGCTAAATCCGACTAGTGCACGTTCCCAGGTCGCGTCGACTTCGTACAGGGGTGCCATGATGAATGCCGCGTTAAAACTCTTACCCGAGTATCATCGCATGTAACGTAC")) -(assert (= z "aggcaagucgauuuaggcug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 deleted file mode 100644 index 3bbc353d2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0289.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTTCCTTGGTTCGATCATATCTACATCGGGATTATGGGCTGAGTATTCGAACGTGTTGTGTAGATCAAAGGGGATCCTATATACGCGCATGTGTAATGATGGCAGGAGTCAGTGCTGCTTAGTCCAATAACCCACTTGCTGCGGGATGCACCCGCAACCAGACCATTTCCCTTAGGCGCGCACAGATCTGATCAAGCTC")) -(assert (= z "ugcacaacacauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 deleted file mode 100644 index 5069b1719..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0290.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAAATCACCTGTAAGAGCTACCTGGAAAAGTCAACCACACATATCAACTACTCTTCCGTCTAAATTACGTATGGCGAGACAGGAAAGTTAAGAGAATGGACCTGCCTGGCCAACAAGTATTCGGGGGGACGTAGACACATCGTCGTCCAATGGTTGCGCGAAGACGATCACCTAGTGATAATAATTATGTGCAACGGACT")) -(assert (= z "uuuaguggacauuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 deleted file mode 100644 index 16d35521c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0291.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAACTTAGGCTTAGTTGGAAGATAGATTACATGTGCCTCCTGAATCAGAAATGTTTGCGTGGCCTGTTTCCATGCAGGCGTCGTCGTAAGCTTAAACGCACGCGGCGAAAGCTATATCTATGAGATGCCGACGTGCGTCCTATTATATGCACATTCGAGTATGGTGGGTTCGCAAGAAGTTAAATGGCATACGTGTTTCA")) -(assert (= z "cuuagucuuuacaaacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 deleted file mode 100644 index 36ae2fde7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0292.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTCAAACTTAATGGGGCGATAACGTCTGTACTTAACACAACCGGCGGTACGTGTCATCCCCGTCAGACTTTTTGACTCCATGCCTTACGATCTCCTTTGCCGACAGTTCACTTATGGCCCAGCACCGAAGCCCGTAGTAACGGCGGATTGAGTTATTAGGATGAAATATCCATTCGATGGTCTACTGGGGCGGTGCAACG")) -(assert (= z "agguaagcuaccagaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 deleted file mode 100644 index d50faf050..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0293.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATCGGGACAACACGCTCACATGTACCTTTCCGCGGCCGAACAGTTGTGCGAGGTTCCGTTTGACACAGCGGCGTTAAACCTGCGGGTAAAGTTTCCCGGGCTGTGGAGAAGCTTGACACTCGTCTGAAACGGTGGCACAATTGCCCGACCCTTTGCCCTAGGAGGCGTCTGAGCCAGGAGAGCCACTCTGGTGATTGCG")) -(assert (= z "gucgccgcaauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 deleted file mode 100644 index 77e37ae86..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0294.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGTTGAAGAGGGACATATAGGACCTAGAGCCAGTGCTGACACGGGAATGGTGGAGGTTGGATAATCGAGTCTGTCGTCCGCCAGGATTAGTTGGATGCTTGGTACGTTCATGAAAGCAGGGTCCCGTGCTCTGGACATCATGTGTGGCACCACGGGAGTATTAGATCCGCTCCGGCTTACCGGTGTCCGTGAGGCCACC")) -(assert (= z "ggcgguccuaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 deleted file mode 100644 index 1d22ca518..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0295.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGACCGTTGTTTACGAACTGTGGGAGTTTCTCCTTGGGTCGATAGGCTGTTCATACCCGCCCTGATAGAATGGGTTCTAATGTTAACACTCAAGGGAAGGTCACAGCTGAGCCCGAAAAAAATACATATACACATGGCTGGTCCCCCGCGCGAACCATGGTACCCGCGAATTATAAGCCGAGAGTGTTTTGGGGAGTTC")) -(assert (= z "acccuca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 deleted file mode 100644 index 4a6c17db9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0296.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTACAGGTTTCATATGGTAGGGTCCGGGAATCCTCCTACGAATGCGCGTTCGGCTTAGTCACACCTGACCACTTTTGTAAGATTAGGCAAGTTTCGTACGGTCGACTTACAGCTAATCGCAGCCAAGTACATGTCTGTCTAGGCGCCCAAATACTGAAGTTTCGGCGACGCAGTAAATATGCATAAACCGACTCAGTATT")) -(assert (= z "aagccgcugcgucauuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 deleted file mode 100644 index a59b0255b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0297.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGGCATGACACGGGAAGACTATGCACCTAGCTGAGCGAAATGTGCCGTCCGTCTAGCCCGACGGGACATGGTGCTGTCCGAGATCCGGTTACGCAAGAAAGTGACGGTCGGAAGTCCGGTCATCGGCGCAGAGTATCCTTCTGGGGGCCTTGTCCATTGACCCCAACCTAAAGCTGTACATATTGGCATCTTTACGCAG")) -(assert (= z "ugcgu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 deleted file mode 100644 index 6eda17e35..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0298.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTTTATTCGAGTGAGGACCACAGAGGGGCACGGGGTCTTTAGAAATCGGTGCGGTAAATAAATGGAGATAGCCCGGTTAGTGCCACGACCTCTTTAAGGAAACTACCTGAGTCTCCCATTGTGCAGGGTGCCATGGGTACCGTTCCGCCATCTAACTGTAACTATGGATACCGATAAGTTTGTCGCGGGCGTTCTTGGTA")) -(assert (= z "ugucuccccgugccccag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 deleted file mode 100644 index b11006314..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0299.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTAGTACACGAAGCGAAATCTGCCTACTATCCAAACCGCCCAATATTGTGTTCCCAAACCTAGTCTTACGTTGCTATGGTTCATCAAGACTCGAAAGGCGCAGCCCTATAAAGCAATCAAGAGTACACACGTCACCGGCGAACCAGCGTTGCCCCCGGAGTGTGACGCCGGCTGCCCGTCTACTATGATAAGCGGTGCGG")) -(assert (= z "gugcagug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 deleted file mode 100644 index d37d97774..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0300.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGGAAAACTGTATTCATTAGCTGGCGTCGAGTTGCCGTGCATTGCCTCCACAAACAGTGGAGCTGCTAATAAGACATACATGTGGCAGGGTGATTCATCAGAAGGGTTCATTGTGTTTCTTACCCTGCTGTTCCCGGGCACTCAGAGGCCTGGTACTTACCTGACGTGACCGCGGACCATGGCGAGCCCGCGTGAATAT")) -(assert (= z "gucuccggaccaugaaugga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 deleted file mode 100644 index 90f323dc7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0301.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGTTCAGCTAGTTGGGGGTACCACTACTAGTCGAGTAAAGCTCGCGCCACGCGAACTCTACCAGGAGTAGCACCACCAGCTTGACTAAATTCAAAGATACTAAGCACCGGTAACCATTCAGCCATAAATGGCTTTTAATGCCGGCTCCTATGCCATCTCTCTTATGGTCGGCGTGCAAGGAGGATGCACGGCACCAATA")) -(assert (= z "guuccuccuacgugccgugg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 deleted file mode 100644 index 4e289d2f1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0302.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCTTAATTACCCATCTTAAGCGGTCTGATCAGGATTCTGCCCAGGGGATGGGAACGTCCATGCAAATTAGGTAGTTGGTTCTGCGGGATTTGTATGTCGTGTTCGTTCAAGCCCAATGGGCTTCACACATCACAATCGCAAAAGGTCGTAAGCTTCAGAAATCCTGTTCATCAAATTGAGCGTAGGCTCCAGATAGATG")) -(assert (= z "cgcccuaaaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 deleted file mode 100644 index b69146a3e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0303.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTAACTTCCGGTTACGTTAGATGGACGGTTTAAGATAGAGATATTACTCCGTCCTGCTGGACTATCTACGGAGTCGAGGCGCCATGCGGTCCCGTCGCAAGCACCTAATCTCACTCGTATTTCATCATCGTCTGCCACCCAGGTGCATGGCCGAATGTGGAGCGTTCACCGGGACTGTACTTCACTGCGCTACCAATGCC")) -(assert (= z "ucgcaaguggcccugacaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 deleted file mode 100644 index 6fc675637..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0304.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTGGAACGACGGGCACATCCCGTGAAATCGACTCAGGCTGAAGTAGTCATGAGCTAGAGTTGTTCACCCCGTTTGTCCCCGTGTACGGGGTTGTTAGCTACGGACGAATATTGGAAAGAACTTTATGCCTCAGTCTAACGTATGCCATTACTGGCCGCAGGGCTGGCACTAGTCATGAACCTGGAGCGGGTTCTCTGCT")) -(assert (= z "acaaucgaugcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 deleted file mode 100644 index a6ea81eba..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0305.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGCCTTAATATAGACTGATGCTATTTCAAAATGGCAAATGCCTTAGTTGATATTATAGTGGATTGATGGATCTGTTGCAGGATATTATGATGTTCGATTAATGGGTGGGCTTTCCGCATTTCATGGCGTCCGATTCCTGGAACGGTATAACATAAAGAGGGATACGATAGAGTGGCTGATAAATGAGAATTGAACGGAA")) -(assert (= z "agacaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 deleted file mode 100644 index 839faca9d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0306.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACGACCGTGGCACATGTGTCTCGGTGAGGCACCGATAGGGTAATTTACATGATCCATGCAGCTACCAGCCATAACGTAACGTGTAACCGAGAGGTCCCATCTCTAACTATCCATGTGGAGTGTTGCTACGCACAATTCGATAGTCTTGCATGGGGCATGTGGAATCATGAGGAATCATTAGGTCACAATGGCCAAAGGGA")) -(assert (= z "uccaguguuaccg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 deleted file mode 100644 index 1b4594931..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0307.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGCGATACCTTTGCCTGCCCCGTTCTCCTTCTAGCTGTACCCTAGTTTGTTTGCATAGAACAAACGCTGGCCCGGGGAAGTTGGTTCTGTACTAAGTAGTCTTTCACATCGCGTTACTGGGTGAGTCAGCCCCAATGATTCACAGTATAGCAGGGACCTTGCAGGGTACTACGGTTTAGCAAGAATGCAAAAATGATCC")) -(assert (= z "acguaucuuguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 deleted file mode 100644 index c67115127..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0308.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTCAAAGACATGATCGGGCTGGTGTCAGTGCCTTGTTAGAGTCTGAAAAACGAGGTGAGTGCAGTCCCAAACTTCATCCCTAGGTACTCCAGTGGTTTTTAATGGCTCGTTGACGAACAACGAGGAGCTGCGAACCGGCTCACGCGGCTTGGGCGGGTAAGGTCGTTAGGGCTGCAACTGTTAGACCCTGTTACGAGCTA")) -(assert (= z "cuuuuugcuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 deleted file mode 100644 index c9227b18d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0309.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTATTCCTCTTTACTTTGAGCCCGGCGCTCGCGGTGATCATTCCTAGGACTCATCTCCAGGGCCAGTAAGTGGAAACCGGGATCGACTGTCGTATACTGTGGCTTCCTTCGTCCAATGTGCTCAGTAATACTTATCCCAATCCATTAAAAATGGCAGGGCTCGTCCCATTCTGTATCTTGCCTTTACAGCGTCCGTCTA")) -(assert (= z "guaaggauccugaguaga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 deleted file mode 100644 index 15d5158b6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0310.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAAGGCGTCCAATAATAGTGGATGGAGAGCAACTGTCGCGCCCAAATGTGGGTAGGCATAAAAAGCTACCTTGCATTAAGATTTTATAACAACAATCCAGAAAATGTTGCAGTGTGGGACCCTAACTCCACATGAATTTTTCCATTCCGTAAATACGGGAATGTTAAACAGACTATATGGTTAGTGGCGACAGTCAAGG")) -(assert (= z "caguucc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 deleted file mode 100644 index 21f922e91..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0311.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTAGTGGCAATCTGAGAGCCTGTCAGCCAACTCCGAGATTCTAAACGAGAGTGAGGGACAGACTAGGCTTATTTCTCCTCCCGCTTTATGGCCAGTAGGGGCGCACGAAGCCACGATTCGTCTAAGGATTTAAAATTTCCATACACGCTTTCAGAGGCGTTTAGGTAAACATGCTGCTAAAACATGTTCAACGAAATGTT")) -(assert (= z "uguacgacga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 deleted file mode 100644 index 1464d22a0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0312.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGGTAAGAAGGAACGGCGTAACAGTGGTGCGTGGAAGAACCTCCTGAATTACAGTGGCGAAGAACATAAGTAGGATTTCGCGCGGACTTTTTTCAAAGACATCATTTGTCATTCCCACTGTGAATCAGCCGATTGGATAACCCTTAGTTTATTATCAGATTCAGAGCATCGGGAGAGAAGGAAGAGTGTGGGAGCCGCG")) -(assert (= z "aaauaauagucuaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 deleted file mode 100644 index ad82a39df..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0313.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCCTCCCACCGCCCTCGGACAGCACGGCCCAGACCTCCTCACCGTGGCTCCCCTTTCGTGACTAGCTCTCCCACCATCGGGTCACTAACTCTATGTAGCAAGTTTACGAATTGTACCCCTACACTAGTAGCAGCCACGTTAAGTGACAGAGCGGAAAGATCCCGCTAGCACCTTAAAGTCGTCAATGCGTCCCTGAGCA")) -(assert (= z "cucgccuuucuaggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 deleted file mode 100644 index 4ec312a6e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0314.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGTTTTTTTGGAACAGAGACTGCAATTTACGCTAGATAGGTACTAGATATCGGATGCGAAAATTACAGCCTCTTCGATGCCGCTGAGTGGCGAGGAGGAACTCGCCCCTGTGTGCAAACGTGTCCGTTAACAATGCGTGCAGATGTACCCGCAGCAACTGATGCGTTCTAGCCTCCGACATAGCATACTCGCGGTTCAT")) -(assert (= z "uugucucug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 deleted file mode 100644 index b53246f9f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0315.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACAAAGGGCTCATTCCGTCACCCAGGTAGGCTCTGGCAACATTCCTCAGCAAAGGCGACAGCTGCCCTCCGTGTCTTCGCCAATGGTAACATTCCTGGGGCGAACGCTGCCGTTACCATCAGTAGACGTACCAACTAGTATTCTAACTCAAAAACCCCGCGTTTTTGGGACCCCTACGCGCATCGAGCTTTTTTACCTT")) -(assert (= z "gcgguuaccauugu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 deleted file mode 100644 index 5e29164cb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0316.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCTGGGTCGGACGCGCTAGGATCGTCGATAGCGAGCACTGTCGCTGCTGAAGAGCTCGCGTGGCCCGACGACCCGCGAATCGTTCACGTGAGTCATCTCACAAATGATACACCAGGTTATGGGATCGCGTAACGAAGGGAAACCTACGACCACCTTTCCCAAAAGTAGAACCGAATCACCCCGCGTGGGTCCGATAATT")) -(assert (= z "gaaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 deleted file mode 100644 index 5c6271aa5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0317.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGGGTGCGCCGATATTCGGTCCAGCTACGGGGACTTAAGTTTCTTGTAAGAGAGGGGACATAATTTCCCTTCCGCTGCGGGCGGCTTATACTGCCAGACCAAAAAGTATCCAATACTGCTTTAAAGGGCTTAAGTATTCTCAGTAGTTTTGCGATCAGACCGACGGTCACACCCAAGCATGGGACGCGACTCCTTACCA")) -(assert (= z "gcgacgccc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 deleted file mode 100644 index d767a286a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0318.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGGGGCCTACAATCCATAATAAATCGCCGTGCTTGACCGAACAAGGTCGGCCGGCAAACAATGGGAGCTATCGCTTTGCCGGCAACTAAAGGAACACCAAGTCCCGACTATAGATATGTCCGTCAAGGTATAGGAATCTGGCACGGCGCTCCAATACCCCCCGTGCTGGAGAACTTAAGGGAAGACTGAGGCAGTGGTG")) -(assert (= z "auguu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 deleted file mode 100644 index 5d4f92b98..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0319.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTCTCGAGCCACCCAGACGGGGTTTCTCAAGTCGTGAACGCTCATTGCTGCGTGCGTGTAGAAACATTCACCTTGGCACCGGGCTCGCCGGTGGGTCGCAGTACGGCACAAAATTCGGGCCATTAATAGCTATGGGGCGAGGGGACTAAGGAGTCTCCGAAGCGTTTAGCTTTACTCGTATCGACCATAAAGGTTTATC")) -(assert (= z "ccgcuccccugau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 deleted file mode 100644 index 4cdb9349c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0320.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAACGCGGGCCTGGTCGTATGATTTTGACCATGCTTCAGTCGAAGTCCGGAGTCAATCGACCAACGTTCGTGACCTAACACGTTGCGACCCGGCACGTGTACACATTTGAGGTGCAGAGCTGAGGTGAATGCTTGATACCAAATGCGCGTAGATGAGGCCGGTCCTACTAAGGTCCGTGCGCCTGCTGTCCCGAGTAATT")) -(assert (= z "ccacu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 deleted file mode 100644 index bacb3f69e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0321.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTCACGAGTCAGGGTCGTGAAAAAGCCGAGCCGCCCCATAACGGCGTTTATGTACCAACATTTTAGTATCAGGGCCAAGAGACTATCTAAGCGCCCTATTCCCAGACGGCCATGCTGCCCGCACTGCTGCGGTACGTTTTCGTTCCCAATATTGGACTCCACCCTCTTTTCCAGTTTATCTGTGGGTATCCACAGGCCC")) -(assert (= z "acgggcgugacgac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 deleted file mode 100644 index d13a79e12..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0322.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATTCGACGCATATTCTGATATTCGTTTCCAGTGGCACAATTCTATTAGTAGGAATGCACGTACACCATCAATGGGGTGCTATCCACTCATTAGGATCACATCTGTGTGAGTCTCCGGCGGTTGTAGGTTAGCGCACAATCGATGCCGAGCGTAGTCGACATGGACCAGCAAAACGCGGAGCATCCCAATGAATCAGCCA")) -(assert (= z "gauaggugaguaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 deleted file mode 100644 index 71c438384..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0323.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAACAGCAGACTTACAGGATTCGAAGGTGCCATGCCCCTTGCCGGTAAAATTTGGGTTTTCACGTTTGATGCGGGAGCTAAGTAAGCGTTGGAGTGCCTCCGATGTACCCGCTGACCTCCCTCTAGACAAGTGGATCTGACGTCAAGAAAACCAACGACATTCGTTCATGGGGTTCGCAGTCATACAATCGGGCCCTTTC")) -(assert (= z "gaaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 deleted file mode 100644 index 0b1e4000f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0324.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CACTAAGCCACATTTTAGATGTGGACAGTCTACTTTTTCCTGACACCTACCTAGATTATATGTTCAGGAATAGTTGTTATCTTCGCATCCCACAGTGTTCTGCACAGTCTATCCGAGCGCGCATCTCGCCGACATGGTGTCTAAGGCAATGACAGTCTAACCACTTCGCTTAAGTCTCACCCTAGCTGCTCTCTCGTGGG")) -(assert (= z "ucgguguaaaaucua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 deleted file mode 100644 index 81408ddbc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0325.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATATGACAATTCGACCGCCAACTCTGGTCTGCGTGTTACCCAGGGCCGGGGTAGGAGCCTGGCTTCTGTGTTTATGAGACGGACATACTCTGTTCCTTCCCTTAACCTCCAAAGTGGGCCCCCCCTAAAAACTTCAGTGCGGTGTCGTCGTCTAAAGGCATGTCCCCTAAGTGAAATGGGAGTGAGATTGATTTGTCAT")) -(assert (= z "uggcgguugagaccagacgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 deleted file mode 100644 index 7ed6c6d37..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0326.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCAGTTCAAGATAGGACAAGCGCCACCATTAATCCTCTGGCCGCAGCATATGGACAGGAAGAAATACCCGTGTAAGAGCGCTGTTCTCGGAATAACTCTAATTAGCAAATAGACCTACGTGCCCTGGTAGAAAACGTGGATGGGGACATTTGCTGTCCCTAAGGGCGAAAGCGTGATTTCCTCCATTGCTATTCAAGGGG")) -(assert (= z "guauacc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 deleted file mode 100644 index eb98e2a0b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0327.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTGGGAATTAGTCCGGGGGACAGAAATAGCCAATGCATGAACCAGTCTCCGCAGCCTCAGGCCATAGCTCGTACACGCTAATTCAATCTCCAACATTCCGATGGGCTTGCTGTATGCATTATTGTTGTAAATGAGGATTAGATTGTAGAATTATCAACTTGCAGGAGCAAGTCTCGAAACGAGGCTGAGGAGCACCTCA")) -(assert (= z "cguggagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 deleted file mode 100644 index f1cc86038..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0328.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGTTCGCCCAAGGTTCTTCCACTAATGCAGCTCGTTAGGGAGGACGCCCGGGAGTATCGGGGCTGTGCTACCGGGCATGTTGTTTCTGCGACATGGGATGCAGGTACTATAGGATGATCGACCTAACGGTATCTGCGCCTTCGATGAACGAGCCCCGCCTGATTAATCCACCACCATTTCATCACGATTCCGGAATTACC")) -(assert (= z "uugcucggggcggacuaauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 deleted file mode 100644 index d3dc84489..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0329.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTGTGGAAAGGCGTTTCTTATCTATATCCCTATATAGGGCCACTGGAGTGAATGCTGGCCCCTACCTCGCAGACTATAGCGTTTCTACAAGTGCCGTCTCAGGTAAAGTCAAGCCAGCCAGAGATCTGTCATTCACCGCAGTGCTGATCTGTTCTTATCGATATATTTTTAGATGCTATGCTCCGTTTTTATTCGGCTT")) -(assert (= z "aguggcgucacgacuag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 deleted file mode 100644 index 96abe2751..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0330.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACACGTGTGTGTACACAGTCCCGTACAGTGAGACGGGATAAATAATAGGAACTACTTACCTTGCGTTCCATTCAAAGTGGCGGCAGAGTGACCACTAGAAGTGCGGAACGCAATATCCCGATGATGGGTCCCCGCGTATGAACAGCGCGTCGAAAATACAGTCAGTCTGTTCCCACCTTTCCCGTTGGAACGCTATGCAA")) -(assert (= z "ugucac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 deleted file mode 100644 index 1d58a9e08..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0331.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AACTAAACCAATAGTTGGTTACTGCGTAGGGACTCGGAGCCGCAATTTAAAGCCGACTTTGGACGCCCTGTGTGATCCCGCCGCGCCCTGGTGGCTCAAAATTCGATGCGCGCTGTACCCAATTCCTCGCGGTGACGATCAAAATCAGCTGCTGGATGAGGTTACCTGGTTAGCACACCAGATGAAGGCTTTTCTGTCCC")) -(assert (= z "ccucggcguuaaauuucg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 deleted file mode 100644 index 4881c34a0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0332.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTAATGCTGCCGCGGTAATACTCCTTTTGTTCGCGCTCATAGGACATTGAGTAGTTAGTCAGAGTAAGCGAACGTTTTATACCTGTATGCGTATTGCTGGGCCCGGAGTATGGGTAGAAGTCTGACCGCGGACGTTCGTGCACAACCTGGTAGCAAACCCGTCCTAAGTAAAGTCGGTCATTTATAACAAACGTACTCGC")) -(assert (= z "caaaauauggacauac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 deleted file mode 100644 index 584eb64a4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0333.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGCGAGAATTCCTCCTTTCTCATCTTTTATCACTCTCTCGGCGCGGTCGACTTGTGCACCATCACGGCGCGACGAGACGCATAAGATTCGAGGATCCTAGGGACCATGGAATTTGTTTGTATAAGAGTCATGCCTAATCCGATATCAGACTCATTCTGGCGTCCGCACGCAAGAATACGGTTTAGGCTCGTATGTGATA")) -(assert (= z "uaaacaaaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 deleted file mode 100644 index d067b456d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0334.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTATATTCGTGCAGTGGGTGAGCCCAAGGAATTACACGACTCTGGGCCTGCCCTTTATTGAGACAGTTTACTGAATATGGTCATATAAAACTTGTGGTTTACGTTCAGAAGTGCTTCAGGTATCTAGGTGGCAGTCAATGGCGCCAGAGGGCACGGACAGCTGGTATTGTCGCGAAGTCTCTGGTTCCCATCGTATTTC")) -(assert (= z "accaguauauuuugaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 deleted file mode 100644 index 6765cbb92..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0335.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAGGTCCAGTGACGAAGCGACTAATGATCCCCCTGCTTCCAGCGATTGTAAATAACACCATGGGCGATAACCCGCTATGATGATGAGACTATGACCCCTATACTGCGGGGGGAAGTCAAGCAGTCGCTGAGTGTTAGCCTGCGATTGAATAATATGCGGCCACGGCACTAACCCCGCCCCCCGGTTATAATCGCTCGTCA")) -(assert (= z "uugggcgauacuacuacu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 deleted file mode 100644 index f39e784ac..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0336.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTTGCAGTCAACTAGAACGCCCTTGTTAACCTCCACCGTTTCTTCTGCAGATCGTATGTGGTGTTTCGTTTCACGTAGAGTCTATAGTGCCAGATGGTGATGCACCCTTCCAACCGGCGGTAGTACGTAAGGTAATTCTGAGGACGAGTTTCTTGGTCTTAATAGGGCATGTTCTCGCTCCCAGACCATTCTTAAAAAT")) -(assert (= z "uggag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 deleted file mode 100644 index 3a4fd9c7d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0337.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CACCTAAGCAACTCTTCGAGCGTGGGTTCATAGGCATGTACGCAGTCTGCCCTAGCATCCTCTTGACATTTGGGGCATCGCCTGCTTACGATGGTAGGTCCATTTGAACAGCTACGAAGGGCTTGCCTTTATCTGGCATTGATCGCGACCCCACAGCTACTGTATCGTCCCAGGCTACACTAGTTACGACAAGGTATCAC")) -(assert (= z "gagaagcucgcacc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 deleted file mode 100644 index a3c091bbf..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0338.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGATAGGGGAATCATACGTTATACACACGCAGGCTCGCGAGTACGGCGACGAGGCATATGTAACTACGATCATCATAATGCCATCGTTGAACAAATTACAGAATTGGTCATGAACCACAGTCGGGCGCCCAATAGGGAGGTAGATGCTCGTGCTCCGCACGCGTACCCATCGGACTACCTGTTGGGTCGTGACCTGTGAC")) -(assert (= z "aguaugcaauaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 deleted file mode 100644 index 80171e6cb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0339.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGATGTATCACACAGCTCGTCAAACATGGGGCATCGAGCAGAATCAGGCTAACCTTCCTCTGGATCCTTCACAGCAGGTTGATCTAGGAAGCTATGACTCTTTGGTGTTTAACTCGATCGGGAAATCGTACGGAACAGTTCACAAAAGGTAAAATTCGTCGTTACGTAGGTCGAATGTTGCGATTGAGGGTTGTTTGAT")) -(assert (= z "cgcuaacucccaacaaac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 deleted file mode 100644 index cd873545a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0340.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGGTTTAGTTCGCTTATATTCGCGATAGTCCGGTAGTTCGACGACATCCAGTTGTGGCTGAGTTGATACTAGTGCCAACGAAGTGTTAAGTCAACTGGCGAATAGAATGGCTCGGGTAATTGAGAGCCATTTACCACTCCTGGAACACTCGGTTCCGGGAGGACATGCTCCCCGTCACATAAAGTGCCTACCAGGGGTA")) -(assert (= z "uccuguacgaggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 deleted file mode 100644 index 784e2cda4..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0341.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGCTGAACGAATAATACGCGCAGGTAAGTACTCACCTAAAGGTTATGATCATAATTGGACGAGTAAAACCGTCACTAGATCTGGTGGACACCCCCAGTAGTTCGTAATGCGATAGCCAAGTATTCGACATTATTTTTCCTTTTGATACTCATTCGTTCGACATGGAATACTCTCCTAAAAGCGGCCTGAAGTCCTCGAC")) -(assert (= z "caucaagcauuacgcuau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 deleted file mode 100644 index a9248c131..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0342.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTACGAAACAATAACTCAAATCTAGGAGATTACGGAACCCAGACTAACTTATAACACTATGCCTAAGCAGGACCCGGGTGTTATCCTGGCGGTCATAACCTAAGCCGGGGGGTAACGTAGGTACTCCTACAACTCGATAAATCAACCTGGATAGCGTCTAAACCGGAATCGTCGGAAGGTATATACCTAATCCAATAGC")) -(assert (= z "ccaguauugg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 deleted file mode 100644 index 9b0b7807f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0343.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTCGTTAACAGGCCGGACCGAGTACGGATTACCACGGTATAATCTCTCTGGTCCACCCCTCGCATCGGAATGGCAGAGCTGAGCGGTCTTTGCCTTGCGGGGTTTCCAGGACCATTAACAGAGCAGGTCAATGTTCCTTGCGCCATCACGCGACGATATACCCTTTTAGGGTAATTTTGTTGTTCAGGACTTAGAATAT")) -(assert (= z "ucaugccuaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 deleted file mode 100644 index c26b2b28b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0344.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGGAGCTAGACTACTCTATAACACCAGTGCAGTCCTTTAATCCGTTTGCCTCACTATACTGGGCCGAACAGGGTCCTTTACATACACAGGATCCATCTTGGTCCTCAGCAGTCACAGGTTTCATTCCAACCACGCTAGAAGAATGACACAAACCTTTGTGCAAGAGCGTGTGAGCGATGCGGTCGGTTGACTGTAACCA")) -(assert (= z "ucagug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 deleted file mode 100644 index b54713038..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0345.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCTCATCAGTGGATTAGTTCAAGCACCCGTAGCTCAACGTTGTGTATTTAGTAGGGATAGACTTACTAGTCATATCTAACTTCCGTGGTCTCCCCAATGGGTTAAGATTCGAGGCCGGATTGCCTTTGAGGCACCAAAGATCGCGCTCTTCACCGTCAAGCTCTGTACTTCATATCCCAAACCAAATTGAAGAAGGGCCT")) -(assert (= z "cgcgagaaguggcaguucga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 deleted file mode 100644 index 3bc0a91b5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0346.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGACGTCAACACTTGATCGTGCAGCCAGCCTGTCGGAAGCAACGTGATCAAGGTGCTTTTGGATTTGTGAAAGGCAGCGCTCACTGTGTATTTTTGAGGCCGGAGAATTACAGCAAAATGTAGAATGATGCTCGTCGAACTTTATTCAAGTCACATCTCCAGCTTTTGATTGCACAATGGTTACAACCGTGCCAACTGTA")) -(assert (= z "accaauguuggc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 deleted file mode 100644 index 8eba8e09d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0347.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGCCTGGGCGTGGCGGGATAGCGTACGCGCTGGGGGCCCCTACAGCCCCTTCGTGTTGGACTCCCGCCTGCATTACCGCAAGTGGCCCAAACCGCAAGTTTGGGACGAGACATAGGGTGAACGACCCTTCGAACTACAGCTGCACGCCTTACTATTCAGTGGCACGTATTTAGCACATTAGCGTTTTTCGCGCATTCGTT")) -(assert (= z "guguaauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 deleted file mode 100644 index 79adfa3db..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0348.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTGCCCTTAAACCTGACACGCTTTCAATGGAGTCAGAAAGTCTCACTGGATTGCCACTGATCTCATTCCTCCAACCTACCAGTAACTGAAAGGCAGGCTGGCCCCGGTTGAGTGTTGAGATTATCAGATTACTAAGCCTGCGTCATTTATGGGTAGTTAGGTTATGGGGTGGGAGGCTGCGTCTAACTGTATGGCTAGC")) -(assert (= z "gugacuagagua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 deleted file mode 100644 index 481494c2c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0349.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGTACGCAAGTAAATCGCTCTACACATGTGATAAGGTCGACATGGAACGCCCACTTATTGCACACGCCATCCCCCCAACTGGCATAACAGTTTCGTCTGTAATGATCATAGGTGCGTTCTCATCGCAATTGGGCTGATTTTTCGGGGTTACTCCAACTGTAACACAAAGGAAGCGTAATCCTCCATCGCCGAGACCCGAG")) -(assert (= z "gcaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 deleted file mode 100644 index f898fe4fd..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0350.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCGGTTGACAAATCGACGTAGAGGGTTGGCGCTAGGGTCCCACTGAGCGAGGCATGTTTGTCCACGACGGATTGCAATCACTGTTAGGCACTCCGTCGTCACGATTGCGTGCACAGAAGTCAACTGCTGATCACGGTTGATACAAGGATAATATACCGGGCGAATGAAGTGGGTCGTACTTTCAAGCTTCCGCGACGTAC")) -(assert (= z "uccuauuauaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 deleted file mode 100644 index da476aa38..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0351.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCTAGGTAGAAGGTATCCAGGTTACCTGACGGGGTGTCCAAGGAGCTTACTGTCGTGCCATCGCATGCCAGTGTTGCCATGCTCTTCTAACGGACATATCACGAGAGAGACCAATGGACGATCCAGTTAGTGTTTCGTACTGGGTCGGGCTCGGAGGACTCGCCTACGCATAGTGTAGAAACCGTTAGGACATTTGGAGG")) -(assert (= z "aaagcaugacccagcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 deleted file mode 100644 index 2d9809ae7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0352.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCATCGCTCGTGGTAATGTGCAATGATTGTTGCAGAATCTAGGGTAATCTCCAATTAGCGTTCTCCCCGCAATTCGAACTAACTTTGCATTAGCGGTCCGTTCTATAGGGTGAATAGGCTTACCCCTTAGTTTGTTATGGTGTGAATACCGTCTTCGCCTGACACGTGGTTCCCGGCGCTAATCGTGCGTACTCCCCTAA")) -(assert (= z "ucccauuagagguuaauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 deleted file mode 100644 index 0c889d586..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0353.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTAAGGAGGTAGGCTCAGGAGGGTGCGTGCTGTTTCCCTCGGGGGTAAGAGGACCTATGGCAGTATCCGTGCTTAGTGATTCTCCGGACAGAGCCTATTGGGAAGTCTACTATACGTGAACCTTTATATCTCCGCGTGCCATGCCCGATTAGGGACCTCAAGCTTGGATTGATGCTGCGTCAAACGATCTGACGTTCGG")) -(assert (= z "gucauaggcacgaaucacu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 deleted file mode 100644 index e22dc496a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0354.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGCAATTTCAAGGGATTCACGAATACGGATTCGACAAAAATGCATGACCTGACACCCGATCATCCAAGACGTGAGTATCCAACGGTACGGAGGTCGGGACCGGGCATTCCCCCCCAGACGGCCTGTAACGGGGTTGTGTACTACTACCTAGCGCTGAGTCCGCGCACTTAGTATGACTTCTTAGGCGCCGGACGCTATGG")) -(assert (= z "cccguaagggggggucug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 deleted file mode 100644 index 83856b3be..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0355.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGTGATCGGCTGGGACTTTTACGAGTATGACATAACGTTCCACTGGCGCCCCGTGTTAGCTAGACCTTCGTTAACGGATCGTACTCAGTAGTAATAGGTGTCTCTAGGGCGATTATGTTACGAATTAGTCAGGATAGGGGGTGTGACTTATCTCTTGAAGGTGGCGGCCCATGGTGGAGACGTCCTATCACTGGCACTA")) -(assert (= z "guaccacc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 deleted file mode 100644 index db1750ef9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0356.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTCGCGCTCTCGGTGTTGGCTTTAAATTCTTTCGGCTAAGCGGGAGTCGGGCTTCGGTAAAGAATAGCGGTATGTCGCCGTTCCCATCAGCTTGGAATAGCCGGCGGAATTCGAGCTCCGTCCCGGTACACGCTTCGGCCGATCAGCGACATGGAGTCGGATTACTTTGACAAGTTGTTACGCTTTTTGGAGATCCCTG")) -(assert (= z "caugugcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 deleted file mode 100644 index 2b4ec0a9f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0357.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CACAGCTTCCTTGGGCGAGCAAGAGGACACTCTACACCTCCGATTTTTACTAGGGTTACTGGTGCCAGGGCAGCATGATCCCCCTGTTGCAAGTAATTCTTAAGTGTAACAGAGGGCGACCTCGTCTAGGTCCTAGCGCATGACAGGGTACGGGACGATCCAGCTAGTTTGAGACCGGTAATCTTATATCTGCGACAGCA")) -(assert (= z "caaacucuggccauuaga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 deleted file mode 100644 index 2889843ff..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0358.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCAGAGCAATATTGTCACGGCAGGCTCCCTTCGCTTGTGTATTTAACGAACGATGCTGGTACGGTTTTGACGCGGTATACAAAAACTGGGCCAGACAGCCTCTTCATCAAAGGTAACATTTAGGTGATAAAAACTGCGCAGTCACTATCAGTTCTCGCAGATTCGTCTAGATAGCGCGGACTTTCTTGAAGCGACACTGA")) -(assert (= z "gccuga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 deleted file mode 100644 index 485b27dac..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0359.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGAGCTCCGCAAGAGTGGTCGGTGGGCCGTATTTCTGTCTATACTTACTAGCCCCGGGAGCAACCACGATCTCCACCGGATCCCGCCACCATGGAACTTCTGGAAGGGAGCTCGACGCGAGTCGCCCCCTGGGAAGGTGAAAGCGTCCCCTGGTTACTCGCCAAGTCGCCTCTTGTATGATTTCCTTGAGTGCTCACGCT")) -(assert (= z "gugcga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 deleted file mode 100644 index a1ca61714..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0360.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTGCGCTCTCGAAGGATAAATCATCCCTAGCGGATTATTTTGCATATGATTGAGGCGCGAAAATCCGTCAAGTCAAATCCGATATAGACAAGATAGAGGGAAACGAACTTTGGTTTAACCGTTGAGGCTCATGTGATCTCCGACTGTACGGGGAGATACAAGAACAGATAGTTTTGGGAACGTCTACTGTGGACAGGCC")) -(assert (= z "gaggcugacaugccccuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 deleted file mode 100644 index 6a39fbab9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0361.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTTTCCTGGGCCGGTGGAGTGTCGGCACAAGATCGATCAATGCACCCTCGTCAAAATCACAATTCCATGTATTTGCCGGCCAATTTCCATCTGCATTTCTTCGGCCCCTGGACGTATGAAGGGTCACCCTCTATTCTGAACTCACGGACTCGTCGCATTTGCCTGTCCAGCGGGGGGTCCGCGGCTGCACGTTGTGTCTC")) -(assert (= z "agacguaaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 deleted file mode 100644 index ec4afd98a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0362.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTGCCCTGGGCTGTTTCCGGGCAAGACGGTGACGATTAATTTAACGAAGTGCATTCGACCAGACTCACGCCTTGTTTATATTTGTGTGATAGGTGCTCTGGCTTAAGAGTCAGAGATTTGTGCTAACTGACGGCGTGTTGCACTTGTTCGTAGGGTCAGGAATAAACTTGCTACCTCGATGTCCCACGAGTACAAACAAC")) -(assert (= z "gcccguucugccacu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 deleted file mode 100644 index 8142c7a56..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0363.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAATACGTGACAATTAGTACAGTTCCGATAGGGCTACGCTCTTCTGTTGTCAATCTAAGGATGATTTTGGTATGGGTTGTCTCACCACGGACCCTATTGATGTTGCATTAATTTTTCCTATTCAGTTGTTAGGCTAATTCAACCAGAAGTGGGCAGGCCAACACGACGCTTCTGCCGACGGCAAGTAAACCAAACTGGTG")) -(assert (= z "uugaccac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 deleted file mode 100644 index e1d7186f3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0364.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AATGATCTGTGCACCATAGCATTGACCATCGGATCCCCCGGCACGAATCGACGTGACGGCAAAAGATTATAAGCAAGCATTCTTCACATCATAGTCGGGTATGCGAGCATTGATAGTAATGACTCGTTATGTCCTTTAGTCCTCCGTATGTCTGTAACGATTGTTTTGCTCTCGTCGACCCTTATTTTTAACCAATAGCG")) -(assert (= z "cuaucauuacugagca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 deleted file mode 100644 index 450e3d245..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0365.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTACTTAAGTTGCGGCATGCAGAAGTTTTAAGCGTGATGTACAGTGCCGACATTAAGTTGTCCCAAACTCTCTCGGCAACGTCCGCCAGACCCTGTGGCTGCGCACTCAAATCCGACTGCCCGCTCAACTGGTCCTAACAGGTGTAACCGTTTTGCTCTCTGCTACTGTATAGTCCGGTTACGCTATACTCACGATATG")) -(assert (= z "acggcuguaauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 deleted file mode 100644 index 4302f9de1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0366.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTACCCTCTGGCGCCAGCCTGCTCACTGACTAGGCATTCATTAAGTAAACCCGCGATTGGCCTTGCGGACGAGCAAGCTTAGGTTCTCGTCCCTTAGTTTTATAGTATCAGATGTAACCGTCCTGACCATCTCCGGACTGCGTATATCAACCTTTAAAGTATGGTTCGCACAGGGCCTTTACGGGGTCGTGGTAATCAC")) -(assert (= z "augccccagcaccauua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 deleted file mode 100644 index 82fc38907..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0367.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTTCCAGCAGTCGGACGACCGAAGATAGCGCGCCCCTCAGAAGACCCCTGGTACCCACTCCACCGGCCTAGTCGCACGAAGTCTCGTGCACTTTTCGGTGGGTAGTTGGTGACCACCAATGCGTACTCTACTTTGTAGGCAATTACAATATTTAGGTGGGCTATATTTTGCAACTCAATAGAAATCTGGATCGTACTTC")) -(assert (= z "acguug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 deleted file mode 100644 index a47b171dc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0368.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTATATCGGTACGCTGGAATCCCTCGGAGGAGTATGTACGCGTAAGACCGCTGGTTAAATGAAAAAGTGCACGGTTGTTTCGCTTGCTCAACACAGAGTAAAGTTAGCTCTTGCCTATGCAGACAGTTGTAGGCCTGGCTGGCTAGGCTGGCTCCCATCGCCGACGCGTGCAATTTGGCGTGGTTAGTGCCCGGCCCCTG")) -(assert (= z "cgaguug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 deleted file mode 100644 index b0d7c6b88..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0369.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGTTACTCCCGCGATTCACAGACAACCCTCCAGGGGGGACCTTATAGATTGGGAGCCGTCGAAAGGAGAGGTACTTCGCACGTTCTCGCGAGGTTGTACTGAACATAAAGCTGCGTCCTGTCAGCGGTTAAATTGGTTTGACCTCCTGCCTAGGTTTTGAACGTAGTGTCTCCCACTCGGAATGTTGCTCGCAGCCGATC")) -(assert (= z "caucacagagg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 deleted file mode 100644 index bfec305b1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0370.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAATGAGTGGCTCGGGCAGAATACCGTGTATGACCACTGAAGAACTAGTCTCAGAGCCAACGCGAAGTTCGAATTGTAGTCACACGATGCGAGGATGGTCGGGCCGGGAGCCTTACCGCATGATCCGGCAGTAATTACTTGAAGTATATTCTTATGGTACATCTGTTCGCTATCGGAACAGTCAGGCCAAGTTTACCGGC")) -(assert (= z "auagcc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 deleted file mode 100644 index fc5c344f5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0371.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGACCGGGCACACAGGAAGTCTCGCTGATTAATTCGGAACTCGTTAGTAATAAAATGCTAGAAGCTGTTCCGTTACCTTCGAATTAAGCCACCGCACTACCAAAGAAGTTTGTCTTATCAGCTGCGCCAGAAATAAGTCGCCGTTATGACCTGGACATAGAGTGCGTCAGTAGGGTCCCAGGGGCGGCGCTGGCTTGCGC")) -(assert (= z "guuucuucaaacag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 deleted file mode 100644 index 3929cfd8b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0372.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTTCGGACTGTATCTCGCTTTGGGTAGGCATAGTAGACGCGAGCGGGGGTAGACCACCAGCCTACATCCGGAGGAGCCAAGTGGGAAGGTTGAGCTGCACCGCACACTAATGATTCCTGCCCCCTTGGTCGGAGTATATCACTCGATCGAACGGATTATCTTACTGAAGTTAGCCCACCACTTCGGATTCGGAGCCTGTC")) -(assert (= z "uggcgugugauuac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 deleted file mode 100644 index 457defc10..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0373.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAGTCAAATTCGGCCCGCCGCTAACGACTCGATGAAGGCCAGCGTCGTCGGGCCGTAGTTGTGTCCAGCCCAGGAACCATCAATATATACGTAGACGCGTGTTGCCGATCCGGAAAGGGGCCACGTCCGCAAACTTATCCGTCGGGTACTTAGCTCGCAACATCATACTACAGGTTGGTTGTAACACACACTTCTGACG")) -(assert (= z "uuccccg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 deleted file mode 100644 index e00ef6c55..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0374.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTGGATACGCGTATTAGTGTGACCTTTGGGAAGACCTCCTTCACCGCACCCGCTGTACGCACTGGGCGATTGCCATCGTCTTCTCGTCGAGAATGGGAAATGATGGACTGGTGGAGTGATTTATGCTACCAAGCTTGACCCGTTGCAGCAGTCATATTCATTACCTGCCCCTCTGAAGACCAGATCGATCCCGGTAGTCA")) -(assert (= z "cgguag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 deleted file mode 100644 index 62cae87c5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0375.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGCAGAACCTCCTGGTTTTCCGTACGATCACACTACAATGCATCATAGAACACCCAGTCTTGAGCGGATGAAAATCAACCGCGCGCCTAGCCTCGCGCAGTCGGCGCGAAAGTCGCAACAGGTAGAAAGTCGAGACTGCATATGGACGAGAGCCGACCGAAAATCGTGCCACCAGCTGGGATAGTGGAGATCACCAGGT")) -(assert (= z "ugacguau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 deleted file mode 100644 index 5a97de86c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0376.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAAATCGGTTTCACCTTCTAGCAGCGATGATGTAAGGTGCACTGCGGCCCGTTAGATACGCGCGAGAGACGGTAGAACGGCCCCAGGGGAATACAGGGATTTGGGGGAATCTCCTCCAAGGCACGCTACAAGTTTCGCACCCGGTCGATAAGGCCCCTCGGGGAAGGTCTCTCGCTACATAGCCCGTGAGGTATTATATC")) -(assert (= z "gcacu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 deleted file mode 100644 index 0dd3a8f6c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0377.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCTCGAAAGGACGGATGGGGAATCTGTTTAGCTGGAATCTGATGTAGCAGGCGCACGGACCTCGGAAAAGTGTAAATCAATGAGCAGTTTTTGCTTCATTTACAAGTTCGTGACAAACACGTCCTACTCTAAAAGACCTATTATCATCACTCACACAAATCCCATATTGATACAGGGCTAACTGCCCCTCTGTCGGATAA")) -(assert (= z "guuugugcagga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 deleted file mode 100644 index 72f5193e1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0378.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGGGACACAATACCTGCTAATTACCGCATGGCACTAACCTTCCTAACTTACAGGTGGCAAATAAACTCATAACCTGAGAAGGGTACAGTCAGAGAATATAGGGGCACACCGACAAATATTTCATTCACACGTCCCGGTATCCAAACCCCGGATCATTCTGGTCCCTCGGGCAGTTTCACCGAGTGATGAAGAGCAGAGC")) -(assert (= z "ggaagga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 deleted file mode 100644 index 530499885..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0379.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AATAGCCTAACTTGATCCGCAGCCACTGACCCATGAGTTAAGGAGGCAAAAATACAGGGCAGCACTCGTGCTAATGAACTCCGAATCATCCCCTCGATACTATGGAGAGGCGTTTTAATTTTTAATGTTGAGTAACAGGCCACGTCCGTGGGTAGATGTCAGATCATAATCTGGTGTTTCACGTGAAGATTGGTCTCTAC")) -(assert (= z "gauugaacuag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 deleted file mode 100644 index 5d56c9cc6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0380.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTGGATTAGATCGGGATGAGCATAAGAATGGAGTCGCGTTCTAGGTGATACATCAGGGACCACTTGTTTTAGAACGTGCAATCTCAAACACGCGTGGGCATAATCCACACGCGCGTAAAGGAGCAATGTGCTCGATTTGGAGCAGTTTGGGGAGGAGAGCGCGTTGGGTGGCAATCGACTACCATTGTCTGGCATTTTTT")) -(assert (= z "ccuaaucuagcccu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 deleted file mode 100644 index a810e7291..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0381.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGGGACCGAGCTGAGGTTACTGGCTTGATTAGGGCGATGCCGGTCATGGCCGCATACCAACGTGTTAGATGTAAACAGACTCGCGGGTGTCCGCGTAAACTCTTATCTACCATACGTCACGGCGAGGGCCATTGCCAGGTACTGCTAGTGTAAGAAATTTCTTACCGCCTGGCTCCTCCAAGGCCCGGCGCGAGCTCGCG")) -(assert (= z "gcucga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 deleted file mode 100644 index 977572643..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0382.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAACCGTCATACACCGGCATTGTGGATGACTATACAAAGAGGGCCGCGCGGTTGTATGTCAAGTTTCCCCAATGGCTCACCCAATAAAGGCTAACCTCGGATATTATCATTGAACTATAAACGGGCTGACTATGAATTATTTCCTGCAGAGGCGTGGAAAGGTGATCTGCACGGACTATGAGGTATTCACTGAGAGGTCC")) -(assert (= z "gauauuugcccga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 deleted file mode 100644 index c57f2ccdf..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0383.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGCTTCCCCGAAGTTCGATCAAACCAGCCCGGCGAAATCCTACCCTTCTTTATTATCCTTAGCAACCAGCCTATAGGTTGAATCTAAGGTTGTGTTCGGCATCAGTAACAAGTTGAGAACATCAGCATCGTCGTCTTATATCATTCGAGCAGGCTCGGCTAAACCTCATTGGGCAAATGGGGCCGCTTCCAGCAACTGGT")) -(assert (= z "aguaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 deleted file mode 100644 index effe24cb0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0384.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTTTCATACTAAGCAGACTGGATACCTGCCATCACTTCTGAGGCCACAGTGGCCCCCTGGAAATGCCAGAAAGTACGCTCCGGAAGGTCATTGGAAGCGACAGATTTCATACCCAGACACAGCTATACAAGGGAGAGGTCGTGAGCTCTGAGGCTTTGAGAGTCTGACTTCCCCAAAGTTGTACCTTGGTTGAAGGACT")) -(assert (= z "aguauggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 deleted file mode 100644 index 3217859be..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0385.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTAACCCTACAAATGGATGAGGTTAAGGACACACGGAATGTGCGATACACCATGGTCAGCCCGGATATTCGGGGGACACAAGGTGTTTGCTGGGGGGTCTGGATAGCTCGTTGCTCACGACTGTTCAGCGCATCCATCAGGTTCTGCTTCTACATCCAAATACGCGCAAGAGCCTGCTTAATTACAAGACGTTGCCTTTC")) -(assert (= z "guucugcaacggaaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 deleted file mode 100644 index fec756c5e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0386.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTGCTCAAACGCCTATTAATGTGCTAAGGACCCGGTTTTCGACCAAAGGCGACACGCCTAATGGCCCTCCTCGGTCCGAAATCGCACTATTCCACTGCGGCAGGAAGACGAGGCGATTAATCGAGTAGTCTGTCTTATTGGCCTATGGTACAGCGGAAAGAGGTATAATGAGGGTAGAGGAGACCTCACTGCGGCAACG")) -(assert (= z "cgccguugc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 deleted file mode 100644 index 5aacaed3b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0387.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTGTACCAAGTCCCGGGGGTTTTCAATGAAGGAGAAGCGGATTCTCAGGTCTCGAAGGAGTGGATAGTACCCACCAACCCGCACCGCTTGTGCTTTATTTAAACAACATCGGATCTGTCGAAGCTTAAATCTATGCGTGAATTCGATAGGATTGCAGCATCCCGTGATAAAGGGTCACTTATCAGTAGCCGAGTTCGTG")) -(assert (= z "cagggccccca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 deleted file mode 100644 index f0109aaeb..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0388.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCCCTAACAGAGAAACCCGTTCAGCACCAACGACGTCCTGCGTAGTTAGAAGTGAATACAAAGCGAATATATCATAGCTCTTAACTTATATTTACGTTGCATGGATGATTCTCAGTACGACTTGCTCTCAGATTGAGTCCACAAGTAACCCCTACCTTGGGGGGTGCATGGCGGTGAAGATGGACGGGTAGTGCATACAG")) -(assert (= z "ugcugaacgagagucua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 deleted file mode 100644 index 8133cd8e6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0389.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGCGGGATAAAAAAGCGGTTTCCGTTTCCACCTGGGGGCATATATTGCATCGGATCTGAAAAAGCCCGGCGTCCTTTTGGTAATGGACAACTATGTCCCCAGGCTACAACCATAGAGGCGTTGGTCACTGTCCTTAGGTGCGAGCCCCACCCGGAAACCTTCCACGGCTCTTATTACTCCCGCAGAGGGCGTTTTGGGA")) -(assert (= z "ugauacagggguccgaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 deleted file mode 100644 index 3cfc4d7b6..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0390.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGAGTAATAGCCGCACTTTTCCAGTGGCAGGAGGGAATGCGTATTTGATGGGACAGTGAAGAGGGATGCTGGTAGACGGTCGAAATGATTGCGGGATGGGACGGCTGCGTATTTCGACTGTCTTTAGTCGATGATTGGCGGAACGACGACAACACCGTTGCGATAACGTAGAATGTCCAGGTAGTCAAAGGAGGCAAGG")) -(assert (= z "aacuacccugucacuucucc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 deleted file mode 100644 index 22fcce197..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0391.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CACGGGTCCGACCTTTGCTTGTGGGCGGGTAGAGTAGTTTGTGGCATCACTACAGACAGATTCTGACAAACGGGGAGCTTGAGTCTCACATGTATATCGTAAGTTCAAAAATCTGCGCGCGAGGTAAGAAAGCACGTATGCGATGCTAATAAAGCTCGTAGCAACTCGGAGGCCGACCAATAAAATCCGCGTTGACCCAT")) -(assert (= z "aaguuuuuagac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 deleted file mode 100644 index 8d1a1df77..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0392.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAATTCAAGGACCCAGGCGTCGCACGCTCCAACTCGAATCATTATGGTTTATCGATTTAAGCACCAGCTTGGAATAGGAGGGAATCCATCAGAACCTAGGCTTTTTCGAGTTTTACAAGCGGGCCCTAAGTCGTGGTGCTGGCTTCGATGTGGTAAGATAACTCACCGAAGCCGTTGGCCTAGGTATACTTTCATCGGTA")) -(assert (= z "uagcuaaauucguggucgaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 deleted file mode 100644 index 9d1af680d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0393.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGTGCCCCTTTAACGACGAGTGAAGGACGCAGACACTCCACCCTTAGGGTCCTGTAAGCAACTTAGCCAGACCTCACCTGTTTATAGCCATTTGTTATTTTAGCAGTAGGGCCGGGCTCCGGGAGATTAGTCACGCACTGAATCAAACACTTCGCCTACTTAAATAATCCCCTAGAGCAATATCAGTGCGCTCGTTACT")) -(assert (= z "aggccc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 deleted file mode 100644 index b686cbaba..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0394.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTACTTCCCAAGAGGGGCCCCTTGAGATAGATGGCCAGGAATATTATGCACTGCCGTCGATATTGCCCTAGTTCCGTTCTTCCCCGACACTGGCCCCACTTCACTCATGAACTATATCTGATTGGGCACTAGGGAGATCTCGTGATTCTCCGAATAGAATCACCTAATCCATTGATCATGATTAAAGCATTACCAGTGTT")) -(assert (= z "gucac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 deleted file mode 100644 index ae368f224..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0395.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CATCTCCAGAGACGGGCAGCGAGCCATCTGACATTATGCTAGTCAGGGGGCAGGACTATCTTAGGGGTTAAGCCGCTCGACGGCTCTTTAGTCAGATACGGCGAGTGGTAGGTATGGATTACCGGCCCTGGTCGTATACACCGCCTTTAGCCACCGGTACTTCCGATTCGCGCAACATGGTATGTGATTTTACACGGCCC")) -(assert (= z "guuguaccauacac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 deleted file mode 100644 index f73cc398e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0396.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTCACCAGGTCCGCAACGTTGGCTAAAGTCATATGAGTGCGCGTCATGCCTCTTCACGCGATCTCCACAACGAGAGGGCTGTTTAGCGAGATATCACGAATGCTGTTGAGCTATCGGCCGAGTAAAGCGGAGGCAGCTTTCAATTAGCGAGCTTTTGCCGAACTGGGCATGCCTGAAGTGAAAAAGTAGCAGGGCCCGC")) -(assert (= z "aacucga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 deleted file mode 100644 index e0ae19a5c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0397.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTCCGCTCCTGTAAGTAAGCTCTAGGAATTACACTTCTTTGGACACCATGTGGGTGTGCCCCAGGGCAGGGATGCCTCCGTGGCTGAATCGGTCGGCGTGTTTTCAGATTCACCATAACGGCCGTTTTACTGGTTCCCCATGACGATGAGAGTAATCCAGCTTGCGAGTTACTAATCTAAGTTACGGAGTCGTGATTGAA")) -(assert (= z "guauugccggca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 deleted file mode 100644 index e8c4821c5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0398.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATAGCAACAGGCGAGAACGATGTCGTTACCCGATTCAGGAAACGCAGGACATTCAGTTGCCCCCCCCCGGATGTAGTATATGGCCTTCCCCCGTCTGAAGCTCAAGTAGGCCAAGCGCCCCCATAGAACGCCTGGTCCGCTCTCGCGTTTCTTGTGTCGTATAGGTAGCGAGACGACGAGCGCACTTTCCGTACCCAAGT")) -(assert (= z "aucguuguccgcucu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 deleted file mode 100644 index 407338195..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0399.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCTGTGCAGAGGCACCATGTGCTAGCCACGGTTCTTAGCGTATGTCCCTTGCCTCATACGATTCCTCATGCATTGTACGCATACGGAGGGAACGTATCCTCCCCCAGAGTGGCGCGTCGGCCAGGTTTAACCATGATCGACCCTTTTTTCGTTGTAACCGTGCTAATTCGCCTTGCAGCGTATCAAACCTTGAAACCGA")) -(assert (= z "auuaagc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 deleted file mode 100644 index 84391abf2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0400.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGTGTCACGAATATCTGCGCGAACTTGCAACGCGATCACACCTCACTGTCTACCCCGTCAATTAGATGGAAGAGTATGCGATGGGATAGATTATGAAGCCCGTACGCTATAGAACTGGGGGCAAGAAGAAGATCTGCCCTCGACATTTCAAAGTTCCAATGCATTTTCAATCTGCCTAGCATTGGTATGGATGGTTATC")) -(assert (= z "ucgggcaugcgaua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 deleted file mode 100644 index 712b3d5e8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0401.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GACTACGAAATCGGTAGCAGCCGATGAATCCGCTATTCATGGCGTATCCTTGATTTGCAGCTCTCAGAAGAACTTGACATTTGCGCTGAGTCCCACAACGGCGCCGCGTATCCAATGGTCGTTTCTGATTCCAAGCCCTGAACCGAAGGGGACCACAGATAATGTCCGATAAACCATGCTATCAAAGAGGCCTGGGGAGG")) -(assert (= z "ggcuuccc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 deleted file mode 100644 index 75fd80826..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0402.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGGGCGTATTTGGTTCGCGACGGGGCCGGTCTCCACTCCTAATCACAGTTTAGATCGGTGGGAAGCAGTGCAGGATACTAAAGAGGCCCGTCCTCATCTCGCTCAAAGGGGATGGACATTGGACACTTGAACCTAATGTAATTCATGTCAGCTGTCCTCCCCATTGGCGAAAGTAGGGTATGGTTCTGAAGAGTGACGA")) -(assert (= z "uagagcgaguuuccccua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 deleted file mode 100644 index 29324e959..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0403.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTACAGGGTTAAACGCTCCGTGTAAGCCAAGTAGTTTTCGGCACAGGACCCTGAGGTCATGAATTCGTCCCGTCCTTCGGGTGGGTATATACAACAGCGGACATTAGCGGACAAAGGTTGTGACACGGCAGTTTTGAGGTACTGCGGCAGGGATATTTAATCTACCAGGCCCGCGCTGCGGTTGTTGTGTAAGATTCGT")) -(assert (= z "aagcag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 deleted file mode 100644 index 6f10ec28e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0404.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTTTCAGTACTGAGGAGCATGGCTACTCACATCCAAGTGTGTGCACAAAAAATGCTTCATGGACTGGGCATCCATTCGTTAACGCACACTCCTCTATCCCTTACTAGCATATTCGAAACCCATCGAATATACAGAATCGATATAGAGCTTTATCAGAGTTGCCCTAGTTAGGAATGATATGGGGGGTGCCACGTACTTAG")) -(assert (= z "ugacccguagguaagcaauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 deleted file mode 100644 index 1a742f0d7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0405.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCTGAGCCCTTTTCAATTATAGTCCAGGGGGTGCGGTACACTACCTCGCGCGACCTAACAGGATATCTCATGTAGGCTTTGAGACCGGTATCGAAAAGTTTTTAATAAGCTGCAGCTACTGTTCCACAGATATCCTGTGTGAAGGTAGCTAGCATCGACAGCTATATCTGCATGTCCTCTCATTGCGTCTGAAGAACATC")) -(assert (= z "ccaua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 deleted file mode 100644 index 906468600..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0406.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAACTGAGACACAGAGGTGCGTACCCTAGTTACTGCAGATGGCCCACTCATTGCATATGCCGTCGAGCTCAGCGGCCTTATATACAGAATTCGTACACGCAAAGTAAGGACTTCACTGGAGTGTACCGTCAACCTGATCATGTTTATAGACTGTAAGCCTGTTTCTCTCATCTATGCTCTGCGTATACGCGTGTATGCGT")) -(assert (= z "aguacaaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 deleted file mode 100644 index 14c1f9c86..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0407.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAATCACTTTGGTCTCATGTCGGGTCCTAGCTTAGCGTCAATTATCCATCGGTTTTAAGTCAGCGACGTATCCGTTGCTGCGGACGAGGGTGCCCACGAAGTAATCATAGTACCTATTCGGCATTCGTCGGGCTTTGACGCAGACAGCCCCTACAACCTGTGGCGGGTCTTACGAAGTTCGCTGAAGTCCGTGCAGTCCG")) -(assert (= z "uaucauggauaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 deleted file mode 100644 index 32d227857..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0408.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTCAGGTGAAAGGCTATGCAATTCTTGTATGTATTCACGAAGTCAGAGATAGACAGCTTTCTAAAACTACACAAATAGATAGTCGGGCGAGACGCAGTATGAACCTAATGACATCAGTATTAGACAGTTCCATCCGCAACGCTCTTTCATCTGTAAAAGTGCTTGCATCAGGTAAGGTTATACTATCTGACACAGTGCC")) -(assert (= z "guugcgagaaaguag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 deleted file mode 100644 index fdc601f7a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0409.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAACAGACATGCGGGTACTGGGTAAGACAAGTAAGGGAAGACTGCGGGGCAGTGTGCTTGTGCTTGCATGGTTCAGGCATACTGCACCCGCTAACCGGGACCCACCTCGCACTAGTAGATAAGTCTTAACGGCTCAAATCGTTGTTATAGCTCACCAGTCCGTAAACGCTCCCAACGCTCCAGCTGATTCAGACTCTCAA")) -(assert (= z "aucuauucagaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 deleted file mode 100644 index 6ec1966b2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0410.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GACTGTTAAAGTGCTAGGCGCTTTGATACCCCTGTGAATTTCCCCACTCTGCACGACCTTGACATCGCAATTGCTTCAAGCTGTAGAACGGGATAGCTTCCACCGAGTACAATCCTAATTTGTAATGACCGTATTCGCGAAGGCACGTATTGTCGCTAGCACAGTGGGAGACGAACTCGAAGAACGCTGCCGAAGGTGGC")) -(assert (= z "ugcauaacagcgaucguguc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 deleted file mode 100644 index effb52c00..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0411.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGCACTAGAGCCATGTTTGCCCTTGACGGTGTAAGGGAAATGGAAGCAGTATGAATGTCACACCGGAGGAAAACTTAAGTAGGGAGAGAGCGCGTAGATCAGGTCTTTTTAGATTGACTTTTAACTTCCCGGGTCTACCATAATTTCTTTAGAATACGATTTCATTTCGGTGTTTGCTTCAGGGTTCGGGAGTATTCACG")) -(assert (= z "ugaauucaucccucucucgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 deleted file mode 100644 index a4905c4f1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0412.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCTCTTCCTGACGGCTACATAGATATGCTACTCAGGCCATACGTTTATGCACAAGGTCATAAAGCGTCAATGTGTACTAGTGGGTCGAGTTATAGCGGGCTTAGGTACTATGTTACAACGAGCGCCACGGCCGTTACACAGGTCGCGCATCCCGACTTAGTCCTCAATCGCCAGAGTCAGCGATCGCAGCTGGCCCGAGA")) -(assert (= z "gaaucaggagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 deleted file mode 100644 index 15638240b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0413.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGGTTGGACTTACAAGGCTTGAACGTTGGCTATGTATTACTGAGCGTTCATTCTACTAGTCTCGAGTATGACACAGGGGAGCGGGCAAGTCGACTATTGGGGTGCGTCTTCAATACCCACTGGTGACGACGGAGTGTCCTGCTAACAACGTTGCCTAACGCTAGATCTAATGAGGTCACGCACGTTTCAGGAACCCGACT")) -(assert (= z "uguccccucgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 deleted file mode 100644 index 78bf527b8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0414.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGTTCCAAACTCAAACGAGGATTCTTCCCGAGGCGTAGTCTAGGCGAATGGCTTGATATAGGGACCAGTTAATGCCTGCCGACGCGAAACTATATCCCCAAAACCTTATGTGGCTGAACGTCACTCGGTCGTGTGTTAAAGGAGCCATTCAGATGCGCTTAAAGGACTTTTGGACTTCCTTATCGAATAAGAGAGCTCA")) -(assert (= z "uaagaagggcuccgcauc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 deleted file mode 100644 index d2af780ae..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0415.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGATGTAACACTGTTCATCCCTCGTGATACTATGTAGCCGTAGCTCCTACCGGCAGGCATTTTTATACCCTTGGGGCAGAATGATTTACCGACACGCACAGACCAATCACGGCTTTGCATTCTCCGCCGATGGTATACCATCTTGGCTATCCTTAACGACCGCTGAAAATACATCACACGATATCGTGCATTCCAGGTC")) -(assert (= z "uaugauacaucggca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 deleted file mode 100644 index 68aee7494..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0416.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAAAATGAGAGGGTTCCTATACGATGTGTGGATGGCGCCTTGCTCAACACCATCGCTCGTACGTTCCGGGAGCGCGAATACAGCTGCAGATATCACCAAAATACACTCGTCGGTATCCCTGCGTAACATCAAGTAATCGGGGTAGGGGTAGGCAAACATATGGTCCCATTGTACATTGATCGGTGCAGTTTGTTTGTGTA")) -(assert (= z "agcaugcaaggcccucgcgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 deleted file mode 100644 index eb7ae2ba0..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0417.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TATACACATAGGGCGCCTGAGTGGCTAACCCAGATATTCAAAGATCCAGCGTTTTCGGGCAATAGTGTCTGTCGTTTTCGAGGTACAGTAGGATGTGGGGCAGGGAAACATGAGCCAACCGCAGTTGCGTAGGGTTAGGCCCTAATTTGACGATGAGGAAGTGATGAAGTTGTCTGCCTGTTCTACGCTAGTGTGGACCG")) -(assert (= z "acuucaacagacgg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 deleted file mode 100644 index 1bc6171f9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0418.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGGTGAAGTCAAATGAACGTAGCCGGACACTTAGTACCCGATTAATTTTAGACAGTCCATGTCGAATACCTTCCATCTCTGATTACGCCGTTTTATGGCCCCGCCGTCCTATATTTAGGATGTTTTCACCCGTGTGGTCTAAACGATCGTACTACCGAAATTGTATAGAAGTGTGGCAATACCGGAGATCTGGCACTTG")) -(assert (= z "ggccucuaga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 deleted file mode 100644 index d0ef6e59d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0419.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTATTCTTTGAACCGATTTTCATGACTGGGAGCCGACAAAAGTCCTCCTATACGCCTCGGTATCAGACGTAGCGCATGGCAACCGAGGCCGAGAGCCCCGCGCCCGCCCAGACTGCCTATGGTAGCTAATGTCCAAGGGGGTAGGAATGCACTGCCGTACGAGGAGTCAGCTTTCTAAAAGTACTGTGCTATCTAATTA")) -(assert (= z "ccccauccuuacgugacgg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 deleted file mode 100644 index fa5e17fa1..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0420.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAATATGTAGATAAGTTCAAGTGAAAGCGCCGTCGGAGGCGGACCATATATCGGAAACATACCACATGAGTTAGGTGCGGAGATCAACTCGGACAATCTTAATTAAAACTGAGACTTTCCAGAGCCTTGCTTTCGCAGCCAATCCCTCGCACGCCTACGGACAAAAACCTTAACCGTTTTACTTACAAAAGCAAATTGAG")) -(assert (= z "aaauga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 deleted file mode 100644 index 65f593868..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0421.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGTTCATGTTTAGACCATGTGAGTTTCCCCTACGGTCCGACTCCAGTCTGCCATGCGGTTTTCAGCCACGTGGTGGCGATATTACTGTACCGATGTCCACTCGGCTGACCTAATCAGCATGTATCGTTAGTTTTTTGGTGACTGTGTACTCACTATAAGGTCTTCACCCGAGGGAGTGGAGATAGCACGATTTACACCGC")) -(assert (= z "uuccagaagugggcu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 deleted file mode 100644 index d4496846a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0422.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACTAATCCACACCTGGCCAGTACGCACGTCAATATTAATAACGTTTTCTATAATCACCAGAAGACGTTCTGGGGAGTCTTCTAACTCCTTGGAGTGGGCCTCTACGGTGGTATGGGTACTCAGATCAGTCGGGTCCATTGAGCGGTCTCGCTTTTAATTCCGACATCATGGTTCGTCGTCTCCAAGCTGTACATGGAGTT")) -(assert (= z "uagugg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 deleted file mode 100644 index 4432e0e34..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0423.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGACTGAGGCCATGCGCTTAACGACTCGTCCAGGCGGGGAACCCCCTACTTGAGGATAGGACCGCTATCCTAGCCCCGGCAGGAAAGTGATCCGAGGTGACATATCCTGCAGGTGGCGAATGCGCACAGATTCACTACTGCAGTCGGGAAGACATCCGATACCAAAGTCCTCTCTGGCAAGGAATCAGTCGGGCGCCGG")) -(assert (= z "acuaggcuccacugua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 deleted file mode 100644 index 607c10d42..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0424.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GACTATATGACTCGTCTCACATGCAGTAAACACGCCTTCTTATGGGGCGGAAGGTGGACCTATATTAAAATCAGGGTCAAAGCGCAACATTTATAAAAAGCCTTGTCTTCGCTACGTACGTACTTCGACGACAATGTCCTATAATCCACCAGTAAATGATAGTTGGGAAGGGGACTCTACGGGCGATTCAGATTGGGCGA")) -(assert (= z "uggauauaauuuuaguccca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 deleted file mode 100644 index 6a4c55a87..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0425.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGTCAGAGGAACAACATTCCCTGGTTGAGCGCGGTCCCCCCTACTGAAAGCTTTCCAGGGTAGAAGCAGGCGCACACTCAAAGCCGAAGTTCCTCAAACCGTGGCCTTCAGTGCGGCTTCGTGTTATGCGAGAGAGTTCCTGGAGGCTTGCAGATCGCTCGCTGCTATGATTGATACTCGGAGTATCGCGCTGGAATAAA")) -(assert (= z "gcgacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 deleted file mode 100644 index 61abfcffd..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0426.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTCCATGCATTCTAAGGAGTTTACGACATAAAACGCTCCATTGTTAAAAGTGCAGATCATGCACGGCGATGATGAGGTTCCCAAACTTGCCTCTCTTTCAGATCCGGGTCGTCCCGGGCGGGCAGTTCATCTGAGCATCCGATAGTGAGCCTAGGCAAGGTTGTTCCATGAAAATAAGGAATTACCCGCAAATCACGTGT")) -(assert (= z "agguacguaagauuccuc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 deleted file mode 100644 index 438b6ceb5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0427.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCGGCGAGCTAGACGTCGGCATTATGCGTGGCCACCCCACCCGCGAAAAATCCAGTCATATGTTTGTTTGTAGCCAGAGAGTGTCCTGGAGCGCTACAGTCTGGTAGCGCCATCCTTAAGAATTGCTAATAGCGCTGACGTGATCCCCGTTTGAAAACTGATACATCTTCCGCACCGGCATGGTAACAATATAGCACATC")) -(assert (= z "cauuguuau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 deleted file mode 100644 index b9f3b267b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0428.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCAGGTACTAAAGCATTCATTTTTGCCCCGACTCGGATTTTTCTTGAACTTGCTTGTAGTAGGTACGTCCGATAAGTGGTCATCTAATCATGATGATGGCGAGTTCCGGTGGACGAAGCCTCGAGATTGGTGTGGTTTCCTTGGATCCCGTGTCTAGAACGGCGCCTCGCGCATATTAAAAAGGATTAAACCAATTTCT")) -(assert (= z "guaagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 deleted file mode 100644 index 8ede87c71..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0429.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATATCCGCATGTTGTTGTTTACGTGCGACGGGTCCTGAGTTTTGACATGGTATTGGTATGAGAACTATTCCGTAAACCTGCTTAATCGAAACCTCCAGGCATCAGGTATCGGGCATTGATACGGACAACAGTAGCACACGTATTGACCCTCCGCCGCGTACGTCTCTGGCTCGGAGTCAGCACCGGGCCATGCCCAGAGC")) -(assert (= z "accgagccuca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 deleted file mode 100644 index e543e38f8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0430.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTCACCGAGAATCAGCCCAACGTCCCACCGGGCACTGAGAACCGACATACTCAGCGATCTGCGAGATCCAAGGTTAGTGGCCACTTATTTCTTTCGCAGGTTCCCGACAATTTCTTTGCTTGCTTGCCTGCTAGTTGGGACGGTTCGGTCGGCAAGGAGCTCTTATGCCTACGGCCACATTGTTGTTTCATACTTGCCAC")) -(assert (= z "uuccaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 deleted file mode 100644 index 126f4ff6d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0431.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGTGACCTCAGTAAACTAGTCGGTTATCATACGAGACCCAGTTCAAAGTGTGCAAAGAGGCAGTCGTCCAATTGCACTATAGAATGTATCTCTGCTTCTAACACCTTGGCGGAGCCGTTATCCCGGGCCCCGACAGAGTTAATAGTATTTCTACGGGCATTTGGCTGTCAGGCGAGTTGGGTACTATAGCAGTATCTCC")) -(assert (= z "cugggucaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 deleted file mode 100644 index 2ed962b7e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0432.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AATACGCCCCGATGCGTGCCTTGCATTGTGGACACAACGACTCGACTCCGAGACGCCAAGTATACACTTTCACCGGTACTCGACAGTTGGTATAAGCCCGTTAGACCGGGGATAGCGGCGTCCAGGCATCCACCACCTTTACGGACGATGCGCATCCAAAGAAGCATCCCAAATTACAGGGACCTTATGAGCCTACGATA")) -(assert (= z "cgguucauau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 deleted file mode 100644 index 35928c7b7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0433.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTCATAACACGAGTGACCTGGTTCCCTCGATCCCCTGTTACACCCGTACCTACTCGTTGGATAGCAGGAAAACTTCAATATGGGTCGTCCTCCCGACGTGACAAAGTGGGCTGACGCCATTCCGGTGTTCGAGTACATGTCTTTTTGCGTTAGCATGTTAGCGCCGGAGCAGATGACTGCATGTAATGCGCTCTAGTACA")) -(assert (= z "gccacaagcucauguaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 deleted file mode 100644 index 87d6b4bb2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0434.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGAGGGTTAGTAAGCGTTCACGTGCGGTCCGTATTAGCGATCGACATCAGGGGAGAAACCAAATCCTGATTGCGGTAAACATTACGGGTCAAGCTCTACTGTGCGTGAGAATAAATTTGCAAGAGAAACATACACGCCAGCCACTGCGTGAAGGGTGTTAAAATCTCAAAGATAGCCCGACGTCGTGCTACTTTGTACAG")) -(assert (= z "uuuggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 deleted file mode 100644 index a94937117..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0435.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTGTGTGTAGCTTGGTTATACCTGTAATTCAATTATTGCTGCCGATGTGACGTGCCAAACTACTCTTTATTTAGCTTGGAGCAGGCAGCCTCTATACGACGATCCTTTCGTCCGGAAAGTATGATAAGTCCTGGCTATAAATTGAAACCCATAGAATGCAAATCCGATCCCCATGGGAAGACCAGAATGGAAGGGGCGC")) -(assert (= z "aucuuac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 deleted file mode 100644 index 33c690b75..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0436.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAAACAAAAGGTCACGGGCGCCTCACGGAGCGGGAAGACTACAGGCCTGGGCTCCTTACTGGCTATGGTCGGCTGAGGGAGGGCCATGGATATAAAACTCCCCTTTTTGTCTGCATTTGTGATTGTGCGTACATTGAGAAGGCTTGCTGTATAACACGCTGAACCTGGGGAAATAGAGCAGCCTTGCGGGTGCCATCGGA")) -(assert (= z "cgcau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 deleted file mode 100644 index 6c2c2c295..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0437.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGGGCGGCTTGATTACGGCTGTCTCGACCGATGGTTCGGAAAGCAAATTCGGATGTGGAAGTTGGGGCGGAAGAATGCTCTCACATCCCTGCCTGCATTTACTCCACGGAGTAGAGTCCGAACAGTCACCACACGCAGCTGGCACCCACTCGGGTGGCCCCTTCATAATCAGTGATTCGGTCTTTCATTAGACCCCCCA")) -(assert (= z "aguggugugcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 deleted file mode 100644 index 0a366ddf9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0438.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATCGCACAGTCTGGCAAATCGGCAAACGTTCTATGATGGAGTAATTCAACCCACAAGGTGTATTTATTAGGGTAGGATAACGCAAACCCTTGTCCTGTCAATATGCGTGTGAGCCTCAACAGGCCCGAGTAGTGAAATGGGCCCTCGACTCAAGGTTAGGGGCCTGAGTCTCCATCACGCATGGGATACGCCTGAGACA")) -(assert (= z "ccgggagcugagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 deleted file mode 100644 index 91fdffa97..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0439.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTTTCGACGAGAGATACACTCCCTGCTAATACCCATTTCGAATGTTACCACGCGTATACCCGGAGGATCGAGATTTCTCGAGCTCTTCCTGTTCTCGCGGGGGACCGGTACAGTATGGGACTGGAGGGCGAGCAACCGAAGGCCTCCGTGTTGGTACGCATTGCAGTTCTATTCACCGTCAAATCGCCAAACTTCCGACC")) -(assert (= z "aauggugcgcauaugg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 deleted file mode 100644 index 2828c11b8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0440.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAGCCTAAAGGCCTTGGAGACACGCGACTTCCCACGGTCCTCGTTGCTGAAAAGCACATTTCGCCTTGCGCTACTGGGATAACAAGCGGGGTGAATGTTTAAGAATCTCATCAACTGGTCCGCTACCACACGGATAATCCGTGTATCAGACAACCGTTATCGATTTTGCCAGTACGGATTGTCTTGGCAGTTTTGTTAAG")) -(assert (= z "ggagcaacgacuuuucgug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 deleted file mode 100644 index ffba896ca..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0441.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCCAACTGCGCCGGAGCCTGATGATCCTTACCCCTCGTAAGCTCTCTGGGTTGAGGGGGATTGCCGATTATACCACACAAGCTTCCGGGTCCTACGAGCAAGTACGAAGTAACTAGCGGTCCTGTAACTAAAGAGAAAGAAGTACTGTATCCGTCGACAATAAACGTCGTTGATTCATAAATCATCTCCAGAGCTGGGCC")) -(assert (= z "uuauuugcagc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 deleted file mode 100644 index b9c087965..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0442.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCATCTAGTTGCTAGAGATTTATCGAACCCTATGGCTAATCTAATTTAGTGCCAGTAGTTGTTTATGCAGCGTGATGCGGACCTCCAGAAGGTCCCCCAGGTCAGACCCACACATAGCCTACTGATGGAACCGATGGCATAGAGGCATGACGGGGTAATAATCGAGGGGTTACAAACGCGCCGCTAAGTTGGTTCTGAC")) -(assert (= z "aucggaugacuaccu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 deleted file mode 100644 index 1287cd174..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0443.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCGCTCTTCGGCACTCATATACAAGACGCCCCGGTTCACTCTATACGGTCATAAACGAATGTCCTATTGGTCGATAGCGAAGCTCGTGGCCATGGCTCTGCTAGTCCAACAAGATCGATTCGTCCGGGTCAGTAGCCCGGGAGGTTTGCCCCACATGGCCTACGTGCAGATACTGTGCAGTCAAACCTAAGAGTCTGGAC")) -(assert (= z "ucaguuuggauucu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 deleted file mode 100644 index 8698a1adf..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0444.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGTAGCACCGGACTACTCGCGGGATGAGCAATGACGAAGGGAATCCGGGGATAGCTGCCATAACAATGGGTGGGACAGTCTCGTGTTGCTGGCACGTAATGCATTGGGGTTTCAGTTCTTGGAGGCTCCCGATTTTATAACTTGCTCCCACATGGTCCGTGCCCCCAGTAGCCTTCGTTAGTCTTTCCATGCAGCCTCCG")) -(assert (= z "cauuacguaaccccaaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 deleted file mode 100644 index dd45efba3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0445.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGAGTTGCGGCACCTGCAAGTCCTCATAGCATGTAGAACTCCCAACCTCCGAAACGTCTCTTTATGCGATTTTAGATTACCGGTTTTCCGCCACCCGAGCGGCGGCGCTCAGGTGATAACAAGTGGGCAATGAGAAAATAATGGTAACCTGTGTACAAGGCGCTCGGAACTGGATTATTTAGGGGTTCACCCAATAGGAC")) -(assert (= z "guuacucuuuuauuacc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 deleted file mode 100644 index f14409bfc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0446.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGCCATTCGTCATTGAACACAAGCTTGTTGGATCCAGGGAGGCAGTAGAATTCGGTGTCAAGCAAGCTGATGATCCTCGGGTAAGCACCGGTTAGCGAACAGACTTTGAGGCTAGGTATCAGCACTGGAAGTTCATTGCAACTACCCTCATGTACGACGAGTCCCGAGGGACTCGTAAGGGGACCATATATAAACGTAG")) -(assert (= z "ugcuca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 deleted file mode 100644 index b1b5a7b55..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0447.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTTGCACATGTGCCTAGGTTGGCGTAACGGTTATTCAGGACAAGGGGTCTACGGTTCTTCTCGCAGGGCGCGCTTCACGCAATATTCCTGTCCTCGGCAGTCTTTGTTGCTCGGTGTCAAGTTGAGGGAGGGTTGGTGGACGGCAATGCCGAAAATGGTTGCGTATCGTGGCTTACCTACGCATCGCGGTGTATGTGGCG")) -(assert (= z "caagaagagcgucccgcgc")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 deleted file mode 100644 index 992f5ea88..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0448.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AACCAGCTTGCAGGGGCTTCTAACAAAAATCTATTCTGTTTGCGTGCTCCGTCCCAACTTCATGAGCTTTTCCGATGAGGTTTCATGAATGAGACCGGTACTTGCCAATCTCGGGAATCGCAGCTTAGACGATGCTTCGGGGTCAGGTAATAATCCTCTAAATCAGAGCGGTGGCCCGTTGGTGCAACTCGAGCGACAAC")) -(assert (= z "ccaugaacgg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 deleted file mode 100644 index 26be61494..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0449.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGCTGATACGACAACACCTTACGCAAAACGTGTTAGTTGACTCGGGCGATCCAGGTCTTTCAGTATTCGAAATGAAGAACCGGAGTAATCGAACAGCCAATCACCTGATCTGTCAATGTAATGGTCTATTTACGGCCCCCTCGCAGGAATAACGGAGAGCTAGGTTCGACATAGCCACTTTCACCGTCCGTAAATTGCT")) -(assert (= z "agucauaagcuuuac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 deleted file mode 100644 index 00fd10777..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0450.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGTTATGGCCGTTGACGCCTCGGCTCGCTGGTTCATAGCCGCAGCAACAAGAATGCGTGCTACCCCAATCATTGGCACAGGCATTGAAACGTCAAGTCCTTGCGCTTCGACATGTGCGATGCAAGCATTGGTGCATATCGCACTCTCTCCAGGTCGATCCAGAGCCCACATGCCGGGCGCCTTCGTTATGAGTAATAGAA")) -(assert (= z "agcguga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 deleted file mode 100644 index 9203f2933..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0451.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGCTGCGTGTTAACCAGGGTATGCAGACTCGTACTAATTCGTTTAGGATCCTCGAATTGGGTGGAACAACGTAGATCACGTGAAAAGCTGTGGGTGCTGACTACAGTTGCCGTCCATGGATAGACCATCAATTTGAAAACAGGTGATTAGTCATAATAGATAGGACCTATAAGTTGCTGCAACCTGGTTAAGGCATGCG")) -(assert (= z "gauuaagcaaauccuagg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 deleted file mode 100644 index d71fa9c0b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0452.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGGCAAACAGAATGACGCCCTATAGGCTGTCATAGCTAGTTTGCAGCCAAACCAGCCAATCGTTAATTTGACGGAAGACCAAAGGTACCTACCACAGTCACCTTTGCTTACCGCGTGTATTAAACAAGGGATTAAGTTGGAGATCTAACAAATCATGTACAAATACCTGCCGGAGGAACGCATGTCATACTACGACCTCA")) -(assert (= z "guuuaguacauguuuau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 deleted file mode 100644 index ae6a532a3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0453.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGTATGATTCACCACGCCTACAAGTGAGCTCGTCGGCAACCGAAAAGTGATTTACCTAATCCTCTACGTACTTATCAGTAGCACATAGCCGGACTTGCGCATCTCGGACGAGATCTGCGCCTCAGGGTTCATGGTCGAGATACAGGTACTTACTTAACGGCTCTCCGCCTAGCTTCAGCATCCTTTGAACCAGATCTATC")) -(assert (= z "gcggauguuca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 deleted file mode 100644 index 420316a7c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0454.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCCTGATGCATCCTTGGGACGGCGTTAGGAATGTAGATACCCCATCGGTGTGTGGACGGCAGAGTTAATACAATCATCGGAATTATACGTGGCTGTATACATTCACATCAGCTTACCTCTCCATGGGGTTTTCGGCGCTACCCAAGTGCTCCAAACACCTAGACCAATTCGTAGTGCCTTGGGGAGACCCTTACAATTT")) -(assert (= z "acgagguuuguggau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 deleted file mode 100644 index 44d44dda5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0455.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACACGTCCCCCTATGTGACGGGGGGTGCTTCCCACAAAACAGTATCCGATACGAGAGTTGGGTCCATTGTGCGTCAGATGAAGCTAACGGGAAACTAAATCTCAACCGCTAGACTACGGTGCAAGTAAGTGAATTTCAACGCATATCGACTTTGACATGCAGCTAGGCCATCACTGAGCGGAACTGACCAGGAGGCCAC")) -(assert (= z "guaacacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 deleted file mode 100644 index 8da67b5a2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0456.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCTCCAGATCGCATGGCACTAAGTTAATCAGCTAAACGGCTCGCACTAGGTAGTCTAGGTTAAATTCATGAGAGCCGCGAATGAGCCATAATACATAACCGAGGATATCCCCTCTTCTACACGTCCGATCCCCAGCGGGATAATCCATGTAGGACTGTCGACTGGGACTGGCGATATCTTACGACGCAAGCATATAGCT")) -(assert (= z "gcugacccug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 deleted file mode 100644 index b76904467..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0457.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCCAACCCACAGTTACAAGCGTTCCCATCGGTCTGAGTTGCAGATTGAGGCGGTAAGGCGTTGGTACATGCCAGCTAAACGGACCCTCCTGCATATTTAACCTGTTACGGTAATACTGTTCTGTGATTGCATGACATTCGAGGAGGAAGAGTGACTCTCAGACTGAGGAGGCATACAGAGGCATCACGTGAAGTTCCCGT")) -(assert (= z "guauaaauuggacaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 deleted file mode 100644 index 4d0672198..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0458.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGACTTATTATGTCCTCTCATTCTGTAATTGCGGTGGTCCAACGCACTCATACTCGGTTCTAACTCTACTGGCCTCTACGTAAATAGGGACGCCCCGGCTACTTGAAGGAGGGGTTCTCGCAACACCCGGTCCGTAAGACGTAAGCATAGCCCAGACCAGCGGCGTAGTTTACGGGGAATTGGCACGAGCCAGTCCCACC")) -(assert (= z "agagcguugugggccag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 deleted file mode 100644 index d22bd7c01..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0459.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTCAGCTTGTTGTGGTTCCACAATCATCCATTGATACATAGCCAGCCATTCTGCTCACTACACTTGGCCTGCTGCGTGACAACCAGTCTGTGGGTCCATACCCCCATAGTGTGTTCGAAATTAATCCAAATCCCCCGAGCCACGTTAGTGTTCAAAGGTTTCTGCTAACAATTGAAGTATTGCCAGAGGGACCCAAGCA")) -(assert (= z "caaguuu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 deleted file mode 100644 index 02361b9b9..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0460.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACAACCATGAGAAGTATCGATTCATTTTGGATACTTGTATGCGGCAAGCCCCGAGCGCACGGTGTGAACAATCCAGTTTTTCACACTCGCCATGGGGAGCCGCAACTCTCGGGAGCCAATACTTTGTGTTGACTAGCCCTATATAGACTGGCGTATGGAATGTATTAATCAAGGACTACACCCCGTAAGTCGCTAGCATG")) -(assert (= z "cugauguggg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 deleted file mode 100644 index b65371885..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0461.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTGCGCACTTCCTCATTCAATGGACTTCTAAGAAAGAATGAGGAAAGAGCCGAATTACTAAAGTGACCTAACGACCTATCATTGGCTTACCCCATTATCAATTTAGGTGCATCGCGGCATCGTTTCTCACGGCGTTATGTCCGTCCGTTAGGGCGCTCCCTGGCGAAACGAAACTTAAAGGTCCGGCTACCGAGACTCAG")) -(assert (= z "aaggaguaagu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 deleted file mode 100644 index 91b32e6ab..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0462.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGAATTTGATGCTCAGCTTAGCAATGCCGAACGAGCTACGTAATGCACTGCGGAAATATAAACTCTCCGTTTGTTACTTGGGCGGTCGACGTCTAGTCACTTAAATTATATAGAGTGTCTATATCACGGATTTAATCAAGGCGTTAAACACCCCCCCACGAAAAGAACCGGCGGCGTAGAATACAGGTGCAAATGCCTT")) -(assert (= z "uuaug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 deleted file mode 100644 index 63374ad66..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0463.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTCCGCGGCGCCAATATAGGGTTTGGGTCTTATGTAAGGGCTTATAGAGAACGGTGTATCCCAATCGTCTCAGCCACTATAGGTGATTGACTAGTAATCTTAGGGGGTTCATCGTGGTACCTTCTATGGTTGGCATCCACGATGGGGCCGACTAATAACTATTTTCCTCGAAAGACCGCGAGCATTAGGAACACAGTTA")) -(assert (= z "ccacuaacug")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 deleted file mode 100644 index a325b55f8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0464.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGCGCGGCAGAACCATACAAACCCGACCTCATGAACAGAAGCGTGTCATGACTTGCAAATAGCTTGGGTTGTGGCTTGTGTGCGCTGACACACGTTAGTCGCTTGAAAGTAATGTTCATGCGTTCGCTAGGCCGATATATACTCTCAGTTGGCGGTCGAAAAAGCATGCGTGCCATATCGTCCAATGATTGGACCGCGA")) -(assert (= z "acguuuaucgaacccaacac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 deleted file mode 100644 index 810302f4a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0465.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCTGCGCGCGTACTGCCACCCTGTCTCGGATCCAATGCGGGAATCACTGGGACCAATGAGCCCGCGCCCTCTTCTGCCGAAGCAGTCCCGTATGTAGTTATCACCCTCGAATGGGAAGCGCCCCTTCTCGGATCGTGCCCAAATGCCTACGGGTTTGAAACTAAAACCGACTCTTAAGAGCCATGGTATGAGTCCAAGA")) -(assert (= z "gacgcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 deleted file mode 100644 index 31477493e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0466.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCATCGACTCCACACTTGCAATGAAGCACCTCACAGATGTCATCCGTCATTCGTTATGCGGATACATTGTACATAGACCGTGCATCCCAACTAAGGCCCACTTGTACTTCCTTGTACCGCCTAAGCTGCACGACAACGTGGGCCGGGCGACGAAGAGTGGATTGGATTTAGACCCCGCACCACGGGTATACCCCGTGTGC")) -(assert (= z "ggagugucuaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 deleted file mode 100644 index e3aabba9a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0467.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TTTAGCGCAACTAGACGTTCATATGTGGCGCCATCGCTCAGTAGAACGTAGATAATAGATTACTCCGAAACAGTTCATAACTAATGGTCCAGGACTGCAACGCGAGCGCCACGAACCACTTCAGAGGCGCTCGGAACGTAGGCCTGGGGACACAGCAATGCGCCGGTAAACGGGGGCTCTAGGTTAACCATATCATTGCA")) -(assert (= z "cuccgcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 deleted file mode 100644 index ac0a04f62..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0468.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCGGCGCAGGTGTGCGGTGGAAAAGCTCTTTGCTAAAAAGTCCCGCACTAGACGGCCGCGTAGAGTGGTAAGAGACAGCCCAAGATGCACCATTTGTTGTCACTAGGGTCATTACAGTCACGAATGGTAGTCCTGCCAGGACGACCTTCATACATTATCATGAGACATCTGGCGTGGAACTCACCCGATCACGGTCGATT")) -(assert (= z "accaucaggacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 deleted file mode 100644 index abf015bef..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0469.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AAACGTCCAATGGATCCTGGCAAAACGCGCCTCGATCACCTTCACCGACAGATGGGCAAACCAGCAGGTGCAAAGACAACATATCCCTACCAGGATTAAAACGGTCAAGTGTAGTTTGCGTAGGTGTTGTTTTATTCTGGAGCGTTTACAGATGTAGACCGCATTCGCTAAAACCTCTGTCTGACGATTAGCCCAGCGCA")) -(assert (= z "aaauaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 deleted file mode 100644 index 2986037cc..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0470.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GTGCGCTATAGGCTACATCTTACTTCCCGGGTCCTCTAAGGCGTCGTATTGTCGACTTCGCGGCAACGCAAGTACCCTCTGTGTGTAACACGTCAAGGTAGTGCACAACGGCGCGGAAAGAGTTGCCCCAAAAGGCAAAGGCAGTGACCATATCTGTCCGAAAGCTCTGGGTACATAATTCGCAAGGTCTCAAGTAACCT")) -(assert (= z "gugcaguuccaucacg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 deleted file mode 100644 index f208a6c3a..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0471.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAAGTAGCTCGCGAAATTGTCTAAATATCCAATGCTCGACCAAATATAGACTGCGAGCTGGAGGAGTGATAACAGTAACTCTATGCTAAAGTCAGCAGTCGCAGCATCTTGTGGGCGAAAGATCCACTTGGCGGTAACCGAGGCCTGAGTCTGCAATGCGACCTAGACCTTTAGAAAGTTTTATTAACTGCCCGTTTTAC")) -(assert (= z "agauu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 deleted file mode 100644 index a3cd1ebdd..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0472.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTATGTAGGTTCAGGGATTGGAAGCTAGCGTCGCCATAGAGCGATGTCCTTTGCACCAACCCTCGGCCTTAACCGATGAGAGTGATCCACCCGAACAATATTTTTGATAAGATTAATTCTAACTTTTTATGGCCCCGTAACTACTGGGAGCCCTCCCGGCAGAGGACAATGGGACGTGATGAAACGGACGCTGGGTGGTC")) -(assert (= z "uauucuaauua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 deleted file mode 100644 index a3a5f7017..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0473.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGAGATGTTAAACAAATCCTACTCATCTCGAGGGGACAGTTAGAAGTTGTATTATTTCGAGATTACAGCCTTCTAGGGACCTATGTTACGTGTGGGAACTACAGAATACGTTGTATTAGCATACGAATCTTAAGCTAGTCGATATCATGCTTGCGTTCTGACCAGGATGGAGTTAAAAGGACCCAGAAATTTAATATCCC")) -(assert (= z "ucuaaugu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 deleted file mode 100644 index 0d8746330..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0474.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACCAAGGTAAGTTGTGCCCCCGTGCGGCCAGCAAGATTCGTGAGAGGTATGATCGCAGTCGAGCTCAATCTGTACCAAGGCTATACTTCGACAGGCACATCTGCAGCGTACAATCAGTCGGGTTCCTAAGACTAACGTGGCCCGTCCCCCCCAAGGTACTATGTCTCCCGGTTATATAACTCGAACCCGTAAAGATGTGG")) -(assert (= z "augauacagagggccaau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 deleted file mode 100644 index b25dfd547..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0475.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTTATTTGGTAACCGCAAGTGGTAGGGTAGGAACATTCATCCAATTGTCGACCAAACACTTTACGGGAGTTTTTGTACCATGGCCGCATCATGCAAGACACATGGCTAGTAGTGAGAAGGTCTGCCTTTCATGAGCTTAAACGCACTCCTACACCCCCACTTGCTCGAGATCGACGACACCCTGCGAGTCACACACTCG")) -(assert (= z "aucccauccuuguaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 deleted file mode 100644 index b3e734902..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0476.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATCAGATCGGGAGAACGCCTTACTCGCACGACCGTCGATTGGGAAACGCTGACCTATGACGTCCCCTAAGTAATAAGTAAAAAGGGCTGTCGCGTTGCGACGCCTTTCAATAGCTAGTAAGGATTTGCGCTCTTCCTGCCCTGATCGTCGTTATCCCTGGGGGCCAGGCTGATAGACACGGAGTAGGGTATTTCCTATGG")) -(assert (= z "uagcccucuugcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 deleted file mode 100644 index 003aaeb77..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0477.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGCCATGTGTAACAGGCGTGGATTGAGCACAGCTTACTCCGCGCCTCACCACCGCTTTATCTGACTAGAGGATGCAACGACACATGCCTTTATATAGGCATCAATAGCATAGAAAGAGCCTGGGCGAAAGTGACGCTAGAATCTGTTGAATACATCTAGTCGCAGGCGGCCTGCGGTTTTTCACTCACATGTTCTCGGC")) -(assert (= z "agacaacuuaugua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 deleted file mode 100644 index debcae70f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0478.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ACCCGGGAACGGTCCCCATGGCTTGACACCGACACGCGCACCCTGTCATGCTTTAGTTTTTTGTGCAGACCCAGCAGTTAATGAGATTGCCCTTCCTCACGGCTGCATTTGAACGCATGGCCTCCTCAAGTTCCCCGCTGAGGTATCTTCTTTCACACCGAGATAACCCGTCGCATGACGGGGGAGTGCATGACTAGCCC")) -(assert (= z "aggaguucaag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 deleted file mode 100644 index ad661870d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0479.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATGACGATGAGTTGCGTGCGTGTACGGGGCCCCAGTTGCCTTCAAGAACCGTTTGGTCGATCATTAAAAAAAGTTTCCAGGCGCATACTAATCAACTTACCTATGGTCGATCCCTGATATGACAGGGGTCCAACATTCTCACGCCGAAGGCGTCTGGTCGCCCACTGAGAGTGTAGGACAGCAGCGTTTGCCTAAAGCAC")) -(assert (= z "uucaaaggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 deleted file mode 100644 index b728b527b..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0480.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TACAGCTGTGAAGACACAATTGTGGCGTTTTCGTGGCGGGCTCCGCGCAACCGCTCGGCTGATGACCGGGTCCGTTTTACCCCTCCTCCATGCGTCTGACTTGTTCAGGTAACCAATGGTCCTCCGACTTTCTAGCCGGTCTGCTCAGAGCGTGATGGTCTTAACTCGCCTCGAAATAGAGGTTCCTGTACACGTGGAAA")) -(assert (= z "guacgcagac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 deleted file mode 100644 index b6b39ae10..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0481.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGCTCCTGCAAACTCACGGATCGCATTGGGCCATAATCAGACAAACACACCGGGGGACAGGCCGCTTCAGATCGGTTGGGAAGAATGTGTGCTACCCCTTAGCGCGCAACAGGGTCTTACAGGCTAGCACGCCTTGCCTCCATGCATTGGCATTTGTGGATGGTGCCGACGCCGGCCTAGATGCGATTGCGGGAAGGCGG")) -(assert (= z "ugccuagcguaacccg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 deleted file mode 100644 index c49637517..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0482.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TGCAGCTTCTGGCGTGAACATGTGACAACCCTTGCTACGGAGACCTATCGCACGTATGTAATATGACTGTGATTGGCAAGAAGGCACAGACCTGGCTTGCTTGATGTAATACCTATCTCGCGCGCCTTCTTGTGTGTGTGAACACTATGGCTTTTAGGAATGGCAAACCTACTTAAGCTGCGATCTCTCCCTGACCGCAA")) -(assert (= z "gugauaccgaaaauccuuac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 deleted file mode 100644 index d90655422..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0483.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGCGTTCTCGTCAGCCAGAACTCTAGAGACGGGGTAGTATACCTTAGTACTAGATTAACAAGCGGAGCTACGTACCAGCCCCAATATCGAGTAAAGTCGAGTTGTTACTAATAAAATTCATATGCCAGCTCATTACAGGAGATTTAGGCCTCGCAGGTCAGTAAGATAATAGGAACAGAGAGGTTCTATCACTATCCGAT")) -(assert (= z "caacaaugau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 deleted file mode 100644 index dda758bf8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0484.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTAAACTTCCCACAACCCTACACAAAAGCTTAGGCCCCTTGGATCACGCTACCAGTTGAAGCCCAATCTTCTCCTTACCCTATCCAACCACAAATCAACACCATTGAGCTCCTCCGATGTCTGCCCCTTAACTATACACGTCCCTGTAGCCTTGATGACAGAATCCCAAGGAAAAGCAATCTTTCCTTCTAGCACTCTAT")) -(assert (= z "uuggugu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 deleted file mode 100644 index 57819e5e5..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0485.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GAAAATAGGCGGGGACTCGGGTACTTCGCGCCGTACAGCTTTATGATAGCTGGAACCCGATCAAATAGATTCGGTACATTTTTACGCACTGTCGACTCAGCACTATGCATTCGACACACCTTACATAACCTGGGTTAACAATAAGGGTCAATGAGACTCTTTGCTAATTTTCTGTGCAGCCATGGGATTGTAGGATCTAG")) -(assert (= z "uaaaaaugcgu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 deleted file mode 100644 index 94f19c20e..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0486.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TCAAGCGAGACCCATGCGGGGTCCAAACTAGACAGAGCTTTGTACGGGCGGCAGCAGTGACCGTCCGTTGGTCGAAAGGCCTTGATTCCGAGATGAGAGCCCTTTATATTAGTTCGATGGAAATAAACTAACCGGAGGTCGTCCCCCTTTGTCACACAGAGCATCCGAACACGGTTACGCAACGTGACATTGATAACCGG")) -(assert (= z "cgcucuggguacgcccca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 deleted file mode 100644 index 06fdd0f51..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0487.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AGGCTGGTCATTGCCTACATATACTCGAGTTACGTGTGTCGCTTGCTAGACTAGAACGTCTGCATTCCTGTGACTACTTCAATACCTCGGAGTCCATTTCATTCCCCGAGTGCTGCTCATCGTATACTATAAAGCCACTTTAAGGCAGTAGGTGACTGTCTAATACCTAGGACAAATAGGGAGTACGCCTGTGTATAGAT")) -(assert (= z "ggagccuca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 deleted file mode 100644 index c3c8eb86d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0488.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGGATTAGTGTGCTGGCAAGTGCCAGATTCTAGCTTGTGTTTAGCTTGCCCAAACCTCTGTATCAGTAGCGTCAGTGTATATTCACCTGTCCGTCAGTGCCTGCGAACAGTCTCCAGGTAACTCGACCTGGCAATCACTGACTCTAACGCAACGCTGCGGTGTATTGCTTTCGCTCAGGCAACAACTGAAACCACCGTA")) -(assert (= z "uucacggucuaagaucg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 deleted file mode 100644 index a2979ddfd..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0489.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CGTCGCCAGCCCCCAACCACCGGCCCCGCGCCAGCTGATAGTGCCGAAAAGTGGCCCGCGCGCAAAGTAACGCGCGGACGTCTTAAATGCCCAAACCTCTCAAAATATAAGTACAGGATTGATCGTGGGATCTGTGTGTCGGTGCTATATCCCGCCAGGATGCGAAGCCGCTAAGGGGTGGGGGTAGGCGACCCTTAGGG")) -(assert (= z "uaacuagcacccuagacaca")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 deleted file mode 100644 index e0befc928..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0490.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "ATTCCGTCACCCTCCTGCCTTATACCTAGAGATGTCTCAACCCCGTCAAGGCGATTCTGTAATCACACTTCAAGCTACTAGTGTAGTGTGTCAAGTAAATCCTAGACCACCGCGCTGGAGCCTTCAGCGTCCTGGCAGCCGCGACGTCGTCGCCATTAGGGGAATTCTCCCGTAAAGGTTGTGCTGGGTGCGTATTCGGA")) -(assert (= z "guucgaugaucacaucacac")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 deleted file mode 100644 index 2f81590ac..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0491.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GGAACGGAGCACGATTCTCGAGGCTCTACCTCTGGACTGCATCACGTAGCCAGATCCATTGGCCTAGTATGCAAACGAGGATGTCGAGACCTACGGATTGTTCACCGTATACCATGTCGCGCCCGACGCTAAATAGAAAGTAACAAATTACGCGATCTGATGCTAAACTGGGCTTTGCACTGTACTGTCCTTGAGCCTCG")) -(assert (= z "cuuucauuguuuaaugcgcu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 deleted file mode 100644 index 5f9d826b7..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0492.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGATCCAGGCGATGAAATAGGGTCGGTAGGCTAGGTCCCGGCTTGTACCCATCCTCCGCGCTGGTTCGTAGTCTACACAGTATTTGACGTGTATTGTAACGACGATTGCCAGAAATCCCATCGCAGGACAAAGTTAGAATAGACCATGCGATTGGTACTCTGATACCGACTTTGATAAAAACGGGTCTCCTATCATTCG")) -(assert (= z "gagacuauggcugaaacuau")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 deleted file mode 100644 index fd0a209f3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0493.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GCTCAGGAACCATAACCATCTCTAGGCCCAAAGTCCGTGTTTATTTTATGATTTTACACTAGGTCTCCGATAGTACTCTAGTTGCGACATGATCAGTACTGGCGGGTCAAATGCTCCTCTTGCTAAGTGGTATGGGGACGTTCATCAAAGTGTTTCAGCCCGGGATCTATATGTAGGCGAAGAGTCCTAACCATCTACGA")) -(assert (= z "ucaggcacaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 deleted file mode 100644 index 13984740f..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0494.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CAGGGCCGCCGACGACCGGTTTTACTGGGAACTTGAGGGAGGTGAGATGACACTAACCTGAAGATCCTTGAATGCATGGATAGTAATCGGGTGATTCCAGATGATGAGTCCTCGTTAGAGTTGAAGGCGCCGATTGTAACTAGTACGACGGCCGACTCGTCTCGTGCCTTTTTCGAGGAAGAGCCCCAGGCAGGTAGGAA")) -(assert (= z "ggcugcuggccaaa")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 deleted file mode 100644 index c87cc9f43..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0495.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CCACAGCACGGAAATCTCTCGGTGCTGACGCGATTGCCTAACCGCGGCTCCGTTTCAGGCTTTCAAGACTCTGGGGCTGGTTTAATAGGAAGCGGGGCGTGGTGCTGGGACCGATGGTCCATCAGACTGCGGCCCCTGATATACTAGGCGGACGTGCAGACCTGGGCAGGGTCGTTGGCACTTACATAGGGGTGGGGATG")) -(assert (= z "ugccuuua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 deleted file mode 100644 index f3639ce5d..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0496.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "CTGGGCACGCAAGGTTGTACAGAGACGCCCTATCCCTGACACGCCCGCTGAGAATCACAACTTACCCAGTGTAGGGTGAAACGCTGGGCATACGCTGCGTATCATGGGCCCCAACGAGTTGTGATGACAAGAGGCTCTGCGAGCATAGGCATGATCGTTTACTTAACTTCATACACTCCGCACGTGCAACTAAGCATCGA")) -(assert (= z "caacacuacuguucuccga")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 deleted file mode 100644 index e2643a0d2..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0497.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "TAGCGGTTGCACATCGCCGCAAAACAAGTCATAACAAGTTGGGCGCCCCCGACGGCGCGCTCCCTCTGGATTAACGATCAACACTGGTTTCAGGTGTGGATCTGGGGATTCAGTCCCTCAGTCCATTTCAGTCGGGGATTCCCAAAGCTAATCCGCTTTCGAACAGGGATGTAGCCTTTAATTGGTCATCGGAGTGCGTT")) -(assert (= z "auuaaccaguag")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 deleted file mode 100644 index 1b1edaab3..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0498.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GATAAGTGTGGTCGTGGGCTATGGGATTGACGAGACACTCGTAGTGTCCTATTTTAAATTAGCTCCCCCGTTGAACTACCCTTCCATGACTTATGTGAAGCCTTAGGAGTGGGTTGACTCTGCGTATATGACAGTTTACACCTTGCGCAAGACCTACTCACATCCCTACCAACCCTTCTGATCCGTTATTGATACTTGTG")) -(assert (= z "ggaacgcg")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 deleted file mode 100644 index ef030a56c..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0499.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "AATACCCAAAACTTTCAATCCTGCTCGGTTTGTATTGTGGCAAGCTGTCATGATCATCTTGAAAAGGCTCCACCACTTGTGAGTCCGCCGATCTGGTGGTACAGACCCTATGTTGAGGACGTAGGCCTCTGTTGTGAGTATAAGGGGTCTTGCAAGTAACTACGCCCGCTTAGCGAACACGAGGGGCAGCCTGGATCACG")) -(assert (= z "cuuuuccgagguggu")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 deleted file mode 100644 index 2d7c8f8f8..000000000 --- a/non-incremental/QF_S/20250403-rna-sat/benchmark_0500.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status sat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete values -(assert (= x "GACCAAGACGAACAGTTGGGTCTGGGTAAGTGAGACCTCTCAACCAGGTGGGAGGTCCCTTCAAAGCGTCTCTCGCGGATATGGCTATGGTAATCTCCCGATTGTGAAGACAAACAAACTATATGCTATACTCTATCATCCCCAGGCACGCTGGAAAAGTCCCCCTTCCACACGAGAATAAATTGGTGCGTGGACTATGG")) -(assert (= z "uguuugauaua")) - -; Pattern must occur in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 deleted file mode 100644 index 88074d403..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0001.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGCTGACATCATCTGTACCATGGAGTGTGTACCGTCTGAGACCATTACAGTTTATCTGAAGTATAAAAGGTCTCCATGCAGTTGCGGCGAAACTCACTATGTTAGTGATTAATCTCTCTGCGCACGCATGACTCAATGAAAAAGTGAATCGTATCACTGGCAGCACATGAACCCTGATTCGGATAAGTAAAGGACGATAC")) -(assert (= z "gccgugaccgcuuaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 deleted file mode 100644 index 4493d8768..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0002.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTATATAAAATTTGGATTACGTAGGCAACTTGCTGAAATCACCGGCCTCCTCCTGTCGCTCCATCCTCCCCTCTGGATCAGGGCCTTGACCTTGCCTTTCTACCGTAAGTACTCATGCAGGGAGTTCTACTGCCCAAGGCCCCCATCGTAATTGGTTCCGAAGCTCTGGTATAGCACCGCGCTCACCCGTACACTACATT")) -(assert (= z "gggacugauuuuuau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 deleted file mode 100644 index 4a7d3aff2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0003.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCTGTGGGCAGTGTGCTACCCCGCGCCATTGTAACTCAACGGATTACTGGGATGGGTGGGAGTCATCGCGCGATACCTAGTTAGACTGTTTTTTGGGGTACCCTGTGCCATTACTCATAGGCGCCCCGAATCAATGATTTGGCAACCCAAACGGATCCTTCGGCCCGGCCCCCAATCACCCGAGATATGGGCGCACGTG")) -(assert (= z "cccgugccuacgacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 deleted file mode 100644 index 271c61d73..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0004.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGCTGAGGGCGACATCTAGGACCAAGCACGTTTGTTGCTGTGGTGAGCCTGTACACCGGAAGTAAAATTGCACGACGGTTTTACGATCGAGAATTAGAGGCCAGGCGCAAAGGGTATCGATGGTGTCTCCAGCAACTGCACGTAACGCCTCCATTTTTCAGTCCAGAGTCTAAGCTCTTTCCGATTAAGGGCTAACCCTG")) -(assert (= z "uaggaucuacauaua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 deleted file mode 100644 index a07526bcc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0005.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCTATATACTAGTTGTGCAGGGGAGAAATACCCATGCTTTGCGTTCACAGCTGTGGCCGCAAAACGATAAAAGCAGTAGGTATCAATTATCCGTTAAAACCTTGAGGTGTCACGCAAGCCGTGGAGAGGGCCGGCAGCTATTCCGATAGACATCATGCTGAACAATTAGGTGCCAGAGCGATTGGTGAATGGGGCGCAT")) -(assert (= z "uauaaauagaguuga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 deleted file mode 100644 index d5c3dab08..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0006.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTACTGCAAAATGTGAGCATCCGACCCGTACAGTGACGTCAAGCTGAAACAGACGTCCATGGGGAGTCCTTTTCCAGTGACCTAGTAATTCTTGGACGCGTAATATCCAGCTGCAGTTGTCGAAAGGATCTGTTGGGAGGAAAAACCAGATTTTCGTAAAAATAATCGAACCGGAGCGCGTGCTAATTGCCATTGCCTAG")) -(assert (= z "cuagggcguauuguu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 deleted file mode 100644 index 76b46a877..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0007.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATACCCTACGGACATGGAAGCCCTCTCGACCAGGTGAGAGTGCGCGGGTAGAGTAGCTAACGCTCGTGATTCCGCGCCACATATGCCCGGACGGGCAATGGCCCGCTGCAAGACTGAACTAGAGGCGCTTTTCGTTACGGTTTCTACCATCACTAGGTTCCAGTAAATTTCACCCCTTAATGAGCCATGACTAACTGTTT")) -(assert (= z "cugagcgugcucggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 deleted file mode 100644 index 371c8daaf..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0008.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCTAATACCCCAGGCGATATTGGGTACACATCCACGTCATACATCTGACTTATAATAGTTTCATATGGTCACCACATCATCACTCTTAGAGAAAGGACCGCTAGAATAGGTCTCACGCCTAGCTAACGTAAACAAGTCTGACGCTTTGAAAAGGTTGAAAAGCAAATCCCCTTTATCTGGCCAGAAGGTCCACTAGACG")) -(assert (= z "acaguuugucaugcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 deleted file mode 100644 index fbc364d68..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0009.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTGTATTATCATGTCTAACGTCTGGCCGGCAGTAGTCTTGACTAAGTGCATCAGTTAACCGGGTTACGTAATAATGTTAATTGAGAGTAGCTGGCACTATCCCCCCTTTGGTGTTGTTATACACGGTTCGCTGTCGACGCCATTCAGATCGCGATGGCCCTCACCGAGGCCCATACCGCGCATTGCCGGCAGCTGCGGA")) -(assert (= z "augagucccugacaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 deleted file mode 100644 index eb47d0051..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0010.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAAGACGACCTAACATCCTACAACAGGCACCTGATTGGACGTAGGCAAGTGCGTAATCCCGATCTGCTGTCTGCCCCTACGAAGAAAACGGGCCTCTGCAGACAAGGCTGAACGTCAGCTATTCTGCAGAGACAAGGTCACGTGCGTAGAATGTGGCCAGAGTGTAACGGAAAGACGTGGCCATTATGATAAGTAAGCA")) -(assert (= z "uagucuugggggcca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 deleted file mode 100644 index 8afe22661..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0011.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGACCTCGAGTATTTCAGCGCCTCGGAAACCAAGTAAGGTGGGTAATTTTTTGCTTACAATCGTTAATCACTGAGTCAGTTTCTGAGGCGTAGGCGTTCGGAATATCGAAAGCATGGAACCCCGCGAGATCAACTCTTGGTTCTAAAACTTTGTCTCGGGATAGACCGAAGTAAAGGATCTAATTGTCGACAACACCTGT")) -(assert (= z "agcuagugcgggugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 deleted file mode 100644 index b12651b80..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0012.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTGCAAGTCATGAGTTTGTACCATAACTCGACGATCTCGTTAATCTCCTCGGAAAGAGAACACGCGAAAAGCACAATCGGTGGTTGGGGCCACAAACACTAAACAAACCCCTCCATATACCTGTCATAGAGGCCTGCCCTATCATAAAGATAGTCGCAAGAGCTTCTGCAGGTTTCTTTCACAGCGATGGGCAGCCGCGA")) -(assert (= z "aggugguaaucccgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 deleted file mode 100644 index 1875e2f33..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0013.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTATCCGTCGGACGTACACTTTTCGTATAGAGCAACGGCTTACGAGTCTACACTATGAAATATGAATCGTCCTGGTATCCCCTATGTATGTAACCCAGGGTCGTAGCGGGGTTTCCGCCCGCGAATAAGGGTCTACGACACGGACACTCTTGCCCGGCGACTGATTCCAACTCTGGTTGACAGGCCAAAAAAGTTTGTAA")) -(assert (= z "gccaacuugccgcag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 deleted file mode 100644 index fb6c1bcd9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0014.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTTTGTTAAGATGGTTGACCCGGCGTCGGCCCTGTATCAAGAGTAGATAAGGATAACACCCCCGCATAGGTGGCGCTCCAAACATAGACGGGAGGCCGGGCGACGCCACAATATCGCCATGCGGAGCTCAGGCTAGGAACCGTAACCTGGGTGCTCACTACCCTCGCGTTACGAGATTCCTGCACGATTCACTGAGAGC")) -(assert (= z "uguucacagcucgga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 deleted file mode 100644 index 9f61c3e82..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0015.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTATCACGAGTGTGAAGCAGTCCCAAACTGTTCTACAGTTTGCGATAACCTCCGCCTATTCTCTATCGCAAGTGACGTGGTAGGGGCCGCTGTAGAAGGACGGGGGTGACGAACTGAGACTACGATTTTTTAAGACGCTCTAAGACCGCTGAGACGCTCTGCTGACCTACCGACTTCATTAAGATACGCAGTCAACTCA")) -(assert (= z "gcucugagaggccgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 deleted file mode 100644 index bc05676d3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0016.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTAGTGGTACTCTGCGTCTCCCTTGACGTCGATGTATATCTAGTGGCCATGGTTGGTTTTCCGGTTTGGCACCTCGAAGTAGATAGGCAACATTCCAAAAGAGCGATACCACCGTTGCCGTGATTGGTTTTTTTCATCACATAAACGATAGAAGAGGTCAGACAACGCCCCAGCCGCCGTGTTTTGATTGGGCGCTTCAT")) -(assert (= z "ucaauaggguaauau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 deleted file mode 100644 index 00fcaa6d0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0017.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCGGTTCATCTAGAAAGCCAAAACCCGCTCTCACTGCTTATCTTACTTCACAATGATAGGTGGCCGTCCGCGCGGTCGTTATCTGCATAGAGTAATCAGTAATTTTCGTGCCGTCACCGTCAGATCGTTACGATACCATTTAGGGCTTTTCGCCAGCTGAAAGCAGTTTGTGGGTCGGTATGTTTACGAATAGCTAGGAA")) -(assert (= z "cacacgauuuuagac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 deleted file mode 100644 index f8b3b58b1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0018.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAAACTTTTGCCATAAAAACCCACACGAGATAGAGAGCCGTAATAATATCAATAGCGTAGAGAGCCAAATATGGCTATGCGCATTGAGTTGGAAGGATCATGATCCAGAGATGTCCTTCAAACTTCGATTCTTCCGTTACCGAACTTGCCGTTCGTTTTATAATAAGTGAAATGCTCCTGCAGGTCGGTCATGTAGCATC")) -(assert (= z "aaacagcauguuauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 deleted file mode 100644 index 2e8467e58..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0019.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGTGAGAAACCGTGTTATCGTCAGTGCCACCTCTCCCCAGACTCAGACGCAGTATTCATCCACCCCTGCGCAACTGAGGTTCGCAGATGCGTCACGCAGGCAGAAAACATCCCGGCGTGGTTTTAAACGTTGTGGAGGTCCTTAGGGGTCGTCGACGGTAATTCCGTTGTTGGACCTTTTACTCAAGAGGTCCTTTTAG")) -(assert (= z "gaacuuucugccagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 deleted file mode 100644 index 822155028..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0020.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AATAAAATGGTACGTCAACAAGGCTTAAACAGGTGTTTACCATTACTGCTCATAGGTGTGTTTGGGATATGCTAGTTTGCGGGAGTACTCTCGAGGCACTGCTTCTTCAAAGCCGTGGGATTGGTGAAAGATCGCCTGAGCCACCAGGTCAGCATTTAGATTTCTGTCTAGTTGAAGCAAGCCAAGCGACTCACCTATTG")) -(assert (= z "aacaacgacgaggac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 deleted file mode 100644 index 591ed97f6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0021.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATGAGCTCGACGCCTCCTACTTATTGTAACTCGTGGTTGGGCAGGATCAAATCGGGGTTTGCCCTCAGCTACTGCGGAAGAACTCTGCATGTGAGCGCGTGTCTCCCACATGTCTGCAAAAGCTAAATCCTTTTAGGGGTATTCAGTAAGTCGCCAAACGCTGCATAACGTGTGATTTAGAATTTCCCATGCATCGTGA")) -(assert (= z "agacaucugaaucca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 deleted file mode 100644 index 47bfd8bff..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0022.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTGCTCCGACAGCTCATCGTTGACTCTGGGCTTCTGCAATCCACATGGGCGTCTGTGCAGTATGCTCTCGTGTTACGACTAGGACTAACCGTGGACGTTCCTGGGCTTTGTCGGTGACTGGATGCACGTATGAGGCTGTCATCTTGTCTGAATGAGTGCGTTTGTGGAGACTCAGCCACCAAAGTCCTCATGGGCACGT")) -(assert (= z "gaaguggacaugugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 deleted file mode 100644 index a699c10a5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0023.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACAAAAGCCACGCGGAAGATCTTTTAACATTGCATCTGGCAGGGTCCTGACTGTGGTTCGCAGAAACCGGATCTCGCGTCGCTTGCTCAGGCGGTCATACCGGAAGATACGTTTCCGACCACGCAAATGGTTCGGCGGTTTAACTGATCACTTGGCAAGGGCAAATCCCCCAGCTGATCTCGTAAAATGATTATATGACC")) -(assert (= z "cacuacccauucaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 deleted file mode 100644 index 14b20ebe6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0024.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCTGTAAGTCTGTAGTCCGAGGACAATACCCCTTCAGTGCAACGAAATTTAGCTATAGTGCAAATAATAAGCGGTCAATAACTGGTTTAGTCTCCTCGCCCTTGTGAAACCCTCAGGAGGTCAGTCGGCACACCGCTTGTTTAGGAGCATTGAGTTTACTCTTCGCCATAGGTGGATAGGCGATCATATTAAGGAGTTAA")) -(assert (= z "uguaaguggggucac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 deleted file mode 100644 index 301fe0a48..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0025.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGTCAGAGATTATAATCTTCTTTTTGATGACCAGCGTAGTTGGTCAAATCAGGCACTCCACGGGGGACGGTTGTACACGGGGTCCGAAGATCCATACCAGACTGGTAATGAGCTGGGCTTCTAGAAGAATCAGGCGTCTTCATCACTCTTTCTCGTAGCGCTCGGAGATATTTTAGCAAGACGTGCATGTATCAAGTAC")) -(assert (= z "cgcuugguuugcgcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 deleted file mode 100644 index 6845b4ec1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0026.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTAGGGGCAGACACTTTTAGGAGTCAGACACGACGTTGCGATATGGACCGCACGTAGGGCGGCTATTGTTGTACCTTATCAGCTTACAGCCCGTCTCGTGCCGATAAGCATCTTACCAATCAGCGTCAACCACATTCTCCTAATGTGGAGCGCAAGTGTCAAGGTAACTCGCCAGGTGAGCCATGAAAGGGGAATGGGCT")) -(assert (= z "gguaucgaucggcag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 deleted file mode 100644 index 01f75afe5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0027.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACACTCACTATCGCTGGCATTCAAAATGCTGTTGACTTAGGAGTGTGGGGTCCACACCCGTGTGGCGAGACTCAGCGAAGCCTACAGATTTCTCCAAAAAATCAAAGGGTTACTGGTAGCGGTCCCGCAAACAGACGTCGTGACCCATCCTCGACGGGGCCCCGTCAGGTAGGTGCCAACCGACTCGGCTTTAGAGGGGT")) -(assert (= z "gagguacuucucaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 deleted file mode 100644 index 5f1f11660..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0028.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCGGATCCCGTGCCAATCGAGTAAGTCCCATAATCACGGCTCATACCATATTGGCCGCAGCACCGACTTAGATTATCCTGTGAGGTTCAGGCTATCCATAGAATTAGCACTCCTGCGAACTTTCCCTACCGTTGGCCTTGTACGTCCGAGATTACAGCCGACCCAGTATAAGGCAGCTTCGACGTGATTTTTCAGCTTGC")) -(assert (= z "gccugggacccagcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 deleted file mode 100644 index a9378f9b9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0029.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTTCCGCTCTCATGTACTAGCCAGATCCTCCAAGTAAAGCAGGCGGACGCATAAGAGGTAGCGGCGGCTTCTCTGTTCGTTATAGCCTAAGCACGTCCCTTCGAAGGCCGGGCTAGCCGTACTAAGGTCTGTGAACCAATAGGACGATGCTGCATTCGGCGGCAGGTTATAATGGCAAACACGGATGTGCACCTCGAGA")) -(assert (= z "aggaguccuaauugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 deleted file mode 100644 index 83906c12c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0030.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACGAATCTTTATTACATGGCCAGTAGGATGGTGAGTTGCCCATCAGGGTAAATCGTATAAATGCTGGACGTGGTAACTCCGAGGTTTTACCCACTTCGACATTTAATGGGATATACTGCGGACGTCTAGTTATACTCCGGGGCTGGCGGTGTAATAGAGTGGGCCGGAATTTGACGTGTATAGCGGCACTCCCCAGGAG")) -(assert (= z "cacgcgaagugguau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 deleted file mode 100644 index 2cdffc026..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0031.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGCCAACCCGAGCACCCCCTGAAGGAGTAAAAAAGCACAGTTATTCCACTGGCCACGGGCAGTAGTAGAAACTGCAGTTAAGGTCGGACTCTTTACTATTATCTGGGGGGCCGCACGCTCCCTTTGCAAGTACTTATTGTCTCAGGATCCTAAGAAATCCCCTTCGGGCAGCAGAAAGATAGCTCAAAGACACTACTTA")) -(assert (= z "caagguccgguuguu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 deleted file mode 100644 index 4ad83b2f4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0032.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTTACAACTCAGGTGGATTTGTCAACATGCCCAAGCCGGTCAACAGGCGGTTCCGAGAAACGCCAGTGTGGAAAACTGTCGTGGGCGCCTCGATTGCCTCTATACTAGCCAATGGTGAATCTTCGAACATTACCCTCAACCAGTATGGAGCTTGTAGTTCAAAAAGTGTGGCGACCTAGGATTCGACGCGGCGAAAGTTT")) -(assert (= z "gugaaaauuguacac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 deleted file mode 100644 index 1e0795ac6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0033.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AACACCTATATTTTAGCTAACCTATCTTCTAGTAGCTCAGTGGAGTTAACACTCAATGGACGTTCCAAATCGCAACGGTTTCGGTCTTGTTTTGCACCCCCTCAACATGTGTCGGGCTCCTCGGATCACAGTTTTTGTGATATGAACAGACTGTCCGTCATTCTCGATAATAGCACACGAAATGCCATGAACGCGCGTAT")) -(assert (= z "auccuacugucguau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 deleted file mode 100644 index 71146a7f9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0034.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACAATTTATGACTGATTTACTAGATAGTTGGAGTCAGATCACTGGTGAATTTCGGGTAAAACGTGCAGACGTGGAGTGTACCTTTCTACGCAGTCTACCTCGGGACGACCGTTGCCTTTATTTAATAAGCAATGAACATAGATCCCTATATTACACCTGTTCACGGGAAGCGTCCTCTTCATACAGCACCGGACTACAC")) -(assert (= z "ggcucguacgaguag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 deleted file mode 100644 index bf25e2dfb..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0035.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACAATAGAGCGTCTAAGCACATCACGGATGGATGGGCAGCATATTAAGGCTCAATCTGATTGCATCATGGAGCATCGCCGCTCCAAAACAATGCGGTTCTTAGAAGGTACAATGTTAGATATTTATGTGCGGTCAAAACTGCGCGACACGTTTCCGTGCTGATGATCCTCGTGTTGTATCACTTGTTATGTTAGGTCATT")) -(assert (= z "augacccugcaagcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 deleted file mode 100644 index 97feecdbc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0036.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AATATGTGGATCCCCTTGATGATCCTTAGTTTTCTCAGCAACCACTGTCATTAATTTTGTATAGGAACCTGTAAAATTAACGTGCGCCAGGAATGTGCGTCACGCACTGGTAGCCGCCCACCGAAACAGCTCATTTCCGTGTTCTAGGGGTTCCTAGCGTTTCACGTGGAATACGGCTCGCCTCCGCGACAAAGCGAATG")) -(assert (= z "gauuucgcaccaugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 deleted file mode 100644 index 92c243554..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0037.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGACCTTCGTTAGAGTAAAATTGATAACAGACCTCGCAGGCATGTCCCGATATGCAATGCAAAGGTGGTCTGGGGCGAGATGATAACGCTAGCTGAGGTCTCCAATCCTCAACGCATAGGCATGCCACATGCGTGATACGAAAGGGCCCGCCAATCATTCCAGGGCCATCGCTGACACACTGGGCACTGCGATTTGTTA")) -(assert (= z "accuuuacggauugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 deleted file mode 100644 index eb90a4a47..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0038.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCGAAGCCTTATTAGGCGTGCAAAGTGATACCGAATAAAGGGTACCCCACAACATCCTAATCACGCCCAATACACTCGAGCTAGATGTTGATTGAGTTACGATCAGGACACATGCGATGGGCCACGTGGCAACCAGACTTTCGCACCGCACACCATTTTGGGTAGGATAACCGGAAACGTTATGACTAATTCCATGTAA")) -(assert (= z "aguugucuaguccag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 deleted file mode 100644 index 39deacbcd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0039.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTAGGTTGCGGGATTCTCGACTCGTCCCCTGTGCAGCCAGAAATGAGTAGGTTGAAGCCATATCTCCTAGAGGTTCCCCTGAGCTAGATCGGTTTCCAGTTCGGGTGCGCCTACAATTACCCTACGAGGGGCGCAAAAGATCAGATCTGGTACACCAACCGTTACTGGTGTTCCCCAACTTGCTATACAGGCAGATCGTT")) -(assert (= z "gcuauuucuuuucuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 deleted file mode 100644 index f57b0847e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0040.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGAACGATGTTACTTGGTCGGCTACGGAGGTCCCCTCAACAGCGTCAAAAAAGAGAGACGAACGGCACCCACCGGTAATGCCCCGAAAAGGGAAGATCCACGAGATCCGAATCTGGAGATAGAATCTACCAATCATCGCAGCCTTTTCTAACTAGGGCATCGATCAAGGCCAAGTGAACTCACTCGGCCGGGATTGGCA")) -(assert (= z "gggugcgaccacagg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 deleted file mode 100644 index 687e8af34..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0041.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATCTCTTGTTTCGCCTCGAAGTGAATAGTGGGAAAATCTTAAAGACACATACCAAGACTTATCCCTTAGGGTACGCTGTGAGATTCCCTGTTTCAAGGGTTGATTCAGCGCTCGAACAAACGAAGTCGCCACGCAGAGCATCACGAACAGGGGAATTTAGCTACGAGTCCTCAGATATTCGGATTAGATTTAACACGCAC")) -(assert (= z "uucacacuacgcaau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 deleted file mode 100644 index 84a50e6cd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0042.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTACGTCAACCAGGCCGGTAGCGACGCTCGCGTCTTAATTGATCTGAACCAAAGTGCGGGTCCTACTATTTCGTGTGGTCCAAGTAGTAGCCTTTACGCATTCCAGTGGTTATTCCGGGCCATAAGAGGGCAGCGAGACAACCCTCAGGTTCTGGAGAGCGGAGTACAGCCTATTAGCTTACGACTATTAGCTCGCATCA")) -(assert (= z "cuuuccaucuagcaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 deleted file mode 100644 index b7f939cea..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0043.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GATGTTGTCTTATACCACTCTAACTGACTGGTCCTCGTAACCCGTAGTGTTCATCCCTATGACCGCGCCGGTAAGACAAAGGGGTATTGATTCTCTTACCGCTGGTAGGTAAGCTGGCGTAACGGGACCGGCGCATGCGTAGACCTAGTATCCACTATAAGCTATTACGTCACCTGGGTTCGTGAGCGGATACATTACTA")) -(assert (= z "gaaacgccucaccca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 deleted file mode 100644 index 1d7e8e93b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0044.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGCAGAGTTTAGCACAGACTCGTAGAAATTGGTGACCTAAGGCGGATGGCTTTTTTTAAACCCCCTACGAAAATTCCCAACCTGTAGTGCAAAGGCGTTCCGACCGGGTTGAGAGAAAGCTGCGCATCTCGCTGGCAGACAAGAGTTTTCGATACCACTTATTTTATCATAACTACGCGACGCTCCGTGCGAGTGGGAG")) -(assert (= z "uauugagagugucca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 deleted file mode 100644 index d842274f4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0045.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTGGGTAATATATTTGACCGGTGGTCCTCGAGTACATTAAGTTAAAAGAAGATTCAAGACCACTATGCCGAGACGAGAATGCAGCTTCAATTATCAGGTCTATACATTGACCCAAATCCTCGACCGTAACCCACTAGATATGCCGAGCTTATGAATTTTACGTTCATGCTCACGCGAAGGGAGTAAAGGTATACACCTC")) -(assert (= z "aggacgaccgaaaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 deleted file mode 100644 index 07fb17945..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0046.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGGATTCAGTACATCCCCGCTGGCACATTTGCCAGCTAAGGTTAACGAACTTGCTATACTTCGTCACTATAAATGAATTCACGGGTTCTCTTTTTATCCTCAAACATTTAAAGCCAGCAACCCCGCTGCAATCAAAGTCACGATTTCTTGCGCACATATTATGGGGCAGGAATAGGGTTTGGTGTGCACAACCATAACA")) -(assert (= z "gggugcacgucuagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 deleted file mode 100644 index 0bf900d1b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0047.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACAGTCTATCCAGCACGTTCCATTACTGAGGGTAGTTTCGTGAGAATTCCTGTTCACAGCGGGCACACGGAGTTAATCAACTACTCTCGCAGATGTACCCGTGCACAGGAAACTAACTTAAACATTTGTTGCTTTAGAGATACAGGCATGTTCCCTTCTCGTGCGGAAGTGACACCAACATAGGTGGCGCGGCCAACCT")) -(assert (= z "ccgacguacuaugug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 deleted file mode 100644 index f962dee28..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0048.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTACTAGCACCAGCCGTCCGTCCGTCGTTCCCAAGCTAATTACGTCAGACTCGACATCACGCACAACCAGTGGTAATAGCGTCAGGGGCCAAAGTATAGCGCGCATGATTTGCCGTTGCATAATTGGAGACAAACAGTACACGTACGTATCCTTGGGACCTGACGCGAAAATAGTGTTGCGCTTGCGCCAAGAAATGTCT")) -(assert (= z "accagacucauauua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 deleted file mode 100644 index 17fdcea69..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0049.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGACCCTCAGCTCCATCTGCCAACGCACGCGTCCATCATAGTTCCGTGTTCGCGCGTTGGATTCTTGACCGATACACTGGGGCGGGTGGTAACGTTCAACCATATCGACCACGAATACTTGGTGCAGACGTATGTATTTGACGTCATAACAACACCCTTGCGACTACCTTATGTAAAATCTTCACTAGCATTACCCACTA")) -(assert (= z "accagagcacagccg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 deleted file mode 100644 index 3a321a0b3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0050.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCAATTAATGAGCGCCCTCTTTACCCATGGTTACATTTTTACGATGTAAACCTAACGAAGGGCATAGACGGCTACCAGAAATTTGCCTAGGGCTGAGTGATACTTAGCGAATGACTCTGTTTCATCTTGATCAAGCCGGTGGACTACAGAAGCAAGCTATCCGGGTTACTCTGTCCCGTACAGAATGCAAACTAGTAAC")) -(assert (= z "acuaaccagucgcgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 deleted file mode 100644 index 0aa9a623d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0051.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCAATCACTATGGTGAACCATCCGAAGCTTGAGTTGCGCAGCAGTCTCACCTGGAGGGAAAGAGTGAAACGCTACATAGAGCCAGTTCAGTGTGCCCATATACTTGATAACTGATAGGGCCCCTCGGGTGTCTCAATCACGAGATCGCTACACCAATCCCCGAGCCCCAACCTACGACACAGACTGATGTTGCTAGTCCC")) -(assert (= z "gcuuauuaaugaucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 deleted file mode 100644 index 798f2fd0f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0052.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGCTGAGGAATCGCGCCCGTCCCTCCCTGAAGCAGCCTTATAGGATTGTTGTCGCCACCTAGGTGATACTGTCTTGCCAGACTTCCCCTATCTTATCGTCTAGTAGATGAAGTCTTGATACCATACACAGTAAGCGGCTAGATGTCGCCTGCCTACCTCAAATATCTCACGACACAGGTGTCTGGGTGTGATATCCGAC")) -(assert (= z "ggguaggaugcgugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 deleted file mode 100644 index 085658807..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0053.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTACACGGAAATACCACCGTTTTTGAATTGCAACTCCTCGCGTATGCAATCACCCTTGAATGTGTCATCAAGCACAGATAAGGCGGCATAATTCATGAAGTGCGGTATCACCACCCGTTGGTTCTAAGCAACTCGCTGAACTTAGGGCGGGGAGAGACGAAACGGGGCATTGGCTTAAACAATTCAATAATAGCTTACGC")) -(assert (= z "uguaugaggaacauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 deleted file mode 100644 index 35701c4f4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0054.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GATTGTCGATGTCCCTCAAATAATAGCGTTAACAGAAACGTAGGTGCACACACGTTCGCGCCACCCTTAAACTCGAGTATTGCTGAAGTTCGCGCAGGTGAAGCTTAGTAGTCCTGGCAATCTGGTAGGGACAATCAGACAGTTCTGGTAATTAGACGAAGAATCCGCTGCGGCGGTATGTACCACACGTCCGTCCCACA")) -(assert (= z "uaacaaugcgauacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 deleted file mode 100644 index f74c5ea50..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0055.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAAAGCCTGTTTACGCTGGACGCGAGCGTTCGAGCAGCGTCATAACGGACTGGCCACGACATGGAGAGTCCCAGCCCTGGAGTGAATGATTGGCGACAACCAAATGCTTCCTGTCAACTGTGATACGGCATGCTCCGTGGCGTACCCAACAAACGCCTTAATTTTGGTTCTATAGTAGAATCGTAGTTGAATTACAGCGT")) -(assert (= z "gcuuucgcggauaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 deleted file mode 100644 index 919961885..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0056.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAGAATTGGTGTGATAAGCGGACGCTAACCGCTGTGTCAACTTCCCGCTCGGTGTGATATTAGCTCGTGCACCACCCAGTCGGGACGCACGCAGGCTCAGTCCGAAGCCTCCCAAACTCGATCTTTCTGCGTGCACCCCTTATGGCGCAGGTCTACTGTGGTGATGTGAATGTATTAGACGCCTATGTGGCTACGTATCT")) -(assert (= z "acgcggacgugagga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 deleted file mode 100644 index 80a748502..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0057.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATATAGATTCCATACTCCGTAAGAACCTCTCGGCCGCGCATCATTCATCTGGGAGTACTGTAAAGCCACGGAACTTAATTCCCCCGCTTCAATCCTTGCTAAGGTGTATTCCCTATCGAAATGGGTGAAGCCGGCTTCATACGTACGTACAAAGCTTCCTATCACCGAGCTCAGACCTATTAAACTAAATGCAGAACCT")) -(assert (= z "aagagugacuacccu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 deleted file mode 100644 index 9cc874d84..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0058.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCAAGAGCTTTGGAACGACAATGAAGTTCACGAGGGTGGCAATACCTTCCGAATTGCACAAGCTGTCGCTGCCTTGGCATGGATTTCCCACTCGACTATTGCCGCCGTTAAAATCGCCAGATCGATTGAGGCAGGTAACACTCAGAATAAGATCTCCAGTCGAGAGTCCTGCAAACGACATAGCTGTAACGACAAGCTCC")) -(assert (= z "agaacaugugaugug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 deleted file mode 100644 index 9536f3e22..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0059.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCCGTTCTCTCTTGGTTAATACCCAAACTCGCGCCGACGTAGAGCCCCGCTAGGGGGGCCACCATTCTGATCGATTGGGCTCGCGTGTGTGCTAAACCCAGTAGTTGACCCTATTTGCTGTGTATGCGTAGCTTAGGGTCGCTGTGTGTCATTCAGCAACTTCTCTGTCCCATGTCGAATATCCGCCAGGCTACCTGGGT")) -(assert (= z "gucccccgcuuauua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 deleted file mode 100644 index dc4dcd6ec..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0060.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCCCTAGTGGGAAACACACGGCCCGAAAAAAGAAGCGGTCTTTATCCATACACGGTGCTTTGCGTACCCGTTTAACATTGAAGCGCTCTCGCTTGCTAAGGAGTGCCCGCCCTTGTGCGCGGGTAAGTAGTTAGGGTTTCCGTTCAGATTCAGGCACAATTACATCGCCAGCGCCGTTGATCATTGCTTGGCTGGTTTTA")) -(assert (= z "cuauaggcgcuucuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 deleted file mode 100644 index 8dbb4c571..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0061.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCATAATACGGTTACGTGACCCTGTAACTCCTTAGGCCTGTCTAAACTTGAATAGAGTGCGTTAAGAGCCGAGCGGCGCCATAGTCGCGAGTGCCCGTATTAAGAACTACTTTAAGCTTTTTCAACGGAACTTTTCAGCGTTAGTCCAGTCCTTTAATTCACACACTCCGTTCGAACGAAGTGGCGCTCCGGGAATAAGT")) -(assert (= z "ugggggagggcgacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 deleted file mode 100644 index 4846d5894..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0062.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGATACTTGGAGCTGGCTACGACACTCGCCACATCCATCAAGCGGCACCCGATCACGGGTTGTGAAAAAACGTACCAACCATGCTTTAAAACCTAGGCGATTGGGTCTACAGCACACCGAGTCGATGAATATCGAGCTACCAATAAAAGGGGATACGGAGACAAAGAATTAAGGCCACACAGTTGGACGCGGCTTACATA")) -(assert (= z "acggucuugacgagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 deleted file mode 100644 index d59152ecb..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0063.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGGTAGGGAGCATGTCGGCTGATCGTCTGCGCGTCTGTACGCCGAAGAGCTACAACGACCAGGTGTCAGGTCGATGCCAAAATGTTTTATGCTAGCCACGGAGTATGATCACCGGAAAGCAACTATTTCGATGTCTTCGGTCAGACGATAAGGTCCGCTTCCGGACCGTTTTTTAACTCTAATTTCCTGAAAGTATGAG")) -(assert (= z "aggcguauaccggug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 deleted file mode 100644 index b1bd017bd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0064.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGATCGATTGCGGCTGATACAGTATCATCCTTGTCGAGGAGAAGATAGTTAAGTAATATACGCTGTCGAGGTCAGAAGACGCATAAAGACGGTCTTTCAGCTAGAGGAGATAGCAGGATGCTTCAACGGATACCGCGGCTAGACTCACCTGAGAGTAAACGAGACTACTTAGTAAACAGACTGAACGTATGGAAGTCGTG")) -(assert (= z "cgcggcucgagaauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 deleted file mode 100644 index 67f53a5c1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0065.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGAATATAGGCGTGGGCATAACCTGGTATCCAAGGGCATAGAGAGTGGGGAGTCAACAACGCGGGCGCAATATTGTTTAAACCACCCCCGTGACGTCAGCGTTAGTTCGGTTCTCCCGCGCGCAGGATCGTTGTCCGTCCCGTAAGGAGTTATGCATCTCTCCTGCGGGGCCCCCCACGTCCGATTTGTTCCCATTGGA")) -(assert (= z "acacuuuuugagaca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 deleted file mode 100644 index 78cb1db0c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0066.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAAGTGCGCGGCAATTATACCAATGTTTATGGGTCTCCCATATTCGAAGACTACGCATTAAAGCTCACGTTTCTTCCCAGATGTAACTCGTACCTTTGGTAGGGTCGGTTGTGTTATAATCGTGCAAAACAAAAAAGCACAAGATAAGTAACGCGGACCAACGGAATATCGCTAGCCCTTCGGTCGTGGCTTCCCTGCCA")) -(assert (= z "caugcgagcucaugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 deleted file mode 100644 index 0576b40eb..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0067.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAGCTCCTTAGTCAGTCTGTTCTTAAATAGACTTCGGCAATGATTACTCTCCGAGAGTTATTGTTGCCACTACATATCATCGGTGGCCACTTAACTGGTGTATCTGCGAGGCTTTCCACGACTTGATAAGGTAGCTGACCTAACCGTCTTTACCCTTCTAGACATGTTGGATTGTGCCCCCCGTTCCTGCTTCGGCCCGG")) -(assert (= z "cggcuagacuuguca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 deleted file mode 100644 index d24e5c1a3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0068.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCTTACACAAAGTGGAGAAGCAAATGGTCGCTCGGACAAGCCAGGCCCGATTCCAGTTTAGTCGGGGAACAACTTTCTTAATCAGGACGTCCCGTCATAACTGCCAATGTACTCATGTACAACACTGGTACCGGAAGCCGGCGGGATGAGCGCCCTCAGGCGCGGCTGCGTTAAGCTGTGCGTAGCCTTGCGGGTAATTC")) -(assert (= z "gucuuuuauaaagua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 deleted file mode 100644 index 129dc49e4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0069.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTTGTTGCCCCCTCTCCATACCCCCCCGACGTTGTAGAGACAAAGACCCGGACCGGCACCATCCCGTAAATCGTTTTCTGGACTGCCGTTGGCCTGCGATTTCTTAGAAATTAACATGTGAAGTCGGGGTAGAGGGTGTGCCAAGTACTGGCGCGACCCACGCTCGTGCCGCCATTTCAGACTAATTAGAGTTGGGACA")) -(assert (= z "ccacggacuuccuug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 deleted file mode 100644 index b93808f74..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0070.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATCACAGACGGGGTAGTCACATGAGCCCAGCAGACGAGTGAATGTGACAATGATGCGGTCTCAACACTGGAGTTGGACGTTCTCATAAGAGGCGACACGCCGTACATGTATTGGCCCAATTTATCGAAAGAGGAACTACATTTAGAGTACGTCTTTCGGTTCTACACGCCTGAGTATTCCACGCCTTATGAGGGACGCA")) -(assert (= z "gugcucggcucguag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 deleted file mode 100644 index e0a06a972..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0071.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACTACGTGTTACTCTTACGCGCACAATGCAAGGTTCCGGTCGGAGATACCCAAGTGAGGATGTATGAATCCCCATGGTGTGATCCTCCAACCACGAATAGGCCCCGGCTTTCAGGTCATACAAGAATCTCTTGGCGACCCATAAACTATCGGTTTTGCAGGACTTTAGTGATCTAATATAATCTCGATAGCCACCAGCC")) -(assert (= z "agaacccagugacug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 deleted file mode 100644 index c43f6874f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0072.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCACCACGTGATTTCCCACTATCCTGCTCGTTCGATGATGCCAATCGCGTTATCTCTCACTGGAGAACTACCACAGCGTGCGTGCTGCGATGCGTCTGACGATATTTAGAGACACGCGTCTCAAACAGGACCGAGAGTCACCACCATTGGATGATTTCATTTTTAGGGTCTTGGGCACCGGGGGCGATAAGTGCTACTG")) -(assert (= z "acgauggaaaugagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 deleted file mode 100644 index 5b20f2b11..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0073.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAAAGTCTTATAGTGTGCGCCACAAATAACCAGTGCAAGCCCATAAACGATAGACCCGTTTCAAGGACACGAGAATCTGGCGAGCGGGTTAGAATATGACTCGGGGCCTACCGAAGAGGCCTTGTAGGGCCTGTCCTGGTCTCAGGGCGCCTCCTCATTCAAGGATAGGAGGCTCGTATCGATGTCTGCGTCGGTCTCGA")) -(assert (= z "uguugauucuacguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 deleted file mode 100644 index 370f00f9d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0074.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTGTAGGATGGTACGATTTAGATGCCTTGGGTGTAGGGGGGTTCAAAGGAGAACGAGCAAGGAAGTCTACAAGAGAGTCGGTCGCGCCTTTATCATTATGGACTTTGTCGCCCGTGGGCCAGCATCCTGGCTCCGGATAACCCAAACTAACGGCTTGCAGATCGATGGTTATGGCCTGCTCGTTCGTTGATCCCTCTTG")) -(assert (= z "gagcggggcuuaucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 deleted file mode 100644 index 616bdfec7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0075.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AATGGCCTCTCTCTCGAGGTCCGTGCGCCTCGAATATGTTTAAAATTGTGGTTTACCCGAACGTCAATTTAAGCCGAACCCCGCTTATCAAGGGCCACTACTACGTGACGGGTAAACAAACGATCCTCGCCTGAATATGCATCGTGCCCCGTACTTGTCGCACCGCCTGACATTATGGATGTAACCGCTATACACGATGC")) -(assert (= z "aauguucccgaaaca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 deleted file mode 100644 index 853f2d1f2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0076.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTGCACTAGAGGGATCCATGTCGATTTTCTCCACTCCGGCGCACGGGGCTAGGATGTCTGCAGGATGAGTGCCTAATTCGGGTGTTTTCATATTTACGGGCTACCCCGTGCGAAGGGCCTCAACAAAATCCTCGGACGGATTTACTCGGAAGACAGTGTTCCTACAGGACGCTTGGACTTTGGACTCTTAATATTGGAG")) -(assert (= z "uggacaaauacuccu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 deleted file mode 100644 index 8d4724eb5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0077.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCCTCTACTCCGATCTACAACGCCCACAAGAATGGTGAGTCTAACTATACTCCGGCGCCTGCCCGTCACTGCCGAGCACCGTACCCGCGCAATCCTCGATAAACCTATTGCGGGAATGTAGTCAGGGATCTCGGCTGTTACTATGATTCGATAGATCATCAGTAGTGACAAGACGGGTTCGATAACGGAGCTCCGGGTCA")) -(assert (= z "aucagaugaggggca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 deleted file mode 100644 index 1da0d4bf6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0078.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAGAGCTCACGTCTTGTGGAAGACACTGCATATACGGCTCTAGCTAACCACGCGAATTCCGACATTTACAGCTCCCATATGAAAGATCACATCCCGTTCCAGAACTGGCTAGATTGTAATCATTTTATCGGGAGATGCTGGTATTCAAGCATGAGTACGTGGCATACCTCGAACGGAACTACAACTTTGAGTCACCGTT")) -(assert (= z "uaaaaaguuacgcag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 deleted file mode 100644 index 7b20b2f69..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0079.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCTAACCTTATGCGGTCACGATGGTAATAGAACTCGAACAAGCCTTGCGCCGCTGCGGGAGCCCATTAGTGCTCTTTACCTACGCTCGATTAGGCTTTCGGTACAGGCTTCCGGGATGTAAAAAAGACCTTTAGGTACGAAAGGGCTTAGCATCTACAGTACATTTTAGTAATCATACTGGCATGTGTAGCCGTAATGT")) -(assert (= z "cuaucucgucgcucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 deleted file mode 100644 index 726c1cfbf..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0080.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACCCAGCTTTGGGGATCGGACTTTAAATCGTAGAATCTGAAAGCGTAGCTGCCGCCGATGCTGACGGACACTTTATGCATTGGGTGCATGACGAGATTTGCCTGCTGTCGCATTAGTACACCAGTATACAGTAATACTCGAACCACATATTGAGAGAGTCGCATAGCGCCTGTTGGACCGGAAGGGTCCCCAGCCGCAA")) -(assert (= z "gaggccucccacaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 deleted file mode 100644 index 23f11fbb9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0081.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGTTTGTCCAAGGGACAGGATCAGTAGGTAACACTAAACAAAATGCGCCATTGATTTAAGCCCTTCCCATCTATACAAGGCAGACGTAAGCGTGAATTTTGAAAGATGTCCTTAATCCTACTCGCCGCCCAATGGCTCTAGCTTTCGCGTGCACCGACCCGCACTCTATTTCATTTTAACATCAGTCTACGGCGCATCC")) -(assert (= z "ucuucaugggacuac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 deleted file mode 100644 index 722547c66..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0082.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AACAGGGGACGGTTCTGGTGGCTCCTTGTGCGAAGACAAGTGTTCATCATACTCAACGGCATGTCTACATCTCCAGCTGAGATCAGAGGTGGCTAGGGAAGTCGCTACACCCGCCTCCCTTCCCGTTCTATTACAATTAGACTGAGCTGTTTGCCAACAGGCGCACTCGGGTGCTGACCTATGGATCCATTATGTAGTTA")) -(assert (= z "ccaaaaaucacuagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 deleted file mode 100644 index f00573118..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0083.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACACTCAGAGCAACTACAATTAGGTACTGTCTAGTTCATCAGCCGAAGACCGATAACACCTTGAAGATAGGTAAGGTGTGTCTGAAAAGAGCTTTGATCATTTCAGGTATCTTGGTCTCGTTGTATTAGGGGACTACTATAAAATAATTGCCACCGGTCACTTACTACTTAGACACCATGTGGCTAAGAATGTTCGGGG")) -(assert (= z "aucgcaaaggccagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 deleted file mode 100644 index a3371a963..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0084.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGTAATACTAAATAACAAAGTTAAATGCGTGCAGCCACAAACCTTAAGTTTAGAATATATCCGGAGTTGCTCTGGACCTCACCATAAGGAGGTAAGTTAATACTGATCCGCCTGGTGAACGTCAAAACGCACTGAGCTATAACCGGAACTATGTGCCCCAGCTACCTTTGACGATGGTAGAGTGACTATCCCCCATTGTC")) -(assert (= z "gccgugcuggcugau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 deleted file mode 100644 index ea0f0023e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0085.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTATGAGTGTAGATAGTTTACACATAACTTTGGACAATGGTTTGGACGGAACATCACGAGAAGGGGGTTACATTGATCACTGCCTATTCGTTATGTTAGCACTGCGGGCAAAACAGCCTGCCTAGAGGACAGGGCATAAACGGAGCTTGTGCGTTCTAGGTGAATTACGCTGCCGTCTTCTAAGAAAGAGCTTGCTGGT")) -(assert (= z "gggaguugguugacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 deleted file mode 100644 index 2bc936234..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0086.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGATTATGTTGTTACATCACGCTCCCAACATATTCCCTCGGCCACATCATGCATTGAGAGCTATGCTCAGCTTATACCGGGAAGCGGCAAGCTCCTCCCGAAGGGAAGGATACCCTCTTAGCCTCCGTCAATTTTTCGCTGATTCCAAGAGGTGACAGAGAACTCCGTAGCGCTTAACAGTCTGGAAGAGCTTGAAAAG")) -(assert (= z "uaauccaaucgagcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 deleted file mode 100644 index 89730a32f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0087.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCAAGCTCCAGCGGAGAGACGGGGGGGCCTACGCAAAAACCACGAGAGTTACACGCATGCATGTTTCCATTTACCCGGTGTGGTCTATCACCTTGGATTGGCGATTAAAAGTCGCTTATTTTTACGCAACTAGATTTCCATCCCTGGACGGCCAAAATGATATTATGGCAGGTGCGGCAATATGGGGCCATGCTCAGAG")) -(assert (= z "cuguaaugauacacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 deleted file mode 100644 index 8ef21d4f1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0088.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCAGCGGTTGGCCCAGTGCTACGACATTGAGAGACATAACGGACGGACAAAAGTCCAACACAGCCATTCGCGTTCGGTGGGGTGAATCCCTTACAGCTGAGCAGAACTTACATCAGTCCTAAGATCGTACGTTTTCATTACCCTTTTGTGTTCCATGGGTACGGTGGTGATTGACTTCCTCGTACTGTGTGAAAATCAG")) -(assert (= z "aaaaauagccacguu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 deleted file mode 100644 index ed4c3ef45..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0089.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTCCATCAGTACCAGCAAAGGAAACTACGTAGGGGGTCTGCTGGTCTAAAGTCTCGGTTATATGTAACGAGTCCGCAGGTTGGTCCAATCGCAGAGCCTCCTTTTGCGTCCTTGGGATATCGCCAAGACCCAGGTCTGTTGATAGCTATGACCAGTATCCGGTTACGAGAGCCTTTATCTGGAGGCTACAGTAATAGAA")) -(assert (= z "ggaagggccguguag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 deleted file mode 100644 index 23b6c68cb..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0090.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTTTGTTAACAGCAAACATAGTCTACAACACAGCATCTATATCCGTCACCTACGCGAAGCGTCAGTGGGTCAGAAGCGACCGGACGCTGGCCCGTTCCCGTGTGGGGATCGTCTTCTACGCCGAGGAATCCACTTAACAGCACGCGGGCTCCCTCAGCACCTTTTACTACATGAAAGAGATGACGGCTAGCGTGTTGTT")) -(assert (= z "aguacucucagugac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 deleted file mode 100644 index c34fac1bc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0091.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCCAGTACCGAAATTTGATCAATGAAAAACGAGCTTGGCTAGCAAGACAGCCCACCGATTCTCGAGTCCATCCGTGACAAGCCGGGCTACAGAGGGTTGGGACCATGGTGGGACCGATCACTCCGCTCAAGGAAAAGGTAGACTAGTTGCGCTATGTCCAAGGTCGAAAACCGGGGAGTCAACACATTATCCGGTGCTA")) -(assert (= z "ggucucuggccacgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 deleted file mode 100644 index 5e92f0a02..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0092.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCCGCACAGTTGCTGTTGTGTTTACATTATATCACACGCAAGATTTAGTTGATACCTCGACTAAATAGCGCGCTACCGAGGCGATCTCGAGACTCGTGAGCTCCTAATGCGATTTTGAGTCACTAGAATGCCGAAGTATAGGTGCTGAGACATCCGATAACGGTGACTAACGTCCTCATTTATTTTCAATCCTTCCGGTA")) -(assert (= z "acacauggaccacuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 deleted file mode 100644 index 09b904211..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0093.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTAGCACTGAAACACAACCCCTGGGTCGGCGCGTGCCGGGCGAACGCTGGACGGCGTCGGTAGAGTCAGGTTCAACCAGATTAATTCTTGGGGCAACGGCCCGAATGAATAGAACCAAGCTAGCGTCACGGTTGCAGGTGGCCGCTGAAGAAGGCTTACGGCCGAACTTATCTTACCGTGGATCCATCAAATGCCGTCCC")) -(assert (= z "uuguuauuuagauca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 deleted file mode 100644 index b9cf9246c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0094.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATCGGAGAATGTGTCGAATATTCAAATCCCCGAATAGAATGAAGTAGCGTTCACGATGCGGCAACCTGTGCTCAACGTTTCCCCGGCAGCCCCCTTACGGTGTAAGATTGTCTTAGATTTGTCATGTGCGATACGGAATTGATTTTGCTCGGGTAAGCGCGCTTGTGTGCGAGTCCTAAGGTTAGGGAAAGGAGGTTTTT")) -(assert (= z "accaugugaguccca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 deleted file mode 100644 index ce4b5f3b2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0095.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CATCACGCTTAATTCTTATCTGAGCCTACAACGGTTCGGTTCCGTGGAGTTTTGTTTGCTAAAACCAGATACGGTCGCGTAGTTTCGCTCGGAAGCCGTCTTTCCTGCGTTGCGCTTGATGGAGAGTTGTGCGACATACCTAAGCCTGATAGAAAACTTAGGGACGAGCTTGCGCATGTGAGTCCGGGTACGCGAGCTCG")) -(assert (= z "gaccgauuacaacug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 deleted file mode 100644 index 0166cbacd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0096.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTAGCCGACTCCGTATTTAGAATCGTGATCATTGTCATAAGGCGAGATAGATATACGTAACCCCGCCAAACATTGCGGTATGCGAGGTACAAAGCACCTATGTTTTGGCATCCCGCGTTCGAGCTATCGAGAGATAAGGAGTTTCGTCGTTATCCGGAATCATACAGAGCGTACCGTCCGCAACTTAACAAGATGTTTT")) -(assert (= z "gaggcuccuauccgc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 deleted file mode 100644 index 476f29c45..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0097.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGTGTTTACCACAACAAGTAGGCACCAGGAGTACATTCCAGACAAGCCAAAATGGTAGTACTGGGGTTCGGGGTCCTGAGTTTCTCAACTCGTGAGGGCGTAGCGGGGGAGTTAGCTATAGCACTACCTGGGGTTCTACTACGACTGGACCCATGTAGAGGAGTCTCCCACAAAATCCCACAACTAACGAATTAGCCTCG")) -(assert (= z "ggcagcuguuuagcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 deleted file mode 100644 index c968b0346..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0098.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGTTAAAGTCATTCGAGTTTGAAATCGCTGAACAGTGCAAGAATCCACTCCCAGTTAGTTTGCGCACGCTCCGGATCTCCATTCTACATATTATTGCGACTGATTCGTGGTAGATGGTCTCGCCAGCCTCGTACATTGCTGCCCTGAGTAGCACTAGCCGTGCCATACCATTCCATAATATCTTGGATGTCATGGCATG")) -(assert (= z "ccucguauuugggau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 deleted file mode 100644 index 0e9be8c47..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0099.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGCGGCCTTATACGTAGGATATTCATGTGGATAAAAGGGGTTGCATATTATTATGTCTTGGTCTGGGCACATGGATGCGACCCGAACGATCCTTTACAAGTTCAAGACCGAAGCGGTACATTAAAGTCCCGGCCGGGGTCCAAAATTGACAAGAGGCAGCCCGCAGACATAGACTGCGCCCGGGCAACGATTGAGAGGC")) -(assert (= z "agacgguucacgcac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 deleted file mode 100644 index b6be5f8bf..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0100.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTTAAGGCTAAAAGCGCTATTCTAATAATATATCTTCTATATCCGAGTTCTTTCCTCATATGTCGGGCTGTTCGTGTCAGCTGGAATCAAACGAAACCAGTGTAAGTCGGAACGACTACGCCAATCATTGATAGCCCTATCTCCATTATCCTTAAATGTGTATGCATATCTCATCCCCCTCTTGATCAAGGTGGTGTAT")) -(assert (= z "ucauccaucuugcgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 deleted file mode 100644 index fe5eafdae..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0101.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGTGACAGACGCCTGCTGCCATAAGGCGCTATCACATGCGTGGCTAGAGGTGGGACTAGAATTTGTCTCCGTGAGTGTGGCTGGCAATCATGACTGACCTTCCGGGACGATGGAAACGTTTGACGTCCGCAGGGCAACATAGCCAACTGTTCCGCAGAACCAAGAACACCGATATAGTCTAAAATTGAAGCATGTTCGT")) -(assert (= z "uguggucaaccgggg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 deleted file mode 100644 index 9ac7372d1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0102.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTGGGTTGATGACAATTTACTAGTGCACTGGACTACCGAGAAGAAGTAGCTTTGTCAGAATTATCTCGCCAAGGAGAGGACACCCGTTAATGGCAGTTCACATCGTACAAGGTCAGTACGGCAGTACTATGTGGGCGAGGGAGAAGCTCGAAAAAGTCACTAAGCAAAGACAAGCCTGGCAGTGGTCGTCACGGTCAATT")) -(assert (= z "agggccgcgcgacau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 deleted file mode 100644 index 99b8ef703..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0103.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCCCCGAGGCTGCGTGTTGTCAGTATGCAGCTCCCTCAGTCCGTCATTTCAGAACTAGCCCTAAGAATTAACTTAACGGTGCCGACTGAGTCGATGGCAGGGGAATCTGACCGAGGCCGGCATACGCGATACATCGCCACGTAGAGACGTTGGCAGCGACACTTTGAGACGATTAAGATTACCGAGGATTGCTTCACCCC")) -(assert (= z "auaagugaggagagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 deleted file mode 100644 index c11900861..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0104.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACCTAGACCGGGTAGCCAGCGTCGTGCTTCCCGTTATACGAGGTGTAGGACGAGATGTTCAGATAATATAGGAGGAGCTCCGTGTCTGAGTTAGATGACCCAGGTATTATCTTATTTCCGACACCTGGTGCGGCCGGAGGGAGCAACATGCAAACACTTAAGTCGATGTCCAAGCCGGGCAGAAGTATGTTGCATAAAG")) -(assert (= z "gucucaggacuacgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 deleted file mode 100644 index 6faed5b0c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0105.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCGTGGAATTCTCTGTTTAATTGTACCCCACGGATGATGTAATTTGGGCTAGTATGCGTTTACGTCGTACTCGGAACGCCTGCTCCCTGCGGACGTACGAGCGGCCGGGAGGTGGCCTAAAACTCATAGGACCCGGCCACTAACATTCCAGGCCGGGGCACACCTGGCTCTTAACCAATAGGAACTTTGTATGGATTAGC")) -(assert (= z "aacauauguccgcug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 deleted file mode 100644 index aaac7be67..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0106.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGTTTGCACGACTCTTAAACCGGCGACGGTCCAGAATGGCTACAACATCCCAACTGGGGTATATTGAAGTAGTATTCCTCTTAAGCGATGGACAGCCCTAACGCATAGGACGGCAGCCTGACGTTAAAACTGGCTTAACAGTAGGGGCGCTATGGCATTTTTCTAAAGGCTACTGTACCGACGGCGCACTGAATTTATG")) -(assert (= z "ggccauguuacugug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 deleted file mode 100644 index 7b20824d5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0107.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGAGGACATTCAGAGTGGGGCGGTAATCGGATTATGCAGGGCTTGTATAGCGAAGCCTTACGTATTCGTTTTAAGTTACTAGCCGGGGTTCGGCTTTATCGAATCAAAGACCGCGATCAAAACTTGCTGAACGGCACAGTCAAGATATGCCCCGGTCCTGTAATCAACGGATGCGATAAACAGCGAGACGACTTGGCGG")) -(assert (= z "uauaauaaaacgacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 deleted file mode 100644 index dbd6e1f22..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0108.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACAACCGAAGTTGATCTCCAGGGATGTGTAGATATACTGGTGGTAAAAGTCATCCTTCGGTGCGCTCAACGCGCGCATCACCTGAATTTCGGGTCGGTAAAACTCATCAGGCAGTATCCGGTGAATCAAGCGGAGAGCGTCTTCTTCTAAGATCATCCCTTCACGTACGCAAACTGTTACAACTTGAACCAGGCGTAAT")) -(assert (= z "uaggugguagaaaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 deleted file mode 100644 index a24f650f3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0109.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGTCAGCACCTTTGTTCCGTGCTACGATTGGGGGGGCTTATTCTTATTATAGTTCACTCTACTTAACATCCGACATATAGATCGGTAGAAACGAGGGGTGACGGCCGTACCTTTACCTCCGGACCCTATGCGAGTCGCAGTTCACCTCGCTTGCTGATACCATGACACAGAACTGGTTTATAACGCTTTTCGATAGATG")) -(assert (= z "gaacaacgaucccug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 deleted file mode 100644 index cb52c1d4e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0110.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCACAGCAGTGATTTCAAGAAGGTGTTCCCTGGTCTGGACACCTGTTATTACTTAACTCTGTGGACTTAACGTCGGTTGGCTTTGCGCACAGACTCTGGTGTGCCCGGGGAGACCCTATCCAGGGACACTCATGAGACCAACAGACGGGCTGCTCAAACGAACACCGGCTGATAACAAGTCTCAGGTATCTGCTGACAC")) -(assert (= z "ugccacaugcugcca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 deleted file mode 100644 index 2a9d9999a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0111.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGTGGCCTCAGGTAAAAGCCCCATAATCTGAGTGCGCTCGCTACCAGCAGTCTTTAAGCCTACCAACATCCCGTACTGGCTTTAAGGTATGGTCTGCATGCATATGTTTAGTTGAAATAGACCTACGGATAGTTGACGTGCCGCTAAAAATGCCGCTAGTCTAGCGATGAGAGAAATGATGGCAATGGGACGGCATATA")) -(assert (= z "accuuuccaugcgga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 deleted file mode 100644 index 8dfeea3ad..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0112.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGGGTATATTACCATCTACAGTGCTTGCATGTGCGTGCTATCTCTGCTTCCCGGCCTGTTGCGGGATTGCCTTCTAGAAAATGAGAGGGCAAGCAGCACGGGCTTGTTGGCACATTTAGGCCCGTGTTAGGGGTACCAGAGTGAACAAGTATTCGGTAATATAACCTGCGTAGGCCGATCTAACAAATGTGTGTACGGC")) -(assert (= z "ggccuguuuuucgcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 deleted file mode 100644 index 999d7287f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0113.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCCTCAATATATTTACTAATCACCAGGGAGGGCGGTGGCTAAGTGCATCTCTTCTGTCGCCAAATAGGAGGTTGCTTCTTACGTCACGCGGAGCGCGTCGGCCATAGAACCAGGTGGCAAGGGCCATGGGTACTATATCGTCGTAAACTTGACCTGGTTATGTCGGATTCAATCACGGTTCTCCGTAAAACGTGGCGCA")) -(assert (= z "agugggagagacgcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 deleted file mode 100644 index 22d098494..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0114.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGTAGGCAACTACCCATTTCGTCGGACAAGAGCGTGCGAGTGCCTATGCGGGCAAATTACGTCCAGCCCACGGCCAACGCAAGGAGTGTGGGCTCATCGCAGAACTATCACTCGGGGACTCAACGTAGCGAAGATGCTCATCAGCAGGAGCGTTACCCTTACAAGGACCTACGACGTGATTACCCGTTTAGGCGCCTAC")) -(assert (= z "auugccgauuacuag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 deleted file mode 100644 index 40655fe0b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0115.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTACGAGGGGAGCAGTATCAAGTCTTCTCGGCCCGTAAGTCCTATACCGAACAAGCGTCAAAATGCGCAGCTGCGTGTATGATGAAGGACAGTGTTCCCATCATCAGTAGCTACCATGCTCAATGAAATTCCTCTTACTTAGTGTGGCGGGTGCGATGCAATGCCTTACTAGTAACACAAAACAGCTCATATCGCTGCGC")) -(assert (= z "guugcggaugagaca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 deleted file mode 100644 index c8fa0714a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0116.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGTTGCCCCAACGTCCCTCACGGATCTGGTGGTTCAATGAGTCCGCGTGACTTCCATGCGCTCGTCACGGCCCCCTATGCTGGTGGACACGCTGTCAGGTTACGACTCCAAAGCGAAGACGCTTGCATTACTCCCCGATCTCAACCATGCCAGAGCCAGCACACGTAAAATCCCGGTCCTTTCGGCTCATAGTCATGAC")) -(assert (= z "caugucgguauucgc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 deleted file mode 100644 index 3c3cb7c5d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0117.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGAGCGTGTGGTTAACGAGACGAACGAGGAACGCGCGGAGGGATTCGGTGTGGTGATGCTCAGATAAGTACCTAGGGATTAAGCGCGAACCTGCATGACTTACATCGTGTAATTAGTTCGTTCCTCTCCGTAGCTCCACTCTATACCCTCAGCCGGCGGTTCAGTACAGGCATGTCTTGTTCGTCCGTCATACTGAGGCG")) -(assert (= z "ccagggcgauacauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 deleted file mode 100644 index c31b65f19..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0118.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGCATGTGACGCGAGATTTCCCTGTCAAGATCCACTGTGTGACCTGGGCAGAGGAGTTTGGAAGGGACGATGACCTTGGATCTCCCGGTCATTCCTTTTTGTAAAACACACATAATATTACAACTACGGGGACGTTAAGTTTAAAAACAAGCACTGCATGGCCAGTAAGATGTGGTAGGCCCCATTTAAATCAAGCGCT")) -(assert (= z "acguugaggcgaauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 deleted file mode 100644 index a88d22e33..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0119.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGACAGCCGGGTCACCCGGTACCCTTGCCCCATGACAGGAAAATCTGAAAACTTTATCTTTCTTGCGAGTTACATTATCAAAACGTCGTCAGGGATCTGCATCCTAATCTGGGAGGCCTTACATGCACGATGCCCGAATCCATTTCATTAATGATACACGGAGAACGCCTGGAAAGAAAAGAGTACCGCATACATGGGCA")) -(assert (= z "agccgcuauagucaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 deleted file mode 100644 index 5e9809c82..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0120.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACTAATTAAAGAGCTACGCGTACCCGTGAGAGAGTCGTAACTCAAAGATACACGGATGGTCCTCCCGGTGTTTCATGGAATGGAATAGGCGTGTGTTGTTCCGAAGATCGTGGAACGAGCATGACTACACTCTCATTCTCCATCAGTGGGAAGCACGTACATTACGTAAACATTCAACCGCTAACAGTACTTCGCCCTC")) -(assert (= z "uugaucgcagggcua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 deleted file mode 100644 index 2e7857398..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0121.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCAGCGCCTGCCGCGTTCTGAAGAGACCTGCGAATATCACATACTGGAGTTCATAAGCGGACCGTGTGACTTTCGAAGCTGATATATTATCGTGAGTTGCATACCGACGATGTACCGTAGAACTCTCGGAAACCCCGCATAAGAAAGAAACCGCGCATTCGCTAGAAAAAATACGGTTAGTGGCCTGAGGCATGGTTTCT")) -(assert (= z "gauagauccguaaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 deleted file mode 100644 index f88a470a0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0122.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCAAGGAAGAACCGCCTGGCAGCAGGGCGGCTAAAAGGTAAACCGACCCCTATGTAGGGTTACGCCACAAGGGGCGAGTCTGTGCGTCTAAGGATGTGTTTTAAGGGACACCAAGCGACGGTCGTCGTGGGCTGTAATGTAACGGATACAAGCCGACCCATCGACTTAGGTGCGGATACGACCTCAAAGATGCCTTTAAC")) -(assert (= z "caccgccgcaaucga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 deleted file mode 100644 index 148b9ea9a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0123.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACAACGGATGAATTCGGATAAGGAAGCCAAAGCCATCAAACTACGTAGATATCACATTAACTTCCCTCCAACCTTGACACTTTCGGTCAGGCCATCAGATGAACGGCTCCGCGTCACCCTTAGATGTTTTCTAGTAAATGTTATCTTCGAGCGGAGCCAAAAAGCTCTGCATATTTTCTTCGGTTATCCCGGACTTTCA")) -(assert (= z "gaccgcaaaagucuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 deleted file mode 100644 index 3e42a430a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0124.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAAACCTCAATGCCCTCGATGTCCCGGAATTTGAAAAGAACCGATGTAAGAAGGGACGATGCGAACTCGTGTAGTGCGCGACTTCAGTCTTGGGGCTCTGCGTCTCCAGCGGTTGACGTACCAACGCCTTCACCTAGATTTAAATGAAAAGATCCAGTGCGGAAAACCACTTCCTCCCATAAAGAACGATCGAATTTACA")) -(assert (= z "cauacuggucagacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 deleted file mode 100644 index 2709ac202..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0125.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCGCCAGGCGTACGCGATTTGGATAGAACATGACGCTCAGCCCCCGATTCGCATCTGGGACGCAGAATGTTGTGTCCTAGCTCACGTTGGGAACCCCAGGCAGACGACACCCGCAGGCATATCGCCGCGTTGTCACAATAAGGGTTGCCCCGTTAATTGTCTTTTAACCTTGCACTACCGTACATGCACTCGACAAAGG")) -(assert (= z "uauuagcgugauuug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 deleted file mode 100644 index 76620402c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0126.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CATCCTCCTATTAGTAGTGTACTAAGGACCACTTTATCGTTTGCTTTGATGCGGATAACTTATGCCGCACCTAAGTCCACCACTAACTCCATGAGAGTACCATAGGCTAATCTTCACCTGAGGAGCGTTAAATGTGTGGACAACTTGCACGCAAACACAGTGGCTCTCTTACCTTGCTTACTGGCATGAATCGGAGAGCG")) -(assert (= z "cgcuucaacugaaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 deleted file mode 100644 index e89474306..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0127.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGGGCCTGGAGCGTTTGAACCCTGTAGAAGCGCTGCGTTGAGGACAACCTACTGTTTTATTTGGTGGGTAGGATCGTTGCGGGGCATATGGCCGACACACGTGACCAAGAACAAACGGACGGTGCGCAGTCCTTAAAATGTGTTAATGGGGGTTCGAACCTTATGGCGGACACGGATGTGGTGCGGTAGAGTTATTTGT")) -(assert (= z "uaaggggacgaacac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 deleted file mode 100644 index c0c87c260..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0128.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGTAGCCGTTACTGGTACATCGATTTCACACGCCCCGTGAAGGAGCGATGTTTCCGGCGTTCTACTGATTGCTACACGCGTCTTCTCAGAGGTTGTGAACTTGATTATAGGCATAGGCGCAGCGTCATAGACGCACGCGGGGAGAAACGCATTTATGCTGTTGTCAGTGACGGCGGTTGAACCGTGGATAAACTTTTTGG")) -(assert (= z "acgggcuagucuugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 deleted file mode 100644 index 9443438da..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0129.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCCCAATGATAGCGACACGATTATGAAAATCCTATAATTTTGATCGAACGCACAAGGGTGCCCGCTGGCTACACTTTATAATGCTATCACAAGTGAAGGTCGTAAATTATTTGAGCACACAGCAGCGTTCTTGCACGGCTTCGTTCACGAGCCCACCTCGCTAGTCGATGACATGTAATTGATGATTGCGCCCCGCAGAA")) -(assert (= z "caacuuaucugcccg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 deleted file mode 100644 index 7a86a5ea7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0130.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACTAACGTTAAATAACAACTATAATATTAGGATCACTGAAATTGTGGCCAATTTCTATCGAGCGTAGGGGGAATGCAAGTAATCCATTCTACATATATCGCGAAAAACCTAAACCTCACTTCGTTACCAGTGATGAACTGGGATCACTCGATAAACGGAGCGCATGCATATTGCGTACGCTCCTAGAGATTAACAGCCC")) -(assert (= z "acagacgacucagaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 deleted file mode 100644 index 58d26fe5d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0131.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGATTGCGTCAGTTCTCCGCAGGTTCAGGTGGAGCTGAGAGGTTTCGAGTTTCGACCCGTTCGTAGCCCGTTCTAGACTGCTTGACTACCGTTGGAGGGTGGGTGCACGCTGATGAAACGAGCCTGTCTAAATTGACCTTAAACGGATATAACAAAAGATTCGTGTCTCTTAAAGAGGGTGATGAGAATCTACTCTTCA")) -(assert (= z "agguguguagaccuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 deleted file mode 100644 index d6105f700..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0132.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATGACATTTTCATAGCGGTATTGCGTGTTCCAATTATAGATCGCCATCCAACTGCTATAATATCATACAGCTATTCTGGTTGGAGCAGCAATGAATAAACGCTAATTCCCGGCGAGCTATGGCGTGGCCGAAACCAAGCCGACAGGGGTAAGCCATGGGCTTAAGGCTTCAGGTAGTGTCGTCAGGAATACAACGTAATA")) -(assert (= z "aggaggucgcaacga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 deleted file mode 100644 index a90a26c66..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0133.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGTGTTTATATCTATGTGTGCGTATGCCATGATGTATCCTATAATTTGAATTCCGCCTTATCTCTCCCGTTGATAGGCGTGTCCTGCCGAAGTATTGTTCAGAACGCTCTGGGGCGAAGAAAGGTGTACGCCGCTATCTTTGAGCGTCTACGCGTGTTTCTCCATATGCGTGCGTTTCCGTTTCCAGGTCATCCGGGGT")) -(assert (= z "uuuccucgccggauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 deleted file mode 100644 index f68e02169..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0134.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGACGGAAGATCCTCGTAAGCCCTCGCTATCGAAACGCTCTCATTGCTGCAGTTGCACAAGTAGTGGATGGAGATCTATTTACGACAGCAAGACCTTATAGCAGGTACATTTCAGTGTGCAGCTTCCATAAGTTACTGCAATGGTGTTATACGCTTGCACCGAATTGGCATGGACACCTCTCCCTAGACGATTTTGTCA")) -(assert (= z "gguacgagacuauaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 deleted file mode 100644 index fce17bf09..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0135.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACTAAAGCCCTACGGCAAACCTCTGACCAACCCACAATACCTAGAATCTAGTCTCCCCGCGCGCTTCTTCCCATGCCTAGGTGAAAAATAATTGAGCATACCTGGTTGGCCAGCCTCATGCGGTTACGCAGTTATCTTGTTTGGCAAACGAGACCTGGTTGGATTCCGTGAACAAATCTGCTGAAACATAAGCTATTGG")) -(assert (= z "ucccggcgccaucgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 deleted file mode 100644 index 4ab979d3b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0136.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAACAAACTGGCTCCAATAGGCGCCAGACTATTAAATTAACAGCCCCGCGAGAACGGGGATTGGGAATGAAGCTTAGGCTAGTATCTGGGTGTGGGACATTCCGGCCTCAGATTCCAAAATTTATAGGTAGCCAGGTTGTGAAGTTGGGCCAGGAACGACCGACGGAGTCTGTAAGCCAATGTTCACCGTGTGATCCTAC")) -(assert (= z "ggucuaaggccgugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 deleted file mode 100644 index f34e8aff0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0137.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCCTACTTGGAAATTTACGTGGTGAGCACAAACTGTCTTAAGTATAAGAACAGTGATATCGGAATCCGTAACTAAAAGTCAGTTATCGATCGGTCCCTCGAAGTATCTCTCTGGATGGCAGCACTGGACACAACGACCGTGTGTGGGCCACCATCCGCGCCCGTCGCTGAGTTTAGCATTCTCGAGAAGCGAGTGCTTCT")) -(assert (= z "aaccgguagcgcacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 deleted file mode 100644 index 450d76be2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0138.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCTAGCCCCCGCTCGTCGTCCACGATGCCTTTCTCCTACCCCTTTCCACTGAACGCCTCCCTTAGTTGGCTGTGACATGGTGACTCGGGGAATACCCACTCTAGGAGCGTTAGACGCTGCGTCCGCGATTTGAGAGTTCATGGGCACGTGTAGACCATAATAAGTAACTAAGCCAGGCACAATATCTGCCGTCACTAGC")) -(assert (= z "cugccgauaagauga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 deleted file mode 100644 index 0d2017073..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0139.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGCTATCTGAATTAACCTCTAAAAACTTTCATACCTTAGAGGGGTGCTAGCGTAGCACGCTGAGTGCCTGTTCGTGCTGTTGGCTTGAGCAAACAGGCGTCCACAATATCGACGAATCGGCTTTCGAAGTCGTCACATGAAACCTTGGGCATGTTGAGGTGTGGCCTTGTCCCCCGAAACAACCGTTCGCCCTGCTGATC")) -(assert (= z "uucaguugcauccua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 deleted file mode 100644 index b57c9c806..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0140.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTGAAGGCACTTTGTCATCATCGAACCATGTGAGTTACACTATAGACCAACCGATTGGTGTTCCGGCGCTGAATATCGAGTCGCGACCTGCAGTTTCCTATGTATTTGGGAACCTCTAGGTTATCGTGAAGCGGTGATCTCCTCCGTCCACGAGCATCGTATACTAATGTTTCTAAAAAGCGTGGCAGGAGGCAGTTAT")) -(assert (= z "uagggcaaugaauga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 deleted file mode 100644 index 92ede4d4b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0141.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACAGCACAATAAGGTGACGTGTATATCATTCCGCTCGGTGATCTTTGCGACTGGTCACCTAATCTCCGGGAAGTCGAGATCTTCTTCTCCACCTCGTAGGTAAAATCTTGGCGATCGAAGCTCGGAACGACTGGGGCGGTCTATCATTCCCATTGGAGTTCTAAGAAGAAAGCGCTTGGTCGGTTTCATCTATTAAAAAT")) -(assert (= z "acaaagguccgcucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 deleted file mode 100644 index c99163a4c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0142.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCTTTATAATGATCAAATGGCATGATACGTCGTTGGTGCCCATCTGATAGGAGCTCCTGGGTAACCATTTGATTAGGAGATATGTTCAACGCCCGCACGCGCAGATACACATGAGAATCAGCATAAATTTAGTCCGCCGCATACAGATGCTGCCTAAGGAAGTCGTTCTTTATTGTGAAAGGCTCAAGGTGTAGCGGCT")) -(assert (= z "acauacaauaguaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 deleted file mode 100644 index f3782ed18..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0143.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACGAGTCGTTCTAAGATGCCCCCTAAGCTTCCGGATAAATCGTGATGCGGTGGGCTGGCTGTCGACGTACAGAGAGGTAGAGACCATCCCCCAGAAAACAGAATGCTGTCCTCTTGTCAGTGTCCGTGCCGGGCCTGGGCTACAAGCCTTAAAAAACCGCGCGCGAGCGTACTACCCTTAGCCTCGATAGACGCTGGTCC")) -(assert (= z "ggguuuuauuuuugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 deleted file mode 100644 index 9eabbe249..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0144.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCGCCTTATACCCATAACGATAACGTATCATGTGTTTCTTTCGATTGGAGCGCACGCAGTGCCCCAGTTAGCCCGATGTGTAGAACACAGACTATTTAGAAAAGTTACTACGGAGGCGAGCCACCCGATCTCTCGGCTGAGTCAGCGCATGAGTCAGAACACAAGTCCACCTTGTGGCTTTGAACCGTTTTGCGCGCGTT")) -(assert (= z "cuagcuaacaccaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 deleted file mode 100644 index 7bab255cf..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0145.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCTTTCGCCAGGTGTGTCAGTTGTCTCTAGGGTCACTGCGCCATGACACATTCTTCCGGATGCCATATTGGTGTTGGCTGTCGCTACTTACCCGTGACGGCTATTCGATGACCCACCTTCAGGTTCTATCCATAATTATACGACCACGGAGACGTTAAGCCATCGAACCCGACTTCCTTTGCGTCCTGTTATATCTGTG")) -(assert (= z "ucucagucuacaguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 deleted file mode 100644 index d456ff5ec..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0146.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAAGTCCGGTCCGAAGCTGTACGCGGTAAGCTTGGACAATGAACATGACGTAGAGAGGCACACAAAGACCTTAGTTACCATATGCCAGGCGATCCAGCCGGTTCTCCTTGCCCCGTCGGGCCAACTACAAAGTTCCTTGCAAATCGAATTGGAATTGCGAGCTTATAATTCGGATTAATTAAAAAGTTTCCGCTGAAGTC")) -(assert (= z "ucuggguaaucgacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 deleted file mode 100644 index ae6166374..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0147.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTACAACGGCCCTGGATAAATCAGGACCAGCCTCGGCCAAATGCAGTTTGGACAGGACACTTGGGTGGAACTGGTAGAGGTGCTAAATGAGCTGATCCCACCCTAAGAGGATCTAAAGCTAAGGGAGGCTAAAATCGCACTGGAAGAGGGGCGAGTATCGTTAGTCGCAGATATTCTACTGGCCGTATATCGAAGTAGA")) -(assert (= z "ggggaagaggcuauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 deleted file mode 100644 index ad267dbb1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0148.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGGCGCCACATCACCCGCGCTATAATGTCTTCAGACGTTTGGCGATGCTCATGGCGAGACTGCGATCGCCAATGAGTTATGGCCGCTCTGAGGAGCGAGCTGCCGGGATAGCGTGCCAATTGAGATTTCTGCCGGGAGCTCCGAGCAAAGATTGTCTAACGGAGGCTCATCACAGCTGATTCAAAGCCCTGATATGTAG")) -(assert (= z "cgaacaggauaccga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 deleted file mode 100644 index bf3ea25ee..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0149.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAATCCTTAATCCCTTCCCCGAGGAGCGGGACTTATAAACTCTTGGGCAGTTTAAGTCCCCAACGAGATATCGGCTAATTAAGATTGACAGACGACTATAAGGGCGACCTGGTTTCGGTAGATGACCCCTGGGGGGTTGGATGCACCGATCGATGCACATAGGCCGCTCCGTCACCGAACGCATGGGGATCTGTATCAGG")) -(assert (= z "gguccaaaauagacg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 deleted file mode 100644 index a1941f642..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0150.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GATAGGTATGACGGCCGAGACTGCAACAACTTTCATAAGCCTTAGTATTCCGATATGTGGACTCTAAGGTGCCCTCACTTGACTCAAACTGAGCCAGGGGCATGGCGTCGGGGCGTCATCTCCCATCAAATGGCGTAGAAGACACGAGTGAACTCAGTGAGTCGTGCCGTTCGCCTAGTGGATAATCAAGCGCCACGAAT")) -(assert (= z "gaaacagggacaucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 deleted file mode 100644 index e7119f040..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0151.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTTACGGCTTGCCGCCGAGCACTAAAGAGCTTGATAGCCGGATGCGACATCTATTGATGAGAGCTTATGGTAGCCTACCATCTCCCACTTACCCCCAAGCGACCTAACTGATGGTGGTTTATCGGGAGGTCGCCCTATCCATAATTCGTGGCGTCAGTAGCGCAGCATTGTATACTGCTGAAGGATATTCGTTTTCATC")) -(assert (= z "cacccuuucaaagac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 deleted file mode 100644 index 02d161bcc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0152.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCCCCAACTAAGCAAGCGTCCTCTTCCGCGATGCTATTAGGACTGGCTAATAACCTGCTCTGAGGGGCGTTCGGACTCTTAATAGGCGGAATGACGCTCCTGTCCCTTTACGGGCCGTGCACGAACCAAGGCAAGCCCTGTCCGCTATAGGTGTGTGTTAAGCCGCCCTACGGCTTCGTCGTTAGTGTGCTTGTGATCG")) -(assert (= z "cuuuggcaguucuac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 deleted file mode 100644 index 97dc7773f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0153.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCACAGTCTCCTCATCAGCACATATTTATTCGAGGTGGCGCGAAACTTACGTGCATAGACCCTAATGTCCCGGCTAAACATCGCTACAGAAGACTTCTTGCCGCCCCACGGCATCCCCAAACTATGAAGCGGGCCTTATTACTGGTTATAAAGGGGAAGCTAGTTACCTGTCCCACTTATGATCGCTCGTCTTCTTAGTC")) -(assert (= z "agucuucgaucucca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 deleted file mode 100644 index cef99ed02..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0154.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTAGTCTGGTTTTCGGCAGAAGGTCTTCCAACTTATGCTCGAAAAAGTCAGATTCTTTCCAATCCAAAACCCCAATCAGCGTTGCACTCCCACGCTGGCCAATACCGTGTCCGAAAACAATCTTTTGGCGCTATTCCCCTTCAACTTCGCAGGGGAAGATCTGACGGTAGACTGACCAAGTTCCCTATACAAGGAGGGTC")) -(assert (= z "ggguacaggaagaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 deleted file mode 100644 index 91dac0a5f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0155.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCCTTGCCCCACCATATCACGTTCTCCGTTATACAAGTCTTGCTCCCGCCGAGATACGATAAGATATTCTAGGAAGTACTCTTAGGAATGAGCGATTCGTATCAAAGGGCTCGAGCCAACTGCGCGGTTCGGCGTCGAAAGTAGTAACCTCTGGAAGAAAGTAGGGGACGTTATGCCAAGAGTGCGCGAGACCGATCTC")) -(assert (= z "gucgaauacacugac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 deleted file mode 100644 index 2f8e73d72..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0156.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AACGTTGGTTGGTCTCGTGTCTAGCCAGCGCGGTAGTTAGGTCCGGTACTCCTGTGCTGAGGAGGACGATCGCTTATCCGCAACGCTTACACCTGTTGCCGAGATTCGGCATAAATTCGAGGGGGAACTAGCTTGTTTAGCTTCGCTATCAAGAACTTTGTCGAGCCTGGCTTATTGTTAAGGATTCCCGGATTGCCTTG")) -(assert (= z "uguaguuacacccgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 deleted file mode 100644 index fc7b911a4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0157.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATATGTACTGGTCTCCCCAGGTATCAGGCGTATTTCATCGAAATCAGACGTAGGCGCGTACAAACACTTGGCCTTCGGCCGCTAGCTGCAAGTGTCCAAGCCGTCCATTCGGCGGAGAAATCAGAAAAACAAAGTTAGACCTTTAGCAACCTACACCTATTGTTTCGCAACGGAGATACTCCTGTGTGTAATAGTTTTT")) -(assert (= z "cuucuuuuagucgcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 deleted file mode 100644 index 3efd18860..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0158.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCATATCAGTCTCTTCTTTCGGGCAGGAATCTTGATGTCGTGCTAGTCGTCTGATCTTCCAAGATACATTTCGACCATAACTACTCAACATCCCTCTCAAGAGCGGTGGTCATAGGGCGGCAGAGCTACGGCAGGTCCTTTAGATATCTGCCATTCAGCACGTTTAGTGATATGACTAATTCACACGGTGTAAATAGAGA")) -(assert (= z "agagacugcuagagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 deleted file mode 100644 index ae60520c4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0159.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACCGTATGTGAATAATGGCACTCGTATTGCAGACTCTTGTCACTAGACAAGCGGTGGGCGACCTAAATTGTACCTGTAATACTGGGGACCTGGTCGTAGTACTACAGCTTTATGTTTATACCTAGTGGCTCTAGAGCCTTAGTTCAAGGTGTGGCCCCTCGAGTCAGGGTCCCTGTAACATCAATGGTCAACAACGACA")) -(assert (= z "cggucaacauacgaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 deleted file mode 100644 index 9f38d4fc2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0160.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGCCTACTTCTGCGTCTACCTCTTAACCTCCGAGCTTGTAGTATGTTATGCGCTATCGTGACCATGATCGGCTGCAACGCCCCTCTTAGAGACTGTACTATTCTTCTGGCGGAATTCCAAATGGGCTCATGCTGGTATGTGAGGGGACAAAAGCGCAGCATTACGACCCAAAAGGACGTCCTGATCCGGGATGCTAGCTA")) -(assert (= z "accggcgaaccuuac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 deleted file mode 100644 index 95b0f0ed7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0161.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACACGTCTGCAGTCCGACCTAATTTTGGTCGACTAATCGCCGATCTGTTTATGTCGACCGCAGTACAAGGGGGGCAAGCGGGTTCTATACGAAAATATCTGCTACTATACTAAATCTAGAACACATAGTATATTGAACTGAATGATCGACTCCAAACAACACAGGCTGTAGAATCAGCTGATCATTCCGCGCATCATTT")) -(assert (= z "aaguuagguauauug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 deleted file mode 100644 index 4ba561e36..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0162.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTCTACTACAATAAGATATGGGACTACTATTGCACCACAAGTCATACGAAGTGATGGTAGAGTTTGCGGTTGCTCGCTAGCCCAGGCCACCATTATGGTGCGGCAAGATACTTGTAGGATGATTGCTATCTCCGTCGAAGCCCCGTCACCTCTTGTACGCCCTGCGTCACTCAAGATCCCCTGGAATGACTGCTATCTT")) -(assert (= z "aguaaacaagggcgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 deleted file mode 100644 index 92c9c821c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0163.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTGCTCGTTTACTTTTCCATCCCTGATACTTCTCAGTGTTATCATCGCGCACGTACAATATGATAAGAGGTCTCGAACATACACCGGTGAACCATCATGAGGAGCTCACAAAACCTGAAATTAGGAGTCACCTCATTCGGTTACAATAGCCCCCAACACTAGCGAATGTTATGGATCCAATCCCCAGTGTCGGAGCCAAC")) -(assert (= z "cgacgaauacuugca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 deleted file mode 100644 index f9e27dc15..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0164.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTTAATACCGTCGGAGCAGCTAGGCCCTCCAAAATGTTAAAGTGACTGCTTAATAACCCGCGCTGCGACACGCTCATCCTTGGCACCGCGGATCCGACATGATGATTAACAGCACGCCGAGGCAGAAAACGGTCAGCCGACCAGTATCGGCTTATTGCCCCTAGGCGGGGCGGCGTACTCATAGGATTGACTAGATCCC")) -(assert (= z "aucuacccggacccc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 deleted file mode 100644 index 4fdc24eeb..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0165.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTGTGTGTCCCAACAACAAGGCGAGCCCACTTGGTAAGCCGGTTTATACACTCTGCAATTAGCCGGTTAGTAGGTTTGATTCAGGGGGTCTGTGGAATCAGTGCCAAAGGCCGTCCGGGGCTGGTGAGTCTGCAAGATGGGCCGAGGCGTCCTTCGGTAACAGCTCGCGAGCGCCACGCCGCTCGTCACACTAGCGCCCT")) -(assert (= z "acucgugagaccuca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 deleted file mode 100644 index 5406d6e89..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0166.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCACAGCGTTTTATGCTGTTGAGCACGTCTAGTTTAATGGAATTAGCGTTGGGTCGCTTCCGTGGATCCCCCAAGTACTCTTAGGCATTCGTAGTGCAGGAATGACCCAAGTGCCACCCACCTAATAATGTAGTTTGCAGATAGTCGTTTATATACTTAAGGTACTTTCGTTTACCGACGGGCATACGGGTGTTGCCCCG")) -(assert (= z "caagugauauuuauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 deleted file mode 100644 index 65a4e69ea..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0167.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AACGAAAATCGAGGATGTCAGAGAGCGGTCCGCAAAATATCCCCCTTGTGAGCACATGTCGTGGAAATTAGATGTTGATATTTGCATTTGACAATTATAGCCTGTGTATAAGCCCCGTCAGGAGGGCGTCCCCACCCTCGGATTTCTACTCCCGTGGATCATCAGCGCGCATATTTTGTCTGCAACCGAATTCTCCCACA")) -(assert (= z "ggauuuggccgagau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 deleted file mode 100644 index 328a38bab..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0168.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCTCCGCATTCCCTCTGGGTCTCACCATCACTTCCCGTAATATGACGGTCCCCCCGCCTGAGAGATTCGCCCGCGCCATAAGGGCAGGCATAACTAACATAATAACGCCATATAGTTTGTCATATTCCTAGTCAACCTACGAGTTCTCATGCCTATTTTGCCAGTCCCCAAGCCACATGTGTATGTCGGATAACAGGAG")) -(assert (= z "acauccgccucuugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 deleted file mode 100644 index d9f98f331..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0169.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAGGGTGTCTGATTCAGGCTGCCGCAATAGCTACGAGACAGCGGTCTGATCTGCATGACCGACGCCCCTCAGCGTAGACGACCTGGTATATTCCAAGGGATAACGCAACGCTTTAAAAAATTGAGGCATGCCATGACTGAGCCCTACATCATCGGTGGCTCTGTTCTTTTATGAACGGGGAAGAACATTGACATACGCAT")) -(assert (= z "auaugugguaaguaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 deleted file mode 100644 index af2c424f4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0170.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGAGTGAGGATGTGCGTCCCCGCTTATTTATGAGTCGCGGTAGCCTCGCCGTGGCATAATGCGATTTTCTTTATGGACACTCATACCTGGGGAAGCAGATGGGACTCGGCTCGTAGATCCACGTACTGATGATCAACACGGCCTGTGCAATACCTCCAACGTGAAGGTTATGTAGCAGCCTATTTCGGTAGGAGATTTTG")) -(assert (= z "ccagcuaggauacaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 deleted file mode 100644 index a73737a5d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0171.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CATCGCTTGCTTGTTGACGAATGCTGGGAGTTCGATAAGCGAGCTAGCCATTGTAGAAAAGGAAGCCGACGCTTTGGCTAAAAACACCGGTGTCGTAGTTTCTGTGCGCAATCTCGGGTTTACACAGTACGCCTTGAGCAGAGAAGGCGTTACCATGCATCGTAGCAGAACGTCCCTTACCAGACAATCAATATCTATAG")) -(assert (= z "cgccggucacacggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 deleted file mode 100644 index f117cb9f6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0172.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACTCATGTGTTTAGGCATCCATTACTCTGGCGGATACAGGGTCCATATGTTGCATCGCGAAGGTCACGTAGAATGTGTGAAAATTATCTCCAATAAGTTCCGGCCCAGTGCGATTCGCAGGCGTCATGGCGACGCACGCTTGATAATCGTGGGTCACGCAGAGATGGATTTTGGACAACCAGTCGGTCTCCGGGACTCG")) -(assert (= z "guauaaacacuaagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 deleted file mode 100644 index ceda7db34..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0173.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGAAGGGGGTATGACGCAGTGAGGGGCCGTGATTCTCTGTCCCAGCCAGGTGTAACCTCATAGGCCAACAACCCTCGGTAACTGCCTTGTGAGGGATGAGCGTTGCATTACATCGAAATGCGAATCGCCATGGTAATCTGCGACATTAAAATAAAACTGTCGCTTGCGATCTATCAATGGTTATACCGGGACTAACGGG")) -(assert (= z "aacaguuuaagacau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 deleted file mode 100644 index 511b6281e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0174.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCATCGCCACTAGACTCCCTGGCGACATGGAGACGATTAGCCCGTAACGGCGTGTCTCAATCGGAGATCCGGACCCCTGATAATAACCACTGACCTTGCATATATGAGATATACGTTTGAGTCTCTAAATGGAATACTAAAGAAGGTAGCGCATTAGCGGTCAGAAGCCGAGCCATTCCCACAGGTGGCACCGCGGATAT")) -(assert (= z "gcaagaguaggaagg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 deleted file mode 100644 index 2d197e893..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0175.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAATGGCACAGGCTCCTGAGAGGAGTGATTCCAGGCGATGCTGAACGAGCTCGCACCGATATCACCGGGTCGCAATCACTTGATGACACCGCTATCCCCAACCCCCAAGTAAACCCGCGAGCGACGCTCTGAGACGTTCTCAAGAGGCGCAACTCGAGCAGTTCAAATGCAGAAAGTGCGGGAAACAACTGGCTCGAGTC")) -(assert (= z "ucuacuuggaccuaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 deleted file mode 100644 index c26ef0b2c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0176.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CATGATAGATTTCAGTTGTGTGTTGCAAAGAGAAGGACCTTGAAGACACCCCATCGCCCAGCCTCTGTAAGCCGCTGCTTAGGGTATTCGTGGTTCGCCTCGCAGCAGTTAATTGTCGATACACACCCTGTGGCTTTTCATCCTACTATCATAGACTTCGTGAGAACATGTTCTAGTTGGGCAGGGGAACGTTTAAGATC")) -(assert (= z "cacaggcaagguuua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 deleted file mode 100644 index a20a5dc73..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0177.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTTCTCCGTATTCGTGGAGTATTGGCAGAGCGAGTGGCCTGTTCCTTGGGTCTATAGGAATCCTAGCTGAGTCTTCGAAAACTACATAGATATCCAATATGGACGCTAATCAGCTCTTGGCTCGAAGTCTATGGATAGTATCCCACTCGAGCGTACATCATGCAAAATAATGTGTATGCGAACCGAGACATTGAAGTAG")) -(assert (= z "ucauggagcuuaaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 deleted file mode 100644 index 3df487482..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0178.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTACCGGGATGTTTGGGGCTAGTTAGTGTCGTTGTTGCTTGAGACGTCACTTATAGGCGTAGACCGACCCGTCATCTAAGTCGACCAAACTCCATTCCGCTTAGGAGGGGGGATATTCGGCTCTACGAATTCCTTGAAACAGACAGTGAGGGTACCGCGACGTACCCAGATGGTAATGCGTGTCGCGAGTACGGGCTAG")) -(assert (= z "caucaggguauuggc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 deleted file mode 100644 index bb2905b16..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0179.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGACGGTCTTCCCCGAGTATAAACCCCCGTCAAGAAACCGGTCCTACTTGGTATTTGCCATTAGTTGAGCGGACGCAACAAAGGTGGGGATGCGAGATACCCATAACAGCACCGCATTTACAGGCTCCAGGAATAAACTCGGGGGTCAGGTGTGACGAACTTCCCCGTAGGCAGACTGTGGCAGGGGCGGAAACGGGTCT")) -(assert (= z "caacuuuaccugugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 deleted file mode 100644 index efe073a8f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0180.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACGAGCTTCTTGAAGGTATGCAGCCCTTCATAGTATTAAACCCAAATCCATCCAGATAGAACATTAGTCGTTGCACAAGCTGAGGAGTGTACTAAACCATCTATTGCCCATTTCTCAGGCTGTTGGCGGCACTTCAGCCCGGTCCCACTGGCTCGAGGTATTTTGGTCATGATGGGGCTAGCAGACCCCAAGCAATACA")) -(assert (= z "gguguugcacguucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 deleted file mode 100644 index d18e71d8d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0181.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTTTATCACTGTTCTAGGTCCGCTTCGAAGACGCTGGGGTAGAATATTCAGCTAACCCAAGCTGCATACTAATATAAGTGCCATTGTTATGGCTATGTTAGCGTTTCTTGGACCATAGGGAGACGGATACGCCTACACAGCCATTGAGATCGAAAAGTACAGCCTAGATGCTGTGTCGCTGAAGCAACACATCCGCTCA")) -(assert (= z "uggauacugaguugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 deleted file mode 100644 index 23f2ab147..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0182.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACTGATTAAGGGCTGCTTTCACGCTGTGGGACCGAAGATGTTGATAGGGTACAGGGTTTAGGCATTCGAGTCCTTGGAGACGTTCGTTTGAAGCAGATTGTACAATCTGCGTTTGGCGCATAGCCTGGTAGCTAACCCACTTTGTCACAAATGACTCCGTGGTTACGTATCAAGTGAGGCCCTCCGTCCCCATTGACGA")) -(assert (= z "uaaugcgauauaagg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 deleted file mode 100644 index b9972f57f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0183.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTCGCTTGTTTTAGAATGAGATGTTTTTCGGGTGGAAGCCCTCTGCTTTTTAACTACCAGCCCTAGCATGACACGCCTCTGCGGCTTGCAACCTTCGTCTGGCTTCCCGGCTCCGACCGCCTTCCTGGAACCACTATGGGTGGTACCTAACCAGAGCTTTGACATCCCGGCGCCGAAGATTGTACGGCGCTCGTGGAAC")) -(assert (= z "gauacccgcgucuug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 deleted file mode 100644 index 6e8fb2006..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0184.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCCCGGTACATTTTGCCCCCTTGTGTACGGGGCCGATGCACTCTCATTACCCAAATCTTCGAAGGTCTCTAATAAAACTGCAATCGCCGGGTACGACAGGATAGCATGATTACCCGGGCATAAGGTCGGTTAATTGATCTCACGGGCACGAGTAAGTCATGGGCGTGTTGCTCCACTCAAGGTACAGCGCTAGAGAATA")) -(assert (= z "ugcggcuccguguua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 deleted file mode 100644 index f12aeea2e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0185.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGAGGTTCTGACCAGCGTACTACCACGCAATTGTTCAGAACCTCAAGGACAGTCCGGCCGAAGCGCGGTCGAGGAAGTGAGTAGAGGATGTGAAAATTCTAGTTCCGATATGCTCGTCAGTTAATAGATAGGACACGCAGTCCCAAGTGCCAGTTTGTCGAACTATAGGGAATAAGCCCAACAGCTTGGCGCACACCGGA")) -(assert (= z "aaccguaucucccuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 deleted file mode 100644 index 1d4341743..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0186.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTATAGTATGGATTTGCTCGCTATGATTGCCTTGTCTCAAAAGAAACCCTCTCATATTGGCTCACGGCTTGTCATCGTGATCTTTCGCTGAAACCCCTACGATTATAGAGGTAGTGACATGCTGAAATGCTGGTGGGTGCCGTACTAAGTTTACAATAACATGCTTGCGAGATTTCGGGTTTTTTGCCCAGTACCAGCC")) -(assert (= z "cagcucgagcuaugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 deleted file mode 100644 index efbfca975..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0187.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCGCGCGTACTCTTTCACCGAAGTGTGTATTTGCTTGCTTTAGTAGATTAGCTTAGGTGGCACAACGTCCCAGGGAGAAAACGGAGTATGGCAACGGCACCGAGTGTATGTGACGCTAATCACTGACACCTATCCAGGAGGAGTATCTCGTTTTTACGAGACCCGCAGCCTGTATTGGGAGCCACATATTTCTGCAGTC")) -(assert (= z "ugcacuuuucccgcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 deleted file mode 100644 index 6926d33ae..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0188.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGTAGGATTTCTGAGGTTCTGAATTACCTTTATTAGATAAATGGCGGGATCACCAGTACAGCCGAATCGATTCGAGCATCTGGCGAATAGAGATCATCGAAATGTCGGTTGAGAGGCACTCGGATTCGCACCCCATTAGGCCTAGTTAATTCCTTGTCCGCCATAGTTTAGTCTGTGGCTTGTCAGTGAGGAGCGTGCC")) -(assert (= z "uccuucuacagcgug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 deleted file mode 100644 index 900edfe60..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0189.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTTCCCAGATAGTGAGTGCACCATCTTCATCCCGAAGCTACTCAGCCGAGAGTCCCCTGGTGTATGCAGTGCTGGTATTTGGGAGGCCCGAGTACTCAATTTCTTTAGGGAGGGCAACGGGACGTTGTTGTGTGATAGGGGACGCGGTGGTTTAGTAGTGCGGTCAAAGCGAGTTAATCCCGATGGAGCGCTATCACTGA")) -(assert (= z "guaaccaacgugagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 deleted file mode 100644 index 92d8a68e1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0190.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTTGCCCCAGACTCTAGAAGTCCAATTGTGGTGATCGAATAGCCATTCTAACTACTGGCACGGGAGAATATCTGCCGTCAGTTGGATTACGAAGCATCAAGAAAGCAACTACTGGGATGCCCAGTTCAATCAGTTACCGCATGTGGGCGAGATTCTCGGGGGGGTCATTCGTCTGCTACTGATGTAGTGTGTCATCCGC")) -(assert (= z "cgucgauacaugguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 deleted file mode 100644 index 43eea072a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0191.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGCGTAACCGGTCTGAACGAGTCATTAATTAGGTTAATTTTCATCTAACGGATAATAAGTGCGCAGAGTAACAAATCTGCAGATTGTTGAAACGGGGTGTCGAATACTGATCAACTATATTGGAGAATGGAGTGTAAGTGTCAGTTATAGGTCGAAAATGGTAATTCACGATAGTATTACCGTAACTACGGCCGAGGAC")) -(assert (= z "ucaaaaagaucuggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 deleted file mode 100644 index 8de7e3412..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0192.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCAATGGGCTAACGTCTGTTAGCAGCGGATACTATCAAGTCATCCTTTAATGGTTAAAGGTAAATAGTTAGATGTTTTACTAGGTGTAACAACCTCGCCGACTGGTGCGTGAGATTTAAGAATCGTCGGGACGAAGGCTTTCAGGCTAAAGGCCCGGATAACCTCCCTTTTCCAATCCAGGATCGGCTGCTTAGTCCAAA")) -(assert (= z "uagcccgucaccaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 deleted file mode 100644 index 45f9eab0f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0193.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTTTTTGTCTTAATGTTGTTGCGCACGCATATTATGGACGTCTTACTTTTCAGTATATTGTTCAGCCTCAGGGTGCCTGAGGACTCTTCAACATCCATTCGATAGCCTTCGTGCCAGCAACCCTGAAAGTAAACGGTATTTCTCCGGCATCGGACACAGGCGTCATAGCGTGCATTGAGAGCGTTGAACGCTTACCTTT")) -(assert (= z "auuggucuuacgauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 deleted file mode 100644 index 783f335b6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0194.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCTTAATTACCCAGCGACAACATACTAGTGTTCCGGTATCCCGGGGTTAGCGGGTTGCGGAGGGTATGCTAACCTCGCTCTCCTACATAACGTATCTGTAAGTGGGGACCTCAGGTCTTGCCACTCTTCATTCAGAGACTCCGGAATTCCCAGATGCCCTGGACCCCACAGGGGCAACACGTATGTACAGCAGATCATC")) -(assert (= z "cccaaucgaccgucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 deleted file mode 100644 index 8ec7a94f7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0195.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGACACAATCCCGGTCCGTTAGAACCACGCTCCCTAGAAACGTGCACCCATGCCGACGCCCTTCAACGCCCAGCCCCTCCAGGCTAGATTGTGCTCTCCGCAGAGTAGTCGGTCACGTGACATTTGCAATGAAACATTAACACTGATGATGTGTGACCCTAACTCTGAGAACTCATCACTGGGCCGGAGACCCCTCTTTT")) -(assert (= z "ccuaauuucaauggc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 deleted file mode 100644 index dd9f5a779..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0196.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCCTAACTAATTCCGATATTGTCTATAGTGTATGGTCATATGTTCTATGGCTTCTACAACGATCCGGTGGCCCTAGACCGGATGCATCGGCGTGTATACCTTGCCGCCACTGTCTTGTGGAACCGGGCTGTCAAGGAACGGGTCAAATGAGATAAGCTCCCGTCAGCCCTTCCCGCAACCGCCAACTAGGTTCGACGCG")) -(assert (= z "aucguucuaggaaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 deleted file mode 100644 index b66854417..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0197.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGATTTGAACAGGCTGATTATGGTGATTCGAGAGTAGATTGTTCCGCACGTCCTCGTCCGTTGTATGCCAGCTCCACAGGTGCACTTTTAGGACGTACCGAAGGTGAGGGTTTGGCGGGAGTGACTCGGACTAACATCATCTACCGGGAACCGTTTGCCCAGAGGGTGGTGGGCTGTAGGCTCCAGTCGATGTCTACTGT")) -(assert (= z "aguccgggugggggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 deleted file mode 100644 index aca8b0d5e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0198.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCAGATAGGGGACCATCGGTGCCAGAGTAGATGTGATGGCTGGAAACGCTATCGATTAGGAGTTGTTTCACGAAGTGTTTTGCCGTCCAACCTCTGCCAGATCCAACGCAGATCCTCCCCGGGTATTGCAGCGATCCAACCTAATGTTATTACTTCCTCAGACGGCGTACGAAGTACTAGGGTAGTCCCTAAGACAGGTC")) -(assert (= z "acggcuugaccuauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 deleted file mode 100644 index ae384a6ea..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0199.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGTGGTCTACACACTCATTAAAATAATGACAACCGTACTAAACATGTCGGCCTGCCTTTCAAGACAAAGTCAGGTTAGAAGTTACTAGTACAAAAGTGACTGGGGTAAAGTTTTCGTGTTCAGCGTTCCGGGGAGGCTTGTCATGAGGGATTAACATAAAGATAAGGACCACACAGGAGTTGCGATACGGTGGTGTCGT")) -(assert (= z "acaggcgaauggcuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 deleted file mode 100644 index d8403ce98..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0200.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACGACAGGTTGATGAACGAACGCACACCATTCGGGTGCCTTTGGCCTCTAAAGGGAGGAACATCTTTTAAAAGACATCTAACCGGCGTCGATCATCAAATCGAACTACGGATCTAAGAACTTACGGGGTCCAGGCGATGGGGCAAGAATAATCATCACTCACGATTCTCTTGAGGAGCGAATTTATGGGGATCTGGATTG")) -(assert (= z "gaguccuuaugagcg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 deleted file mode 100644 index ec057f707..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0201.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACTGGTACCTTGTTGGACGTACTACCTGCGTTATACCCTCCTCCTTGGAACCCAGAGTTCCGATAGCGTAATCTTCGGATCAGACTCGGGATCTCACAAGAGGTCTTAGGCGGGCAAAACTCTTTTAGACCGGTCTTGGGACGATCTGGTATTTGCATGTAAGAACCTGTCACAGCTTCCACCAGGCTAGACTGGTAGA")) -(assert (= z "gacgcauuugaaccc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 deleted file mode 100644 index aa1aad897..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0202.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCAGAAACGCGAAGGTGGCTCGTATATTAACAGAAAATGATTTGAACAACTCGGCCTGGTGTCCGGGTTTTGTGAGAAGGTCTCGGTACCATGTGGAAAGCAATGACACGTACTGAACTTTCGCTCTCCGTGACTGCGGGGCGACCTTGGTAATCGAATAACATGCAGCAGAATAGGTTTAGCCGTCTGAATGAGATTG")) -(assert (= z "ccggcucagaaacua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 deleted file mode 100644 index e0e7af708..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0203.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGAGGTTGAGTCAATTGGCAGGATCACGGAAAGAATTCGGTTCGAGAACACGAAGGGCGATACCGAGGCAGTACGAGGAAGCCATGAGTCCGCAGTCACTACCGATTAGGTATACGGACACGTAGACGGGGGACGATTAGATCAACTTCCAGTTTCACCGGCGGGGGCGCTTCTAAACATTTGGCGTACCGTGTACTGGT")) -(assert (= z "uuaugacccaugcga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 deleted file mode 100644 index 69cc2e9e0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0204.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCTTGTGCGATGGTCCGTCGACTCGCCAGATTACCCGTACTTTGTCACGGTGCATATAAAGGCAGCTCCCTGACACATCTGCAAGCATGTATCAGGCGCCAAATCAATTTAATTAGGTCCAACAAGGTTGGAATGGACTGTCAGTCGTTGTAGGAGGGTAGTTACCTATATCCTCTACGCGAGGATTGTGCTTATAGAT")) -(assert (= z "agcgaguuaggauau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 deleted file mode 100644 index 29667b332..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0205.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGAGTTTACGCAGTCCCTTCACTAATTAAGATTTCTTTCCTGTAATTTTCTAGTTAGTACGACCGGAAGCTGCAATCTTATAACGATATCCACGATACCTGGGCAGCCGGGACAAAACCGGTCTATGGCCCAGTCGACGGCGATTTGTGCACCGCATGCAGGAGGCAAGTCCTAGCGGCGGACCGCCAGATACGACGGTG")) -(assert (= z "cacgggaccauacga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 deleted file mode 100644 index 6312344b1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0206.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGGCACACGGTATGTCGAGAACGTCTGAAACTAGCTGGAAACAGTATTTGTGCTGCGTTTTTGCAGGATGGGGAGTCTGTAGGTAGATTGCACTCTGTAAAATGCGGGCCCCGGACCGCCGGCAGGGGTACCCGCTAACCGCTGAGCTTGGTCGGGCATACATGTCCGGTTAAAGCAGAATGCTTCCTTCCCTGTAGTC")) -(assert (= z "cucuggagucccccg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 deleted file mode 100644 index 235bf8009..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0207.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGGGGCACGCCCGGCCCCACTGTACGCTTGCATGGCCCGATGCGCCCCAGTGTTTAGCACCGGACTTTTTCCTTCGACGGAGCATAAATCAGCAACGATGGCTTGCACCTGGGATAGAGCAGGAGGGTTGCACGTCAGACCCGTCGGTATGCTGAAACTCATCTTGAAGCATCATAACTCCCGAATGCTCCCAGCTAACA")) -(assert (= z "cggagaucuacacau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 deleted file mode 100644 index a479a1fa5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0208.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACCACAGTGAGAGCTCTCGGGCCCGCAACGAGTCATTACATTTTTTGTCCCCACCGGGACTAATGCAAAGAGGGCCGGGACACTGCATTGATTGCCACGACGAAGACTCCCTAGTTATAAATGTTTAAACCGCTCGTGTGAGTATACAGGGTATTATAAGTCCAGTGTATTTCGGATCAGGGATATATTATGAAGAAAA")) -(assert (= z "caccgacauuaguau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 deleted file mode 100644 index 87e3be6d6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0209.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGTACCGCTGAAATGGGTTACAAAGTACTCTTGGTGGCTTAGATACCCTGATACAGCCAGGAATGATAAGACGTTAACAGCTACCCGGGGTTGTGTGGAAGCACGTAAGGGTCATATAAGCCAAGCCGCGCACCGCGTACCACCTGTGTGGTAACCATCGTTACCGGGCCGCTACAAGTTAAGAACGATAGTCCAGACTG")) -(assert (= z "cugacgucccguagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 deleted file mode 100644 index 7ae1b04c5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0210.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCCGGCTGACGAACGCACGATATAAATCCAGAGTTGAAGTAATGCGCGGTCGTTAAGATATTCCGGTGCAGATGGTCTGACTCAAGCCCATGAAAGGTCCTCATGAACTTCCTGGGACACTCACTCAGGCAAGGTTTGGAGACGTGCTCGCGCCTCTTCAATCCGGGAGTGCCTGCAACTGATGTGGCCACACCCCGGC")) -(assert (= z "accguuccuccucaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 deleted file mode 100644 index 294673e77..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0211.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTCTCCCTTTGCCTCAAGCACTGCTGACCGGGCATTCAGAGTTGACTTTATTAATCTAAGATTGTATGTTACGCTCTTTGGCCCGGCGAGCCGTGATGAACCCAACAAGTATCTTTGCAACGCCCCTTGGATACAGAGACTGTTATATTCCCCAGGAGTCCTCTGGCCTGTCAGTCTTAAAGAAATGCTTCTTGAGTAC")) -(assert (= z "cuauacagcaccauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 deleted file mode 100644 index 503ab8f45..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0212.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCAGTCCGCAGCGAATAGCCGTCTGGGGAATCTTTTGGCTTAGACACTATCAAGCTTAGACCAGGCACCTTGCGGAAAGGTCGCCATCTCCAGCCTCGTGAGGATGAGCTTACCCATACGACGGGCTCCTTGTTAGTCGGGAGAGCTATACCGCCATCGAAATCTGCGGCCCGCTTAGACATGTGGCGCCCATCATGCTC")) -(assert (= z "aaccgcggggaccua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 deleted file mode 100644 index ac1f4b6fd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0213.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCTCCTCATGTTAGCGACCGGCAGGTGTAAGCTAACCCTTCCCATTTGCAATGCCATTCGCGGTGTGTGTTAACCATTGGCCTCCAGCTAAAAATCCGCGGGGGAGGCCTGCTTAGTTCTGTAGCCTATCTGGCTAAAATGAACCATGCAATCTCCGGTCTTGTTTCATCGAAACATTCTGAAACCCGTTGAATAGCGAA")) -(assert (= z "cuucccaguuuuguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 deleted file mode 100644 index bd823d044..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0214.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACAGGCTATGCTGAGACATTCCTTAAACGCGTTGGGCGACACTTTGGGCGCGATGGTCCGAGCATAATGTTGTCAATCATTCGCTATTTCCCGACAGTCTAGGACGGAGGCTCGATTCTGGCCAAGACCCCGCGCCATACAAGGGTAGATTAGATGAAGGGTATCGTAAGCCGTCGCAAGCTTGTTGATCAAGTTGCGCA")) -(assert (= z "gguagccuuggccca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 deleted file mode 100644 index e9b8acdbe..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0215.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCCGGAGCGTCAGGTACCGCCCCATAACAATCTGAAGCCTATGACAAGTCCGATGAGTAAATGCCTTACGTGCCGACGGCTTACTCGACCTCCTAAGCCCACGCGGCAGTTGGGGTTCGGGCGTCTTATTCGTAAAATCTCTCGTTCAATCTGAGTGTCAGTTTGTGTCGCGGTTGATGGGTGGCAGAAAATTCATAAG")) -(assert (= z "ccaauagaucuuuuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 deleted file mode 100644 index 141526e37..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0216.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCGTTGAGGCGTGATCACATCCAGATCCGTTTGCCAAGAGCGCACTATTGCTAGCGAGTATCTCAGGACCGCATTCATTTCTCAAGCAAGTGTAAAGTGGCCATGGACTAGGTGGCATCTGGATCTTAACGCTTTAGATAACATTTGTACTGATGCTAGTTTATTTTAAGGTCTGAATTCCATTTGGGTGCTGGAAGCAC")) -(assert (= z "aacuaaucaucaagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 deleted file mode 100644 index e679cce43..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0217.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAGCTGCTGATAGCTGCGGAGAAAGGACATTGATTACTGGAGGGCGTATCCGATCTTAGAAAACCAAGGATCTACGGCACTGACGGTGTTGGAGCACAAACAACATTATAGTGGCGGTGGACAAAAACCAATCCTCCTAGAACCGTCCCTTGCCGATATAGTCGCTGCACTTTCGACGAATCCGCCCGCCATGTCACCCG")) -(assert (= z "cgcggcuagaccggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 deleted file mode 100644 index c8d54cf38..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0218.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGAGGGCTCTGCTCAAGTCCAATAGGAAGTACCTCACGTTAGGCGGACGAATGGCATGGAACACGCGCGCTTGATTTATATAATTGAGAGCCGACTCCCAAAAGAGCGAGGTGATAGCGGAAGCTTGGTAACATAACAGTTGATCATCCTTTGGTTGTTCGGAGTTATTCGGCTAGTGCGAGGAGCATGCAAACGACGA")) -(assert (= z "ggaagaccgcccagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 deleted file mode 100644 index 44162a343..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0219.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGTACTCAGTAGGCCTAGCCTGATTGAGTTAATTGCCTTCTTTGATTAAGAAGCGCAGGAACATCATCCCATGGGGCTTAGCGATTGGCATTTAAGAGCAGCAGTCGTCCGCTTATCGTCTTTGTCTGATCGTTGGTAGCGTACCTAGCACGCCAAGTCCCAAGCCATGTTGCATGCGGCAGGTACACTCCAGAGTAATG")) -(assert (= z "ucgccuucucuacaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 deleted file mode 100644 index e23a779a0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0220.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCCGCTAAGGGTCGGATTTGAAATGGGAATCGGATAATGTTACCCGTTTAGAAAACCTTAGAGGCATAGTCTATATCAAGGGGTACCGAAGCTGTGAGACTAAGGGGATTGGTAGGATGGCGCCTATACGGACGTGGCGACACAAAGGGAGTTTTGTCTGGTTGCTCCTGGCGGAGCCAAGATTTACTATCACACCACG")) -(assert (= z "guuuucguucacaca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 deleted file mode 100644 index 9605e54e4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0221.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AACGGGTCATCGTGGATTGCTACATTGGATACCATGCCGGTCCATATGAGACCGTCCGCGAGACCCAGAATCCTAGGGCTCCCTAGGATCCGGGCAAACCAAATAGACATGGCCACATAGGGACTGTTTCTCTGGCACGCTCTAACGACCCAGCACAGCTTCAGTATATTAACCTAGACAGTCATCCGCGGCATGAAAAC")) -(assert (= z "cagucuaggcuguca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 deleted file mode 100644 index 3b981b469..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0222.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTGCCTGCAGATAGCGTTCAGTCAACGTAAACCCTCCGGCGGTCAGAGACAGCCCAGCTTCATTCCTGGATGGTTTAAGCATGACCGGGTCACGACCCATGCTAAACAGATATATTGCATCAAATGAACGTTACGGTGCTTCGTTACATTTAGGGTAGGAAGGCGTAGGTTGCTCGTGGAGTTAAATTAGTCTCCGTAG")) -(assert (= z "ucccaaauuuaaucu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 deleted file mode 100644 index 65560fe8c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0223.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTGTTGGTCACGGCTTACTGATCGAGCACTGCTGGCGACGATCGACGGTTTATGTTCGCCTCGGCATACCGTCGATATCTATACGATTATTCACTCACCCCAGGTTCCCATTATCGGAAAGCGTCTAGTTGAAAGCGTGACCCCCCAGCCGGCTACTTATTCTGAATTGGTGGCCGCTAGCCGATAATTCCCCCGGTTA")) -(assert (= z "aaucguauauccagu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 deleted file mode 100644 index 7d19fcc08..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0224.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCTTGAGGCTAAGTTTTACCGTGTAATTCAGCCTTCATTGGTATAGGCACCCTAAGGCTATCGCGGAATGCACCTACCCGACTCGCGTCACTTACACTTCAGTCTATCCCTCTCCTGAATAGACGAACTCCTATAACGCCTACGAGTCATGGCTCGTGTCATGGTTTGGCGCATTTCCAATGCGTGACGAATAAACCCAC")) -(assert (= z "uauucccuguggggg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 deleted file mode 100644 index c2df78bd0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0225.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAGTTTCTTGCTGATTCTTGCCCTGTGCGGGCGCGGTTGTCTCGAAACATCTAGTCGGGGGATCCGGGTTACTTCCTAGAAGAGCCCCTTTCACTGCATAATAGCGGGTTAAGGGATTGCGAACCAGGCCGTGAACAAACAGATACATCGGGTGGCCCCGTGAACATTCTGGATAGCCCCCGCGGCAAAGTGCTCCTAGG")) -(assert (= z "gaacagaccaacaac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 deleted file mode 100644 index 3ced1a8a2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0226.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGTGACCCATAGTTATCCTACACAGGTCCACCTGAGTCGACCGGCTATCCGAGGAAAGGGAACCCGGCGAATACTTTGCTGGCAAAGGATGCCTGACCACCCGATTGGGATTGGCTTAGAATGCGTCTCGAAATATGTGGCGCCTTCCAGCTGCTCGAGGGAACACCCATATTACAAGGTCATAGTGTGAACATAACGA")) -(assert (= z "cuguugaucagcaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 deleted file mode 100644 index 81d7e8dcd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0227.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAATCAGGAAACGATGGGAAAACGGATGACCCCCCCAGCCTAAAGACAGCAGGCCTGACTAGGCATACTAACCCCGACAGCCGAGCCGGGTTAGGCCCTATTGCTGGACGGCTGCTTGCGGAGCCTGAGCCGCGAGCGATGCCCGTTATGCATATCCATACAGTATTACGGTTACAAATTTTTTTTTTTAACATCAACAA")) -(assert (= z "cggagauacuccacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 deleted file mode 100644 index 5a036667f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0228.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAGACATTATGAACTGGGTTAAAGGCTTCTTCGCATCAGATTGGTTGCGCGCGGACTCTCTCACGGCTTTAACCGTGTGCAAGCCGAGCACTGGGGAGTGAAGTATTATAAATAGGTTCGCGTGAACCTCGTCGGCACGCTTGAAGGTAAATTTGCTGCTCGTAAAGGGGTCGGGTGTAAATGGTTCCTTCGTCAGATTT")) -(assert (= z "gaacuaacgcuuccu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 deleted file mode 100644 index c191b353c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0229.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTGAATTTTGAAAAACAACGTTTTTCTCGGGTAGATTACTCATGCGGTTACGGCAGCAGAACCGCTTTTGTAGATGGTAGGGCGTGTGCACGCCCCTGTTCACAGAGACCTCCAGAAGCGCAGCTTGTTGTATCATCTAACTGGGGATTTATTGTATTTATTGTTTAGCCATGAGTTTTAAGATGCATCAAGACTGCTA")) -(assert (= z "ccaagugacaauaca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 deleted file mode 100644 index 5674aba1e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0230.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACACGTGCGTACGGAGGAGGTGAAAACCCAACGGGGGAGTTTTGTAATGACCGCTACACTCGCGGGCTAGGTTCGTCGGCAATCTAAGCGTGCAGATTAGATCGAGTAACACTAGGAACTTTATGAGAATCGATAATCCTGGATGTGTCATCGCGATCATCAGGACTATTCACTGCATATGACTCCTCGACTGCGGTCT")) -(assert (= z "acacuuacaacuaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 deleted file mode 100644 index 595c59613..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0231.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTTAGGGCGACGGTCACTGTCGTGAGCGAGTCTATTACGCTGTCGTAAAGCCTATCATTCACAACCACTTGTATAAGTGGTTATACCCAATGATATGCTTATCTCGGGATCTTCGTTTCTAAGCTCGGGGGTTAGGCGAAAGACTGCTTCCGTCGGTTCAATACGGGTGCCCATGTTTCCCAGCCCGCAAACAACCATG")) -(assert (= z "ggggguguucgcccc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 deleted file mode 100644 index ec91e390c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0232.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACTGCCACGTAGCCGGGCTTCTCGGCTTCTTACGCCTGAATTTAATCCCGTTCCTCCATGTCTGAAGCAGTTTGAGCTCACGTGGTGGTTCTGGCACGCATCCCCTATGCTGCGCCAAATCACAAATACCGCGAACACTTTGTGGGACGTACGAGCACTTGTGGTCCGTCTGTACAGGGTATACAACTTCATACACCGG")) -(assert (= z "uccuauguugucugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 deleted file mode 100644 index 35f1b86c4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0233.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAAGAACAGTATGCAGCAGGGCCGGTAACGAAAAGAGTGCACGTGTTTTGCCGGAAGGCATGCGGCGCATGCCGACCCTTATGGCTACCCTCTCGTAGTTTGAATTACGTTTTCTATTATCCATCAAGATTGTAGTTCGGAGCAACTCTGGCCGTCCTCAGGAGCAGAGCGACACATCCGTGACCTTCGAGTGACATTCG")) -(assert (= z "agaagggugggcaua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 deleted file mode 100644 index 849ae5e44..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0234.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACGACCCTGGAACGGTGTGTGCAGCAAAAATACACCATTAAAAACAAAAAGGCACCACGGCCTACAGAGTATTTCTAGACGTATGTTTCTGACTTTGGTCTTTTATTATAGTGTCCCTCAGCGCTCCCGTCCGCTGACCGGCGTTAAAAGAAAAGACTCCGGAGGACCCCTGAGTGCAAACTTCCAGTTCAACCGGTGGC")) -(assert (= z "ccuauaucucccugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 deleted file mode 100644 index 302617a9c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0235.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATCGTAACAATGGATCAGGCAGAGCATACCCTTATTATTTGTGGTATTTCATCACTCAAAGAAAGTGCGCGCTCCTTTGCATTGACGTGTACATTGATCCTGTTGAGACCAGAGGGGGCACTTGAGTAGTCGCGTGTAGGCTGGGGAGTTTCCCCACAGTAGGTACATCACAGTTATCTATGCCGTGCTAACTCTTCTCA")) -(assert (= z "agccacaacaaaggc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 deleted file mode 100644 index fb670fb97..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0236.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCTGTTACCACTTCTTCCAAAGGTCCGTGGCCGCTGAGTGGACTGCAGTTGTGTAGCACTGCCCAAGAGAAACCTTGCTGTGAAAGCGAGAAACCAGAGGATGTCACCTGTGCACCCATCTCACATACTTACAACCTCGCCCGCTCCTCACGACGCCTGTACGTTATGTAGTAGAGCCTAGTTCATGCGCTATCGATCAT")) -(assert (= z "uugggacguuuggag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 deleted file mode 100644 index bbcb5e558..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0237.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCATATGTACAAAGGGTTCGATCCCATATATTGACAGCCCCATCGAGCTCGGCAAGAGCTCGGGGGCACGCGTTCAGCCTGATAGGGATTCTGTAACTTCATCAGGCCCAATTCAGGATATTGTGCTCATAACGCAGTCATCCACGAACGGAGGCCCGATGCGGCCCTTAGAGTCATGGATTTACGTCTTTAGTGCAAT")) -(assert (= z "cgugaaugggugcau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 deleted file mode 100644 index 5f759ff34..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0238.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTTAACTAGTACCTCGGGAATGACTTCGGGGGCGCGATCCAATTTCTAACGCGAGGAGGCTCCACGAAATGTGGCCGTAATGAACTTGAGCTATCCTGTGAGTCCATTTCGAATTACACGAGAGCCCAAATGTGCCTGACTTTGTAATGACTGACGTATGTTTTTACTTACATCGCCGGGTTTGATGGCCCGTCGAAAGG")) -(assert (= z "guguacacccgugug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 deleted file mode 100644 index 14a192843..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0239.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGCTTAAGATGAATTGCGAGTTGGTAATATACTTTATTGAAGGCACATTGTGCACTCATATATTCCGAATCCTTTACTTTCCCTTCTAAAAGCAGACTAGCTTCAAGTACCGTCCCTGTGTCCACAGTCAAGTCAGTCAGCACACGAACCTGGGCCAACAATCTACAGCCACGCGGCTTAAGTCAATCTCAATGACAAGC")) -(assert (= z "cagcgccggaacuua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 deleted file mode 100644 index 77e5a8fc5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0240.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCGGTTAAACGCGCCCAATGCATTCAAAACAAGCTCTTATCGAAATTTGAGAGCCCAGCATCAGCCCGTGATTTCGAATGGTGCGCTTGTCAATGCTCGTCAATTCATGCAACGATAATACGGGCTGTCCGAGACGCTACGGTTCTGCGATGGGGCCACAACTCAATCATTTGGCCACAACGCTCACAATAATATAGGCA")) -(assert (= z "ugucgugggguugca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 deleted file mode 100644 index 2d5d10153..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0241.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTCGGGACGATATGGACTCTCATTGTCATTCTGTAGGACTGAAAAAATAATTATTCACGGGTCTGCATACGACAGATATAAGATGCGGTCCGCAAGGATCGGCTCTTGCCCGGCGATCCAATGTTATTTGCACGTACACCCAGCAAGCTTATGAGTGACCCCTTGCCACATGCGTAAAGTGGAGGTGACGGCGAGGCAG")) -(assert (= z "auuuaggcacuuuaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 deleted file mode 100644 index 21f93a0f7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0242.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTAGTCAGCGGCGCCAAGAGCATCCATTAGTGAATTCGCTAAGACCAGATGAGCATTTAGCCGTTCTGAGACGGAATCGACCTGATACGGGAAAGACGCGCCACCAGGTCGACACACATTCAATTGTACTGCGGCTCTGCGCCATATCTCCATGAAATGGAACAAGAGATACCTCTACCAATGAAGGAAGGGGTCACCC")) -(assert (= z "uacccugacaccaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 deleted file mode 100644 index 8cc6a8d63..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0243.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGACTCATCGCGAAAACCCGTTCCAGTAGCCAAGGTACGACGCTCATGATTAGACGTGAACTCATTGGGGATGCGCGAAAGGTCATCCCAGCCTCGATTGATACGTATATGGCATGAGGCCCTCAGGGAACTTAATAACTACGGGTGCTCGCGGCTTGACCAATGTGCTTGACCACTTCCAAACCAGGAAAATGCTGGGA")) -(assert (= z "gggacguuuuuguaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 deleted file mode 100644 index c98cadfaf..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0244.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACGCTGTGCACTCTCATGCCCCTCATCTTTTCGGGAGTACCCCGTGCCAATACCCATGAATGTATTTGAGTTACCATCTCATTCACATTAGAACGCCAAAAGGAGGTCGTATTGGCATATTAACTCAACGAGATATGTTCTTCCTTGGTTTGCGAGTAAACTAACTGGAACGTTTACGGCGAGCTTCTCCCCAAGAGAT")) -(assert (= z "ucaucuacggcgcgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 deleted file mode 100644 index 5c832e53d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0245.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGCATGGACAGGGAGATCTCCGTCTACATGTAAGGACGTAACCAATGAAAATAACTTCACGAACCCTACGGTGAGCTCTAGAGCTCCGTTCTGGGCGGGAATCGGGGAGCCATTAAGTGTGACCTCCCGTCGGCGGTGTCTACCAGCTGGCGAACCACCCAGGGTCGTACACAGTCAAAATGGCTACGTTTTCCGCTGG")) -(assert (= z "gcauaagucagcacg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 deleted file mode 100644 index d4d85e881..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0246.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCAGGGCAACCCAAACCAAAATACCAAACGAACGCTCAATCAGCATCATCTGGCTCTGCCATAGCTCGCCCCATCAGAAATCCCGGCCAGCTATCTAGACTCAGCAGTTAAACCGCGTAAAGGCGTAAATGCATACAAGATAGGCGTTAGGCAACGCTATTTTCCCAGCCCTCATCGACTCTTGATCGAAGAAGGCCGA")) -(assert (= z "agauguccacaguua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 deleted file mode 100644 index ff2267112..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0247.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACATGAAAGAGTTATCCGTCACATTGCCGCGGTAGATAGACTCCCCGCTGCATGAGCGTAGAGTTGAGCATCGCGCACAGAGTGGCAGTCTGAGGCGGGGAGGCAGGTCACACGAAGTCGGCGACGATGAGCCCTATCTCTCCGGGACCCTAAAACGACCGCACCAGAGTCCTAGGGCCTCTAACAGGGGAAGCGATGC")) -(assert (= z "aucuuacaguuaaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 deleted file mode 100644 index 0e2471f55..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0248.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGACGGTTAGACGGGGATCCCCTATCAGTCTAGGAGCGGGGCTATAGTGCGTCCATACCACGAAATGCATGGCGCGAGAAATCCTCCAACCCCGAATTTGAGGCATATCACTACTTACCCGGCGATAAGTCCTCTATGCTGAGGCGGGGCTTGTTGGTTGTACTGAGATGAGACGGAGATTAATCAGAAAGCTAGTTAAC")) -(assert (= z "cuuaccgcguggauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 deleted file mode 100644 index 422f81e81..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0249.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGATCTATTACAGCATTTTAAAGTTTTCGTGACGCGTGTCACGCATGCGTGTTCGATTAAACACAAGCATACTTGCACCAGCTGGATGCCACAAGTATCAAAGAATTAATAATATTTGCATTCACCGTCGGAGGGGTCCCCAACGGAACGTCAGACGTCGCCGAGTCCACGGAGCGCTCGCGGTGACGATATTGCTACT")) -(assert (= z "augggaggagggcgc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 deleted file mode 100644 index 0ef2aa772..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0250.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCAAAGGGGCGGTTGGCAAGGTTGACGGAATTGGTTATTCACAACATCGCGTCCCCTGATTGCACAGGTGTGATGTGTGCTCATGATTCGATAGAGAGATCCGTCATCAATCTGGAACGAAAAGCGGAACGGAATGAGTGGAAAGGGTGTTTGGTGCTGATCGAATCGACCCCGAGTGGGGAGAAAGGGGAAGCAGGCA")) -(assert (= z "gcuagaucugcucgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 deleted file mode 100644 index 80eda293e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0251.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCGAATGGAACAATGACATTTCGGCTTAGCCTGGGGTCAGGGTAGTGCAGCCTAGTACTACGGCCGACAGGTCCATCGTCTGCCTTTGAAAAGAGTACGATTCTCTGGAGTGAATCGGGTGCGACCAGGCGTAATTAGACTTAGCCCATGAGCCATATCGTGTGGGGGTATGACACCGATTTCTAAAACTACGCACAGT")) -(assert (= z "cacagcuaaccugug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 deleted file mode 100644 index b0de4576f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0252.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGTCAGAATTGTTCTCGCATGGAGCCATGTTTTATTTGAATGCAGGGTAGTTGTGACCTTGCTAATCCGCGCTCTGCACGACGGGAAAGAGCCGGCTGCATACACGCCAGCTGCCACCCTCCGCGATGGTGCTGTTGAGGACCCTATGAAAATTGCTCCCGCAGAGCTGGTACGTTGATGCATCCATACTAGTTCTACCA")) -(assert (= z "gaguugccugaaggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 deleted file mode 100644 index b9b032feb..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0253.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGTGCGGGACCCTTGACCGACATAGATTAGCGCGGCACCGTCGGCCAGAGTGCTATTACATCTAGAATCGCGTATAGGCGGTTGTCTACGCCGAATCATAGCCAATAGCCTCGGACAACACGCTTGAGGAGTATTAGCAATACTTCACGTTTGTCACGGCTAGTTCGTTACGTTCGAGACTGCTTTTCATCAAATGGGAC")) -(assert (= z "cacuagugggaugcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 deleted file mode 100644 index b7c039535..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0254.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGCTCGTCCGGTTAATACAATACGTGGGTGTGTTATATGACGGACTACAATATCTGGTAACGTCATTGTTGCGGCGTGTCAGTCACCTGGCTGGGTAGTTTGGACATGACATGGCCGTACCATATTAAACCGCTATAGCAAGGATCTCCAAGAAGTAGTTGAAGGCAATTTTTCGATCGCGAGCCGACTTGACTTGCAT")) -(assert (= z "uacuggguuaaccau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 deleted file mode 100644 index 37f203474..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0255.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGTCCGTCTAATGGCGCACTGACGGCGAAACATTGTTTAAACAGTGTTCTCGTTGGTGCTGGAACCAATATAATCCCGGTGCCAAACAGAGCGGGATGGTTGGGCAGCGGAGTATACTTAACGTTGAACGAGCGACGTGTCTGTGGTGCCTGACAAAATTGAGAACATAGTCCTGCAGGGATCACTGCCTTCCTAGCCTT")) -(assert (= z "ucguccuacaacuca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 deleted file mode 100644 index 23ff0aba8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0256.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTTCCCCCATGGTGATGAAGACCTGTAGGAAGTATAAGACGCTCTAACTCTGTAAATGCAGTAACGGGCACGTCCGTTGAGGGTTCTCACATGTGTTTTTTGAAAGATCTTTCAGGTTTCAAGTGCGACGATGTTATTTGACCCAATATTAAGCTAAGTTCGGTGCGTCTTGTTAGCAACTGCACGGTTGGCATACCTA")) -(assert (= z "cugucggggggucuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 deleted file mode 100644 index bce0cd748..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0257.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTAAAGGCCCTGTAGATTAGTGAAAATTTAATCCCGGCACTGTCCACCGGGGTAGTAATGGTCCTGCCCTGCTTTTAAAGCCATTGGGCTCGAAGATTGCATTAGGGGTCATTAAGTTAAAACGTTCAGTATGAGGGTTTATGCTACGCACTGCGAACAAAGCTTCAATAGAGGGCCGATTTACGGTCCATGTAAGCAGA")) -(assert (= z "acaagcucacuccgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 deleted file mode 100644 index f3755ad28..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0258.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTTAAGGGTTTTACTCGGGTAAGGTTCCACCAAAAGTAAGCTGCCGGCGTGTCCAACCCAGTCAGTCCTAATGCGGGTGACACATGACGGTGCGGTCGTTAGCCTCGTACACTTGGGCCATCGAACTGCTCAACCGGTTTTGCTGCCTAGCCACGACTGTCGGCTTGGCCCAATCACACTTGTAGGAACCATGAAAAAC")) -(assert (= z "cgaaaagugaacggc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 deleted file mode 100644 index e3376f124..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0259.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCGTTTCCAGTCTTCCGGAAGACTGTTCAGCAAATCACTTCTGTGCGACAGTGCTATTCTTTAGCCGACGCAGAGAGTCAGCAGTGATTAAGTTGCGCTGCGACGAGGACATATTAGGTATGGATCGGTTTACCGAGCAACGCTCCCTAGAGGAACCTTCAGGGGGTTAGGACCGCGCTGGTGGATCTGTATGCCCTTT")) -(assert (= z "uaucugugcucucua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 deleted file mode 100644 index dad237b27..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0260.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCCTTCCCTTTAACCGCTCTTTCAGGCTGCGACGTGGTCATTGCTCTGAGCGCTACACGGAGTTGGAAGGTCCTTGGGAAATCATTGAACCTCGCCTTGAAACCTCTTCCGGGGGACTAACTTTCATCGCTGGTTTAAGACGTGTGACCTGCTGATGTCACAGTTATGGGCTCCGCTTCTCCCCGCTCGTTCCAACACC")) -(assert (= z "gcgauuuuaaagauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 deleted file mode 100644 index 30dc17134..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0261.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTTTATTGTGGGTTTTCCACACTTATGAACGGAATAAATGAATCCCTCCCCATTTAGATAACAGCACAGGATAAACCGACGCACATAATAATGGCGCGCCACGTAGCTCAGCGTTAGAGTACTTTATCTGTGGCCAAGTAACCCCAATGATGTCCCGGACCCTAATACTAGACCCCCTCGGGGAGATCACCCAAGACCC")) -(assert (= z "cuaggcacuuuuggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 deleted file mode 100644 index 2450abb01..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0262.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGCCATAAGGAGTTGCCAACAAAGCTGTAAGAGTAGTTCGACCAACCTTGCAATCTATTGATGTTAGTCGCAGGAACCCTAGCGACGATTAACTGACTACCCGGGTGGTTCAAGAGCCGATCCGCGCTCCTCTCGCAGCGAAAGGCAGTGAAGTGACCTCTGCTCTTAGGCCAGCCTTTTCAGCCTATGCTCTGTACGTT")) -(assert (= z "guccgggcacuguaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 deleted file mode 100644 index 872ecd6da..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0263.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACTTTGGACTCCCCCGACTGCGGCAACTCTGTTGGTTCTGGGGGTTTCCGTGATGCAAGGCCTTGGGCAAGTCTTCTCCGACTGGAAGCTAGCCCTGGTGACCTCGTAGAGAACCTCCGTGGTTTAAAAAAAGTGCGCGCATGTCCCGATAGAACAGGCTCGCCCGCACGTATGAAAACTCCGACCGATCTAGCTTTCG")) -(assert (= z "agcgaguuuagucuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 deleted file mode 100644 index 250abd6e0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0264.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATAACGAAGGTTAGCATATACCGCGTATCAGAAGAATCGACCTTACGACACGGTAATGCCGTGCGCACGGAACCAGTGCTGACCACACCTCACATCGCGGACCCTGTTTCCGTGAGGTATGCACTTAGCGTAAGGACTAGTCTCAGCCGCCCTCCGATAAGTTTCTCGGATAGCGTTAATAAACAGGCATGAACCCGTGG")) -(assert (= z "accagucuaucucga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 deleted file mode 100644 index 40bafd49e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0265.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AACTCGGAGGACCAGTCAGCATATTTTTTAGCTTTACAATTGCCTATTCGCTGTGGCGCCGTAAATACCCCATGCGCTAGCCGCTGAGTTTGGTTAAAGCACACGTAGCTTCGGCTGACTACTACAGTTTCTCTACTCTGGATAGCGGAGTTTATAACGCCGATGAGCTACCGCGACCGCTTGTTCACAGACGGTTTGAA")) -(assert (= z "uguggugggcuagga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 deleted file mode 100644 index b56836a87..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0266.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAATTCATCATGTAGTTAACGTGCTCACAAGGATAACTTGCTCGCTACCCCGCCACGGTACTTCCAGGTTCCAAAGCCCCCCGAGGGATCTGAATAGTATTGTAAACATCCACCCACTGGCTGCATCGCATGCGCAAACCATGTACACTTGTCCGCGTCTCGTATGAACCGTTCAAGCCAGCGTGTGGGAATACAAACC")) -(assert (= z "uagacuguuaucaua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 deleted file mode 100644 index 88a1e6b1d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0267.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGTCGTCATTTACGTGGATAGTGCTAGTTAACCAGTCTCCATGAGCTAAACTTAAAGAGTAGGGTGAGGATAAATCGCGCGCACGACTGTTGTTAATTGGTCTAGCTGCGAGAAGGATTAGCAACGCGAGAACCGTCCCACAGGACGCTAGAATATCTTACGATCGCGCTCTCCCAGCGTGGCACGTGGGACTATAAGAA")) -(assert (= z "aaccuaaguacccua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 deleted file mode 100644 index 5a4a02290..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0268.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCTATAAACGCACCCATTCTATTCTGGCCAAGGGCTGTGAACTACCGGAATTTCTGCTCTACGCACAAGTAGTGTCTGAGAGTGAATGTTGGAACCGAAGGATCATTTGGCATCCAGGATGCGGTCGTGATATCCTCAAAGGCGGTCTTTTGACAACGAAGCCATTTATAACAATCACGCGTAAAATGCCCGATTATGA")) -(assert (= z "ucaacaugcaacggc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 deleted file mode 100644 index f28e0da2b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0269.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGCTGGCGTGGAGACTCCTACTCTGACTCTAGCAACTCCGAATAGGTCAGTTACCTGACCTGACGAGCAACACCCGCGAGTCCTCTAAAAATTCCATCAGCAGATACGGGTTTACAAGTCCGCAATGTCATGAATGTACCAATCACTCCCGAACCTCTGAGTTGGCTTCGGAACTGGACTGAGTCCCCCATCTTTCCAC")) -(assert (= z "ucggaccgacaaugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 deleted file mode 100644 index 1a7c9ffbd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0270.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTAAGAATCTAGCACGGTTATTGATCTAGCGTCCTCCACGATGTAGCGTGTGTGCTCCCTCTATAACTAAACATACGAAAAACAGATAGCTTCCTAATTAGCGCGGATGCACGGGGAGGAATCGACAAACTATCATGCAGTTTGAGCACCCACGAGTAACTGTACGGACCACATGAGAGAATTATCCCGGGCTATGGTTA")) -(assert (= z "agaaaacagucaaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 deleted file mode 100644 index 2db089aed..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0271.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATAAACTCATGTCCCATCAAAATGAAGCAATATTTCGTAGCCCTTCGGGTCCTTTTGACACTCTGACACAAACTGGTTTAATCCTTGGGTCTGAAACTTGTGTCCATTTATCCTGATTTTGTGAGCACGGCCAAAGTCTTCACCGCAGTCGCCCAGACGGCTGCTGCACAGCACCAGTCGGGCTATCTGGGCACACCTTA")) -(assert (= z "gccaaauauggugcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 deleted file mode 100644 index 912448fa3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0272.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTTCGGTATTGCTGTCTTTTGTGAGGAATGGCTAAACCCTGGCGTAGTCAAACCGGTTAAGGTAGCATATCCTGGCGCCTCAGTCCCCATACATGCAGTCGGACCCATTCTAGATGCTGAACGTAGTCGCGAGATGCCCCATGGGACTGTCGTCCGAACATAGAAACTTTGGCGTCTTACCAAATGGCGTGAGCAACAG")) -(assert (= z "caugcugaccugcgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 deleted file mode 100644 index f3be01134..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0273.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTCACCCCAGTCTCACAGTCAATTCTCTCCCGAGTATAGACCATTCGTCGCCGGCGGCTCTCTCAAAAGGCTCACCTTGTTTTCAAATTTTGTTTCCAATTGCCTCGGGCTTGACTTAAACCTTTTGAACGTCACCGGTTAACGGTACGATCGATTGTAGTAGAGTGCAGCCCACTGGCCCTAGAGGGTCGGACCCTTC")) -(assert (= z "uaucacucacgauua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 deleted file mode 100644 index 7d769070d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0274.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTGACTTATTAACACGCAAACTTCCATCTATGCAAAAGATCGCGATTCACGTTATGCCGAGACTAATCGACCGAGGCGGCTACTCCAGGGGAGCATCTGAGTAGCCCATGCTTTATGGATCGGGACTCTATTATACTGTGGCGCTTATCAATGTGGCCACAACAACCATAAATTCATCGTGTAAAATACTGAATTACGG")) -(assert (= z "uuccaucuacuaaua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 deleted file mode 100644 index af45ac50b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0275.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCCATCTTATAATAAGGTGACCCGTTTGCTACTTACGCACTGTTTGGTTTCGAGACTGCGCGGTTGATGTTAGCCCATTCCGTCTCGTTGTTACTTCGGCGTAGCTCTTTTACGTATGTCTACGTATGATAGCCCGATTATTAGTGACTACAGTCAATAACGCGCGTGCGTCACGGGTTGCCGTATTCAACCTGCACGT")) -(assert (= z "cccaauaagguccgc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 deleted file mode 100644 index d29905846..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0276.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACGCTCACTGGTGTTTTATCCCGTGCGTATAACCTGCGAAGCCAACGCTCCAAAATTATATTTCAACTCTAGTTGATAGTTGGAGGTTTGCGCACGACTGGATCGGTTTGAATGGTAGACGTCAGGCCGAGGTGTTGTGATACCGTCCCCCACTAGGTTCCAAATACATTATGGCAGACAGGGGGACAATATTTAAATG")) -(assert (= z "guuucccaguaaaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 deleted file mode 100644 index b0bf67085..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0277.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGGCAGACTACTATACTCCCTAGTCGCACTAGATAAAGCCAGCCGGGCAGCGTGCGTGTTAACGATAGGGCCAATCTGGAGGGTCATACCACTATCCGACTCTGTGGTATTTAAATCCTGCGGGTGCGCCCCGTGGAAGCAATGCATTCAGATAGCAGTGACCGGGCATGCCGCCCCGTAACCGTCACTGTCGACTCGG")) -(assert (= z "ucucgcuaaugggaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 deleted file mode 100644 index bf698f2f4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0278.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTCGCGCTAAAACAATAGAGAACAACGGCGTTGAGTAGCGACTCCAAGGCTCGTGTTGACGATTCAGTCCCTGATCAGGTTTGATCTTCCGTGTTTTATGTGCAATGACAGAAATTATAGCTTAATTGAACTAACCGTACAACAGTTGCACCCAATTATATGCCGGAATCCGTGACTCAAAGGATATCGTAACCGTCCG")) -(assert (= z "cauuaugcugucccu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 deleted file mode 100644 index 0ef8e8987..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0279.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCGGGGGTCGGATTCACACTGACGGAAGGCGGACCTACCGGACTCCTGGTTTCATCAACTTCTGAAGTCACGGAGGTCTAAGCCGACGTGCTTCGGGATAGACGCAGAAGGATAAGACCCTATTAGACATAGTCGCGACGCAAAAGGCCGCGAATATTGTTTGTGACAGTACTCATCGGCTCTACAAGTGAGCTCCTGAC")) -(assert (= z "ugugaccaauucgca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 deleted file mode 100644 index f8ad42aef..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0280.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCTGACTGTAGATGTATACAGAGGCTAATTGCTTCCACTAGAGTGCACCTCGTAACCCGTGCCGATCTTTCTAAACGCCCATGACAAGAAGCGATTACGAGCAAGAGGACTTCTGCTCTCCTGAGAACTCCCGGCGACATTCGTGCATACACCTAGGTGCCATTTGCAACAGCGCCGTATATCTAAGGTGACCTGAGCG")) -(assert (= z "gugcuaauuuauaug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 deleted file mode 100644 index 60c1dd869..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0281.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAGCTGCTCCCACCTAGCGGCATCTCACATCACCGCCCTAGGCTCGTTTATATCTGCGTACTCATCTTGCACTCGACACACGCCTAATGTAAGGCCATTTACGCTCTCTCTCACGATATGACCCCATCCCGATTTGTTATGAATGCGAGCAAGAGTTCCGCATTTTCCGACCGTAACCAGAAACCCGCTAAGGCGACATC")) -(assert (= z "aucugcaaucgcgua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 deleted file mode 100644 index 68668e19b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0282.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCCACCTTCCAATAGCGAATATGCGCCATCCTATAAATGTCGTCCGGCTTCTTCACGATACTCTGGTCGTTTTCTAATCTACTCGGCCTATTGCCAACGCATTCCGTCGCGCAACAGAGAACCTCGAGATGCTCAGATATCATGCAATTCGGTGCGTGGCGAGTTTACATTAGTTCTCCAGCTTTGTGGCAGGTTCAAG")) -(assert (= z "aacauguccgcuuag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 deleted file mode 100644 index a942fdee8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0283.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGGTTAGCCTCCCAGGCCACACTCTACCATTAAGGTCTTCAGCTGACGCGTAGGTAGGGGCTTTGCTCGTCAAACTGTGGATCCCGTACGCCCGGCCTAACGACACTGCTGTTTGTATCGCTGCCTAATCTAATCCGTCAACTACCGCGTAAAGCAAGAGGAAAACTAAGAGCCAGTTTATCAGGCAGTACCCCCGCAC")) -(assert (= z "caccggcauugguaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 deleted file mode 100644 index 38e2b7148..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0284.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCGTCGCGTGGTGTCAGACCAGCTTTACTTAACCAGCTCCGTGTCACTCAAACGAAATAACATTTTTGTGGGAACGGTATCTCACTCATACTGGGGCACCGTATGGCTTTATAACGGTACACTCACCGCTTCTTCGTACGGGCTCCCGCCGAATCAGTGGTGCACCATGCATAAAAACTGGGTCCCACAAGTGATCCAGT")) -(assert (= z "gucacgguacaucuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 deleted file mode 100644 index 52e8bbc6a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0285.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCACCCTTCTTTGGCCAGAAAGGAGGGGATAACGTCATTACTCCAATAGTGGGAGGGATTGGATGAATTACGCGTCGGTACTTCGTACTCCTGCAAAACTTATCATACGTTACACAGTACATGTCTGCTAATATTTGGCATGCAGTATACTGATCCATGTAAGCTATACAGATGAGCGCACTGGTCCAGTCCATTCCCGA")) -(assert (= z "acaucuguuuugcag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 deleted file mode 100644 index 53df10a42..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0286.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCCCCGCGCGCTCAAGCTCCAACCGACTGAACCTTGGTCACGGTGCCACAGATTGCGGCATGGGTTCATCTCCTCAATACAAGCCCTTACTTGCTGTCAAGGGAATTAATGACTAGGCCCTGTCCCGAAAGTCGAGTTATCAGTTTAAGACCTGATGTGCTATACTGCGCATTGGAAGGAGCCTATCTATTGTCTATAC")) -(assert (= z "accccaacuuggagg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 deleted file mode 100644 index 1d02ea2e0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0287.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTGTATATCACCTGGAACGAAGCTGGTATTTCGTCTTCACCGTGACATGTCGGGAATATGGCTAGATGAAGGCAGTCTTACGTCGAAATGTCCAATTTCTAGCTTTGCTCAATGGCGCACGGGTGTCATGTTAGAGTCAACAAGTTGTCGACTCACTAATTAACCTATACCTCGCCTGTTTCACATGCTGAGCAATGGG")) -(assert (= z "aagagugcucacggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 deleted file mode 100644 index 6ef593967..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0288.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGACGTCTCACGGGCTAAATTTCGCCTGAGTGAACATCTGTGATCCGAGCTGCCGAGAGAGTAAAAGTATGTCGTATCACTGATCACCATAGGCGTGCATACTTCCCGCCGTGCCCTTGTTATCAAATCGCGCTCACTCCGTAAGCAATCGAAGACTGTCATTGCGGCCGGATTGCTATAATTATACCAGGACACTAACG")) -(assert (= z "aguuauucccgcguu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 deleted file mode 100644 index 8b1473744..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0289.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTTGCACGGTAGTCGCTGACTCTGGTTGTGGGCCGCGCTAGAGTAGACCTGTTTCGCTAGCTAGGTAGGGACTGTGTTCCCTTTGTCCTCATCTCACAGATCGGCTAATTCATTAAGCTACCGCCGTAATCTTTGTGGTCGCGGTTTCTGCTGAGCCACGTACTGCCGACGACGTATCGATGTCGATTTGGGTCCTTGT")) -(assert (= z "caaccaagugaucuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 deleted file mode 100644 index 7765ebf2a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0290.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTAACCGAGGGTGGTACGTGAGCTTTGCATTCGGTGGGTTTAGGATCCAGGTGCCAGAATTAGAGCCATGTAACGCGGCATCGGGACCTGCTCAGCCGCTAAGCCAGTTACTTGGGCCTCCATGAATGAAGCATGTCATTGGACGTAAACCGAACACTCGCGGTCGATCTACAACCTACAACTTACTCGAGATTCAGTT")) -(assert (= z "gauccgaaagggugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 deleted file mode 100644 index b6b2043aa..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0291.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTCCCAGTGAGGAGGTGGATTGGTCCGCCGATCATAAGGCGTAGTCCGCGCATTCCCAGCGCTAGAATTTACTGCTACTAGAGTTTCACGGTGCGCGTGATCCATGACAGTACCAACAATTGAGATTGCGTGTAGTGTCATCCTCAATGATCAAGGCGATGTAATATATTCACGTCCGTTGCCGTAGTCCAACCGATCA")) -(assert (= z "cguauccgccguuaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 deleted file mode 100644 index 7394f03f8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0292.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTACATTGGCCGTGATTCCAAAGAATAGGGGGCCCATGGCCATCAAGCTCGGGGGCGGGTCGAGTCGTAGCGAACCGCGAACCGACGCGATAATGGCGGATCGGCAGGATAGATACCGTCTTTACTCAGACCGAGCGAGCCCTGCGCACAAAATAGGTACGTACCGCTCGTGACGATTCGATAGCACGTTATCGCAGAAC")) -(assert (= z "uuaaucaagcggaac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 deleted file mode 100644 index cc65de2a0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0293.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCAGTGTGCAATTTGCATGCGTGCGTAAGTTCAGTTACAAACTAAGGCTAGCAATAGCCTTCAGTCCAGCCGTTTAAGGGTTGGATCGATTGACCGCACAGGGTTGTATGCTCTCGTACGGAGCCAAACAAACCCAAAAAAGATTCTAAGCCATCTGCGCTAGTCAAATTTGTAGCTCTAGTTAGTCCACCAATCTAAAC")) -(assert (= z "cuagacgucguguaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 deleted file mode 100644 index d89155df8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0294.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAAGTCGCACCAGATAGCTACTGGGCAGGCTTCATATCAAGAGCGTCAGCCCGAGATAACCCGTTACTTCAACCTAGAACGAGGTGCTATCAAACTGGCTTCGACAGACTCCGGATTGCGTTCTCCTTAGCTTGAACTATGAATTTGGCTGGAACCCCATTGGCAGCTCCATGAGGCCTAGCAACCAATCCATGAGGCGT")) -(assert (= z "cuuugcaugcgaucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 deleted file mode 100644 index 4f33ec95d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0295.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCCGAGTGAGTCTGCCCTCAGTAGTCCAGGCTTATGCTCGGGAACCTGAAGATACTGACGGAAAAGTTCACCGACTTCTAGAACAGTACCAATACTCGCTACCCCCGATATGGCTATGGCTATAGAGTTCAGAGGCCTCTCAGCTTTAGTTCCAACATTGACCCCAGTTGTCACTGCTTAACAGGGGTGTGCTCCATTAC")) -(assert (= z "ggauugcggugcaug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 deleted file mode 100644 index e4284b2e3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0296.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGAGACTATTAACTCTCAATTGTACTTAATCACTTATCTTGTGTTTGTATTACGTCCGTCGTAGTTGATCCGTATCATTTACATCCGCACCAGCACAGCGTTGTCCACCAATGATATAGGAGGCGATATTCCTATATGACTGTGCCGTGCGGCCCTTTCGTTCGAAACCACCTCCGAGAGCTGTCGGACGTGAAATGTCT")) -(assert (= z "cguacggacuauuag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 deleted file mode 100644 index 38bef56b5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0297.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCAGAGCCCTTGATTTCTTTTGTTTAGCCGGAATTACCCATCCGCGACTTACGCGGAACCGTAAGACGGTCCAAATCCCCCTGGTGTGTCCATTCACTAATTCATTTAGCATAGTGGTAGGCAGTATGTTTGGATGAAAGGCTTTGAGATCTCCTGCACGTATGTATCAATTGACAGGAGGCTAGAAGTTTTATAGACC")) -(assert (= z "aaguccuaucgcccc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 deleted file mode 100644 index f2be1b2ad..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0298.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGGCTTCATGTGCCGATTATCATTCGGTGGACTCTCCATGGTAATTTGACTAGGACCGCTGTTCGTAGTAAAAATCAAGCACACGGTGCCCTGCGTCGCCCGTTCAGTATTCCACGATACGTCCGAGCGCGCTACAATTCCAACGAGTGGTTGTTCTGACAATCTCGCTAAGCGCAGTATAGCTCCGGCTGTATCCATG")) -(assert (= z "ccuauugcaacaaac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 deleted file mode 100644 index ec0e0da74..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0299.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCGCTTTATATATGCGTTATATGAGGGGGCGAACCATAGCAAACAGATGTGCCCCAAACGCAGCTGAACAGAAATCCGGGCATAGTACGAGACTGGGGCGCGGCCCGGGCGTAGGAACAATAAGACCGGCCCATTCCTTGAGTGTCCTCTAACGAAATACAGCGATAACACCACTGCGTCGTGACTATCTGTACTCTCC")) -(assert (= z "ugaugcugcgccgcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 deleted file mode 100644 index e3eb6105c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0300.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCTCCCCCATGCTTAACCAAAAGTTCAGTATCCTTAGCGTTTTGCTACCTAGGGCAGCCTTGCTTTTCGAAAGTGATTGTCGAGGTCTCTCTTCGAAGAAGGCTCTGTACGGCTAGCTGGCAACGAGGACGTTTCGATGCATTAGCAAGGACCTTACTGATGTGCCCTGGCGGAAGGCCTTCTAACGACGAGGATTCAT")) -(assert (= z "ucgcauggccaaaua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 deleted file mode 100644 index aab3bd658..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0301.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACTACACGAATTCCTGTTGATATAGGTGTTTTGTCCTTAGGCAAATAAATACCCTGCCGAACGGCAAGTGGTCGGACGTCAGCTCAACTGTCTGAAAAACCTACTCGTGCTTTCTCTATCTACGGGCTAGTCTAAGAGTGTGCCCGTACCCGGCCACTTACAGTAGTCTCTCTTATGCGGATCCAGTAGTACATCTGAA")) -(assert (= z "aauaagauaggcccc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 deleted file mode 100644 index 98c27369f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0302.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGGCTCCTGATCATTATCTCGATAAGACGAGAGTAGTCCTAGCGGGCGGCTGTCTGAAGATATCTACGTACCAGATGAGAGTTGCCCATTACCTAATCTTCATGGCTCGGAGACCCTAGCCGGTGGCCCGACTTGTATCGGATCTAGGTACATTGATATAGTTGATTCAAATAATCCGTCATGCTACGTAATATGCAGCA")) -(assert (= z "cugcgguaauauuac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 deleted file mode 100644 index 4882b3871..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0303.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCGCCCCGGTTTCAAGAACTTAACTTGAGGATACAATCCGCGCCGAGTCTCTTGCTTTATTCCTCGCGCACCGATGGCTACAACAGAGTAATTCTTATCTTCTTTAGGTTTGTGACGGCTATAACCACGTCTCTCCCCTAGGAATGTTCACTTGGTGTCTGATGCGAGCGTGAGTACGATAAGCGGTTCTATGGAGGGT")) -(assert (= z "uugaccucuguaggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 deleted file mode 100644 index 48074a9f5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0304.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGGCGAGGATTCAGAGGATTGAGAGGTCCGATACGTACCATGTCGCTCAATTCGGCTAATGTTCCATATACATCGTCAAGGTTGGGTGATCATATCGGTTGATCTGCCCAGAGCGGTCCAGCGTGCGAACGCGCCAAGTAGAGGTAGAGAGCGCTACTTCTTGACATCCGAGAACGCATACACCGTAGATCTGCGCTCAC")) -(assert (= z "aucauacugacucau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 deleted file mode 100644 index c1e91aeb7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0305.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAGAGGGCAGTCTGTCATCGGATCTGCGTATAGGCGGAGGAATGGTCGCATGTTAACGCTAGGCACATCGAACGCAATGAGACTATCAAGCCAAAAGTCTAGGACCCATTCGCAGGGGGCGATTTGAAACACAAAGCGAAGAAGCGTTTAAATCGGTCCTTGCCTTGGATAGTCGATAATTCCGCTTGGTGGCAGCGCTA")) -(assert (= z "guaagagaauacuac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 deleted file mode 100644 index 2504ac646..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0306.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAAGACAAGACACCGACTTAAGTTAGGGAACTTATTTATCTTGCGCCCGATCTATTGGGATTGTTCCGTGCAGAAGATTCCTCGGAGGTCGACCTATTATCTTGCGATTCAAAAAGGTACTTCGTAGAGCACGAGCAGATCTTCACATCGGTTCAACTCGAGGGAGTAGCCAAGTGCGAAGGTAATGACTTGACCACGTA")) -(assert (= z "cucuugccuggcucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 deleted file mode 100644 index a8e907a16..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0307.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCTAGAGGCGCTAGACACCAATTCATACTAGAGATACGTTTGCTTTCAAACCGAATGGCGGTATTTTGTTCACTCCATATGACAGCACTGAGATTAATCACTAAGATACGAGGGTAGTAGTTTGCTGAGGCGTGATGAACGGACCACTTTGCATGGTACAAAGTACGGCCCAGTAACGTCCGAATCCTCGATCGTTCGC")) -(assert (= z "ucaaacguuuagcgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 deleted file mode 100644 index 982c42593..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0308.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTGTAAGCATGGTTATTAGACGCTCGGATACTGCGGTGACGCTGGCATTGGTGGTGAGCTGCAGTCGGGGCCAAGATTTAGGTACGGCTCTAAGTCCAGTAAGAAAATCGTAACGGTAGCAAATCGATGGACAGCACGCGGGACACGATCATCCTAAGAGTGCGTATCTTCCTGTTCTGTCTTCTTAGCTGGGGTGCCCC")) -(assert (= z "ggacccauuucagag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 deleted file mode 100644 index df4374f63..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0309.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACGAAGGCGTCCAACCGTCGTCGAGTCTACGATAATCAGTGACTCGATTATCAGCCATGAATAAGGGCCAGCCCAGTCCCCTAATCGTTGTCCCTTGATACGGCACCCCGCGGAATAGGAGTGTAAATGTACACAGCGGCTACCAAGGAAGTCTTTTTGTTTACGCCACTAACATCAGGCAAGGGTAGAACCCCTGGAGC")) -(assert (= z "gugggcuaggaacac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 deleted file mode 100644 index e6f06cb70..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0310.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCCCACGATTTCAATAGGCCTGCTTGTTAAATGGTGCATTTATCGTCACAGCCTAGCAATCACATAGTATGATGTGCGGGACACGATTGCAATCGGGACGGCCTAGTTACATAACCGTCGGCGAGACCCAGACTACTTCTTGTCGTCATCTTCCTTAAGCAGTCTATGGCAGATTTGCGCCCCTCCGGTTAACGCGGTC")) -(assert (= z "gaccuugcaaauagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 deleted file mode 100644 index acdeb50dc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0311.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GATTTCGACATGGCCGACTCAAGCCGAAACACGCGCACGTTGACATTGTTTTCTTTCGCTAGTCAGCGGTCTCGGACTACAACGGACAACTTACTTCTCCATATAACATTCGCTCGATCGGAACTACACAGCGACTCGTAGAAAGAAATAAGTCCCACCTCCCGCGTGCTTGGTAGAGAACGATCAAGGCGTTTAAAATG")) -(assert (= z "agcuaagugaugauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 deleted file mode 100644 index 1ee631a9b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0312.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAGAAGCGTTGTTACCGACCTCATTTTCGTCTACGAAGGAACAGCCTAGATCCGAATACATTTACACTTCCGCCTTAAGATGTTCTTCGGTCGACCGGTACTCACAACAAAGGATCTCCAGTTACGGAAATGCGTGATCCTTACGTCGCAGACCCATAGTATGTCTAACGTCCTATTGCTATGAGTACTCCTTGGCTGGA")) -(assert (= z "ggacccacagcuccu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 deleted file mode 100644 index 6ce1e526a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0313.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAAGATTCACGAATCCTGCCATAGAAGAAATTGCCTAATAATCGTAGCGGTGAAGTTACAGTGGGGAACACCGGTGACTGGTAGTTGATCCAGCTACTGACTATAACGAAGTTAGCCCGGGGCCCAAAAGCACTTAAAGGGTCTCTTTCGAATACGCCTGCCCCTCATATCAAACTCTCCGATCTCGACAGTTTTTGCTC")) -(assert (= z "aggacacgucuaguu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 deleted file mode 100644 index a70b93dfd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0314.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCACTCACCATAAGTCGTGCCAGACGCTGTGCTGACAGTTGAGGTTCGGTAAATAACAGGCGACCCTATAGCGTATATTCGCGCAATCGTTATGGGCAACAGCCCTATGGCCACTGGGTTTCTTCGGACAATATATCGTGGGTACGGATTTTAACAACTGATGACCACCAGCGGGGTCTACTTTCATTAGAGCGGGTCTT")) -(assert (= z "uucgauagcugggcg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 deleted file mode 100644 index f96bd41fd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0315.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTGTAAGCTCCTTCAATCGCATATCGGACCCGCGCCTAAGTATGTCCCTGCGGAATCTCAGGGTCGGTGTGCTCCGCGAGTTGCGGTTTACCGATCGGTCTTAGGCACCTTCGTCTTCTCTCCTCCGCGCCCCGAGACTTTATTCAAGCGCTGGCCTTTCCTGACCGGCTAGATATCTATTTGCCTGCGCCAAGAGAGG")) -(assert (= z "uucuaacgcuaggua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 deleted file mode 100644 index 91a25650e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0316.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGCATTACCGGCACTAAGCTTCACACTAGTAGAGTGAACTCCTGGCTGCTGTCAGGGCCGCATTAAAGCTTCTGGCTTCGCCTTGTCATTAGGGAACTCGCCCGCGCTGACGGCCTTTATGTGGGATTTTGTGGCAATGACTACACGGAACACTGGTGTACTCTATATACCACGATCGGGCCGGACGAGTCTCCAAAGGC")) -(assert (= z "uguauaugauaggug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 deleted file mode 100644 index 1cab1a3e3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0317.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTTGCATTCTTTATCCCGTTTCAGGAATAACAGTGTTCTTACCAGTATTATGTATTGGAACATTAGGTGCGACAATCCGTCCATCAGGTTTCACAAAGTGGACTGCCAATTTAACGGTTGTCGTGTGTGAGTAAGATACCAAACCGGAATCACCAACAGACTACCGTCTCTCACCCGTACTCAGCCTTCTCGTGACTGG")) -(assert (= z "auacuacaacaugug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 deleted file mode 100644 index 7646c52f5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0318.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTATAGGGGGCTATAATCGCCCAAAATCTTACCAGGGCCAAGAGAACTGCTTCACCGAAGGCGGTAGGCCAATGGGCGCAGGATTCGCATCCACGTACGGACGTCAATTGGCTGAAAGGGCCAACTACCGCTCATTGAGCGTTATCATTTTCCCTAACCATTACGAATTGTGGGGGATATGATGATCGAGCGGTCCATG")) -(assert (= z "acggaacuucucgca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 deleted file mode 100644 index d81fdabba..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0319.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCAGTCAGTGCTTTGGAATTATGTACAGCGTTTCTTTAGACTGAACTGGACCCTTAGGTCTATGGTGTGGCTGAGTCTGACCGCATTGTCGCTCCCCCTGAGTGGAACTTGTTTACAATCATGCTTCACCGTAGGTGAGAGAGACGTATGGAGGGTACCAGAGAAGGTTGGGAGGCACCGGTCCGCGGGATGACGTAGG")) -(assert (= z "caaguaucgguucug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 deleted file mode 100644 index 8490cad5a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0320.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGTTGAAGGTCTTAACCTGATGTGTGGCTAAGCAAGGGCTTGTACAGGATCGCGGAAAAGCGGAACAAGCGCTCAGCGTGACACGCGCTATTTGCGCTCTTGTAAGGAATTTGGCGCAAACGTTCCGTTTACATAATATGCCAGGCCACTCTCCGCTAAGCGTAACCCTACGTGTAATAAAGCAATGTCTCTTTGCGAC")) -(assert (= z "ggguucguuaacaau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 deleted file mode 100644 index 9ddbc92a9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0321.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTCTAAAACCGTGATGAGCCACGTTCCAACTCCAAGTGATAATTGCAATATGACTGGGGACAGAAGCCAAAAGATGCGCTTGGGCACTCCCAATAACCTGCAACGTCTTGGAATCGGAGCCCCGGTCATACATTCAAGTGTTTAATGCTACGCCGCACGGATGGATACTGGGGAGTGAAGCTACAGTGAACTCATAAGT")) -(assert (= z "guuaaugccccccca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 deleted file mode 100644 index d9e4a9fd6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0322.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCGGCTAGTGTGTTATTATTTTACTGTCGCAGTAGACGGCACTGGTGTGGGTCAGACGTGTAAAGGTGGGCCGCCGGCAGGCTTGTTATGGGTGCCAATTTCCTCTGCCGACTCTATCTTAAATCCCATTTACAGGTGCCACATGTATAAAATAGGAATCAATCGCAGTGCGTTAGGGAAGGTACGCGTGCTAAAATCC")) -(assert (= z "uccgaugagauagcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 deleted file mode 100644 index 06f674253..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0323.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACGGTATGCGGGTCTGCTTTGGTGTTTTTCTGTGTCTGGATCTCTTGCACGACTAAGGTGTAGTTTCCCTAGCTTAAAGCGGTTACGCAAAAGCTCTTGCCGACTCCCGCTCTGACCAGCATCAATTCATATAGCTGCTTAATGGCGCTGATAAGACACGTACAGCAATAAGCCTAGCAACAGACGCGACAAAGTCTAT")) -(assert (= z "gacucuuggagucuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 deleted file mode 100644 index 21e644d90..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0324.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACTCCTAGGTGGGTGCAATCACATTGAGGTCTGTAAAGCAAAATGCTTTTTATCGGGAATGATTTCTAATTTTTACTAGAGAAATGCCCATCCGTGGGCACCGACAATGACTGTAAGGGATGCGCATCTAAGAGACGGACAAATGTATGTTGGCTAAAACTTCCGACCTTTGCTCGTCGAATTTTGAGCATTACGGTAT")) -(assert (= z "accggccaauagaug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 deleted file mode 100644 index 6755ac6f8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0325.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACGCTTGCCCCGAAGCGTGTTATCGAGGATGCGAGTCACAGTACTAACCCTCACGAGTTTGTCCCTAGATAATGGGAAGTCACTGCCACAAACCACCGATGAACCCCAGCTCTCTCACATTCCACGCCATGTTTGGGCGCACATATTCACGTCCTGAACACAAAAAATTCAATTCGCAAGCGATAGAGTTCGTCAGTCTG")) -(assert (= z "gcucaguuguugugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 deleted file mode 100644 index 3a6df5418..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0326.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAAATACCAATTGTAGATGCGGTTGTGCTAGCCTAGGAACTTAAATACACAAGATCACATCGTCGAGAAAAACGAACCGGTGATAGTTAGGTCGACCCGGGTCAGTGAAGTCTAAGCGGCTCGGCCACATGCGGCCCCAGGAGTAATAGTTGCGGAGCACTGGTTTGGGACCCTTGGGACATAACTGTGCTTTCAATTAA")) -(assert (= z "gcuccagaauuagag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 deleted file mode 100644 index 006014b36..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0327.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTAAATAAAAGGCATAATCTACTTGTCTGCTATGGATATTGCCCATAATTTGCATTGAGTGCATTGGCCTTAAGAACCCCCCTGTCCCACGCGTTGCGTGTATTCAAGGGTTCCTTACAGCAGTGACTTCCGAAAATGGCACGTTACCGGCCGCAGTTGGTATTAAGCACATTTGGCCCTGCTTGCCTACGACATGGAGG")) -(assert (= z "cauugcugggucgca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 deleted file mode 100644 index 6fc738a4c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0328.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAGTCCCGGGCACGCTATATCACTGAGTGATAAGACCCAGGCCCAATAACCAAAGATGGGGCGTCACCTCTGTCGCAATACGTCGGTGAGTGTCCCCCTTGCAATAGTTATTGCTGTAGTTATCACTGAGCAGTCGGAAAGCCGAGCTCGTCCGAGGATGCCAGTGGGCAGCGCTCGTAGAGATCCCATAACGCCAAGG")) -(assert (= z "guauccguacugcgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 deleted file mode 100644 index aafe81f52..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0329.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCCTAGATGGTGATTCTGCTGACGATGGTACTGCTCCGCTTCGGATTCATAAAGCTACCAACGGCTCGGTTGGATTTGTGCGGCCTGTAAAGGAGTTAAACGTATGTTGCTTCGGGCTCCATCCATTGGATGCAAGTAGGCGGTTCTTGGGCAAGGAGTCGCGGACCATTATCGGACAGAGTGGAAGAAGATATGTCCC")) -(assert (= z "ucucgcgccugucuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 deleted file mode 100644 index 13a915143..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0330.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGAACTATGGACGGGAATCAGTATTCGATCTGTCCACAACGAACTCTTGTATGGTTCACGGGTAGTAATCCGCGGCGTTGGGTTGGGGCGTTCACGAGCCCCTGCGCGATTCGACGTAAATACATTACTTGAGAGCAGCACCATGGCGCGTTCGCCGAAATAGGAGGCGGGCCATGACAGTATGAGCAGCGCCTACCAAC")) -(assert (= z "cucguggaccacgcg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 deleted file mode 100644 index 3ce5a2461..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0331.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGTATAGCCCAAAGTCCATGGCGTAGATATACTTTACTTCAAAGTTCCCTCAACCCAGTTAGCGATACTACCGTGTGATGTACGTATACGCATGTACAAATTGACTGCCGTTCCTTTCGCGACCGGTGGATGCACGGCAGTGTAATGATTAGCAAGGCCCTTCGAGAGCCATCTGCAGGACGTGGGCATAGTAGCGCTC")) -(assert (= z "uaacccugguuccaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 deleted file mode 100644 index 50e5fb642..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0332.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTATGAGCTAGCCTTCCTCGGCAAGTATACTCGCCCTCTAAAACCCAGATATGAGCTCGGATACACTCGATAGACGGATATTGTGTAGAGACCAGTCCTTACTTATCTCATAACGCTGCCCGCATCCTCTGCCAGAAGAGCTTTTACGACCTCAAAGCTCTGTCTCTGCTTATTAGCTCAATCGGTCGTACGGAGATAA")) -(assert (= z "ucuaucguugagaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 deleted file mode 100644 index 095c3dd60..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0333.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTCTCTGCTCGAATCTATCCAACACCGTGCGAGCGTTTCGAAGCGATAGGTCTACGGCAGTGCAACTTAGTGTTTGAGAATAGCGGCCTTTAAGAGGAGACCCCATGATACCCGTAAGTCCACGACTTACGGGTTGACGGTTACTGATTTCAACATTGTGGCGGCGATCGTCGGGGGGCGGCCATTGGCATCTTAAACG")) -(assert (= z "acucgugguccaugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 deleted file mode 100644 index 23e92e93d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0334.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGGCGATTAAGAGAACTCAAGGATAGGGCATTCGTATATGGCTCGCTAAGGCTTTGCGTCTCCGACCTGGTTTGTTAAGAAGCAGTTATACGAATGATCTAATATAGCTATACTTATCACACAGGTGCACCTGCGGGTAATTTTCTTGTCGCGGCCACACACGAGGGTGGCAAGATTGTATATGTTCTCTCAAAATCCG")) -(assert (= z "cuacugaugaccagg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 deleted file mode 100644 index 595e4882e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0335.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTATTCTAAGTTCGGCGCCATATGTAGGCACTGAGGACCAGCGTCTAGTTGCGAATGCACGCTGTTATTAGAAGTACTGTAGGACGCGGCTCACAGGGTCGGATTCTTTCAGAGCCGGGTCCACTACGCCTCTGAGGCAACGTTACCGGAACAATTTGCAGGCTATTGCGTCATTGGCCATCATATCATATAGCACAGA")) -(assert (= z "acagggggaacuccc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 deleted file mode 100644 index 54bdfe310..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0336.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTTACGCTAAAGCAAATAAATAGGGTCATGGGGGTTCACGGGTGGAACCGGACAGATGAGTAGGTGTTAAGCTAGCAGCTCAGGGAGAGATCGAGGTGTACTTCTCTTGATTCCTATTCGGCAATCCGGACTACCCACCACTAATCCATTCGTACCCGCGTAACAACGTCAGCGCCACTCGAACCCAGGTACATTCACA")) -(assert (= z "ccaacuaacuguccu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 deleted file mode 100644 index eac4284ff..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0337.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGAGTCTGTGTGCGTCTCGAGTCGTACTTGCGTGGACCGTTTGCAAGGAAAAGGGAATGTGTAGCGCGGCTAACAACTATGAGTAGTGTTCAGACTGCTCACTTGCGCAGCCCGGGCCCCTGGGGTCTGCATGCGGCGGGATAGTCAATGCATAAGGTATTCCGGTATCCGGGTGTGTCCTAAACCTAGTTTCATCCGG")) -(assert (= z "cgcgucacuuuggcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 deleted file mode 100644 index 77bf1f91a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0338.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGCGCCCGCGCTTCAACTCGTCGGTTACTAGCCACAGGGTAAGACTCTGCAAACTTTGGCAGCAGCCCCTCCGCCCATCACCGCGAAACACCATCAAAATCATAACGATGATGAAATCTATCGTACCGAGCTAATCTTAGCGTGGCAGAGGCCCCCGATAGCACTAATTGCATTTATTGCTCCATGACACGCTACTTAC")) -(assert (= z "augguccgcguugcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 deleted file mode 100644 index 317403327..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0339.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCCTTGATTACCGAGTTGTCTATTCCGTCGTCGTTAGACGCCAGGTTGAACATATTGACGTAGATCGTACACTCTCTATTGCGCGGCGTCTCCAGAGATATCCACGGCAAAAACGACCAGCGACGAGATCAACAAACATTCTTCTTAGTGCAAGCATGGTGGCTGCGAGGGGGTGAGTAGTAAAATCCCCGTTGTTATG")) -(assert (= z "gacaaccgggaugcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 deleted file mode 100644 index 90391022c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0340.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCGGAGCGCCATTCTTTCCAGTAGGACCGATGCGGCGACGTCACACCCCGAACGATTAGGACTTAAGATTGCGCGTCCATCTGCATTTTAAGTAAAATCCCTCCTGATGGCCCTTCGTCTCACTCGAAGAAACCACGCTTAACACCGAGCAAAGGCGGGGAGCCCAAATGGGTTGCCGGGATCGTACTGCCCAACCAGA")) -(assert (= z "accauacccgacaug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 deleted file mode 100644 index 6796135b8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0341.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGCAAAGAGGAGTTCTCTCTGAGTAACGACACCTAAGCTGACACCTGACCCCGCACAATTGACAAGTATTGAATTAGTATTAAGGAAAGACTGCCCTGCTCCGATACAGGGGGCACCTAGGACGCAGGTTCGTTGTTAGGCTTTCCGCGAAAGAGCTGCAGTAAAACCCCAACCTATCTCTAACTTCAGTTTCCGCTATT")) -(assert (= z "ucccgcggggggaau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 deleted file mode 100644 index 05a6b8496..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0342.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGTCGGGCCCTATAAGATTGTAGAGCGGCCCTGGAACTATAGTCCGCAAATTCAGCGAGCCTTAGGTAGAACCGCGCACGGCTCTAGTGACAGGTGGCAGCCTGCGTTTCTCCCATTATTGATAACCCCTCACATGTTAATCGTTCAATAATCAATGGGATAGATGCATCCGGTTGCTAATGGGGCTCCACGACCTATGC")) -(assert (= z "auaacguucuaaucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 deleted file mode 100644 index 8d728da5c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0343.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGAGCGTCGTCACGGCGTAATTGAGTTGGCTGTTACTTAGCACTATCCAGATAAATTCCCCCAACCGCCTTGGGTGGCGATATCGAGACGCGATTAAGCACGGTATTTACAGTAGTCAACTGTTACCACCGCTTCATCGACCCTACTGGGCTTTGCTCCCGTTTGGAATGCTATTACGCGTATCAAGCTTTTTTGCATC")) -(assert (= z "cguauguagcacguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 deleted file mode 100644 index 4915cd479..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0344.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAATGGTATAGGAAGCTTTCTTACAGCTATGGGGTTATAATCCGCGTGGTATCTGATCCGGCTCTGCCCACTGCTCTTATTGGATTGTTGCCTATTTAGTTACGACATGTACGTCACAGGTCTACGGGCCCTAGTAGCGGACAGCGCGTTCTAGCAGACTTAACGACATAGGCCCAAGGCCCGTAACCTCTGCGCCCTGG")) -(assert (= z "agggcucaguuucca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 deleted file mode 100644 index d10765792..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0345.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACCGGCTCGGGTGGCGTACACGGGAAAAAGTCCTCTGTAACGATAATGGGAAGGTACACCATGGCTCGGAGCCGCTCTAGCTACGGGACCACGGGCTCTTTTCCGAAACTGTGAACCTTGGATTTCTCAATGAGAAGAGAAGCGCATGAGTTCGCCCTCGTATGAACGTTATTCGCGCCAGGTCCTTGCAGGCATAAAG")) -(assert (= z "augccaugggacugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 deleted file mode 100644 index ff7235b96..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0346.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCGCTACTCTTCTCGCAGCTGAACTGGAGTCATCTTCCGCCTTGGAAAGTCCCCGATTCAACGCGAAAATAAACTTCTTTTGTGAGGAGCGATCTGCCCAATAATAACGTGCATAGCCTCTTAGGGTAATAATATATGTGTCATCGGACCTATGCCGGGGTTCCTGACCTCCCCATACATACGGTAATAGATATTATCA")) -(assert (= z "ucacucaugacgucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 deleted file mode 100644 index 4a1241ccd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0347.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCTGGTCTGTCTTCTAGGAACCGGCTTTACGGAATGATAGTATTGGAGCGGTTACGGTTCTGAGATTGCTGCGTGCGAGAAACAAGTCATTTATAGCTAGTCCGACTGTGTAGTTTCCTGGGGATTAGCCTGTAGCTTTGGCGCTTTCATCGTCCTATCGGAGACGTACGGGTTCATCAATTGCAAAAAGTATATCAGC")) -(assert (= z "auagcaaacauguac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 deleted file mode 100644 index 090d382d6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0348.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGGCCAGTGAAGACGACCTAAAACGTATGCTCACAGCTTGAATACTAAGCCGTTGAGTTTTCGTCATACTAGGCCTCTGTTGTCTGTGTTGGGACATCCGCCGGTTAAGATTTGCGTTAGGTGTAACCCGCATACCGGTTAGACCTCATTCCGTATATGGAGCTGCCCTCGCGATATAAGACGGTAGAGTATCTAAAAGT")) -(assert (= z "ugagcgccauuguca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 deleted file mode 100644 index 7345eb0a4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0349.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAGCGAAACTTCCGTCAAAATGTACCCTATCAGTTATGTTTACTAAGAACACCCTGAAGGCAAATACCGCGTTCGGGCCTGAAGGGATAAAAGGACGGAACTTGCACTTTCTACGTGTACGTTCCTTGCTCACAAGTGCCGACATAATGAGTTTTAACGCGGCAAGCGCGGCCACATGGCTGAAGGGATCGGCTACATTT")) -(assert (= z "uccccuugucgggag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 deleted file mode 100644 index a8d302c3a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0350.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGCCAGTTTTCGTGGACAGTTCCCACAACAGATAAGTGTGTCCTGGTACCCGAGATTTAACTGATTGAGAGCTCGAAGTCCATCGGTACGTGAGATTGTATGCTAGTCCTAGCAAAGCGGACCTACATCTTCTCACTGATTCGTACCTGCGTGTAGCCTCTTCTTCGCCATCATTATTTTAAGGAGGGCGTGGGACAGTC")) -(assert (= z "aaaggaccuagucgc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 deleted file mode 100644 index 549880676..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0351.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGTTGGGACGCGCGTTCCTGCACATCAGGCGTCTGATACAGATTACTTCCGGAGAGGCTGAATGACTCTAGGCAAATGTCCATCGATAATCGAGAAGGAACCAGCCGGAAGGGCGGTAATGACCAGAATCTCGTCTTTGAGCCCCAATAGCATTAGATGAAGGGTTCGGAGTGTGACTTTTCCTGAACTACCTAGGACGC")) -(assert (= z "gagcgacacaguguu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 deleted file mode 100644 index 5368bdf14..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0352.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTATCCGTGTTCGCAGCGGAATTTTAGTGCATACCCGTGCATGTCGGAACAGAATCGATTTGTCGTAGAAGTCGCTTCGGTGCAAGCGCCGTTATGGTTTAGGGTTGGAATGTCTAAAGCATGTCATATTCCACACACACCGTCTCTAATTCGTTCAGCGGACCCTAGGTCATCAATGCCTCGTTGGCTTAGACCGGGC")) -(assert (= z "uggcccauucacacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 deleted file mode 100644 index 901244651..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0353.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACCAAGGTGAGCGTATATACAAGCTCTTAGTTATGTTCTTTTACGCTGGGACTTAATGCCAAAATAACTCGTGGCACTAAGTATAAGACCGCGATTTCAGCATCCTCACCCCGTGTTGCCCCTGCTTTCAGAAGATGGATGCTCGGCAGGACCTGGCGCGTTTATCCCGTTGCCCTGGCAAGTGATGGGTAACGGTGGG")) -(assert (= z "cguggagcggauccg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 deleted file mode 100644 index 076c6ff02..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0354.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGATGCAGATCTGCTCAATTCCTGGCGACCTTTGCAAACGGTATTCCTTACAGTTCAAAAATAGACCGAAATCATTAGGACAGCCCTGTTGGGGATTGGCTTTCCTAACACACGCGTAATAGGAATCCTTCATACGGCCTCAAGCGAATGCTCGGTTTAGATGCGTGTAGTTACATTTTGCCTGTAACAATCTTAGCCGT")) -(assert (= z "accacaacgagcgau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 deleted file mode 100644 index 74a71fd17..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0355.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACGCTCGAGGTTACGAATGCTCGCGAACGTGTTGGGGCTGCTCCATAGCCCTCTCCCCGTGTCCATTCGCCAGCGGTACTCACTTTGTGAACAATCATGATCACAAGCCTCGCACAGATGTTCGGATCGGGTCGCGCCGCCATGAAAGCCTAGGGAGTCGAAGAGCACCTGAATCCCTCACCCTCATAGCCATACGTTTT")) -(assert (= z "ggaguggacgaguga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 deleted file mode 100644 index 5d702df2f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0356.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTATGAAGTAAATTGGTGTCGCAAGGCTCAGCTAACATCATGGATTGGACGTCCGGCGTGGTCGGTAATAAGCTTACAATCTATGAGATTGTGGACCACGTCAAGTTAGCTGTGATCCTGCATAAAAAGCTTCCCTTCAGGATATGGCCCTTCAGCCCTAGTTATGCCACAACCCGGGTGTAACCATCGCTGAAATTCG")) -(assert (= z "ucacguagcuuccuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 deleted file mode 100644 index a4baced53..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0357.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACGCGGTTACTAGTTGATCAAAGCGGTTAAACATCCTCATCACGTGCCCGTGCCTCGAGTAGAACGAAATTCTCTGCCGAGCAGCTGATCTCTTCTCAGTCCATCAATGAGCGACAAGCAAACTCCACCTGCGAAATTTAAGCACGTAGTCATATATTCAAAGCACATGTGACTTGACTATCTTTGGCTGGAATACGCGA")) -(assert (= z "uuggcaugcuuuuga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 deleted file mode 100644 index 3efa8c8e8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0358.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATCGAAGTGGCTACAAAACTGTGCACTGCAGACCCAACCAATTTAAGCAGCGACGTCCCGTCGCTATTGGGCCCTATACCACAAACGGACCGCACATTGCTTGAAGTGCCGTCCTGCGAGGTTCTGAACACTGTCAGATTGGGTATGGCCAGGTGAATATAATGGACTAGCTCGAACGTCTGGTGTCCTTAGGGCTCCAC")) -(assert (= z "aucgcgagaggacug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 deleted file mode 100644 index 548fb9887..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0359.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGATGTCAGTGGGAGTTTCGGCCTTAAACCCTTTTTGGACTACACATTCTTACTGCGTACAGATTGGATTCTAGGGCAATAAATACCGGGAAATATAGTGTTGGAAAGGGAGTTACGCGATCGTTTAATCTTGAACGCGCACTGAAGCTCACTCATGTCGTCTCGCCATAGTGGGTTGTCTGCCTCCGGTTGGACACGT")) -(assert (= z "auggccaucaucuag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 deleted file mode 100644 index 7dfcd8b00..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0360.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTAACGACAATATCCTAAAGTGGGACTGACCAGCTTAGGACCACCTTGTTCGCGGCAAAAATCATATGTGAATCAATGTCGCGACGATCAGTACTAGCGTATTCGTGATTACTACAACGGATTAAATTGACCGTATGCATTTCAGACTTCTCTCTCGCTAGTGGCCTCATCAGCGTAAGATAATCAAAGCATCATTCCCT")) -(assert (= z "gaaauaugccgucug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 deleted file mode 100644 index 680c409f0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0361.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCGGATCGACCTGCTGTCGGTACTCTCACGAGTGTACAACGTTTCGCCAGCGTCTCCCCATACTCATCGAGATAATCTCCGAACAGGACACATCGCTTTCAATCCGCAAGAAATTCTCTTAGTGTGGTGGTCACCTACAGGGATGTGCTAAGGGGGGGGGACGAGGTATTCCTTGCTTGGCCTAGTACATAGAGTACTC")) -(assert (= z "cgugucacucguagg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 deleted file mode 100644 index 5f5660f07..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0362.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCCAAAAGGATGATGATGGCGAGAGAGAGTTTACGTCTGAGCCGAAGAGCATATGAGGATGGTTTGCGGGTGGGTTGGGAAAGCTCCAGTAGAATGCAATTACCGGCTATCCACGCGCATAGACACCAGTGAACGGACGCTATATTGTGGAGCATCAAGAATTTTTGGTCGCGCCTTAAACAGTTGAACCTCCGAGCGG")) -(assert (= z "gcauugauccucgug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 deleted file mode 100644 index 90bc264c9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0363.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGTCCACGATATTGCAAGACGAGGGATACTTTACGCATAGCTTCTTACACACGGGAGAAACCGGACTAATTACACTTGTAACAGTAAAGTAGTACATTCCGCTTGTAGGCTGGAAAGGGTATACCACCTCCGAGTAGCGTTGGGCTATGCACGGATCGTAGTTGTATTCTTTCATCGTCCCAAGAACAAAGATAGGAGA")) -(assert (= z "auguggauagagacg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 deleted file mode 100644 index 2385e5aa8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0364.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCTTATTACTTATACACACGGACCCAGGTATGGCGAGTTAATCTACGTCATTGCTTTTGCCCATACTAACATGAGTGTTAGAAGCCATCTCCCCTTCAAGTTTACACTATCCGCAGTGAATCATTTATCACCAGACGCCAGCCATCGCCGGCAAAACTAAAAAGACATGCGATCGTACCGGGAGGGTTTTCGACCGCGCT")) -(assert (= z "uaaccgcguugucgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 deleted file mode 100644 index 005e75382..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0365.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGAGTACTGGGGAATGGTGATTATTTTACATCTCTGAAATTTAGCACGGCTCCAGCGCGATGCGTTGATCAAACGCCCAGATCCGGGGTGCGTGCGTGAGCGGCTTATAACGATCAAGTTAGGTGTTTGGTTCTTATCGATATGCTACGCGACCTTTCCTGATGCCACAAGCTAGACTGGCCGTGGTCCTATAAGTAGGT")) -(assert (= z "agaugcggucuaucu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 deleted file mode 100644 index cfe7d7aa9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0366.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGGTAGGACAAAACCTCTGTCGAACACTCGAGGTTGGTTCGCCGATCGGTGCCGTCTACAACGTGAGAGGCCTGATCTTAATTTTCGGCTGTGGACTATGTGAGGTCAGAACTCCCTTTAATCTGCGATATAGGCGTCTGTATAGGCCTTTATACATCTACCCAACCAGGTTGCAGCGTGGCAAACCCAAGTAGAGCAA")) -(assert (= z "ccaacagcaaucgug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 deleted file mode 100644 index 701d71bec..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0367.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCAATGCCCATGTCACCCTCGTAGAACCACATGTTTAAGGGGAGTTTCTCCTTATCGGGCGCGAATGACTGGACGTTTAGGTCTAACAGCAGTCTCTGATAAAGCCAAACTGCTAACAGTACCGTTGTACTCCTCAGACATCGACGCAAGATATTTCCACAGGACATGGCTGGCGTATTCTCACCGATACTAGTATATT")) -(assert (= z "acgggcaugguguau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 deleted file mode 100644 index 954ede5d6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0368.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACACCTTGGGATCGGGCAGCCGGCTAGATTGACAGCATAAGCATGCTAGGCTCGCCTCGAAGCATATGGGTAAGTAGCCCTTGCACTCCCTGACGCTTAACAATGATTTAACTGCACAGCCTGTCATCCGACGTGAGGATGAACATTGAGTTCGTAAGTCAAGTAGGTGGGCAGTCCTCGGACAGCGGCGGTCGAGGCTA")) -(assert (= z "cgcgugauguuuugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 deleted file mode 100644 index 6342302c2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0369.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAATACTAGTTGAGGACCAGCTTAATCAGAAGCAGGCTGTCGCTGTTCGGGTATAAACTGTCTTCCAGCTCCCAGTAAGATCTATCTCGCTATACAGAAGTCTACAACCAATCATTACGGCGTGTCAAACCTTAGAAGCTCTACAGAGGAGTCATCGTAGGCAAAATGAACTTACAAGGTCCGACCACTGGATAGCGGG")) -(assert (= z "ugacuccaaccaacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 deleted file mode 100644 index b31330e8f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0370.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGAGGCTTGATATAGACTTATCAATGGGACAACGTTAATCGTTTTGAGCGACGTTAGACCTGTTTTGTCCGGCTTCATTCTAAATTAACGAAATGCTGAACATACAAGCCTTCCAGCAAGCGATTTAGATTCTAACCCACGAAAGTCCTGTGCGATGACTTGCGCGTGAAGTTGTATGTAGTATTCGTCGTGCACTTCA")) -(assert (= z "cgauuaucauccauu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 deleted file mode 100644 index dd86223af..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0371.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAAGCATCGTAGTCAAAACACTGTTACGGTGCTTCGGAAATCCGATGCTCTCCGTCGAACAACATAATGTGGCAGTCAAAGCCCGGTTGAACTAGCCGCCATTGCTCTGTCCACCGGTCCGTGCCACGGCTAATGTCGCGAGTGGGCGCGCTTGGTGACAATAACGTCGTACCGGCAAGCCCCACGAGCTCGCTAGATGT")) -(assert (= z "cgggauucuuaagga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 deleted file mode 100644 index 593baf1b6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0372.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCGTGGCCATTAGCGAGAGATTTTACGGGTCGTATAGTACTCGCCTGGTAAGTGTAGTGCTCTAGGTTGTCACTGAAGACGTGTACACGACTCTTCATGTCCTCCACCAAAGGTAGTTCCTCGTGATACAAATCTAACAACCAGAAGCCGCTATGCATCAAGAGGCTAAGGTGCCGAGCGTATTAGACTTTAGCACTGCG")) -(assert (= z "agccgauuuguaaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 deleted file mode 100644 index 43a9c533e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0373.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACAACGGGCATCTGCTATTTGTTCGAGTTTAGGCCAACCCTGGACCAAGGCCACTCCTCCATCCGATGGGCGGTCCCGAACGCAACCGAGCGGATCACGCTGGCGTCTGTTATGACTGGATAAGGCGTAAGACGGCGTGCGCAGCCGTGGGAAAGTTTTACACACCCGTCATGCGGATTAGCAAACCGGACGCTAAGACT")) -(assert (= z "caacccugcacccug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 deleted file mode 100644 index 9cfdd8ba7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0374.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AATTATACACATCAGTACTCCACTATGCACGGAAGGCGGCAGGACATGGCTGGGACAACAGGCAAATCGAGGTTACGCTTTTTGTATAAGGTACATCTACGATGGCAGCTAAATGCTGCTGACGTCCGTCGAATTTTACGGGACAAGGCCACCAATTCACCTTAGCGGCCTCTGTGAGTACAAAACCAATACCATTATTC")) -(assert (= z "gaguugguaccggau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 deleted file mode 100644 index 12a1100ec..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0375.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGAATGCGCAAAAGCCCTAATCGAGTACGCTTCCCGGCCCTGTGTATACAGGCTGTAGTACGCTCTAAAACTCGATCCTAACAGGTTGCCGCCTTGACGTCGTATAGATATTCGACGCGATGGGCAAAAAGGCTCGAGCGCTCTTCTCCTGGAATAGTTTGGCGAGAGTAAGTAGCAAGCCAGTTACTCCGGGGACGGCG")) -(assert (= z "cuucguccgguggaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 deleted file mode 100644 index c9f1e476d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0376.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACAGCAATAGCAATAGCCCCGCGTGTCATAGTCCGTTGGATCACCGGCGGGGAAGCGCCTTCATTCTACAATGAGGACTCGGAAGTCCGATCAACGATCAGGGGCACCTTCGGGACATGCCTGGTTGGACTACAGAGGTAAATACGGGGGAAGGCAGCCTCTGCCATCACTCGTCCGAGTACGACTGATTTCTTCATAAG")) -(assert (= z "uacaaccguuuauca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 deleted file mode 100644 index 33f618e79..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0377.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCCTATGATACGAAGCCTACGGATAGTGCATCATCCACTAGTACGAGCGAACGCATGTCGTCTCCCTTCCTGTACGGCCTATAGTTCTCCTCATGTTTCACGTAGTAAGTACATTAAGTCCCACCGTCGCTTGACATATTCTCCGGCTAGTATACCAATCGGCGGACACCTGATCCTCCGAATAAGTTATCTCAACTTG")) -(assert (= z "cuaccaaggcuaggu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 deleted file mode 100644 index ad68e569a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0378.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCGGATATAAGATGGCGCCGTGTGTCGGTCTCCCTGAACTGGGGTCATAGATCCCTGGGCGATCCCCCCCAAAACAATTACTTTCGCATGTCCTTATTAGCTATGACCGCGATGCAATATGAGGCACGAAACTGTCGTACATGACCATGGTGTATTCAACGGAGCTATAATCTTGGTGTCCGATGAGGAAGAGTGCTCA")) -(assert (= z "cugccgauauguaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 deleted file mode 100644 index 05b318d30..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0379.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAGATATATACAAACTTCGTGAGAAGGTTGCCCCGATGACGCATCTCCCGTTACAAACTGCATGGAGAAAAATAAATAGGAATTATTGATTTCTCATGCTTCCCAACTTCTTCAAAGCGCACATTATACTGCACTAGAGAACTTTCTACTAACTGTAGAGTTACAACATGGTAGCGGGTCATGGTCGGACCAGTGCGGCG")) -(assert (= z "ccugucgguacugua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 deleted file mode 100644 index 9aceb4fe2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0380.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTAGGTACATCTAAGTCAACACCTGTCCGATCACCTATTACGCCACCGGAGCAGTTTGGCTCCCTGTTCTTATGACTATGGAAGACGGCTCCCGCGCAAGTGGCCAAGAACCCTATTGTCCACATAACTCCAAACCCAACTGTACGTGGGAAAAATTGGAAGAGCGGACAAGGACTAGTTTTGTTCGTCCCCCGTAGCA")) -(assert (= z "gugcgaaaagaauga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 deleted file mode 100644 index 71748ea16..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0381.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTCAAAATCCTAATTCGGCCTACACTACGGGAACAACCCCTTGTAACTTGATTACCCAATGTTGTATACCTATGTTGACCCAATCACGCGTTCGTATCCTACCCTCCGGCTCGAAAAATTACACTGGCCTCACAAGAGTTTGCGTGAGGATCGGGTATAATATCTGCCTTTGTGAAGCTATCTTATGGGTAGACGTTGG")) -(assert (= z "aaggguuugaauugg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 deleted file mode 100644 index d68d16e1a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0382.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGGGAACACTGGACCTGTTTAGTTACACGTGGGAGGAGTCGAGTGGGAACCTCTCTAGACACGGTCTTACAATATTTCGTCTCGCTATATAACGTTTCTCAAGGCTTCTGCTTGTGCTGAAAAGACGGTAAAACTAGCGTAAGATGGTAATAATACGATCTCCAACGGAGTGTCCTCGTAATACGTGAAACTGGCTTATC")) -(assert (= z "cuuugguacaguuug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 deleted file mode 100644 index 2f149e457..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0383.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAGCAAAAAACTCAGCCACTCTTCCATATATAAAATTCTGCGTCGATGCCTTAGTCTCCCCGTGGTACCGTTAACCTTGCCTGCCGTCGTAGGCAGCCTGTTGAGGGTCTTCTAGTGGTACGTAGTCGGAACGGCGCCCTCTTGGTCAATACCCGCGTCGAAGATTATGAAATACAGTTATCTAGTGCCTGAAGACTTT")) -(assert (= z "cuguggauccagacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 deleted file mode 100644 index 72785df46..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0384.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAAAGCCCTCATCTCTGGTTGTCTCGCGGATACCTGTCACGCGATAAAGCATATGACTATCACCTGTACTATATTATGGGAGGTTCCGTCTGGAGCATAACCCCCCGATGGCCCGTCGAGTCAAGGGCACGTGGAGAAATGATCCCTATACGCACCTCGGGACTCTGTTTCCTCAACCGAACGCATGTAGGGTGGCTTAC")) -(assert (= z "uauugaaccuccgaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 deleted file mode 100644 index 5ea276b5b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0385.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACAATCCCGGTGCAATCAATAACGTCATCCAAATAGCTCCTGTCGACAGTAGATTCCCTAATTTGTGGTGGTGCGACCGGTTTCATCGGATACAAAAACATTCGCCGTGAGGCGAGCCAGTGGCTATACCCGTAGTGGTCAGGAAATCATATTAAGCATTGAATCTTCTGCAGCCCCGGAGCAGAACTGTGGTTGCTAC")) -(assert (= z "accguagaauagcac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 deleted file mode 100644 index a8d6a5910..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0386.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCAATCGAATCATAACCTCTCCGAGATCCGATCTGTGCTGTATGGGAGCATATGACGGGAAGTTGGTCGTATTTAGTGCGTCATTCAGAAATTGGCACGAATTCGAGACGGTTTGCAAAGCTTTCTCTTCAGGCTTAAAAGATTTATGTCGTCGTCCACGAATCTTTCGACACTGACCTCTACTTAAAAACCGAGAGCGT")) -(assert (= z "gaaacguaggcaacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 deleted file mode 100644 index 8dc39b5a7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0387.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCCGAACTTGCATACCGAACCTAGCACGGTGGTAAGCCGACCCTGAGGTCGTACATGACGTTTGTTACTCTCCAGACGCAGTGGCAGCTCCGGAAAACCATCGCGTTTACCTGCGAATTATCTGGAAGAATTCCACATGAGACTCTTATTATCCCGGTATCGCTAATTCTGCTCGTCACTCTGGCCTGATGAATTGCCT")) -(assert (= z "agaguggaugagccu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 deleted file mode 100644 index 71b860226..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0388.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGCCCTGGGGATCGAATTAAAGTCGTTCCCTAAATACGGAACGTGGACTCTAACCCATTTCATCGCGTCGAAATCGGTGGCCTGCTGATGCCCCCCGGTTGCGTGAGCTAATATGCAAATGTCGTGGGTTCCTGTGAAGGTCAAAGCTGGTTTACGGGGAGACTACCAGAGGCAGGACAGTAGAAGAACGGAAACTAGAT")) -(assert (= z "gaaagccauguguag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 deleted file mode 100644 index 162c834ab..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0389.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCGAGACACCCCGGACTCCTCATGAAGCTGCATATTAATGAAATGTATCTTCCCAATTCCCTAGGCTGACGAGGACGAATGCGGGGCATCTATGAGCTTGCATTGTCAACCTTAGGTTTACCAAGAGGGGTATGGGCCAACTTACTGCACAGTCTAGTAACTTGAAGGCAGATTGTTAGCTGGGGGCTGGAGTGACTCGC")) -(assert (= z "auuggucacgacaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 deleted file mode 100644 index 63def9da5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0390.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTTAGTCCTATTCGGCCGCGCCGACTGTGACTCGCCCCGATGGTGTGATTATAGGTGGGAGGTCATCACCATAATCGTCCTTGCTTTAACGTGGCAGTGTCACTCATATAGGGGTTTCAAACGTCAATAAGATAGGGAGATGATCCCACGCCACCTATAAATGACTTCCGTAAACAGAGTCCTGCGACCCCCGATGCGG")) -(assert (= z "ugauaaccagcauuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 deleted file mode 100644 index 6681da2fd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0391.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGCGACTTCTCTCGAAGCTCAGTGGAGCCCGCTCACTTAGAATAAAGATTCGTCAGGTCCTAATACATTGGTATCGAGTCTTAAGGTTGGATGTGGGAGCTGGTGGCTGCATGCGTTTGACGTACATTTAGTGCACATTCATGTGGCCAGTATCCCGCTGTCACCCAAAGTGTAGTCTTGTCAAAGTGGTTTCGTTGAGC")) -(assert (= z "cauaaacaagacaug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 deleted file mode 100644 index f0c4378b4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0392.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAGTAGGGCACGGCAGATATCTCGCTCCCGCCCTGAGAGCCAGAGCTAAACGAACAGCGATCTTGTGTTATTGTACGACTAAATTTGGTGAATTTTACGAGTCTGGAGCGCTAGGTTAGTATATGGTACAGAAGAGCAGACTCCCCTAATTACACTCTAATCGCGATGTCGTAGCAAATATGCATGCATCTTCCCCATGC")) -(assert (= z "aucgauacggcuguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 deleted file mode 100644 index 66d6224a2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0393.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTTGTGGGGCTGTTGCCCGCACCGTGACACCGTGTACCAGCAATTACACATAGGAGAACGGAGCCTTCCCGCATTATCGACCCCCAAATCCCTGTCGCACCACCGCGAAGTATGTCCGTATGCAAAGGACGGACTCAGTGTTGCGAAGTCGCCACATGAGTCTGATGAGACACTGCAGCGAAAGTCAGCTACTCTACAA")) -(assert (= z "uccgugggccccauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 deleted file mode 100644 index 87cdcf59a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0394.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCATCCACACCGCTAGGCACCATTCCAATAGTTGCCCCAAACTCTGGCAATGACAATCTAGGCCCGTTCTACTAGCACGTCTTGTCACGCGTCGTGTGTGTCTTGGGAGATGATCGTGATAGTATATATGTTCGCGTGTTACGACGTCAGGGCGCTAACGCCCAGTCTCAAGAGACCGTCTCCTGGATGAGCTGAGCCTT")) -(assert (= z "gagcauucuccuugu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 deleted file mode 100644 index 8890c307e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0395.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCACTCGGACGGAACCGTGAATATGCTGTTTCATCCGTAAATCGAGAGCCGGTACTCATCTCAGTTAGCTGTGTTCAGACGTTGGCAGCGGACTCCACCGTCTTCCTACAGTCTTTGACCCATCGCGCAATTGCTAGGCGAACTCTACTCATAAACGAGCGCGCTGATAATGGGACTATCGTTCGCAATCAACGTACAAC")) -(assert (= z "gccgcuggaaagcag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 deleted file mode 100644 index 0117d670b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0396.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAAGTGTTAATGTATAGCCGAGCCAAGACGCGAGAACCCTTTAGTAGAACATGCGGGTTTCGAAAACGAAATCTCTAAGTTATAAGGCGAGCGAGCAAATATTAGGAGGGAATTCACCGATACAAGACCTTATCCTTCCTACACCAATCACGTTCGAGTCTTATTTATGACTCTAGGGGTGACAAGCATAATGAGACGCA")) -(assert (= z "aucagguugcggcca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 deleted file mode 100644 index de088132d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0397.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCCAGTTGATGTTGGTACCTAGACTAGTGTAGTATTCTGAAGACTAACTCATAGATATAATTGTCCCAGAACGTGGGCTCAAGTTACTCGCCAACATGTCGATATGTATGGGTAACTTCCGGATAAACAACCTACCTCGCATTTCCCTCCTCGTTCCGCCTAAGAACTTGAGCTTATGTATCACGCGCTAAATGCTCCAT")) -(assert (= z "gguggcucgggcuaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 deleted file mode 100644 index 7322a00f7..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0398.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGTACACAACTAGTAACAAGCAATAACCATAACCTACCTTGTGTTCGCTTCATCAACTAGAAACCATACACAACCGATAGACCCGGTCAAAATACCCAGCGACAAGACCGGCCATGATTACAAGACTTCCCACTGTTGCACTTTTAGACGCTCCTCACTTATTAGGCGGACCTTTTCTCGTTTCCAGTCTATAGTTTTTG")) -(assert (= z "cuacaggcagggacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 deleted file mode 100644 index bf0cafa32..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0399.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCATCCAGGCAGGCTGGGATTACGTCCTCATAGAAAAGCTCACATTTGTACCTAGTGAAGTACAATAGAGGCTTCGCTACGATGGACCCGACTTCGCAAGTGTATTAAGGCTACTGACACCTTTAGTCAACGCCTGCGTGTTGCCTAATTTGAACCCACGACTTTAACCGGTTTTGGCCTCGTCTAGACAGCCGACGGAG")) -(assert (= z "gaucugaguucugaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 deleted file mode 100644 index f91fc2901..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0400.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGAGATGGGCTCTTCTGGCATCTAGCAAATCATCGCGGAGATACAACTAGAATCCGTTCTTCCAGATCCTCTCTAGGCAGCGCGTGGCGTTTTCCTTGCCTGAGATTACATGCGTCCAGTGATATACCCATGTGGTCTCCAATGTTCCTATAAATTGATTTCAACCCTCATGCCACACCGTGAGCACCCCTTCGCACTAT")) -(assert (= z "ucagguugcgaucac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 deleted file mode 100644 index f3173c633..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0401.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATGGAGACCGTCAGGACTAGCAGCGACTCGCCGGAATTCTGGTTCTTTTCGTCATTCTCAAGAGCAATTGCTTACGTCATCAACGGAATTCCGAGTGCGGCTCTTTAGGGGCTATGCCCTAGCTAATAAGGCAATGTCAGCCTAATGTGAAGACGTACCCTGCAATCGTCGACCCTTCTGTTTCGTTTCAACTGTAGAGA")) -(assert (= z "auccaagaauaacuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 deleted file mode 100644 index 0c0cac6c2..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0402.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCATTCGTTCTCGTAGACCTGGGTACTGAACATCTCATGCCTCCCGATCGTAACCCGATCGTCCTCTAACTTTGATGAGTTGAATATTAGTTGAATGCCAGTAACTAATCGGATTAGCAGCAGGGGTTTTCACACCTAACGGCTACACTTTATACGAGCGTGACAATGCAACCGAAATTTGCTAATGATTACCAGTCACA")) -(assert (= z "accuuucaccugaag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 deleted file mode 100644 index 3486a4213..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0403.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCATCAGTTCTATGTGTGTCCGACTATCCGCTGATTAACTCACGGCGCTGCGAGCTTGTACGGGCCAGCACTTCCCTTAAGGTCGGTCCTACCGCACGTAAGTCCTTTGAAATAACGAACGTTGAGCGGGCACATTGAAGGCCGGAGTTATTTTATTCATCAGATGTAGTCGCAGAGCATCCCTTCTTAAACGATAGAC")) -(assert (= z "auauucaugugagcg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 deleted file mode 100644 index 3a485f1cc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0404.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGCCGTCAATTGCAGACCTGCATGAGTCTTCAAGCGAGCTCAGTTGCGTATTTCCACTGAACGTCGAGATCCGATTGGCAGGAGTTAAGGAGGGTCCGTATAGTTCGGTGGAACTGGAGTCGGCTTTAATAGTTGAATCAGTGGCGTTATAAATGCCATGGGAATCGTCTTAACCTATCTTAATGCGTAAGCCCGTTCGA")) -(assert (= z "uuucuucuaugggau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 deleted file mode 100644 index 014c80c66..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0405.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTATTCAGCCTCTGAGTAGGTTTCGATGTTTCGCCGCCTAAAGAACACCCGCCATCGGGGATAGGCCTTGCCAATATAAGTTGCTGGGGCGTTCGGCTGCGTCCATCCAACCCTCCTCCTTTCCTGAATGTGTCGTGATCCCCAGACTAGATTAGTACCAGAGATTTCAGTAGGGAACACCGGACAATATAGTTTAAAAA")) -(assert (= z "gcaauguaagaagag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 deleted file mode 100644 index 42cb71c50..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0406.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GATCATAATTATTGATCAAAGGTCGCATGTTGATCAATATTTAGCGCTGCGCAATTCCGAACCGCCGACCTGTCGAGACCCCCCGCGCCAGACACTCATCAGAATCGTATTTGCACACAGAAGCAATCTCTCATGAAATCCGTACACGTTGAAGTTTCTCAGCTCCGATCTTTCGGCCAAAATGTCCTTTGGGCAACACA")) -(assert (= z "cucuaggaucaagcg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 deleted file mode 100644 index 21f377ebf..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0407.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCAGATGTCCGAGGAATTGAAATATGATTGGGCGGTCGTGAGTTCTCCTGCTAACTTGGGGCAACTACGTATCGTACTAAGCCGAGTTCAATACATTCTGACCTTCCGCATCGGCCGAATACAAGCTGGCTTGTAATAAAGTGTTCGCTTTAGGTTATGTTCACGTCCGAAACTGAGAGATCTATGCGGTGGAAACTTAG")) -(assert (= z "ccgaauaguucgcgc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 deleted file mode 100644 index 034722dcc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0408.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGCCTCTGGTCACCCGGAAAGCTAAAGGGCGGCGTGCCGAGTCGATCGGGCCATACATACGTTCTGTCCACGAAGTCCGTAAGCGGATCACCGAACCATGCATAGGCTTCTATCTTTAGTCCGGAACGTAGTGATAGGGCTCCTCAGGGCCGGTGACTGGGTACTTACTTTATAAACGCTTATCACGAGTCACTGTCAT")) -(assert (= z "agucgcgagcauccc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 deleted file mode 100644 index 685f01a14..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0409.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGATCCCCTGAACGGGCCGGAAAGGCCAGGTTTGCTGAGAGTAGTATTATCCGCCAATCCGCCTCTAGCGGTATGGTCCAGTAAAAGAGAACCTGTCGACTGGAACGTACGTCGCGTCCACGACTCTCTGGCTAGCCGGCTAGACTCATAAGTGGCGGTCTCCCCAGAATAATCTGTGAGTACGGTTTGCGTCTCCAAAC")) -(assert (= z "ucacgugugcccuua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 deleted file mode 100644 index fab9ef207..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0410.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACCCAACAACGCCAGCGGGGTCCTAGGCCGGGTCGTCTAGAGAAAGCAAGGAGTCAACATGACCGGCGGTTAAATTCAGGACTGAATTCAATCGAATCTGATTTGTTTTTGTTTCACGGTTATCAGTTTCATATCAGCCGGTACATGAGGGATGATGGTAGCTCGTTCTATTCGGACCTTCCATGACTGAGCTTGGAAG")) -(assert (= z "gggcguuuucccaua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 deleted file mode 100644 index 680f318ee..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0411.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CAACAGACCGCAGGCCAAGTGACTATACTGTGGCCCGCGAGGATAACTAGGTCCTGCGGAATGGGAAACCTAATCGACAGAAAGAGTTCGGTAGGCAGGGACATTTCGCCTCGATGCGTTGCAGACACGTGCCCGTTCCAGGCCAACGCAGTGCAATAGCGTAGCCAGTACAAAATATCTTTCGTGTCGAAGTTTTCTTG")) -(assert (= z "aacucaacucuuauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 deleted file mode 100644 index 5b0810746..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0412.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCCATACATATCGCGGGTCAGATAGGATACTCACATTTATGACCAATCTAACGTATAGCGAATTGGAGGAAAGGGTGCGGGGTTAGTCCATCAAATGAAGAGTGCAATCCTGTAGTGGGCCTATTTGCTTAGTGGTGTATTAATATCCCCCATTGGCCACGGTTATGTAAACCTAAGCTCGTCTATCAGGTGTGGAGTA")) -(assert (= z "ggcuuggcagcaggg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 deleted file mode 100644 index 5b9f9175f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0413.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGTCTAGACAACATGTGGCACCCGTGAACTTCTACCTCTAGCTATACGATAGCTGAGCAGGATCCCTGTGACGACTAAATTTATCCGTTTTAAAATACCGTTAGAACGAAGCTGATTCATGGACGGCTACCCGCCTTGAAGCAGCCATTCGACATTCTTTCGCTCTCCACGTGCTGCTTTAGGTTTCCCTGGAGAATGT")) -(assert (= z "cugccagaaggcucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 deleted file mode 100644 index d5138425c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0414.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTATGTCGTGATGGATCCGAAGTCACTCTGCCGTCTAGTTGGTAACATCGGTGTAGACTTCACAGCTACACTCCGAGGGCTTAGTTGCGTCGTTATCGTTAGACGATTGGAGGTAAGGTGCAGAGGAAGGAGTGCATCTAATTGCGGATCTGCGGTACCAGGAGGCAAATACTAATTAGGGATATCTATTCGAGTTGGCA")) -(assert (= z "gacaagucaacuugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 deleted file mode 100644 index cfcded52d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0415.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCTGGATAACCTAGTTTTAGGAACTCCGGGTCAGACTCCAGTCCACGAGGTGGTATTGACAAGCCGTGTAACTGTCTTCCCCGCCCGAATCTTACTTTAGTATAACACATTAACGGAGATGGCAGTCCCAGTCGTTACTTAGGCATGAAGGTAGACACTCACACAGCTACATTACCCGATTTAAGACCACAAAAAACCAC")) -(assert (= z "uaguggcuacugagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 deleted file mode 100644 index 18ad5601f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0416.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCCAGGGGGTAACCAACACAGTGCCTCTGATGGTCCCCGGTTTACGATGCCCTCAGTTCCGTGACATGGGCTTCGGGACGCTGTCGCCACAAGCCCTAAGGATACAACTATCGATGTTAACTAACGAGTTTGCTAGCGTGCTCAATTTCGCCTTACTGGACCGATCCAATGGCCGACCTAAGCGTGAACAAGGCCAGTT")) -(assert (= z "cggagcauuguaacu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 deleted file mode 100644 index 45098c17a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0417.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCACAACGGCGTAAGAATCGGAACCAATGCCTGTTTGTGCACTTGCGTACCGCGAGATTTGCGCCGGTAGCGACACTTGACGGACTGATACTAATATATCTCGTTCCGCTGTGCCCTCTGCAACCGCCCCTCACGAAGTCCCTGATACGGTTGGCTATAGACAACTCTCATACTAGTATGAGCTGCATACAGAGAAAGC")) -(assert (= z "uaugacguucguuau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 deleted file mode 100644 index 5faa17696..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0418.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGACACAGAGATGGCACCCCTATGATAAGAACTCCCACAGAGACTGCCAGGCATCCTTGCCTACACAGCCCCAGATGTTGGACTCACTCCAGATAAAGAATCATAATTGCTGTTTAAACACAATATGGCGGCGTTAAGTAAGCAGGAAAGAGTATAAAGCGAACCGCCGGCTGTTTAAAAGGTCTAGCTACAAACTCGT")) -(assert (= z "augcgucccacguga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 deleted file mode 100644 index 41846567c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0419.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGATTCAGTGCACGAGGGAACTTTGATACATTAGAGCGTTCTACCAGTACGCACATGTTCCTAATTCCCTCATTCGGATTGACATCATACCAGGAGTGATGTGTTATCGCCGAGATGGAGGCTAGAACAGGTCGGTTGTGACAAATATTGATAGGCAACTATCCCTTCCCGATGAACACAATGGGGATGATCCATCCTA")) -(assert (= z "ucaaggaaacgaagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 deleted file mode 100644 index 53555cb78..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0420.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGTTATTCCAAAGTCTGCCGCCAGGAAGCCGGAGCTTGCACTGTTAAGTTTGGTCCGGCAGAGGACCACTCCCGGTAATGATCAGTCTGCGCCGGGCTAGCACATATGGGCAATATCTCACCGAGTGAGTTGACCTTGCTTTGACCTCGCTGGAGGTACACGACCACTTGCAAGTATGAGCCACTAAGGTCAAGGGAATT")) -(assert (= z "ucuaaccucaugucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 deleted file mode 100644 index f2cae668b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0421.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGGAACTAGACGGCCTGAAAACTCGTATAGCGACAACTCCCTTTCTTGGTAAATCGCTCCTTACTTGCCACTGGGATTGCCTCGATGTAATCGCGACCTACTGCTATCTTGTCGTGTTAAAACATTCAATTGTTGCCACGAAAGGCGTTCCCCGATATGCCCATCTCACTCCACAATGATGGGCCTGATCGTGAGCTCC")) -(assert (= z "cguggagugaucuag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 deleted file mode 100644 index 303cea6af..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0422.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCCCAGCCGAACCTCTCCTTGGATGTGTATCGCTAGATATTTTGTTTATTGCCCTAGTGCCTTAACCTGTACTAAAGGCGCCTAGCAGAAAAGTTACGACACATACATACTCGCATTTTGTCTATGGCCAGTTCGGTAGTTGACCTCGGTCCGATTGGCTTTGTTCAATTAAATGTTTGACTGATCCGTGAGGAACTCG")) -(assert (= z "cauuugccgggaaug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 deleted file mode 100644 index 46668ab4c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0423.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATAACTGTTGAGTTCTCGGGGTCAGTGTGTAGTCCGTTAGCATTAAGGTCCAATACCGGATCTTTATTCCTCGGCTATGTCCTGCGGAGGGTTCGGATACAGGGCTTATGTCGCTCTCGAACTTGCTCGGCAGTCACGGCATAGTGATAAGTGTGGGGACCTCTTAATGCTGGAGTCGCCTGGTTCTGCTGGTTTTACT")) -(assert (= z "auguacgucaauaua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 deleted file mode 100644 index 6f47af02a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0424.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTTTTCCACCGAGACTCGCCCATTCCACTTGAGGTTCTAGCCTTTTTTATCTTGAGGTGGTGACCTGTAACTATTAAGATGTCGAATGGCATCTCGATTGGTAAAGCTGCTTCCATCATCCTGTCCAATGTAGAGCACGGTGAGAGCTCATGCAAAAGCTCAGCTATTGGTGAGGGTACGTCGGGCTAGGCATTAGTAA")) -(assert (= z "gcucguucugccuaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 deleted file mode 100644 index 86aadb5b0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0425.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AATAAGATCTCCCGCCTAGGTGACCCAAGACTTGTCAATCCGTCCTTAGGAGTGTCATAACTATCGGTTGGACCCCTATAGCTCGAAAGTAGATCGGTCGGCGTCGGGCCCATTGAGGGTAGAGGGTCCCTCAGTGTCTCAACCCTGGCTACGGAGGCAACCACATGCATCCCTAATACATTGCGGATATGTTTACACCC")) -(assert (= z "uagacccgaacucac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 deleted file mode 100644 index 9d309ef46..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0426.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTCCCGCAACACAACACATTTTGGCGCGGGAAGAGCGGGTAAGCTTACCTTGTGATCGCGACTATTCGTAGATGCGGCCGATCTCGGGATAGATCGGTGAGTTCTGATTATATGCGTGGTTCAGTAGGACCACGTGTCACCTTTGTGTTGCCTGACTCGCGGAAAAAGTGGGGCTACTGTGCAACACCGGTGTGGCGGA")) -(assert (= z "gucuucagcuccaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 deleted file mode 100644 index a0fec31d4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0427.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTTCGTGCCTGATGTAAGGCACGCCGATTGACACTGCGAGTTGGCTACACTGAGTTGCTCGCGGACGAGTTATATGGCGGGCCAGCCGCATCTTATACATGAGCTTTAACGGGAGTGTCCGAAGTCAATTCCTACCAACCGCACTCCTATTGCCACGATGACATTAACCAACTAGAGCGGCGATAGTCGACCCGCCAGAC")) -(assert (= z "gcucucugaucauac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 deleted file mode 100644 index b79156188..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0428.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGGTGCTCACTGCTCAGAGCTTATTTCATTCTGAATTTGACAGCCTCGCCATAGCGTGCCAATTGGATAGGCCTTCGGACAGTCGCAGGCAAGATGGAAGTACTCCATCATAGTCCTTACTAGTGAGCCAGTGAAGTAATGGCGGTCCGTGGTGGATCGGGCCAATGATCCAAAAACAGGACAATGGCATTAAGCTCTA")) -(assert (= z "gcccucccaggacca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 deleted file mode 100644 index a519bb09c..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0429.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGCTCTATAGATTTCGATCGCGGGGGAGCCTTTAATCCTGAACTACGGAGGTGATGACATTGAGCGGTAATGAGAACCATGCGGTGACGGGCTCCCTATTACACCGAGTGGCTTAAGTTCGTGACCCTAGGGCGAGGCGAAGTCGACATTGGAAAAACTTGGACTGGTGGAACGACAGCATAAAAGAAATATACGTGTCC")) -(assert (= z "aaagguugagcucag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 deleted file mode 100644 index 88818e545..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0430.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCACAGCTCGAGCCTCCGAGACTCGTTCCCGTGTGTGATACAGAGGTATTTAGGTTTCCAACGGTTAATCAATTATGTCCGCTATATACTAGTCACACGGACAGGAGGCACCACTTACGCAGATTTGGCCTGTGCCATCTCTTTCGAGTAGTGTACGCGTGTTGGCCCGCTGGGATCGTCGTACATGTCACCGCAAGATC")) -(assert (= z "agacugguaguucgg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 deleted file mode 100644 index cb5c7612e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0431.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCAAACGAATGGTCGAAGAACAGAATTATCACGAGAGAACTCTTACATTTTGCACTTACGGCTCCAAAAACAGTTCCACGGGGCCGAACGGAGGCAAGAAACGTCCGCCTCATCTCGTGCCTAACTTGGGCTGCGTACCTGAAGGACGAAAATTATGTTTCGCGGTACGTACGGACACTGTTGTGTGATGTCCTAATGGC")) -(assert (= z "uacuugguccggaca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 deleted file mode 100644 index 8ece66050..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0432.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGGTGTTTCAGGCTTATTGGTTAAGCGATTTGAGGGACATTCGTATTCGTCCTCCTATAACTTTCGATCTCGAACTTTCGGAGGCACGGATTCGATGATGAACCGGCCACGCTTGTGCCCATGCTTGTGTAGCTACTGAGCTCATCGTACAACGCCCGGGACTTGACTTCATGACACTTGCTTAAATACTCAGCCCAGT")) -(assert (= z "ugguugggccaacag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 deleted file mode 100644 index e2c2c377d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0433.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTGTACCCAACAGCGTGGTCTCACTCTCCGCTTCGAAAGGCAAGGTTGTGGATCCGGTGTCCATCAGGTGTATACTCCGCATCATATGCCGACGGATGGGAATGGGGGCCCAGTCCCACAGTGAGGGAGAGTTACTAAGGGACAGTGTGTTGATACGGCAACCTATATCGCAGATAAAGCGATAATTTTCAAGCCTAAGC")) -(assert (= z "uuaccgaucugcucg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 deleted file mode 100644 index 4ba1c46a1..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0434.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGCATAGCACCCGCGCACCACTGTTCAGTTCTCGATACACGCCCTGCCTATGTCCGCAGACGTGCTCTATGTACGGGGCGGTCTAAAAACCGTCTCCCACAAAGCTCTCGTACAATGGCGCACGTAACGACCAACACTACATATGAAACGTGACCGTGTCACATTTTGAGCTGCTTCGTACAGCATGCTTCCGATGTTA")) -(assert (= z "gaagcauagucgacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 deleted file mode 100644 index 19fc18f34..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0435.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATGTGGACCGCGTAATACAAGGAATGCTACCGCGGGAAGTGACTGGTCGTATTATTACTGGTACTATAACGGAACCAAAGCCAAATAGCTACTACTTCTACCTTCGCCGCCTGTGGTTCTTTATGGTCGTCAGGCGTGATGGATCTACGCACCTTACGCTGGTTTCTGAAGCACAATGCTTGGCGGCGCGACTGGTGGT")) -(assert (= z "uaccuuuacuccgau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 deleted file mode 100644 index cb8497c55..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0436.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GATCCATGGTGTCTAGGGGCCGACGTAAATACTCGACGCTTCTGCGCACTCAGGCGAGTATGAGCCCGCTGCTTCAAAATGATCGCCATGAGCCTACTCGAGTCTCACAAGGAGAGGTGATGGGCGATTCTACAGGGTGCGGGCTGGGCGAATCCCTCAGCCATGCCGTGGGCGTGCTAATGGAACACATCTGTCAAAAC")) -(assert (= z "gauguuccgcauauc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 deleted file mode 100644 index d0ea84fd0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0437.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGGCAAATCAGGGGTATCGAGTGCGGGGGGGCGGAGCCAGCGATGCGCTAGACTGACACGCTAAGGAAAGTTGCTAGGTAGTATCAGGAGTCTCCGAGCACAGTAGCGCCCGCGGGAGTTTGGGAGAGAGAATTTCCATCCAGCGAAGGGGGAAGTCAGCACGGTTCAACTACGAAATGGTCGGTGTTAAATTAGAGCT")) -(assert (= z "ccucauggccgaguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 deleted file mode 100644 index f7d55e900..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0438.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTTCCGGGCCGCTTAACCGCACTGACCCCTATTCACAGCGGCTCCTCCCTCTCGCCATGCGGTGAGGTCCGTCCAAGATCATGTTTTACGATGTTATTTCTGTACGGGCCTTGCCATCACGGGAAGCAATAAACATCCGCTCGCTATCTTGCTTACTACCGCTGCGAGGACATGTTACGCAGCTCTAGCTAGTGATCTCT")) -(assert (= z "aacgaccuccugaaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 deleted file mode 100644 index a5f32e51b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0439.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTTTCTGTACACGTTTCATGATAGGGTTCGTTTATAAGGTTGCTATCTGTACACTCGTGGATTTTGAAGTGTGGCCAAGGCGATAACCCAGTTCGGTCTGTAATGCACCTGAAGCGTAACCACATCAGGCATCAACAATTAGCCCGTCGTTGGAAAAGGATTGTGAATAAGGCAAGCAAAAAGTTATAAGCAACACATTG")) -(assert (= z "uugggaaaccugcgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 deleted file mode 100644 index ecfe54c80..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0440.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TACGCAGTCCACGTATGAATGACGGCTCCAAGGATACCCTAGGACCGCATACGTACTGGTCACGTTTTGAAACGGTAACGCTAACGGGTCATAACCTAAAGCGCAATGGAGATGCATCGAAAGAGTCCATCTTTCAAGTCACTCTACGTATGGCCCCGAACCCCATGTATTGATGTTTCCTTATCTGGACAGAACAAGCA")) -(assert (= z "ugguaaguucggaga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 deleted file mode 100644 index b7cd2a5e4..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0441.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATGCGCTAAGCTGGACGGCACAGTCAATTGTAGTAATTGAGGGATATAGCGAAGTGTAAGGTTGGTGTTGCACCGATCGTGGTCGAGTGACCGTGCCACGGTATGCTAATGCAAAGACCAGTGGTAGGTCAGAGCTGTTCAAGCCGACATTAATCGACCGGTCAGTGTCATAGCCCGGCTCTATCTCAGTGGTTCCCGC")) -(assert (= z "gccuaaacuuaugcg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 deleted file mode 100644 index 3629665fc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0442.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGAGGTGAACCAATAGGGCTTGCCTAAGTCTGTCCATCGCAGGCCGTAGAACGGCAAAGGGCACAAATGAACTCCTTAGACTCTCCGTCCCTATGGTTTACCGCGACATGCCAAGCTAGCCCCCGAAGTGAAGGGGTCCAAGTCTTGGCTCGACGGAACATGGCCGAGAGGAGACTTTTCCACTCGCGGATAACTGCTC")) -(assert (= z "cagguggcgaaccaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 deleted file mode 100644 index 5a1348ecc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0443.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAATCGCCAGGGGCTCGTGGGACCACTTCTGTTTGGCAATCACAATAAATTACTTAGACCTTTAGATTCTCCGATGGCTGAAGCAGTGTCCGCAGATGGATTCCCACGGGCGCCGGGTAATAGATTTTTAACTTCACCACACGGTATCTTGAGGCGTACAAGACATCCACGACTCGTACGTCCCGGAATCCAATTGCGTG")) -(assert (= z "cguaauuaccaggca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 deleted file mode 100644 index 56087e5c6..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0444.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGATATTACAGGAGGTTGTGACTTAGGAAGCCTCCGGTTAGGTCCGGGGTTGCTTTCTGCATAAATGTGAAAAGGTCCATAAGGTACAATAGTGATAGGAGTGGGTTTCCCGACCAAATAGTTTCTCACAGAGCCTCGGCTTTATTCAAACCCACACACTCTGACCGGTAACCCCGACATTTTAAAAACCCCGCAGTGC")) -(assert (= z "ucaguacagucaaca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 deleted file mode 100644 index 79f8eb331..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0445.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAATCCGTTTCATATTCTCTCAGTAAGCTAATTTTGGGCTCCTACCTGTCACGTCGTCTAGGTTGGCTATCGGCCTGCATCCTCTGCGTGAGAGTTAGCGGAGGCTATCTGGCTAGATAATCGAGGACTGACACCACGAGGGTCATCCCAGTTGCCAAGCTTACTCGCTGTGCGATGAATGTTTGTAGCAGAAAAAGAAT")) -(assert (= z "acgcauuuuaucacc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 deleted file mode 100644 index 1ad9d9129..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0446.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACGGCAATGAGGTATGACATTATGCCCATTGTGACTGTGCTATCCGATAGATCTCGCTGGCAGGGTCAGCTAGACGATCTGTGAGAATTACAATTCTTTCGAAGATCGATCCAGTCATTCCATGGGGGCATTCACAGTATCCTCCATGAGCTTCCAGTAGGGCCATGTGCATGTCCTCTCTAACTTTATCGGAGACTAG")) -(assert (= z "cacacccgguuacgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 deleted file mode 100644 index c3a0c7de0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0447.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATCTAACGGCGGCCTACCCATCCCGAAACGACTTAGACAACCAGGGTCAAGTAATGTCGACGACGCATAGACTAAATGAGCGCCGTGTAGTCTTAGTCGATACTGGACTGGGTAACCGGACCCGCCAGCCATATCATCTGATTCTGTGAGGTACCTCCCTTGAATCTGCCCTCGTCTCTACAGTGCAATGTGATGAGGTA")) -(assert (= z "cgguacagaucguac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 deleted file mode 100644 index 998eb4165..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0448.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGTCAGTTGATTGTGTAGCCTCGCCCTCTTTATCCCCATTCGAACGTGTACGGAAGGCCAGCCGACCCTCAGTGGCTTAAGTATTGTCTAGACGTGCAAGGCGGTTTTATCTTTCATGTATTCCTGTGACTCTCAGAAATCTTAACCGGGACAATTGATTGTGCACCATTACTTTGAAGGTTCCTAATTCGAAAGAGTTA")) -(assert (= z "cauaaauuccguaau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 deleted file mode 100644 index c43124b98..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0449.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTAAATGTATTCCGCGCGAACCAGAGCATTACCGTAACTTAAGTGTGGTTTAGTGGCACTACACGTCAGTCGGCAGGACTAGTTCCTATTTACCCTTTGGGCTAGGCACAGCGGTAATTTAATTAGTGGAGGACTCGTACGCATGACGCATGGCTGAGGCGTAACGTGCCTCAAACCGACTGATCAAAATACTTTCGCCG")) -(assert (= z "gcuuuuuacaauucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 deleted file mode 100644 index 44210257d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0450.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GAAATGGGTCCGGCCATAGATTTAAGGCGTTCGCAAGCTGCCTCAGATCGGCTAGCATTTTCTCGAAATCCCGCGCCAGTAAGGATACCATTAGTAATGGCGGAACGAACAAGGTGCGTACCAGCGTTGACGCGAAGTAATACCCCTCCAATGCATACCAGTTTTACTTTACTGCTGGATTCACGGGCTCCTTGCCTTTC")) -(assert (= z "agcuuggccgccuuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 deleted file mode 100644 index fa54dde15..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0451.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGATACCAAACTACAGACATCTATTCCTAAGCAATCCTGGGTCAAACTCTTATCCTTGACCTTGACGGACTAGGATGCTCGGTAGACTCGGGGCCGTCCTCGTATCAACATACTTCGGTTGTCCGACATCGGGCATTAAGCAGCTCAGTGTATGGCCGATACGGGGCTATAAACAAGGCTCAATAAAAAATCACAATTAA")) -(assert (= z "ggacucugcaauguc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 deleted file mode 100644 index 2d382b84e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0452.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAGAGGGAGACGTGCCTAATGTAAGTATCCATGTAGAACCGATGCTACCTTGTCGTCTACGAATACGTTCCCCTGCCCTGGAACTAATCAGGGCAGCGTCACGTCCCATCAATATGTTCGACAGGCGACTAGGGGTCGACCCCTTTGTTCTATCTGGCTTGGGCCGTTAGTATGTCGGCGGGACGCTTAAGGTTGGAATG")) -(assert (= z "gguucugcauggcac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 deleted file mode 100644 index 22d4e9e23..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0453.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCGTAGCCATCTGAGCGAATAAGAAGTTCAATCGTACAGTTGGCGCCGTACCACATGTTTCGGAGCAGGTAACGACAGGGCACTCCTCTTGCCAGGGGAAATAAGCGATGAAGGAGGACGTAAGCTCCACCGTGTATCTAGAGGCACGTGGCCGTGCAGCGCGCCGTCGTGCCGGCCCATCCTAGTAAGGCGTATAGTA")) -(assert (= z "ugcgcgccgaaccgu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 deleted file mode 100644 index 68274b5c0..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0454.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTAAGCAATGGGGTCTCTAGACTCCGGAGGCCGTCTTCATCGCCCTTAATCGTACCTCCAACTTAGGTCTTTGCAGGGCGGGTCGGTAGTGACCACTATGTCCCCGGTCAATCATTGCGGTCAGCAAGTCCAAGGGGTTTGCCCGCCAGTAGTAGTAAAGGTATACAGTCGTGGACCGCATCGCTTTCTTGCTGCCCGCC")) -(assert (= z "uccgcaguuuuggug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 deleted file mode 100644 index 7be704d0e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0455.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CCGTTAGCATTCGCGGTTAACACACACGGCTACCACCTTCCATCAATAGACTCGGGGACAATGGAGAGGCCCCACCATCGGAGGGTTAACTTAACTTCCTGAAGGGGTCCTATCGAGCACGCAAGAGCAATCAACCGTGTTCTGCCGCGACGGAGTGAATGGTCACTGAGGTGAAGGAACCGCATGATTGTTAGATTCAT")) -(assert (= z "cucgcugccccauga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 deleted file mode 100644 index ae129e14f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0456.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGTGGGTATGAGTACGGGGCCAGTGTACCAATACGTTGTAAAGACACCAGCATACATGCGAGCTTGTTTGGGAGCTAGTGCGGAGGTAGAATGCCCTAACGCTATTTGCACTCTTGATCTACGGCAAACAGCAAATCGGTGCTGTATGAAAAAGTTTCTAAGGCACGTATCTTGGATTAAGAACCCACAAACTAATTCTG")) -(assert (= z "auagguagggcacga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 deleted file mode 100644 index dcf47cb06..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0457.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATGTCCATAAATATGACATACTCAGGAGTCAGAGCCAACCGGGAAACCTGAGCCCTTAGCTAATTAGGTGGTTCACTGGGTGTATGCCGTGACGAGTCGTGACGCGTACAGGCGTTGCGAGTGACGAGGTCACAGCAAATCGGGTGTTGAGACTGCACGGTCTTTGGTTGATGGCCAGGCCTTCAGCCAAGATGAGGGAG")) -(assert (= z "agccucgugguucag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 deleted file mode 100644 index 8b6938a57..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0458.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCACTTACCAGCGCTTTAAGTCCACGAAGTTCGTACAACCCTCAGGCTCCGCGACCAACTAGACGCCAAGTCAATCGAATGGTGGCCACCTTGTGATGGAAGCGTACCCCTTGCAGGAACGGTTTCAGCCCGATAGACCGGCCAGCCTCGTATGTTGACTCTCACATGGATTGATCTTCATATACGGCGACCCATTGTC")) -(assert (= z "cuaugguaguaagga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 deleted file mode 100644 index f704af897..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0459.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGGCGTTGGTTGAGGCCCATCGACATGATCCTTCTCTACCCTGCACCATAACTCACCACGCAAGAATTTTATGCCTGCCCAGAGAGCCTCTGAACGTGCTTAGTAGGATCCTTCTCTCGTAGAATGTATATAATCTAAGTGAGAATCGGTGTATACCTACCAGTCTAATGGAGCAGGACTTCACAGAAGACCAAACTCA")) -(assert (= z "cggccacacuagcaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 deleted file mode 100644 index d789820de..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0460.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCCTCTGGTAACAGATATGATACCCAATCAAGTCGAAGGTCCGCACAGTGTCTCCTGGACGTCTAAGCAAGACCTAAGCACAGACCTTCCGACATACTGGAAATTCTAGGCGAGATGCCAAATCCACGGAATCGGCGAAGCATATAGAAGACACCCGCTAATAGCTATCAGAGATATTGCTATCCCCTTAGTAGCACGTA")) -(assert (= z "auaauuauaagagcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 deleted file mode 100644 index fa72f87cc..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0461.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGATACCATGGACTAATCACGGCTTCCTGATGCTATCCCTATAAACTGGTGATTCTGCGGTCCCCCAATGGTCTCCTTAATTGTACCCGGCGTTGCCTGTAGATATCCGTTACTGAGCACCGAGGGAGAGCAATGGTACTGGACCCGGTAGACGTAAAGATTTTGATTCGGTCTGTGCGATGTCGGGCGTTGATTACAGC")) -(assert (= z "auuauuugguuucga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 deleted file mode 100644 index fe49c8218..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0462.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGAATTTGAGCAAACTCCTCCTGCCCCAGCGTCATGCCTAATTCCCCTCTTTGGAGGCTTAAGGGGAGATCAAGCTTAATTTAGGTGCAACCTGGTATGCCATTTTACGGTCCCAGGAGAAGTCGTACTGTAGTTCGGGTTTATGGCACTATAAGTAATAACCCTACCGGGTCGAGGTGGCTGCAGCGCCTTACACATCG")) -(assert (= z "ccggugggggacucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 deleted file mode 100644 index 466955c10..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0463.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGACGAATGAGCTTCGATGAGATCATGACTGCCGCCTGGGACATTTACATCTCGCTCCACCTTAGAACGCGAGCGCATCTGTATTTGCAGGGAGGAGAACACAGCTTCGTTATTAGGAAGCTTCTTGGCTCGTTAAACGGGACTCGCGCACACAGTATCACAATATTACACTATTGTTATAGTTACCGGCCGGTGCTACG")) -(assert (= z "auauucggcccucaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 deleted file mode 100644 index 5b59f7630..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0464.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACCAGTGACAGAGAAGAACGCTTACGCTGATAAGTAAGGTTCCACCATCTTGTAACCACAAATGACTGTCGTCATGACTACTATTTGCATGCTTGAGCGCTCAATAGACTCACAAGGACACACGGTTAATGATAAGGCGGCCGCCCGCGCCTGCATTAAGGCGTAAGACCCCCAGTCAGCTCCATGGTCTAACCGTAATG")) -(assert (= z "ccaugucgaaucucu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 deleted file mode 100644 index f9a446c42..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0465.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTACATTCCCTCAACCGCGGGAGGTATCCTCTTGTAGAAGAAGACAGCAAACCGGCACACCCAAGTTTTGGCCCGCGGTGCAGCTGATCGCATGGCTTACTTCTTAGGGCATCCTCTGTCTAATACCATAACTTGCTGGCGACGCCCGCCCAAATCATCTAAGGCACCTCACGTTCCGCGGCGCTATAGGTTATCGGGAC")) -(assert (= z "cuggacauauccagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 deleted file mode 100644 index b7257a387..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0466.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTGTCTCTCTTACCGTCATCGTCGCCTGTTGCCCGGCCAGGCTCACCGGTAGCAGCGACAACGAATCAGAAGCACTTAAAGACTATATGATATAGGTGTCATAAACCCTATTCCACGGTTCGACAGGGCAGCTGCGGAGCGGTGTCTGACGTGTGATTTCGAGAAAAACATAACTACAGTGTGACCCCGGAATGATGAT")) -(assert (= z "cggguagcuugcugc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 deleted file mode 100644 index 85902cf89..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0467.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATGTCGTCCTTTAGTAATGCCCTATCTATCCGGCCCCTATCTTAATGGATTCGATTTGAAAGCATGAGCGCTCAGCTTCTTACCTTGCACAGGACTCGTCTGTATTGTAGCAACCCAGAATTTGCATCCCGACGGTAGAACAACTTCGAATATGTCCATGCTCTTTATTGTGGGGGCTGCGTATGTGCTTATTAGGAACG")) -(assert (= z "gagucaaauggugca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 deleted file mode 100644 index 95541b440..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0468.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACGATACTTATCCGGGCAGTACTCTACCACGTTTCCCTTGCATAGGAATATATCGAAGTCCGTATGACCGACGTTCCGTATACAGAGCCGTAGATTCCACGATCCGTCCTTGAGTCTTCCCTGATTGGCCGTCTAGTTTTTGCCTGGTGAAGCCGCGGTGCTGACGCCGAGGGACCAAATTACTTCGAGCTCTGTGCTC")) -(assert (= z "gcaguaguuccggcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 deleted file mode 100644 index 807213628..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0469.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGGTCTACACCTCCCCGATGTATAATAGCGCTGAAAATCTCCATATCGGTTCGCTTGGGAAGCAACATTCGCCGCCCAAAAACAATTAGACTCCAGCCGTAGGAGCTAGTCCCATTCTCATTTCCTGCACTACAATGTCTGCATTACGCATTGGAGCAACTACGGAGGCACTTGTAGTGTTGTCTTTGACTCCTCGCTGG")) -(assert (= z "gaguggcuucccgca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 deleted file mode 100644 index 309685fdd..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0470.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CACTCCCAACGTACGGTGGGAAGGTCAAGCTGCCACTACACTCACGGTGTAAGCGTATCTAGGGAGTTCAAAGGGCATTCCGAGCTCGAAAAGGCAATCGATTGTAGTGTTCGCAGATATACCATAGGACTCCACGGAAGAGATAATGTTGGTTTCGACGTATTCCCGAAAAGATGCGCTTTCACGTGATGCAGGCATTA")) -(assert (= z "ugccggagcggaagg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 deleted file mode 100644 index dca354d46..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0471.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATATACGTAAGCCACAAGTGAAGCGGGCCCAAGCTCGCCTTCCGTAAGGTATCTGATGGCGTCTCTAAATCCCCTATACCGCCACTTTCTTGGGGTCCTTCCTACTTCCCCCCAAATTACACCATTTAGTAGGCTCTTACCAAGCTATGACCGTCTGCCGCGGGCTGCCTCATTTTCTCCATACTGAGGACGCACACTA")) -(assert (= z "gcucgcuugaauuac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 deleted file mode 100644 index aaf3da5da..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0472.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AATCAACAACATCCATGTTGTAGGGGCAAAGGTTACGTGGATCTAACAACCAAAAACAATCTGCAAGCCTCTCCAGGCGTCTAAATTTAGATTCCGATTACGTGAACGGGTGGGCTTCAGACTTTGCTATCACTCATAGCACAGACGTTATATGGTTAAGATGCTACATATGAGCGGGTCGTTTGCTCCTGGGACCCCTT")) -(assert (= z "guaccuugacgauuu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 deleted file mode 100644 index 5be76d920..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0473.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAGAACCTGATCCTAATTTTTGCTGGGTCTATGAACACTGCCCGACCAACCCTTCAAAACGCCATCTAACCAGAGGTATCGGGTTATAAAAGAGTTCCGCTCGTTACGAGGCAATGTGGTCCGGACACCTCATGAGGACCGAACCGCATGCCTAACTCTAAAAGGAGGCGGAACCCGCAAAGTAGACTACCCCAAGTGC")) -(assert (= z "aagaaacuguaugag")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 deleted file mode 100644 index 3edca2f3e..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0474.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCACTCGAAGTAGCATTCTCGTGATGAGGGATCTGTTACGAGGCTGTCATGATCTCCGAATCCTGTCCGCTAGGCACGTAAGCCATGACCAGGGACCAGCACTAAGGTTGACCCGCGGTATCTACTGATCCTAAACAGAATCTCTGGAATGCGCGGTCCCCATGCCCACCCCCATACGTACCGAGTGTACCTAGAGCAG")) -(assert (= z "aguccgauuguugcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 deleted file mode 100644 index 0c0c8817d..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0475.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TGTGACAGAGTTATGTGGTCTCTCGCAACGCCGCGACTGAGCCATGGTTCGTTTCTTACAGGTGCCCTGTGAATTGTGCGGAGATTCGTCTATCGCCACACTACATGGGTAAAGTATGCACCGTTTTTCACAAGTCATCCCTTTTCTTTTCCATAGCGTGAAAGAGGGAGCGACCCGACTATATATGCTTATCCGTACTC")) -(assert (= z "auccucacacaauaa")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 deleted file mode 100644 index 503418f8a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0476.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GGTCGATCGAAGCACCAAAAGGTTTCCCGCGCTAAATCCTTAAATACCGGTCTTAGCAAAGGCACGCCCCGCGCTGATATCTCTATCGCATAACCTCTTGCGCCAAGTGATACCACGGCACCATCGCAGGTTGAAGGATACTCATAAGGACAATTCTTCCATATGCCGGCATTCATACATCACGGGCCCCGTCAGATATA")) -(assert (= z "uugcaauauucagua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 deleted file mode 100644 index 9f7daadc9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0477.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TAAGCCATTACTCCCAAACATGGCGTCGAGGGTCACCAAGCCGTCGACCAGAGTACGATACCAGCCGTCACCACCGCGCCGCTGAGTGCTTATACGCTTCTAATGGCACCACCCTGCGCTTGGAGGCGGATTTCTTGTCGTTCATGACACCGAGAAGGGGGTTCAGGCTCTAAGTCAGAACGGAGGAAATCATAAAGCCA")) -(assert (= z "aaauccucugacccg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 deleted file mode 100644 index 9ca7b32a5..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0478.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GACGGACTAATCAAAGCCACCCAGCACTTTTGAACAGCGCCAAGGTAGGAGGGCCGCCAATGTTATTGTATAAGAATATGTAACGGGCTCTACGGGGTACCGCCTTAGGCCGATTATAGGACACATATCTGGGTTCGTTTCCTGCGGTGGATTATATTCACGCTCAACGGAGGTTTCGGATTTACACTTGGCTGCTAAAT")) -(assert (= z "ccguugugucaggac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 deleted file mode 100644 index 55cbad679..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0479.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACATTCCCCGCAGAGAACCATATTCCTGCACCCGCCGCCCAGTCAGTGAAAGCATAAACTCAGTTCTGTACCAACCCAAAAGGCCGAGGTGTGGCTTAATCATCACGATGTTCCGATTGATCCCGAAGGGCAACTTCTTTTTATGGCTGAAAATCGCTCTCTTTCATACACACCACAAACATACCACGGCTCCAAAGATA")) -(assert (= z "ccacccgaaguuuga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 deleted file mode 100644 index b8edf9434..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0480.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTGCCTCCTTTACCTTGTTGACGCAGTTCTGGTAATAGACGATAAGCGTGAGCCACGGGGGCGTAGGCCGGCAATCACTAGAGTCTCACATAGATTTTTGTCCGACAACGTACAAGCTCGATGCCGCTATAGACACTGAGTAGCAAATGAATACGTGCTATACGGTTTGCTCATGTCATGAACTACGGGGCATACTATCT")) -(assert (= z "cucuaagcuaugucc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 deleted file mode 100644 index 2aacb0860..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0481.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCGGAGTTGACCCTACAGCCCTGATACAGTGTGGTACCAAGGTTTTTTGCAGATCTCAACATCCACACCACATCCGCATATGTTGACATCATGGTAGCCCAGACTGATATCGCTATACGCCCTGGACAAAAGGGACGATTCTGGCATTTCGTGAAATTCGCATAGCGGATTCTGGGGGGCAAGCATGCGATGTGGCAAC")) -(assert (= z "acgcuggacuuggac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 deleted file mode 100644 index 0dc728ec9..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0482.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTAGTTCATGGGGTGAGGCTTAGAAGTAATGACCATGGCCTCTTAAATGTTCATGCGGCGCAGAGGGCATCACACCAGGATGAGCCGCTCGACTCTCCTGCGCGGTACCCACAGCCGACGGAGGAATAGAATGACACGCCCATGACGCCTCACCGGTCCACGTACGGAGTAGTAATGGCAACTTGGCTCGACCCTTCGT")) -(assert (= z "cgucugaauccgaac")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 deleted file mode 100644 index 94c4fbe7b..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0483.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGGACAGCACCGAAAAGTTCCTACGAGAGACATGACCTCATTCTATGTCCGCGACGAACGCGTGTCATAGAGTAGTTGAAGCAGGTGCGGAAACTTCGCACGTGCCTTCCAAGCTGTGGAGGTTTCAGATATGACAATATGTTTTAGGCAGGGTATGAGAATTGGAACACCAACATCTCCGTCCCACTCCCGGGTCGGCG")) -(assert (= z "uuuuaugucaaagcg")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 deleted file mode 100644 index afee6c674..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0484.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTCCCCCTAACTGTAGATTGTATTGAAACTATACTCGCTGATACAGCCTGGGTCTAGGAATCAAAATGACCTCATTCACGTTTGAGCGGATCTAAGGTATTCCACTGACCCCAACGTTGTCCCCGCTATTTAGTCCCGCCAAGACTGATGTTGGGTCGATACCTACTTCAGCGGGATTGGCCGACATTTCAGAACCAGCA")) -(assert (= z "auagcgcaugauguu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 deleted file mode 100644 index 80741e511..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0485.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ACTGAGTCACCAACACTCCACTTGACTAAAACCCCCATCGCGACATCAACTAAACAGGGACTCACTCGATAGCGGCTGCAGCTACTTACTTATACACCTTACCTTAGATCATCTCGGTTGTGAGAAGTAATCTGTTTTGACCTATAGCACATGTACCATCTTGTGGCGCACGGTAGCGAGATAATTTTCTGATACCCGAG")) -(assert (= z "cguccucccaagggc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 deleted file mode 100644 index cde51fb24..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0486.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCGCATTGCCGTTGATAGTATTCTCATCGTCACCAATCCAAAAAGGGTAGCTTCATCAGGCATAAAAATCGTAAGCTCTAGGTAAACGTCATTCAACCGTCGAAGAGCCCATCGAAATCAATTGGTACAAAACTTAAGCTTGGCAACATTAGGTGCACACAGTTCTTAAGCAACTGTGCTGCACGTGCCAGAGAGAACT")) -(assert (= z "cuuccacuugccucu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 deleted file mode 100644 index ac6c315fe..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0487.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AGTATGCTTGTGCATATCGGTTCTAATTTTCCCCATCGAGGGGGTAGAGGGCGTAAATAGGGCTTCCAGCATGCACATGATAGAACCTTGGAACCTTCACAACTTTCCACATGGTTGCGGGGTCAAGGAGGCCTGCATGACGCGCTCCAACCTCCTGTTCCCAGAGCCTCTGCGGATATCCGGCTTTCTAGCGATTCCGA")) -(assert (= z "aucagaugggagcug")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 deleted file mode 100644 index 944b5bc04..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0488.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TATTATCTTTTCTGATCCATAGGCAATTATATACCACATGCAAGCCCGTTCGGGAAGGCGGAGAACCGAAAGTCAATTCGACCGCAACTATAAGTTACGTAGTTGTATGGCGATGTAGGGGAGATAACCTCCCGTGCGAGGTTTCGCTATCTGACGCACTGAAAGGAGAAAGAAAGGATTGATGCCGACAACAGTTGACC")) -(assert (= z "gaugcgccaguacua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 deleted file mode 100644 index d2027daf8..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0489.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "ATTATCATGTGACAGTGGATTCCAGTACGCAAGAATTTCGGGTCCTAGCGCAATAGCCCCATTGCCATGCACCGGTTGGAATTTATTTCGGCAAGCAGTATACGACTTGGGATCTGCAATGTCGTTTATCCTTACTGGCGTAGAGGTTCTTAGAAGAATCACTATGGACCTTATGCGTGGTTAATGGATCACGTTAGAGT")) -(assert (= z "ccaccccgaacucca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 deleted file mode 100644 index d38e86f73..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0490.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTTTTGCACAGTGCCTGGCGCGTGATTCAGTACTAGCCAGACGGGAATCCGAGGGACCGTGTCGACAAGAGGTCACTTTTTATGTCCTTGTGGGCCGGGGCCGTACGGGCTTGTGGTAGAACTCGAGGAGTTGCTTTGTGGAAATCTAGCTGCTTCACCACATTCTAGATGCGGTGGGACTTGACGGTATGATAGAGTTG")) -(assert (= z "uauguucccaucgua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 deleted file mode 100644 index 044f27243..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0491.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAGTCTCATACTAGAGGAAGAGATATGTTCGATTTTCCCGTTCTCCATATCCCCGGACGCTGAGCTTGAGGGGATGTAAACGACAACATTCCGCATCAATATGGATCCCGACTCGCAAAGACAAGGTGCCAACCGGCCACTGCCTTACACGTTCCTTTAAGCCACAGTTCATACGAGCCAATAACTCTTGTGGATAGGG")) -(assert (= z "aaucagacuugggca")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 deleted file mode 100644 index 14b7b092f..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0492.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCAAGCGCCGTGTTACGGAATTACTTTCTGTGCCAGATGTACAGGAAAACCGAGTACGCTTGGCCTTAATTCGCGTATGTATCCTTCGTGCTACAAACCCGATCCTCAAGGACAGTACGGCGGAGCTCGCGGCAGATTCTCATCAATGTTCTTAATGTTACATTCCAACATGGAGGAGCCACGGACTTATTACATACTG")) -(assert (= z "uaaauccuaccucau")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 deleted file mode 100644 index 44b77b30a..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0493.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGAAGCACTTGTCCGGCTAGCATGGGATCTATATCGCAATCACCTGTTCATTTGTTAAGGTCGCGCTTAGGGTACACGTAACATGCGGGGCTCGTATGAGGGGGCACGAGGGTGACATAATGCGAGTTGCAGCACTAAGATATGACGTAACGTTTTTAAGGTTGATGTATACATGCTTGCGGCCCCAATGACCGATCCTA")) -(assert (= z "gaaccgauuuuugcc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 deleted file mode 100644 index 5614d69bb..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0494.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GCCAACAGTGTAGGGGTCGTAGGGACATGACATGTCCCGATAATTCACATCCACAAGGTCAAGTTCCCGCGAGACGTATGATGTAGCCGTCGCCACTATGGCCCTAAGCCGAAACATGATGACAAGGACCACGAGCCAGGATGCGTGGCCCAGAAGGTAGAACGATAATGGCGTACGCTACAAACTCTTGGGATCCGCGA")) -(assert (= z "ugucaucacuccgcu")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 deleted file mode 100644 index 10abcbf88..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0495.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "AAGTCATCCCGTGCGAGATAACGTATTAACCCCCCTCAGAAAAGACGCTGCATCTGATTTCCGGGCTCTTTTTATGTCCGACAAAAGGGGAATATGGTCAGCCCAGATATCCGATGCAGGGATTCAATTCCTGCAAGAAGTTCTCCGTAGCCCCTTGCATTGATCGCGTAACACAAGTAACTTAGTGGGGTTGAGACGGC")) -(assert (= z "gauuauucauguagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 deleted file mode 100644 index e6e8e7bca..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0496.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CTCTGACAAGTCTGCATTAGTCTAAGGAGTGATAACATAACCAAGACGCGGAGGACACTAGTGTGATCAATTATCAAGCGCGTTGGGCCGTGGGTAGGGGAGATGGAGATCCTGAGTCGGACTTGTATCTGCGGTGCGGCCCCCCCGTGTGCCGGATCATTATGTAGCGAGTGTACCGGGTGCGGAGGAGCTGACTTCCT")) -(assert (= z "gccagagccgaucuc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 deleted file mode 100644 index be48fa3e3..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0497.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "CGGCTCTCACGGACATCTGACCTCGGGAACCGATTTGTTCGACCATGTGGTTAGAAGTTGAGTAGCAGGCCGTTAGAGCTGTATTATGGCAAATCAAGGTTTTATAGTGGTCAAATCACCATATGAACACTGGTGCAAGGTATGAGCATTGATAGATAGGCCGACAGGGATGCCCGGTCCGGCCTATAATTCATACAAGG")) -(assert (= z "uuaccaccguccagc")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 deleted file mode 100644 index 450fb9658..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0498.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TCCCCATACCCCGTCGGAGATGCGTTATGAGTTCTGTTCTAAACCAGCGGCGAAGCGCCCTTTTCGGTGATACACTTGCGCCATCGAATTGCCTCGCCCTGTCATAATATGTAATAGCCAGGCCCTTATCCTACGTATCGGTTTCCCATACGATTCCCAAGCAGGAGGGCTCCACAGCAAGTCACTGATTCGACCCAAAC")) -(assert (= z "cagcuuuugucguua")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 deleted file mode 100644 index aaf317160..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0499.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "GTAACCAGCATATACCTTGTCAAGATGAGCCTAGTGCGACATCACTGGGCAGGACGATCGCTCTTGAGTCTCCGGGCTTGATGTAGCCGAGAATGATAGTCCTAAGGAATAAATTGTGTTATGTCTCTAGAGATTGTCGACGGTAGCCAGCTAAGTCAGCGTGATCCAAGAAGGAGCCTGTACAAACCTGCTTATTCGCT")) -(assert (= z "caaugaggaugugga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 deleted file mode 100644 index 24a0341fe..000000000 --- a/non-incremental/QF_S/20250403-rna-unsat/benchmark_0500.smt2 +++ /dev/null @@ -1,39 +0,0 @@ -(set-info :smt-lib-version 2.6) -(set-logic QF_S) -(set-info :source | -Generated by: Oliver Markgraf -Generated on: 2025-04-03 -Application: Evaluation of Regular Constraint Propagation Techniques -Target solver: OSTRICH,cvc5,Z3-Noodler,Z3,Z3alpha -Time limit: 60.0 -This example models a reverse transcription process inspired by bioinformatics. -Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. -In addition, the RNA string is required to contain a specific pattern. -|) -(set-info :license "https://creativecommons.org/licenses/by/4.0/") -(set-info :category "industrial") -(set-info :status unsat) - -(declare-const y String) -(declare-const y1 String) -(declare-const y2 String) -(declare-const y3 String) -(declare-const x String) -(declare-const z String) - -; Reverse translation: RNA to DNA -(assert (= y1 (str.replace_all y "u" "A"))) -(assert (= y2 (str.replace_all y1 "a" "T"))) -(assert (= y3 (str.replace_all y2 "g" "C"))) -(assert (= x (str.replace_all y3 "c" "G"))) - -; Concrete DNA and RNA strings -(assert (= x "TTCGTGGCTCCAATCGATACACGACGCACTTATGATCAAACATTTACATATGAAGTGAGTGGATGGAAAGTCGGCAGAGGCCCAGTTGCGCTACACCATCGGCGTTGAAGACCGACGTAGAAGGTAGCGGCGCGGTGAAGCAACTATAGACTGTCAGTTATAGGAAAAGCGGTGGCGAAGAAACGCCATACCGTTATGCC")) -(assert (= z "gagugcuuaagugga")) - -; Pattern must be contained in y -(assert (str.contains y z)) - -(check-sat) -(get-value (y)) -(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.smt2 new file mode 100644 index 000000000..fc32541ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGCCCCCAGCCTCTAAACGTAGATCATCCTATAAGTCGTTTCTAACCTTCGCTTCGAATCGAGTAGAGAAACAACGAATGCTCGAGAAGCCTGACGTACTAACTTCTAAGTCCGCGACGCGATTGCCCTCTACGCAGGCGCTGATCCCTTGTGCGACGGCAATATGACTACACCTACTCCGGCGAACGATTACTTCCTA")) +(assert (= z "ucucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0002.smt2 new file mode 100644 index 000000000..52ae834a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0002.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCCCTGCCAGTGGACAAGCTTGGCCGCTGCGTTACTATACTCTGCTACGTGACAGGGGACTAGAAGTAGGCTGAAGCTACTTGAAGATGGGCGGGAACCGGGAAGTTTCAACCGCCGGGGACTGCTCGGACTATTTACCTTCCTTCTTCCTAGGTAGACCTCTGCAACCCACACATCACCATGGCTCGCATCGTCTTCG")) +(assert (= z "agaaggauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0003.smt2 new file mode 100644 index 000000000..4ef272779 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0003.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATAGGACTAAGGTCCGGACTGCTGCCAGGGAACCTCGAAGTGACTTGAGTATGGCTGTGACGCCTTAGGGGCCCCTGAGGGGCGTTTAAGTTGAGGTGAAGAGAGACAGTCATTGGCGACCTACTACATGTAGTACAATTTCTCCTCATAACGACACTGGCCATCCGCAAACTAATGCGCGCCAAATGGCAACAGGGCT")) +(assert (= z "guauug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0004.smt2 new file mode 100644 index 000000000..22d8b0b5f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0004.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGTAATAGAAAGTCCAACTCTTCAAACCAGAGGAAAAACAGTGCGAACCGATCAGAGTTTATGCGCTCGTTCGGGTTGAAGGACATAGGTTGGGTTAGATAGGGAAGGGACGTGAGTGCCACGTTCCCGCCCTTCACTAAGTATCCTTGTACGACTCTTGTAGCTTCGGGTGAGCAGTCCGTCACGTCTTGGGGCGTAA")) +(assert (= z "cccug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0005.smt2 new file mode 100644 index 000000000..98d3e6f31 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0005.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGGGCATCTTGGTATCCAATGTGCTAAAAGGCTGCGTTCATATAAGTACCACTCCCCTAGTGGTCAGGAACTCTGATCTACTAAGGTTGTGACGCCCAGAGCAGGTTAGATAGAGGATATCCATAACGATGTTGGTCGAGGTAATGCACTACGATGTACGGCCCCAGCTGTCGAAGCCCACCGTTTGCGTGAAGATAG")) +(assert (= z "gccgggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0006.smt2 new file mode 100644 index 000000000..709a3f0c2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0006.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCCGAACAAAATCACGAAAACGGCACGGGTAGGGCGCAACGCAAACAGGTAGTCGATGTTCATATGTCCTGTTTCCGCAATATACATGAATAATCGGCCGTATCAAAACGATTTCATGGTGATGTCTTCGGAGCGCACCTGTGCGTCTTCCACTTGGTAGTGAGTTTGCCCCGCACGACTGAGGCGCTCCAACTTATTC")) +(assert (= z "acuuauuagccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0007.smt2 new file mode 100644 index 000000000..02f83109c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0007.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTTCCGTACCGGGAGTGCTTCCGCCAGGACACCCAACGTGGAGTTTATGAAGGCTCTGGGAATTAAGGCCTAGTTCATAGGCAGGGCGTAAAACCAGACTGTCGTCTCCCCATACAATGAGCTCGAATAAACTTGCTTAGCGACGTTGAATTTACCGAGTAACGTCACGTAAACCGACAGGTGACCGTACCTACTTCCA")) +(assert (= z "guccuguggguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0008.smt2 new file mode 100644 index 000000000..3a0aa09d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0008.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGATCAGACTGCATTAGTTTGGTGGACCATGGTAGGGATATGTTGCACCACGGGATAGATAGAAACATGACACGCCTAGGGCTCAATGGGAATGCAGTGGAGGCGTCCAGAGAAAAATTACCTGATAGCTCTGGCTCTTTATGTCTCTTCGGCCCCCCGTAAACCCGTTACAATCCAACACCTCACGGATCACAATCAA")) +(assert (= z "uacaacguggugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0009.smt2 new file mode 100644 index 000000000..2832b4349 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0009.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACACAATCGGAGTATGATCTATAGCCATCCACGGACCAAGATAGTTTTTTGACCACGTATAATTCTGAGGTAACAATTTCGCCCCGAGCTATTTAGATTGTTGCTTTCGGAATGGTTTATTGTACGTTGCAACCAACTCACGGTATCACCAACCTACCTTCTAGTCATGGAATTGTCAGGCAGCTACTCTCGCCTTGATA")) +(assert (= z "gauggaagauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0010.smt2 new file mode 100644 index 000000000..cf1054bb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0010.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAGAATCTAGGCACGAAACTACCCTAGGGCTGAGCGACCCTCCTGCTAGCACAAACAGGGGAGGCTTGCTATAAAAACGTGAACGCTCTCCCGGCACTGGCGCCAGTTTTCTTTTTGGCCGCCCGAAAATATACTAAGACCGATGGGATACCACCTTGGATAAGGCGCACGGAATCACTCGCACACCTGTCTAATAGGT")) +(assert (= z "uggacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0011.smt2 new file mode 100644 index 000000000..4ab4ce29b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0011.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCACAATTCTTGCATGCATAGTTAACTGTTCCGTATTCTGTTGAGATGTTGCTTTGTGAACGCATGAACTAGCGAGTGCATACCGACAGGCCGTACACTATACAGACCGAATTAGAAATTGAGGCCTCCCCCCGGAGCGATTTTCAAGTATTCAGGGCCCGCATCTCGGGGGTGCCTCCGCTATAGACATATCCGTTCGT")) +(assert (= z "uggcuuaaucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0012.smt2 new file mode 100644 index 000000000..6279d4fc1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0012.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGAGGTTCATGCAGCACAACGATAAATTCGAGCCCTTCTTTGCCTGGCGGTCATACCTCGGCTCGAGCAGACCATATGCACCTTGAGAGTTCCCATTGGTAACGAAAAAAGACAAGTGGATTGAGAGACAGAGACGGTACTACTAAGAACTATGTACGAGTTGAAATATCGACTACCGAGTTATCGTTTCCTCGGGTACG")) +(assert (= z "uugcuuuuuuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0013.smt2 new file mode 100644 index 000000000..27eb13a91 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0013.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAAAATGTCCTTCATAGTAACGATATCCGGAGTAGCGGCTAGACGGCGCTATCTCAAGAACTAAGTCACTACGTGCGACGATGTAGAATGACTACGAACCAATTCTCATCGGTATGCACTCCGTCTCTTTTAGTTCTGCTAGTACGTTCGAGATGCCTCATGATGCCAGAGTGTCACACGAATAGTACTGAGACCAGGT")) +(assert (= z "cuacggaguacuacggucuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0014.smt2 new file mode 100644 index 000000000..cf0c7696d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0014.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTGTCCTCTAGACCTGGTTATCTCCATAGCTTAATTCCTGTTACCCTCGCCTCCCCTGAGTCTTTAGGGAGCTTGCATAGAATTCTAAGTCAACGGGTCGCACTGGCAAGCCGGTTCTTCCCTAGTCCTATTTCATGTGTAAAGATTGTCTATAGCAAGTCAGTTTTCTGTAGAATGCTATCCTTTGTCGTCTCAGCG")) +(assert (= z "cuuacga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0015.smt2 new file mode 100644 index 000000000..512b125b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0015.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGTAACCCGTGCCTATACCTAATGGAGCCTGGTATTCGAACGGCTTCGTACCATGGCAATGTATACCGCGTTTTTAGAAGGACTGTCTTTCCGGGCGAGGTAAGGTATGCATTCGCTAAGTGCTCGGTAGGATAGAAGGCTGTCAGGTACGATACATTTTCTACTATGCCCCTGCTTTGGGTTCGCCCCCAAGTGAGCG")) +(assert (= z "aaaucuuccugac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0016.smt2 new file mode 100644 index 000000000..82b8f53e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0016.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCATATTAATACTTCATGGGCTGTTACTACCTATTACCTCCCCTAAGTGCCCTTACGTGCGCGGTCTTCTCTCCGTAGAAAAGCAGTTATAGATTCGCGGGAAGTCTCGCCCAGCAAACTATTACTCTTCCTTTGTCTTATGGCTGACGAAATCCCCCGTCCGTGGTAGAGACTTCAACCGCTTTGGGACCCATCGTGA")) +(assert (= z "auaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0017.smt2 new file mode 100644 index 000000000..06f8d19f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0017.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTTTGTAGATGAATGTAACTGGTATAGGATCTCAGCTTGCCCCCAGGAGGTTCTATGACTATTAAGTTATCCTCGACAGCGCTCGTTAGTTTGCCAGAGTTTGTGGGCACTTTAGGAAAAAGGTCAAGACGTGCAGACTGTATTAGTAGGATAAGAAGCTGTATAATCACCAACGTTACAAGGATTTAGGAGATAGAT")) +(assert (= z "ccgugaaauccuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0018.smt2 new file mode 100644 index 000000000..4cfd390f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0018.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGATTAATTATTAGACAGTAATATTGATCCGTGGGCACAGAAATACGCACGTTTAAACCGTGAGCTTCAGGGGTATCCCCAAATTGGGCCCGCCCTGAAACGGCTCGATCAGGGCAATGCTTGACCGCACAGCTAAGAAGCTAATGGAGCTCTTCGGCCAGACGCTATGAACCGAAGCCTACTGAGCGGAACCCGTAGA")) +(assert (= z "ucccguua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0019.smt2 new file mode 100644 index 000000000..7aeaaea31 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0019.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAATCTGTACGGCGACTTTATTTAGACCGGACACTAGTAACACTCCCTTACCGTTGATACCCATCAAACGGGGTATGCGCAGTGGTTACAAAACTCATTGTAACACGACTAAGAGCCCCGACCCACAATTTACGTCATAATTACCACAACGCCTTCTACTTAAAACAGTCGAATGACCTAGCGAGGTCGTCAGAACCTGC")) +(assert (= z "aauguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0020.smt2 new file mode 100644 index 000000000..0f0c4137f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0020.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGCGAGACGGCGGGTTTGTGCATAGTCACTGATTTATAGGTCAGCAGAGCCGGCCAAAGATGGTGCACCTATTCCCCCGATTTAACAACCGATATGATTTTCCTCATGAAGTGTGTTCGCATCCGTTTTGAAATATCAGCGCGGCGCCTTATAACAGCGCGTAGTCTAATGCCAACGAGAACGAGTACTGGGAGCAGC")) +(assert (= z "gcucaugacccucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0021.smt2 new file mode 100644 index 000000000..190d6e59b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0021.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCCAATGTTCGCCTAGCACACCATACCATTCCTTTTGAGACTTTAGCAGCTCGCAGGTGAAGGAGGTTTTTATACGGCCAGTTTTCCGGTATAGAGCAAACCCATAAGACCTTCTATGCATTGAATGGCGTCTTATTATGAGGAGAGTCGACTGTCCCCCGTAATGGTTTGCTCTGACGTATTCGTATGATGCCTCCA")) +(assert (= z "aaaacuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0022.smt2 new file mode 100644 index 000000000..463047643 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0022.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTACTCTCTTTTACCAATGCCCACGCCGCCCGTGGTGCCAAACTAATCCGAATCCCCCTAGCGACCGGTGGGGTTCTCAAATTAGTTTTTACCGCATGCGCGAGTATCAATTGCTATATTGTACCACGTAAAAAGGATAGTTTCCAACAGGCAATGCGCTGATTGGACCCATGCGCTGGGCCAATGTTTCTTGCCTAC")) +(assert (= z "aaaugguuacgggugcggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0023.smt2 new file mode 100644 index 000000000..badf4ae9b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0023.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTAGTGACTGTCGTGAAGCCTGCTAAGAACCGGGTAACCTACCGAACGAACGGGCACATTGCCGACTGTCTCTTAGTCAGAGGGTCCGAAAGAGATCAGCTACCGCGTCCGTCGCGCACTGGCCGGCGAACCTCACGAGTGGTCAGCTAGCGTGCAAGCCGTCATAAAATCCGTGCTAGAGACGTGTCACACATAAGCAG")) +(assert (= z "gcccauuggauggcuugcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0024.smt2 new file mode 100644 index 000000000..7ce53398e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0024.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATGCACTCCTAGGCCGCATCCATCGCATACGAGCCGTCATTAGGTAGAAACTAAGAGCGCGCACCTTACAGCGGCACAATCCGCATAATTGCAGTACGGGAACCGAGTTAGTAAACTTAGCCCCCCTACGTACGGCGTCCATGCACAACCACAAGAATACTACATATAATGTGCTCTGTTGTTGCCAGGGCCTATGA")) +(assert (= z "ugaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0025.smt2 new file mode 100644 index 000000000..01604c661 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0025.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGAAGATTTGCTCTTGTTTTACGGTGGCTCAAACTCGCACAGGATAATCGAACGATCTTACGCTGTAGATCTCATTATGCTGATCAAGTTATCAAATCGTTTGAAGTTTGAATTGTGTGTTAGGTTAATAAGGAGCGAAGTCGGACCTTCGTCCGCAGGTTTTATTTGTCTGATCCCCTGAATAAGGTACCCGTCTAAG")) +(assert (= z "uauuagcuugcuagaaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0026.smt2 new file mode 100644 index 000000000..b74674015 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0026.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTAGCAGAGACAGTGTAAGCTCTCATGGTACATGTCCACTATTGGGTGAGTCCTTCTACCCGTACGAATGAAGGTAAGTAGAATGTACGGTAAACGGATGACGGGGCGGTCGAACTAAAACTGGAGGACATTAGATCCACCAGTAAATAACAACGCGGCTATTCTAAAGGACTAAAGGGTCATTCACCACCTTGCTCGG")) +(assert (= z "cauuuauuguugcgccga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0027.smt2 new file mode 100644 index 000000000..3e7471d15 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0027.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTCACCTAACTCACATTGTGGTCACAACCTACTTAAATATCAGACGACCGATCGAATACAGCTGTGTACTTATAACCTGCCTTCTCCTACTGGCGATACCCACCCCATGTAGTCACTGGCCGTTCAGTTGCACGGAACTGGCAAACCTCACACGCTCTCCGACATGAACGGCTAGATCTTATCAAGCGCTCACTATCT")) +(assert (= z "gugggguaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0028.smt2 new file mode 100644 index 000000000..7e397d2c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0028.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGTTTGTCAGCGCGCTTAATAAAACCTCGACCCTAGAGCTATGACTATTGATTAACCTACGGGATTACCATCATTTGTTCTTATACCCCTATATTAGAAATATTGTGCGCAGGCCTATACGAACGAATTGGAAAAATATATCGTCTGTCCGGACCTGGACAAGTCAAGGACCGAAAGGGTTCTTAGAATCGCGGCACCA")) +(assert (= z "uuugga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0029.smt2 new file mode 100644 index 000000000..b3600052d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0029.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATACTTTCCCCGGTCATTCCGGTAGTCTAAAGGAACAAGGTGTGTCACCACCTCTGGGTGACTCGCGCGTTGGACATCACGCCAAGTGCATCAATTTGCCCCAAGCCGTTTGCATTAGTTTTCTTCATGACTAAGATGTTTGCCGCAAACCAGTAACTAATGCGCTTCCACGCTGTGGTTACCATCGCGCTGCCAGG")) +(assert (= z "auuuccuuguuccacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0030.smt2 new file mode 100644 index 000000000..dbb159338 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0030.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCTTACTGAGTTCAACCTGGGATGCGGACAGGTGCGAAATTACTTAACACAACCTAAGCAAAAACCCAAAAGAGACCAGATAAAAGGTAGATTTGCATAACCTTCTACATTGCCGCCTGAAGTTGGCAAAATAAAATACCCTATTTTTGAGAAAAGTCAACGATCACTACATTCTTGCAAGGGCGTACATCAAACTGG")) +(assert (= z "uuuuauggga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0031.smt2 new file mode 100644 index 000000000..f5c673a05 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0031.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCTTTCACTGAACACAGATCGAAGATTTTAAGTGAGCGTATCGACAGAATGTCACTGCACTTCAAAGTTGGGGAGCCGAGCGCTAGTTCGATTTTGGCACGAGTCGTCCGCTCTTTTCACGGACTGTTGGCTCCCCACAACTGCTCTACGCTGTCAACCGTGCGAATAATAGTGCAAATTGTCCACATGCCTTGAACTC")) +(assert (= z "cccuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0032.smt2 new file mode 100644 index 000000000..67ba40cd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0032.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGAGTTGGGAATTTTAGGCTTCCCTGAGCTGCTCGAGTCACTAGTGGGATTTTTTCGCAGAAATATTACGGCAACAAATGCGATGGCGGGTCACTGGTATATTCACCCGACCCTTAAAAGATTGCCGAGCAGGTCTTGTGGTAGATCTGTCTGGAGGGCGGAATTACGAGCATGCGACCCTTGTAACTCTCGTTCTTAGT")) +(assert (= z "uuucuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0033.smt2 new file mode 100644 index 000000000..39e4cdb59 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0033.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCCCGTGCGTCCGGCTTCTCCCCATGCTGAAGTATGGTATTTGGTAAGCAGCATAACCGGGTTGAGTCAAACATCTTAAACTATTCAACTCTCCAGCTACTTTAGTATTTGTGTCTTCCGTATCTTTTTCCCTTGCCATTTCTCAACAGGAAAGCACCTCGGGATACCCCTGTCCCGATATAAACACAGAATGGAAATG")) +(assert (= z "cguauuggcccaacucag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0034.smt2 new file mode 100644 index 000000000..e383a81fa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0034.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACATCCCTCTGCTAGTCCATCATAGGTCGTTCTGGTTGCTCTAAGGCATATCTGCTCTCCCTCTTCCCAAAACCATCCGAAATATCAGGCTACGTGATGGGCTACCAAATAGCAGTCTTTTACTGAGAGAGACGATGTGTGATATAACCACGGAATAACTCACGCCTCTTGTGTCGATGGACACATTTCTCTAAAACAG")) +(assert (= z "aaugacucucucugcuaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0035.smt2 new file mode 100644 index 000000000..87a0eb43e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0035.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTATCTGTGTGATCACCAGCACACTCGAGTCTAAGAGATCTGGTAAATACCAGCGGTAGGTCAATCATGAGATGGCGCTCACACCAGAACCGGTTTTGGACAGCGACAACAGGCGCTCCCCTAATTGATGTTATACCCGAAACAAGACCATGGCTTTAAGTAATCGTAATGTCCGAACACGGAGGAGGTTTGGTTAGTGC")) +(assert (= z "cuagaccauuuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0036.smt2 new file mode 100644 index 000000000..9838ea722 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0036.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCTGCCGGTAAAAAGTTGTGTGGGTCAGCAGTTTATTCGTGTACTATTCAAGGACAGTGACTCAGTGTCCTGTGATAGTTGCACCCGATAAGATCCATCTGCGATCGTGTTTCAACCTGTAACAGGACTACCCCGAGTTCCGTGTAGGCCTCTAGTAATTCAACCAACGGTGCATCCCTCAGCCGATGTCAGGAGAGA")) +(assert (= z "uuggacauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0037.smt2 new file mode 100644 index 000000000..306bdbc57 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0037.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTATGTTCCTAAAGAGACGACGATTGCCGAACGACTTTGAAAACACTGACTTTAACCGACTGGCCGCAATGTAGAGACCATTATGAGGATCACGTACCTATATGAGGCAGAACATTTACGCTATCGCTTCCATGGCGTTTGTGATATGGTTTTAGCTTAGTCATAAATGCACGCGAGCGATGAGCAGAGCTGTAAGGTG")) +(assert (= z "cgucucgacau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0038.smt2 new file mode 100644 index 000000000..f15b32cc9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0038.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCGTCGCGTTGCTAGAGTAACTTGAACGTAGCTCAGGAAGGTAAGGGACGAGTGTCGTCTTCGCCCGTGCTTGCATCTTTCCGGCTGTGGCCTCTAAAATCTTTGTCACAAGCTTTGCGTCTTTTTTCTGGATCAGCAAATAACCAGTTCCTCACGTAGCAGCTTCCGGTTAGTAATTATTACTATGGTTTGGCAGAAT")) +(assert (= z "ggccgacaccgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0039.smt2 new file mode 100644 index 000000000..837d9274f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0039.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGATTTAGTCTCTGCCATTCTACGGAGAACTAGGCGTGGGGGATAGTGTAATAGCGCCGATTCGGGGAGTCGGCTAACGGGAGCTGAGGGTGAAGACGGTCGCAAGTTCAATGGTCAGTTTATCACTGGTCTTAGGCGTCGATACTACGTACTTCAGAATGAGGTGGTATTATTTTACTAGAAGCCTCTAGGTAGCGGAG")) +(assert (= z "cugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0040.smt2 new file mode 100644 index 000000000..647f4b74a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0040.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCACGCGCTGGAACTAACGCCACGATCTTATCGGACAAGTTTGAAGACAAGTCAGGCGCGTTCGTCACGCATACATCGAGTGCCGGCACCGTGCCCTAGGGCGCAACACCGCAATTCGTTGGGTGGGAAGCTGACTACTCACACGGGATTGGGGCGGATTACCACCACTCCAAACTGCCTATTTGTGTCGAATGCGCAT")) +(assert (= z "accuugauugcggug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0041.smt2 new file mode 100644 index 000000000..5ce3bf0af --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0041.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGCGGGCAGTGACGGGCATCACTCGAGCTAAAAGATACGGAGTAAGGGTGGATAGGGTTCTCAGTCACGTTCCCTCAACCTACATCCGGGATGTTGATCATCGAAATAGGCACCTAAGAACGCGGGAGGGATGCCGTTTGATATTCGGATGAGCCTTGTGGCGGGTCAACATACAGGGGGGTGTACGGCATTTTCACC")) +(assert (= z "uacaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0042.smt2 new file mode 100644 index 000000000..9f457637a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0042.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCAAATACGGATCATCCCTTTACTAAGTCCCGGATGGTGGACCCGGGATACAGCAATCAAAGGGGTTCATATAACAGGGCGGCTCTATCGTATTGAGGAAATCCCATTACTGGATGTCTACTCTCGAGCGATGAGTCAGACTGTTTAGGCGGATGCCCACCGCGCGGAAGACAATTAACAAACGGGTATTGTGCGATCAG")) +(assert (= z "cgcuaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0043.smt2 new file mode 100644 index 000000000..13c4e6505 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0043.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCGCTTTCCGCCGATTCTGGGTAGTTAGGGCTAAGCTCACTGGTACCACCCTTAGGGTATGCGTCACTTGTGCACACGTATGTTATCAACATACTTCGCATATAGTTCTTGAACCATTACTGCACAAATATTACAAGGTGGTGGTCTTGGAGATTAAACGCCCGGCACTCAATGCACGCAGGCGATTCTAACTCAAGGT")) +(assert (= z "auucgagugaccauggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0044.smt2 new file mode 100644 index 000000000..58ba64ccf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0044.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTGTTCCTTGCGCCACAACAGCGCCTGATTATCTGGGCTATCAGCAATTTTATAAGGTGTCAAACGGGCTACATCCGGGGCGGACGTAGCCTAATGGGCGCCTGTCTCGCTCGAGAAGGCACGACATAATCCCCTCATCTGCAGCCAAGGCAATGATAAACGCTCGTCTGACTTGGTCAGGGAACAAGAGCTGAAGAT")) +(assert (= z "uccacaguuugcccgaugua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0045.smt2 new file mode 100644 index 000000000..2073dbe22 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0045.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCAGTACCGGTTTTGAGCCTGTAGGATTGTGGGGTCACCTACGACCGCACCCACCCAGTTCGACGATTCCTTCGCCAGGGCCTCGATCCCACTACCCATCAGGCGCGACAATCTTTTAGAGCACATTAAACTGCCCAGGGCTCCCATCGTCGTCCAGCGATTGCCCGAGTAAAAGGGCACTGCGAATGTCAAGATGTCT")) +(assert (= z "gugacgcuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0046.smt2 new file mode 100644 index 000000000..ff71295f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0046.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTAGCCTTCTGCGTGAGGTCACACATCCGCGGGGTGCTCGGCCACGGAGCCCCCGCCTCCGGGAGAACCCCGGTTTCCGCGTGACAAAGCCGGATAGTGTTTAGGTGGCTGACCCTAATTAGTCCTCAACAACAACTCGGTCGGAGTATACTACCCCGAAGTAAGTTTATCTGTTAGACTGTTAGCAGACGATATTCA")) +(assert (= z "gacugggauuaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0047.smt2 new file mode 100644 index 000000000..56829187b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0047.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCTGTGTTACCGGCTTCGCACTACACATCAAACAAGGATGTTTATGTGACTTTTGATCGCTACTATGCAACACTCTCTCTCTCGCGCGTTCCTACCACAAAGCGTCTGATTCATACCGTCCATCGTAGGAATCGGTTGTCTCCCTGACCCAACACAGGGTACCAGGCAAAGTTCTTCCTTCCGACTATAACCGGCTCT")) +(assert (= z "ugauauuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0048.smt2 new file mode 100644 index 000000000..c3f506d10 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0048.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGCTGACCTATTAGCTTTTTCAGGATCTAACAAACTCGATCCGTCCGGGATCAATTGGACTCGGCAAGTCCATGCCTCGTACTGCGACACGCCAATAACCAAGCACTAACAGGATCACCTTGGGAGCGCATTACGGTCTGTAGGTTGTATCACATGCCAGTTACCTTTCGATTGACCAATCCCTATCGGGTTTTTCGT")) +(assert (= z "auuguuugagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0049.smt2 new file mode 100644 index 000000000..a2f97cf7d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0049.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTTGAGGTAGCCTGGATCGAGGAGGATTGGTGCAGTGTGCTATTGTTTTTCATTTCCCAGCGCAGCGGACCTTGCCGAATACTCAAGCACGGGTACCACATGGGCATGGGGGGGTTAAGACTACTAGCGCTAGTACCTCGAGGAGGTGTACCCGGGCTTCATAAAATTAGAGAAACTATTTTGGAGGTCACTTCCATTA")) +(assert (= z "cccccaauucuga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0050.smt2 new file mode 100644 index 000000000..9669b768d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0050.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTGTGTAACAAACACAATTATGGCTACCTTCCTGTCGTTCTCGTCTAGAGAGGAGCTTATGTGTCCATAGCGCTCCAAGATCTACCTAATGCTCGTTAGCTACAGGAGAGCTGATGGCGGCCTTCTTATTGATCCAATACGATAATCATAAGCGAATAAGTACAAGTTACATGGATTACGGTAAATAGTAAGGATCCG")) +(assert (= z "uacacaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0051.smt2 new file mode 100644 index 000000000..148062b52 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0051.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGGTAGCCTAGGCGTGCCATGGCATGGATGCTGGCGATACATCGTTTCTGCGCCGCGGGGGGAAAGGGGAGTCCTAGCTTAACTTGCGGACTATCCACGACCCAGGTCACCAGTTTCCACACCGGACAGCGCTATCACTGGCTAAAACGCCGCTTAATTATCTCTGGGCAGAAGAGATTCCAGGGTAAGTCGTAATAA")) +(assert (= z "cccauucagcauua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0052.smt2 new file mode 100644 index 000000000..ea28e4f6f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0052.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCTTTTGATGTGTTTAAGTTAACTAATTGGCATCGTGGCATCGCGTTAAGAAAATTGTCCAACTCTATTGAGTGTCTCTATGAGAAAAGATGAATTCTACAATTCTCTAGGAGGTCGCCCTAAGAGCCAAAATAGTGCGGTTGAAGTTCCGCATTCTCTATGCCTGTCTACGAAGAAAAGGGTTGCTGGAAGTAAGCA")) +(assert (= z "gcaauucuuuuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0053.smt2 new file mode 100644 index 000000000..cd2e1c98a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0053.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCGGCTGCGCGTTGTTTAAAGTCTAAATAAAGACGCGGTTCGAAGAAGAGTTCGCAACGATTGCAGTAACGATGAGATGCTCCTAACTGCCCCACGATATACGGTGTACATAGAAGTCGAATATCTTCCAGAGTTTCCCCGCTGAAAATACACCTCAGGGGCCTCGAGCTGGGCATCCAGTGCGATGGCCTGGACACC")) +(assert (= z "cgcuaccggaccug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0054.smt2 new file mode 100644 index 000000000..a98d3db0b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0054.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGATGTGCGGGCCTGTGTATGTCACTAATGGCAGTCTATGAGACATATTTGTTATGGTAAGTATGCTCACCTAGCCATAAGTCGGCACCTCCGCGGGGTTCGAAATACTGCGTGGGCCTACAAATCTAGTTGACTAATAACTAATTGGGACCAGCCTGCGAGATAAGATTACGGACTCTTAATCGGTCTTGAGGAGCCAT")) +(assert (= z "acgcccggacacauacagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0055.smt2 new file mode 100644 index 000000000..6a196669a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0055.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGAGGTGCCCACCCCAACCCTCATTCCAGCCATATTACAGCGACCTGGCCGCAACGGTGGCGACAGTCTCAACAGCCGGGCTGGGCGCGGCCTTGGCTAAGCTTTTTCTGTCGGTTTTAACTCGAAAGGGGCCGGCCTATGGAGTCTGGAGCTGGAGAATACCCCGTTAGCCGGCCAAATCAGCTTTAAAAATATCTGAG")) +(assert (= z "cacgggugggguugggagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0056.smt2 new file mode 100644 index 000000000..9689465ab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0056.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTTGGCCAGTGACGTATCATTGGTAACCCCATTGGGAGCCCAAGTCAGAAATCGCTGCCACAGCTGTTGGTTCGGCGGCTTAACGCTACCCGCTCCCGGCTTGCTAATTATTTGAGGTGTTGGTAACTTTATCTGCTGACGGCCGCCCATAGGGACCGCGGTATGCGCTTCAAGGTCGAAGCGGCCTTTACTCTATAA")) +(assert (= z "gucacugcaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0057.smt2 new file mode 100644 index 000000000..8c1ca8ad9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0057.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCGGTCCCACTTGGCCTCAAAACGCACGGCATGAAATGTCAATACGAGATTGGACGCCTGGGTTACCGACGAACTTTGGGGTTATGCGTCGCCATGGTTAAGTTCCAGTTTTGTCCCAAGGTGAATTATTCATTCACGGGTGAGACTTCTCAATGCTTCCCACGTACTTTATCGTCTTTAGGGTGGTATGCTGTTAAAG")) +(assert (= z "ccacuuaauaaguaagug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0058.smt2 new file mode 100644 index 000000000..1c02b6895 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0058.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGGGGCTTATTGTTTGCCAGCACTTAATGGTCGGCTGCTCGGTCGTCTACAGCTTTGACGGATAATTGAATGTGTAGATCAAAGCCTCCGCCGGAAGTAGAGACTCATAGTCAGGGGTATAGCGCATTTCGGACTTCACAAACTATTGGGTTAGTAACGGAGGTATAACCTCTTATATGTCACCGGTCGACTCTCTAA")) +(assert (= z "ucugaguauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0059.smt2 new file mode 100644 index 000000000..1fbd5865d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0059.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCAACCCTATCTACTTATTCAGCTAAATCTTTCTAACATGGAAGAGGTCGATCATGTACCATATGTCAGATTGAAAGCGCAACCACGCCGGTTCAAGGGTAAGGAAATACGATCACTGTGCGGGGTCGATATTTGAGCCCGACAAAATGTCGGGTCAGCTCCCGTCTAGTCACGAATCGCCTAGGAGCAAGGCAAGCTC")) +(assert (= z "uagaugaauaagucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0060.smt2 new file mode 100644 index 000000000..a8f5f8fec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0060.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATCCATAATGAGCCTTAGGTATTTCGGTACTTCAAGGTGCGAACCATTAACGGCGGAAATAAATTAGAACTTCATTGTCATCCCGCCAGATAGTCAGTAGTCAACGACCTCGACGCGCGATCCCCATGAAGGGACGCAGGGGCGCCTACTGATTAACATTGAATTCAATGATTATCCAGAGGGAGCCGGTCCGAAGCCC")) +(assert (= z "gucucccucggccaggcuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0061.smt2 new file mode 100644 index 000000000..9bc6c9d14 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0061.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCAAGGACCATCCAGCTATCGCTCTCACACGCTCATAGTCGACCATCTCCTCGTAAAGGCCCGGTATATTTGCTACGCTCCCCCGTGCGCCTGCTATTGAATAGGTAACCGGCCACGATCAGCATAATGCCTTAAGTAATAGATTACAAGCACCGTGGGGTACATTCAACACCGAGCGCAAGACGTTGTATCGAGACGTT")) +(assert (= z "uaaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0062.smt2 new file mode 100644 index 000000000..1ec2c9ea9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0062.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTAGCACGTGTCAGCAATAGGCAATATGGTACTTTACCGACAGATTCTAGAGGCAACCGGTAACCCTATTATGTTGGTATAGTGCTCTATTCGGTTTAGTAACGCGCGTAGCTACCGTCCCCAAAGCGATATAACTACGCCACAACTTCGACCGACACGCATCGAGAAACCAGCGTTAGCCCCGCAGCTTGTGGAATGT")) +(assert (= z "aagccaaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0063.smt2 new file mode 100644 index 000000000..d8482e04f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0063.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTACCTGTATTACTGATGTTATAGTTGTGTATGCGTCGGGCGGGTCCTCCGCGCTCCCCTGGGCCATACCAATGAGCAGATACAAAGGCTTTACTACGAAAAATGCAGACCTTAACGAGTAGGTCGGCAGTATCATTGCTTTAAAAAACTTACAGCTAGACAATCAGGATCGCTGTCACCGCTTTGAACTGGCCTGGACC")) +(assert (= z "uggcgaaacuugac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0064.smt2 new file mode 100644 index 000000000..35d2fa6e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0064.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCTAGGCCAAAGTTGCTCTACCCCATTCACTGTGAGTGCGTGGGTGGGTCTTATCATGCGAGTGTAATATCATGTCCTAATGTTAATCTGCTTAGCGATCGGGGCTGTAACAGGTCACCAACAATCGAACTAATATGGACATCCTGAGATTTGTTTGCTCGGACTCTCTCTTTGTTGACTCGAAGTTTGGGATTCATG")) +(assert (= z "aguacgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0065.smt2 new file mode 100644 index 000000000..7c71701b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0065.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGCATTGGATATCAGTCGGCGTTCCCTCATTGTACAATACGGCGTCGGGACGACAGGTTGTCAGTTGAGACGAGGCTACGCGTTTTAGAGTCCATTAATATCAATAAGACACACTCGGATATCCTTGAGCGACCCCGTGCTTTGGGATTCTCCGCAATCAAGGGGCTTAGCGTTTCATAGTGGTCTGCTCGTTATCAG")) +(assert (= z "auagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0066.smt2 new file mode 100644 index 000000000..68400223e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0066.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTTGTTCGCATACACAGATAGTTGAGCTGGGTTCGTCAAGGGATAGTCTTCTTACGTCCAACAGGGGCACATACTGCGCTTTCAGAGCCTTTGATGATTGTCCTGGTGATGGACGTGGAAACCAGTATCCTTCCTTCCAGCACTAATTAACACTGCCGCCCCGGCCCGCCTAGGTCGATGTCCCACCGGGATCGACGAC")) +(assert (= z "ccaagcaguucccuauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0067.smt2 new file mode 100644 index 000000000..ed5a107ca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0067.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCGACTGGCCCCAACCAAAAAATGCAGCTTAGTAGCTCCGGAAAAAACCGGCAGTCCTCCTAATACCTCCCCACATGCAGTGTGGGCCTATCTATAAGCCCACGGACACCGACACAAGACGATGTTGCGTAACGAGTGCATCCACTCCTCAGAGGTGTCGGCAACGGGGTCAGACTGTGTGTTCACTTCCTGATACGAG")) +(assert (= z "ggauagauauucgggugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0068.smt2 new file mode 100644 index 000000000..106d014ca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0068.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCATTCGAGCGCAGATGCACGTGTGATCCAACATGTGTAGACCAGACGCGGGCGCCAATAATGTGCACTGGGCCATTAAGAGGGTAATTGCTCGTTCACACGAGCTTGCTCGTAGCATTAGTCATGTGGGCTTTGTTCGATCACTCATGTTTGCCTTCTTGATCCACAGCTGTACGAAGTTTATGATCCCTACAGCCGAC")) +(assert (= z "caaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0069.smt2 new file mode 100644 index 000000000..f831ed645 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0069.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCCTGCGAAAACGTCCACGAAACAAGCCAAACTGACATCGCAATAATCCTCGACTGTACGTCCAGGAGGAGTGACGCTCTGTGCGTCCGAGAGAGTCTCAGAAAGACCTTCGTAACGTGAACAACATACCCGATCAATTGTAATAGATCCGGCCCTGTGGCGCTTCGCATCCCAGTTCACCTCTTGCTCGGGTGTACAA")) +(assert (= z "ggugcuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0070.smt2 new file mode 100644 index 000000000..71f4afc0e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0070.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCTATGACCAGCTTGTCCGCTTGTCCACCAGCCCCACACGCAAGCTACCCGTGAGTACTGCGAAGGATAAGAGAACAGGCGGGGGAGGTTGAAGTTACCATGCTGATAATTGTGATAGTGCCCATTCGAAATACATATCGCTAAGAGCACCACCAGCGACCGGGTTAAGTCCAGTTAGGTGCGAGCTATCCTGCGCCC")) +(assert (= z "uucgauggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0071.smt2 new file mode 100644 index 000000000..bcafb0fd2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0071.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCTATCCGCACGGCAGCCCTCGAACTGGCCCAATACTATCTGGTCCCGCTTCCGTACCCACGTCCCTAAATCATACATCTAACATACCCTCAAGCTGAGCTCTACAATTGAAAAGGTGGCCTGCGATTATCCCTCTAAGTGGTCATAGGAAGGGTATTGATCTCCAAGGTCTGACCGTTTTGGATTTGCGCTCGGGCG")) +(assert (= z "cgugccgucggga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0072.smt2 new file mode 100644 index 000000000..d62e72c78 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0072.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATGTGCATGGATTCCTTACGTCAGCCAGCAACAACTACTAAGTGCTGCTGGTTTGTCATACGTATTAGTCATCGCAGAATGGTACAACCAGTAGTAAGCTGTGCGCTAATCTGCCGTCTGTCCAGACGGGGTGTTGCTACTTTGGGCTTTGGTTTCCAATTTACGTGTCCCGGCACTTGTTCCTGTGCCAGAGATTTCT")) +(assert (= z "augcagucggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0073.smt2 new file mode 100644 index 000000000..63b341ca9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0073.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTTCTAAATCGGCTTCTGAGGTAGATCGTACCCCCATGTCATCACGTACGAGACGAGGTGAGTGACCGTCACAGTTGCGAAACCGTGCTTCTCAGCAGATTCAGTAGCATCCGTCACATTCCTAGTACGGTTCATTGGCTGAGCGCGGCCGTCATGCCAAGACTGGCTCAGATGCAACGTAGTAATGAATAATGTAACC")) +(assert (= z "ucgucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0074.smt2 new file mode 100644 index 000000000..e36511fba --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0074.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCAATATCGTTCGGGCTACGGAAATTTGGTGCCAAGCCGTACGACCGCCAGCCTTGCGATAGCGTCGGCGCGCACCGCGGTACGGCCGTATGGGTATACCTTGAGTACGTCCTGCCGGGCGGCATAGAAGGCACTGTTACACCACCATAAACAGGAGCCTTATATAGAATCAAGGTAGGTACATTTCTAGCGAATTGGT")) +(assert (= z "ccauccaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0075.smt2 new file mode 100644 index 000000000..95cd7fd85 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0075.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGGTGATGCCAGGTGGACTGAGTGACGGGACCTGGGTCACAATACCAGAGGCCTGTCCGAATGCGCGAAGGACAAGGTTTAATCTTATCAATTCTACGTCTACCTGTTCTCGTGCTCCCATCCGACATCCTTGCATTAGTCCGCGTATTAAGGCGCCATACGCTACAACACGCCAGTGCGGATTGGGTAGTAATTTCG")) +(assert (= z "guuauggucuccggacaggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0076.smt2 new file mode 100644 index 000000000..b7d376ffc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0076.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTCCGGTTTTGGGACTGAGCCGTCCCTCGCTTAAATATGCTTTTGAGAAACAGATCTTCGTTGAGTCGAACGCACGCAGGAGCAAAGGAACCGCCCTTGCTCTAGGTACGCGTAATTGGCCAGAGCGACCCCCTTTAACCACGGCTGCTATGTCAAGGTCTAAATAGCTGCGGCCCGCAGGGTGTCAGCCTCCCGTCA")) +(assert (= z "gucuagaagcaacuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0077.smt2 new file mode 100644 index 000000000..adb17ae05 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0077.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGACACCGTAGTAAATTCTACGCGTCTAGGAGTGGCTTTACGAACAAGGGGAAGACCTTCAGATCTTCACAAACGATGAGTTGATGACGCCTCCGCTAATGATGCTAGCTGACGAGGCAACCTGCCTTTCACACAATTAAAGAACACATTCTTCCCGTCTTTTAAACCGGCGACGATCCTGTACGTAGTCAATGATTGA")) +(assert (= z "cggaaaguguguuaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0078.smt2 new file mode 100644 index 000000000..c4841f813 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0078.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCATATGTCGTTAAAGCGGCATAAATAGAATCTGCACAGTGCACGTAACTCAGAGAGTGCTATCCCTGGCGGGGAAGAAGGGCCGTTGAGTAAGGAGTACAGAACGGCTCGATACGGACAGTCCTGCCCAGCAAGTGCTTTTACGAACAGACTCCAATAAAGATGCTTCATTAGTGTGTGCCATTTGACGTTTCCCGAA")) +(assert (= z "cgggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0079.smt2 new file mode 100644 index 000000000..4e8f59d4a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0079.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGGGACGTAGGCCCTCCCTCGGCACTTTAGCGAGCATGCTCAGGTCCCATTGGCCTACTAAGATAACACCTGGGTCCTCGGGTGACTCTTGTCGGTCTAACTTCAGCAGGTCGTGCGGCAGAGCGGAAATGATATAAATATTATACGTACCTGCTTGATAAGCAGACTTCCCCCACTTGCTAAGGCACGTACGCACCT")) +(assert (= z "acuauucgucugaagggggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0080.smt2 new file mode 100644 index 000000000..501a262eb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0080.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCTTTGGCTGAAGTGCGGTATTGCGCGCCCAACTGCTCTGCTATAACATGCTTCGTCCGCCGGACGACTCCATTGAGACGAAAGGGCTAGACTGCGCTGCACACCAAGTGGGGTACACCCTGATCACGCGGTAAGATTTAAGAAGGGTGGTACGTACTGTGTATTACTCGAAGGTACAATCGTCACCATAGTTACCTCA")) +(assert (= z "uuagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0081.smt2 new file mode 100644 index 000000000..02d9abbf8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0081.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTCCGTAAGTCTTTAGATCTGCTCGCTAATTTCGCAATAGCCAGAACACGCACTGGACGAGCTGTCATTAGCATGCATCGCTCAAGTGTTATGTTCTAGACGATTAGTCGGGGATCACCATTCCTCCTCGAGTAACCACTCCGAGCGGGCTAGGCGCTTAGATGACATTCGATCCACCGTTCCCCGGCCGTTATTAAGC")) +(assert (= z "ggcucgcccgauccgcgaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0082.smt2 new file mode 100644 index 000000000..bb7cdb0ab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0082.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAAGGCGTGGTACCCGCGGGAACACGGCGTAATTGACTGAAAATGGCCCGGTTTTGGCCTTGTTAGTGCATGAATTCACGTGAACAATACTCGCGCAAGGATACCGAACTTGTCATACCGTAATAAAACAAGAAGGCCGCGCTGATGTTTTTCCTTGTTCTTGTAGTGTTCAATTTCATAGGAAGGAACCCGAGACTCG")) +(assert (= z "uggcauuauuuuguucuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0083.smt2 new file mode 100644 index 000000000..9839e964d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0083.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTAAAGTACGGTGCGTGGTATCATACTCCTGGGCATGTCCATTAGGACTGACGGCAAGCCACACGTCGCGCAGCCAATCAATTCCGTTTAAAATGAGCGCGACAACCACTTTCGCATACGGTCACGTCCAAGGATGTATGTGTTAAAACGTGTATGCTATAGAAAGCCTCGGACACTATCACGCTCTGCTTCGTGATTT")) +(assert (= z "cuaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0084.smt2 new file mode 100644 index 000000000..545a1ea53 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0084.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTTCGATTTTGTGTACGCAGCCAGATGGACTTACTGAATGGGAAACCGGGGGCAGCAAGCGGCACTGTAAGGTTCTCTCGAGTGTGGGAGTAACGTGGACATAGGTTGTAGGGCACATCGAGAGACTTAATCGGGCCTTCGTTCTTATGTCTGCACGCTAGCGTATGTATAGAAATTCGTCTCCACTTTGCCTCTACCG")) +(assert (= z "cauugcaccugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0085.smt2 new file mode 100644 index 000000000..d87ee953f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0085.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGGAGGGTAGTCGAGAGATTGGCATCAGGTACAAACGGTCTATCTCCGGCGAGCGCCACGACTGGTGTTTATATGCGACAGTTGGTATGTACACTAGACGCGTGACATCCGATTAGTTTACAACTACTATATGAGCCTCGATCGTCCTCCATATTTAGATTATAACTGTATACACGACCGTCCATTCCTTTCTCAACGC")) +(assert (= z "guugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0086.smt2 new file mode 100644 index 000000000..e3247ecf4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0086.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTTTTTCGATAGTTTACAAAAAAAACCCCCGTCGAAACTATGCGACTGGTCTTAGGTAGCGACGCTTAGACGAGAACTCGTCATCCCAGAAACGAGCTCTTCAATAGGGCAACATCTGACTCACCCAAGGATCTCGTAATACCAACCAGGTAATCCCGAGCCATTTGCCCACGATTAAGCGAAGTTCTTCCGTACATGT")) +(assert (= z "cuaucaaauguuuuuuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0087.smt2 new file mode 100644 index 000000000..6397f29e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0087.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCGACAGCCGTTATGTTTAGGCATGCGTTGTAAGGGCCCCGGAGTACCCACTACACCCCAGAGGTTTACCTACGTTATGTTTCCATGAGATAAACCATGAAGCCGGGGGCTATAGTCGACCACGTGCTTGCTCCTGTCCGATGTGGGGGCCTCAGAGACAGCCGGAAGCTTTTTCGGATACTACCAACTGAAACCTCC")) +(assert (= z "cuuuggagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0088.smt2 new file mode 100644 index 000000000..1faf3bbc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0088.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGATCAACACTCCCCAGACCCGTCAAGGTGCCTTCTTGCCGCAATGCTGAGCCTAAGAGGCGAGTAATCTTGATTTATTTCTCACTGGACAGCTAGGTCGCCCACACGCGTCAGACCAACTCTCTTCAAATCCTGGTCGCCGCTCTCCTAAGGCAACCCCCGGTGAGACTGAAGGTTCATGGTTTTCAGGTGTAAGCCTC")) +(assert (= z "cggcguuacgacuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0089.smt2 new file mode 100644 index 000000000..cc6216977 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0089.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGTGACCTCCTCGAAGGGGCATGAGAGGACACCATGGTTAAAGTTCGCTCTTCTGCCCCGCTTGTCACATCTGTGCCTTACGCCCATATACACAGGCTAAAGTCGCCCTAACGAATTATCCTTTTACGAAACAGAATCCGAGGGGCCGACTGGATATTTACCTCTCCAGATTTACCACGTATTGTCTGAGAAAAATGC")) +(assert (= z "caauuucaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0090.smt2 new file mode 100644 index 000000000..cc49fa1cd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0090.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTATCAGTTGTATTGCATGGGCAGGCTCAGCCCTCGGTGCTAACCTGCCTCAGCACAGGGTGGACGACAGTCCGAACTGGCGCTGGGGTAGTGTCTTAGTGGTACAATGCCTCGAGAGCTAGCAACCAGTCTTGCCTGGCGCGTTCTCTTACGAGCTCGTTATATATTCCAGCCGCATAATTAATTTACCGGATGCACAC")) +(assert (= z "uggacggagucguguccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0091.smt2 new file mode 100644 index 000000000..54bd6d8a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0091.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTATCTGTGAATCCCCCCGACCTGCATAAACCACCTACTCTGCCCCGCCAGCATGGACATCCCCACAAGCTTCGGTACGCTTTCACAATCTGAAGATTTATCGGCAACGACCGCATTGCAGTTAGAGGAACGCTGCGTGGCCCCTCAACATATTATGCAGACGGGGCTGGGGCGCCGCCATTAAATCCCCACTCACCA")) +(assert (= z "cgcggcgguaauuuagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0092.smt2 new file mode 100644 index 000000000..7fb136e06 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0092.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGAAGAGCCGATGTTAATTTGTTACGCGTTCTTTGCTCGTCGCCCGCAACACGGTACCTGGGCGGACCAAGGGACGTCTCCCGGGATGTACTACCGGCATAGACGGCGGTCAAGCAGCCGATCCGGACTCTGGAAGACGTCGTTTTCTCGTTCAAAAACTGAAATTGTAGCTGTATGGCGATGTCAAGTCCGGACGCA")) +(assert (= z "ccgccugguucccugcagag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0093.smt2 new file mode 100644 index 000000000..22f2418ce --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0093.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCAGTTGGACTCATCACCTGATGCACTCTTACAGCGCGGAGCAGTGCTGATGCTGCGGAAGTGGTGTGATCTTAATTGATCGGGAGTGCTGTCGCAGTAGGTCGATAAACGCGACCCCCTCTTAGTTTGCCGTAAACCATCAAGACTGGGTGACCGATAGGCCGCCATAACCGTTGGTAGAGCTAAGGGGCGTCAGCCC")) +(assert (= z "ccacuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0094.smt2 new file mode 100644 index 000000000..e085c42f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0094.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCCTACCAACCGAACATTTTGCTCTTTAACTACTATCGGAGATGCAAGCTGTGTTCGACGAGACTGACAGAATCCTTTCATACACACGGCAAAGGCTTTTCCTTAATCCTGACATGAATTTTACAAACTTCCTAATCAATACGTTTCACGTAGCCCGCGGCCCCTGGACGCTTGTTTGTGGTATCACGAGGGTGCAAT")) +(assert (= z "acgagaaauugauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.smt2 new file mode 100644 index 000000000..bbef77088 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAAGGCCTCACCGTTCCTTCTTCCGGCGACTGTCGATGACAATGTTGTACACTGCCTGCAGGTTGTGGAGTTACGGGAGTGTGAAATGATGCGCGCTTCCTATGTGTTTGTCACCAGGACTATCAAGGTGCGTTAAGGTCTAGTCGATATTGTCACTTCTGTAAGTTTCATTAGACTTTGTTGAATTTGAATATCCGTC")) +(assert (= z "cacgcaauuccagau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0096.smt2 new file mode 100644 index 000000000..d99024f95 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0096.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCTTCGTGGCGTCCGGTACAAGCAACCTCTATACCTTGCATTGGCTTTGAGTTACATACGAATTTGTAATATTGGTGTCAAACTAGTAACTAGGACGCTAACAGTCCATACGGCTGTACGATGATAGCCTATGGGTTAAAACTCGGGGGGAGATGCTCTCGACACGTTCAAACTTTTGGAGCGCGTGACTCGACGATT")) +(assert (= z "uugucagguaugccgacau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0097.smt2 new file mode 100644 index 000000000..15bd76d26 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0097.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGAATCCGAAGCGTACATTTCATCAGCAATTTCAACACCTCAGCCCCTGGCGCCAAAGTGTCTTTTCCTGAGCCTGGCGGGACGGACTCGGTATTTTACATCTCGAGGCTTCATAGCTGTCAATCGGTACCACCGAAGAAACGCCTAACCTATGTTGTACCAACAACTTAGTCACAGTCCTGGGATGACGTCGCGCGATT")) +(assert (= z "gacccuacugca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0098.smt2 new file mode 100644 index 000000000..5e7865c91 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0098.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTATGTACCCGAGGCCTTAGTTCATTTGGGCTCGCGCCCGGCGGACAACACACGAAGTCATGTTATTCGCATCAAGTACGTTGCTACCCGTATAGTTCCTCCGTCACCGCTAGGCAACGGAGATAGTGCCGGGAAGTCGACGGGACCTCCGGAGTGCACACCGCGCCAGAGCGGCGGATTCCTCATTAAGCGGTAAGC")) +(assert (= z "aaacccgagcgcgggccgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0099.smt2 new file mode 100644 index 000000000..cfc43db71 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0099.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAATTTGACAGTGAGCTCCGCAGGCAGCTTATTACGTGCAACCCGAAGCCATCTATCCGCAATTTACGCCATTATAACATCCCATTAGTACGCTCCAACTTGGTATCCCGGAGCTGGAGACGGTGGAAATTGACCCCAAAAATCGTTGATTAATTCTCATTCTAGCCGGCAAGAAGTAGTTTTTTATATGAGTGGTGTC")) +(assert (= z "uaagaguaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0100.smt2 new file mode 100644 index 000000000..92a2092fc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0100.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCTCTAACGAGCCTTACGCAAAGACCTGATCCCCAGCTTCGGGGCGCACTAGGACACTCCGATTGGCAAACCCCTATGGGCAATAGTTGCAAATCAGCCTCGGTTGCGTACGATTTCCTGTGCCGGGAAAGCTTAAGTTTTTGGCTTGTTGCCTAGATGTAATTGGGACCCATTCTAGTTCGTTAATCGTATTCTACG")) +(assert (= z "aaaccgaacaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0101.smt2 new file mode 100644 index 000000000..8017dcae2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0101.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCCTATCACGCTCTAGACGGCTTTAATGGGGGCGCTTCCTGTCAGAGCGTCTTGATGTATACATCCGTGGTTACGATTAGTAATGAATCGGGCACAAGTTGAGTGCGGTCCCTGCAGGCTATTTCCGTTGAGAAATCATAGAGCTTAGCGTAAGCAAAAGTCGGGAACCAGGATGCATGTGGGATTGTTGGAAGCCGCC")) +(assert (= z "agaucugccgaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0102.smt2 new file mode 100644 index 000000000..4a63e3a48 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0102.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTACATATCGCCAGTTACCACCACTGTCGAATTCGGACAGCATCACTTCCGAGACAAGTCGGGTGTGCTCGGGCGGTCGGAAACGTAAGGCCCAGGGCCGCACGCGGTAGAAAGAGCTGACCGTAAGTACGTAGTTACGTGAGCCTTACTCTACCTTCATGAAATACAACCCACTCTCATTACTGTAGTTCGCTAGTCGT")) +(assert (= z "gaaggcucuguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0103.smt2 new file mode 100644 index 000000000..76a679d6a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0103.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGACGAAGGAACCTTAAGTATCGGAAGTGACGTCGTGGTCCAGGCACATTAGCTGACACACCTCGCCGGCATTCCAACTGTAGCCGCGAATATTGTACAGTACTGAACTATATCCATCTATGATAAGTCACCAATTGCGGAGACCCAACTGCGCTGCAAAATGTAACTGGGTGTAGGCGCATACAGTCGCCCTGGGAGGG")) +(assert (= z "ucgacugug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0104.smt2 new file mode 100644 index 000000000..b3986b81d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0104.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCAGTGAACGTTAGGTACTTGTGACTGTCGTCTATCCGGGGACCAGGCCAACTCATCTCAGTTTGGGGACTGCTAGGACCCTCCTTGACTGGATTCGTTTCCCAGCCGTTGCGGTGCGGGGGAGGCTGTCGCCCAGAAAGGGTGATGCCCAACGAGCGCTTCGAATTGTGTCGACTATTGGGTTCCTTACACGTTGTGGG")) +(assert (= z "gcucgcga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0105.smt2 new file mode 100644 index 000000000..85104c30a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0105.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACGCCGCTTTAACTAGTGAATATTTTCGTAGTCTCGAGTCAGACCCCCCCTTGCAAAGCGAATACGCCTAATTTGGGATACTTTACGCCCCTATAACTGACTGCGAGCGAGCCTTACGAACGCTCCAAGTCCGCCACCCGTAGTGTTCAGATATGGCCCCCCATACTACCTCATACCCTTGTCAGCACCATGTGGCCG")) +(assert (= z "ugaugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0106.smt2 new file mode 100644 index 000000000..71aad8038 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0106.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATGTCTCAACGATTGCGCAGGGTGCCGTAGCCGGTGTTTTGTCAGTGGGATTAAACCTCGATCATGACAATCATAAGGCTAAACGGGTTTGCTAACCATTCTATATTATGGTGACTTTCCAACACATGCATTGGCTCTTTCGCAGGTCCGTGATATGAACTGGTGTATGACCGTATACCCGACTTGAATCTGCAAATCC")) +(assert (= z "uuggagcuag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0107.smt2 new file mode 100644 index 000000000..1971b1bfc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0107.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGATTAGACGCGCTTGCGGTGCGAGGCATAGGGCTGAGAGTGTACGGGGCGGTTTACTCGGATGATACTTTGGAGACCTCGATCTTAGGTATTCCCCTTTCCCGGCCGGCTTGTAAGCGCACCGCGCGATTGTGCCGAAATCACACACTCGGTATCGCGTAAGACTCTAGTCAACGCCCATCGCTGAGAGATTCATAGGT")) +(assert (= z "gccuacuaugaaaccucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0108.smt2 new file mode 100644 index 000000000..121a49426 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0108.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAGTTCTCTTAAGTTAGCGGATTATTTTGCTGCAGGTGCGGGTTTGTCGGGTCATTCAGACTCCGCATCCGGTGTGTTATAGACTACGTAAGAGGCCAACTGTCAAGAGGGTAAGTGATAAAGTTCCTTTATTTACCTTCCGAACTGGGATGTCAATAGCAAAAACGCGCCATATGACCCATGGAGCACCCCTTCTAAT")) +(assert (= z "auaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0109.smt2 new file mode 100644 index 000000000..f86bb9044 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0109.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTTGGTATCGTTCTGGGCGCCGAGAGGGTCAAACATGCGTTATGTAATGATATATACCAATATGGATTATTTCGCGGGTGTATCCAACAGTCGTTGGCGTCCTATCACGGTCTATTTGACTAACTGTCAGGAGTCAAGTCTTCTGACAAGCCGTCGAAGTGACCAAAATGCTCAGCACCTTCCTATAGACCGGAAGCT")) +(assert (= z "uaccuaauaaagcgccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0110.smt2 new file mode 100644 index 000000000..de55464d1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0110.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTCGAGTCTGTCGATTGGTTCGCTCATACCAGTACGGAACTCGGTCCCAAGTATTAGACTGCCACAGCGGATCAAGCGGGCATTCGGGACCTGCCAGTTGGTTTGTCTCTGTATACGACAGATTGTAAGCTCGGCTACCATTAAACTGGCGATTAGACACGGGGTTTTGCCGTCTGCGAAGCCACTTTGGGATGGATA")) +(assert (= z "agccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0111.smt2 new file mode 100644 index 000000000..52d476ae2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0111.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCGCTCCCTGACAACGTTGGAAAGTTCCTAGCGAACCAGATTCAGGCGCCGATGGAGAGTCTATGGCTACCCAACGGATTATATCCACATTTGTCGTATCACTAACATGCGATCCAATACGTTTAGGTCCCTGACGCTCACCACCTGATCTCTGAGGGCCCTGTGCGCACCAGCGTCCTCAATGGCCGCGTACCGTAC")) +(assert (= z "aucgcuuggucua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0112.smt2 new file mode 100644 index 000000000..0d81867ee --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0112.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACTAGGTGACCTCGGGCTCATTCCATGCTGAAGTTCACAAAACCTGTTTGCATCGGAGAAACGCACGCGAGTGAACGCACGTCTTCTGCTGCCCATATTCTGGACGCAAGTTTCCAGATATCCTAATGACCTATGCCCAACACTTCAGCTCGCACTAAAACCAATTAGCGTTAAGCGCATAGTCGCTCAAGCTCATCTA")) +(assert (= z "guauaagaccugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0113.smt2 new file mode 100644 index 000000000..7de3c6d45 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0113.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACCGTAAGGCAATTCCTAGTTACAGCGAATTGGTCAATTATGACGTTGGCCCAACGCGAACCCGCGATAGGCGTGTTCGGCCGCTTCGCTGGATAGGGATCTCAGTCCTGGGCTTAAACGAGAAAGAAGACGTAGTCCGGGCGCCTTCCATTATAGAATCTCTTGAGGATAGAGTAGAGAAAGTTGTTTAATGGGAGAG")) +(assert (= z "gcccgcggaaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0114.smt2 new file mode 100644 index 000000000..511ce3245 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0114.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTACGTTCTACCGAGAACTCCGGTACTGAGCAGGCTGAAGACGTCTTCCTCCGACTTATGCGGATACTTACTATCACCCGCTCACTCTGCCCTATTAGGCCCATTCGGTCCAAAGTAAGTGCTGGAGGATTCAAGTAACATCTGATTGCACTGTTTGATATTAGACTGGGCTGCCCTTATGTTTTGAAGAATTCCAACCT")) +(assert (= z "guaagccagguuuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0115.smt2 new file mode 100644 index 000000000..fe2c287fb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0115.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTAATCCTTTATCTGCACAGCTAAGTCTACCACGTTGATGAGCAATGACGCATTACCACACGCCAGCAGACTATCCAATCCTGTGTTAATCAGGGGTATTTACCTGGGGAGCAACTGTTTACCAGGTGGCGGTGAGAATCCTGTACTCCGACATATGCAGGGCCCGTGGCGGCAGATCCGTAGACTTTTAAGAACTTCAG")) +(assert (= z "gucgauucagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0116.smt2 new file mode 100644 index 000000000..d9b6cd016 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0116.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACGGCGGCACCGATCCTCCGAGGCCCAATACCTCCGCTCGATCTGGGATTCCATCACAGACAGAATTAAGGAGCAGGTCCCGTGGTGGCGGTGGTAAGATAGTGACCTGCAACACTGCAAACGATGGCTGTATGCTCCTATATAAGAACGTATTCGGGCAACATAACACTAGACAGCTGTATGGCCTCGCGAGTCCCGG")) +(assert (= z "cgcucagggcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0117.smt2 new file mode 100644 index 000000000..29a9dff26 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0117.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATATGGGCGGAAACCAGTTATCGGCCTTTAGAACGAACGCTGCTTTCGGCTTGCGACGTGTTACGTCGCGCCCGTCAGATGTTTTATAGCTGAAGTGCCGTTCCCAGCTTGGGACGGGCCACATCGTAAACCATGTCAGCTGTGTATCACCATCTAGAGAAGCTAACATAGAAAGCGTGACCACCTGCGGATCAAGTAC")) +(assert (= z "cgacgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0118.smt2 new file mode 100644 index 000000000..1b3417dc2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0118.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGATTAAAGCTGGATAAGGCCGTCCGTAGAGAGTATACCGTCCACACCGGAATAGTGTTTGAAATGGGCCTCCCGTGGTCTGTGAATGATTTGCTATATTTCTGACCAACTGACTTCAACGGCCCACGCATTCCCTTCCTGATGGGCGGCTTCCTATTGAATCCTCAGCGTGAGGAATTCCTGTTTCTATGCCTAGAC")) +(assert (= z "ggacuacccgccgaaggaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0119.smt2 new file mode 100644 index 000000000..8b16dee33 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0119.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGCTCGCCGCCCCCGGGAATCTTTTTCAGGAAACCTAGGATCAGACGGACGAGGATATATAAAAGCGAGACGACATTACTGCATGATTTTGTGACCGCGTTGTGGTTTATATGTACGTGTCGACCGATCGCTGAGTACGCTCGGAGTTCTTAGACGTAGACTCTGTTATCGGTTTGCAGCGTTTTATCCAAGTGTCGC")) +(assert (= z "gcaucugagacaauagcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0120.smt2 new file mode 100644 index 000000000..9e2c4b664 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0120.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGCTAGTAACCGGGGGACGTCAACCTCTGTACACTGACGTGGCTCAAAATAAGGTCGACTGCTCTGGGTCCCAGGTAGTAGGGCAAGTCTGAGTCATTCGGTTTATACAGGAGTCTGTAGACGGAGGATATATGATTCGGTTTCGCCAGCGGTGGGGAGAAACATCAGCGTCGTTCTGGAACCAAACGTGGTTTCCTCT")) +(assert (= z "augug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0121.smt2 new file mode 100644 index 000000000..fcb917e09 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0121.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCAACACCGACGGTGGGTATTAAGTTGGGCTTAATGGTGCTTAGTTGGAATCCACTAACATATACCTTATGAAGTCTCCCGTTCACGCCTGATCAATAAGCTTCACGCAAAAGGCGACGAAATCCTTCTCCAAACGGCTTGTCTGAATAAGACCGTTAACGTGGCGAGCGGGACAAACCAAACGCAAGATAACGATCCTG")) +(assert (= z "gcaccgcucgcccugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0122.smt2 new file mode 100644 index 000000000..fcf02b255 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0122.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACCAACCCAAGTGTAAAGTGTATGAAACGCTCTGGGCAGTCGGCTGCGTTTGAGCCGTTACTTATCGATCAACTTAATTATCGCCACTCCTTGGGGTTTTACCGGGTAGCGCACAAATGGGGGAAACGGTAGGAAGATTAGACAGTTGAGGGTTCTGTATATAGGGCGTCCTGTATAGGTCGAGACAAAGACAATTGAAG")) +(assert (= z "caucgcguguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0123.smt2 new file mode 100644 index 000000000..d51e08c87 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0123.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATAGCGTTGCTTCACTCACGTTATCCCGGTGGCTCCCTCAATTGCGTTTACGATGGGGTGACTGGAACGTTCAGAGAAGGGAAGAAAGACACCTAATGCAAGAGGCCTTTCCGCCTGGAGCCTCGGTGTAGATGGCCCAGATTCTAGCCGACTCAGGATGGCCCTTGCGCTCCCCGTCGCACGTGGATCAGGCAACGAC")) +(assert (= z "gcaacgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0124.smt2 new file mode 100644 index 000000000..06ef35bc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0124.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGACGGTTCAGGGATTCGGGAGTCTCATTTTAAACGCTGGCGTTATAGTCTGGTATATCCGACTATTCATAGTTTGCCTGATAAGTTCAAGGCATCTTGCGAGCTTACCGGAAGATAGATGCTACTCTTGGATCAGTAAAGGGGCGCATACTACGATATGTAGTAAAGGATGTAACGCGTCGTCTGATGATCTATCATA")) +(assert (= z "acgaugagaaccuagucauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0125.smt2 new file mode 100644 index 000000000..9584eea10 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0125.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGAACATGAATCAAAAGGTAATTAGTCGGCTCTTCGAGTCACCAATTATCTCCGTTGCCCATTGAGCAATAAATTAATACGCCGGGTTGTGGACTCTAAAGGCACCATCTGATACAGCGTAACGGAGCGCATTCGAACGTCAAATGGGAATGTGGGTACCGCTCGGCTGGTCCATGTATGTCTAGCCGATCCCAGTATA")) +(assert (= z "auagaggcaacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0126.smt2 new file mode 100644 index 000000000..bde7f6d4e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0126.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTAAAAGTGTTCCATGGAACGCGGGCATTGACGAGCGCCAGTCGCGAGCACTTATCCGAAACTTGAGTAAACCCTGGGATAACAGCCGTGCGAACTCTACCCTGATGCGTGCCCACTATGCCTCTTCAATTTATGCAGTTCCTAATTTACATTGGAAGTTGAGCTGCACGCGCCGAGGCCTTTTCGGAGCATATTGAAT")) +(assert (= z "ugcgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0127.smt2 new file mode 100644 index 000000000..c6d150bd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0127.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCTCGTTTGACAGCAGAGTAGAAAAATAGGAGGAAGCGCGGCCTCTGCACTCGATTTCTTTCCGGATGAGGAGCGCTTCGTCGAGCTGGTCTCGGCTACCGAGGTTGAGGGCAGTTTTGAGATAACAATCATGTCTCGCGGGTTAGCTTTCACATACTAATACGGATGCTTAGCAGTTTCCCGCATCGACGTTGTTAG")) +(assert (= z "ucgaaaguguaugauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0128.smt2 new file mode 100644 index 000000000..7c32e5e52 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0128.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTTCATTCATAGTGCTGGTGACTACGACTGTTGTGTGGGGGACTCTACAGGCTTAAAAAAAAGCGATGACATAAGATCATGAACCTCAGATAGCTGAGTCCACATATAGTGGTGTCACACAACTTGATTTCGAGCACGGCCCCACTTCTGACACCGCCGCACCACACATGTCTGCCATATACAACCACCAGCTTAAGAT")) +(assert (= z "cugagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0129.smt2 new file mode 100644 index 000000000..6aed995c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0129.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTATGTCATCCTGCTAGCCGATTTACAACTAGGGCTTCGCGGTTGGGTGCCATAAGCATAAAATATTAGTGAACTGAAAGTCCATCAGTCATTAGTTCTTTATACCGACAGTCGCCTGTCGCACGGACGAGTACGACCGTAACAGATCCCACAACATTTACTTATGTAGTACGACTTCTGCGTGCCAGGGGACAACGTA")) +(assert (= z "ggcauugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0130.smt2 new file mode 100644 index 000000000..bcfabcfcc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0130.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGCGTGTTTGCGACATTGTCCGACTTAGCATCGGCTTAAACTTGGCCGGTTGATGTCGTAACCGCCCCCCCATCAACAGAGCCTTACGGAGCTTCGTAAGACATCCTGGCACACCCATGAACGACATGCGGGTCAAACAAAAAAAGGGCTTAAACAGCTCAGCGTTTCCGCCACGTTTTCGTGTTCACTACGACGTTT")) +(assert (= z "acagcauuggcgggggggua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0131.smt2 new file mode 100644 index 000000000..bf41d4228 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0131.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAACCTCTAGCACGGCGACTAGGGCTCCAGGGGGACATTGATCTCGATACGTAAGCGCCCGTTCGCTCTGGCAGGCTTCCTCATAGATTCCACGATCTGCTTTGCTCTAATACCGGGGAAACTTTCTTTAATTGCACAACGCCATTTTGACGACTGGATCAATACGGGGATAATAGTACTAAAGTCCGAGGAAAGTTTT")) +(assert (= z "gaccguccgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0132.smt2 new file mode 100644 index 000000000..c51e0332f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0132.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCACTTCGCTTGAACCGGACAGCCGTCCGCTCCAATGATCTAGCAGTTGGAATCTCAAAGGCCAAAAGTTACTACCCACAGGTCGAAACTGTACAAACCTAGGTTTCCGCAATAACAGTCTAAGGTGAGGCATTCGGTGGCAATCACGCGATCTTGCAAATAATAGACCGATGCAAAAATCTGTGTACGACCTGTGGC")) +(assert (= z "agaucgucaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0133.smt2 new file mode 100644 index 000000000..d61e460ff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0133.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCGACTAACCGCGTAATAACAAAAGTTATATACGAGGACTTGCACACAACGGCTCCTAGAGGAAACTAATTTGCTTAGGAGGCTATGAAAGGACCCAGAAAGTCCAGAAAGTGCTTCCCATTCTAGCCGGATTACAACCTGGACCGGCTTTCAACGGCGGATGCTAAACACTGAGCACATCTTTCAACCTAGTGGGTGG")) +(assert (= z "uaugcuccugaacgugug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0134.smt2 new file mode 100644 index 000000000..7bb5e190c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0134.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCTCGTGCTCTCTCCCCCTAACCACGATCCGAACCCCTGGAGGGCGCTTCCTATGAACGTAGGAAGCGGGCTTTGCACAGGTTCGGTTGTGAGTAGGTGGGACCCCAGCCCGACACGAGTCCAATACGCCGTACCAGTATGTCGTGCTATACGTCGGCAAGCTTGAGAAGCTGCTCGTACAGGGTCCGCCGCATAGTA")) +(assert (= z "gggggauuggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0135.smt2 new file mode 100644 index 000000000..93445cee3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0135.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAGTGGCGTGGCCCTATTCCTCACTAACATAGGTACTTGGCGGTGGCCGTCGGCTAATGGAAGCAGGAGCTCGAACGAAAGGTATTGACATCTGATGTAGACACGTAAGACCGGCCTACCCTCTCTAAACAATGGTCTGAGTGACCATCGGAACGTTATTGCTGCCAACTGTTCATCAGAAGCGAGAAGATGTCCATGG")) +(assert (= z "ggaugggagagauuuguua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0136.smt2 new file mode 100644 index 000000000..c70551834 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0136.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGCCAATGGATTGATGGAAGAAGCTTCTGTGAATGTGGTACCTCACTGTCTACGAGAATCTCTAAAATTTAATTTCCAGGGGAGTACTGGAGTTTATTGACTGGAGCAAAACATGCCTTGCTACGCTCGACTTGGGACCATTTATTTACCTAGTGTATGCTCCGGCAGGTACTCTCTGATTAGCTCCTAACGCATGGTT")) +(assert (= z "uggua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0137.smt2 new file mode 100644 index 000000000..df7fae211 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0137.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCGCATATATATCCGCATCCGCTATACCTGAATTTAGGTTCCGCGTCGGTGCGTACTTCTATACGTGTCTAAGCACTGCCCGCCGCTGGCTAATGGGAAGGCCCTTTCTGCCGTCGTATTAGGCGGTTGCCCGAGCTCTGACTGAGGATGCGTTCGCATAGCCGTGGCATCTGATTTCAAGCTAATCGCTTCATAACCC")) +(assert (= z "gacuuaaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0138.smt2 new file mode 100644 index 000000000..fbf4890f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0138.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACTTAGGGGAGACAATCACGCTGACCTAATAACCGGTGGGGAATGTAACGCGTGTTACGGCCTGTAGTCAATCCAGGAACGCGAATACTTGTAGGTGTAAGCTAGATAGACGGCGCCTGGAATTTAAAGGTGCAGTAAACAGCTCAGAGCGTCTTCTGCTACCGGTTTCGCATGGTCACTATGACTCGTGTGTGAGCCC")) +(assert (= z "ugaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0139.smt2 new file mode 100644 index 000000000..17d634fa7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0139.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGACCAACGAGCCGCGATCTTTTCACTTTAGGCCGCCCAAAGTTCAGGAGTCGCACGCAGGACAGTACCTGTTCGTAGCACGCAAAGGATTTACTTGTAACGTGCTGGATCAAGTGGTGGTACCGCTATTCAGTACACTCGGTTTAGCGGAGTGCGGACAAAGTTGGCCCCAGTGCCAGGGACTCTAGGCGATTAACG")) +(assert (= z "augugagccaaaucgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0140.smt2 new file mode 100644 index 000000000..84a028157 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0140.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCGTTCTCCGACGAACTCTGAGAAGACCGAGAGGGTACTCTGCGGACCGGCGTTGTTTTGATGGACACAGGCCAAATTCGTAGGACGATCTACGGCGACCCAGGAGGTAATCAAAAACGACAAGGTTAGCCAACGCTCTACTCCAACACGCCTTTGCTCTAAGCGGCATTCCAGGATATTGTGCTTCTTTGTCTGAGG")) +(assert (= z "ggcucucccaugagacgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0141.smt2 new file mode 100644 index 000000000..48dc1ca4e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0141.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAACGTCGTACGCGATGCTACATGTTCGGTGACTAAACTATCAGGGATTAATATGTAAAATTTGGGACATCAATAGGATGTTCCAAACGTTGTAGATAATACCTGTGCGGGCCGCTACATCTTGAACCGCTGATGTTGGCATGCGCAGTTTCACTTCATACAGTCTACGGGGTCTACTTACATGGCTCGCTTGGCGTGT")) +(assert (= z "cgcaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0142.smt2 new file mode 100644 index 000000000..3d2b5fc0d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0142.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTAACAAGTCTCGACTTGCACCCTTGTAAAGGTACATAACATTACGAAGATGCAAACGACGCCACAGAATCTAGTAGGTCAACGAGAGGAGAGCGCAAGACGGCGTAAACAGAGGATGGGCCAGTTGCTCGGTTACAAATAACAGTTAATCGACCTTGGTATTACTGGCAACGTCCCGTGGCGAATACATCGCTCTCC")) +(assert (= z "uguaaugcuucuacgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0143.smt2 new file mode 100644 index 000000000..9575e0d80 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0143.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCGCAGCGGACCAGGCTGAGATATCTTATTTATCTACGGTCACAATACTTTGAAATAGGAAGACTACTCCCATTTTGATGATATTATTCCGCGCCCTTTCACCGACTATCTACGTCTGGCTCACCGGTTGACATCACACTAGTTCTTATCAGGCCTCCGTAATTGCCCTAGCCGTTCTGACACTGGTGTGTCACCGGC")) +(assert (= z "aggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0144.smt2 new file mode 100644 index 000000000..937e9696c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0144.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATTGGCCTTGGGCCAACGCACCTCCACTTCACAAGCTACCATGTATACTCACGAATCGAATTGTATCGCCCGGTCGAACCAACAATCCTGTGTCCGGGTTCCGTTTCACAGACCTCCCTGCCTCTTTCTGTAGTTAGTCACAGTCTGCGACTCGTGTTGGTCCCGATCCTCTATAACTAATGAGGCACAACACTCGACA")) +(assert (= z "gacaucaaucag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0145.smt2 new file mode 100644 index 000000000..2774ca6bd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0145.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTGCAAATTGTGTAGTATGGGTATCGGATGGCCCTATGTAGGATTTCTTTTCCGTGAGTCTTTAAACGCTCCACAAATTGCCCTGGACTCCGGCAGTACCGTCCCCGACTACGCACCCGACTAGCGCGTGTCGGACCTAGTGTGGAGCGGACTGAGATATCGTAAACTCAGTGCGGAACGGCTACGCTAAGACGGGTC")) +(assert (= z "acguuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0146.smt2 new file mode 100644 index 000000000..b5679812d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0146.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACCGAATTTTCCCATTGTCCACCTGTGTTAGCTCGGTCCAATTTGAAAAAAAGAGTTTCCAAACCTTGCGCCGCGTTCGAAACGCGCTTTGGTGTCTTCCTTGGATCGGCTCGTTACCTATATCATGTTCTTCTTGCCTGGCAAGTGCGGTATTACTTACGGATTGTTCAGGACGGTCTTTTCGCGAGAGAGCAGTCAG")) +(assert (= z "ugaaugccuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0147.smt2 new file mode 100644 index 000000000..6144b4c90 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0147.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGATTATCCTACTGCGCAGTTACGTTGTCAAGCGGGTGTATCTGAACGGATTCTCACCTCTACCATGGACGGGCATACGTCCTGTCCCTGTAGTGTGTGACAATAAGTGAATGAATATGCTTGGATCTACGGGAGTTCGACTATTAGCACAGGCGACGCGTTGTTGACACCGGGATAAATAGTCCTTTTGCGATTTCCA")) +(assert (= z "uaaaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0148.smt2 new file mode 100644 index 000000000..933a19651 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0148.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCACGGTATGAGGGCCGTATGATAGTGTTGCCGCTTAGTTCTGAGTCCACCGAGCGTAGCTGGCATTGCTTGGTGAACAACATTGAGTAGCAAGGGATAGACGCACTCGGCCATGGAAAACACGTACGTCATGGCAATATTACGTTCCTCACCAACTATTCTTTCTGTGGAGTGAGAGGTCGCTTTGGTTGACGTACATA")) +(assert (= z "gaacca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0149.smt2 new file mode 100644 index 000000000..3d83b2321 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0149.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTCAACTGGTCGACGAGTGTCAACCGGGGGCGCCTTGCTCGTGGACGCCCGTCGGTCCCATTGTTCACACGTTGGCATAGACGCCGACCGTTCTAAATAAAATATAGCCTAAATTACAGAATCGTTACGCGGTAAACCCCGGTCTGCCCAACGACGTCTAGAAGACCGGACACCAGATATTCCCGATCTGAGTACTAA")) +(assert (= z "uuagcaaugcgccau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0150.smt2 new file mode 100644 index 000000000..391978cff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0150.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGAGCGTTACTGGGAGGGTACTAGTTTTATATTCAAGACAACGACCATATCGCCGGTATACACCTTTATGGGGGAGCTTAGTTTGCTCAATCATGAACGCGTTTGCATCTGGATTATTCAAGACAAGGGGGATGGCCCGAAACACTGCATCTTAAACGAATATCCATTCGTATATGGTCCCTGGAGGATTTATTGCGCG")) +(assert (= z "uaccagggaccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0151.smt2 new file mode 100644 index 000000000..2836640fb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0151.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACGAAGGCAGAAACGCTCCCGTATGACGAATTGGACGTTGGTTAGGGTTCCCTTTCATGACCAGTTTGACGGACTACTGGTCACGATACTTTGGGTTAGATTTGCGTCTGAACTGTGAAAAGCTAGAAATGTTAGACGGCCGTATTAATGGCGAGACAAAGCTGATCACCTCTGACCGTATACAGGACCCCGATAAGCT")) +(assert (= z "ugcaacca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0152.smt2 new file mode 100644 index 000000000..3669a3527 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0152.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCACTGACGGGGCCGGTGGTTCTACTGGCTGCCAAAGGGTTCCGTCTGCGGAAGAGGCCTGCCAGACCAGGCAAGCGCCTCCTACGCGGTGGCGGTAAAGCCGATCGCGTCTTCGGGTCATTTCGACGAGCAGAACAAGTATTTTAAGGAGAAAGACCTCAGAGCGTTGTCACGGGCTGATGCGGCCACAGCATCGCCC")) +(assert (= z "acuacgccggugucguagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0153.smt2 new file mode 100644 index 000000000..9527349f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0153.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCTGGTCTCTGTGGCGGAACAGTTTCGCTCACCTATCGGATAACTTTGCTAAAGACCAACCCCTTCCCTGCAAGGGTAAACGGGCGTATGCTCCTTACAAACAGTCGTATAGGGTCGGGGAGCAACTAATCAAGAACAGCAATGCCTTAGAATCCATTACATACGAGGTAAGTTGACGTACGGTTTCTCAAAGACTTCG")) +(assert (= z "gaggaauguuug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0154.smt2 new file mode 100644 index 000000000..b8585d080 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0154.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGTCCTCTAACGCGCTGCTAAAGACGTAGATACTACTTTCTTTGGGTGAACCTCGGAACTACAGTACCTACCCAGTTAGTTTTGTGATTTCTTGTGTTCTTGTCTTGAGCATTTAGCCGCCCTTTAGGTTAAGAGGCTCTCCAAATGGCTGATAAAATGACGCGACCTGCGGCTGCTCTCGTAAATTAAGGAGAAACA")) +(assert (= z "acuauuuuacugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0155.smt2 new file mode 100644 index 000000000..35ac22c7c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0155.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGTACGCCAAGCTGGCTGCACGACCACTAAATTTTCCGTGGCTGGTATGTTGTTGCTCCCTTCGCATGCGTTATAAGCCCCTTCAATTCCGTGGAGCACGTGCTGATGCTCGTTACCGAGACATCTAAAGACTTTCGGCTACTTTGTAGCTCACAACTTAACTTTAGAGCCTACTAGGCGCGAATTGGCAGTGGGATC")) +(assert (= z "gcuuaaccgucacccua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0156.smt2 new file mode 100644 index 000000000..bea9588b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0156.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGAACAGTAATGGGCCTCGAGCACCTCAGCACTACGGCGCACATCAGTATCCTGTCACTCTTCAAAGAGCAGGGGGCCAAGCTGCTGGCGGCGTTCGGGGAATTACGGGATTCGCCGGAGATCCCACTAAGCATGCCAGTCGTTGCCCAGTGTCTCCGGTGAGACCGGTGCCCTCATACTGCTGGTCGTCTAGATGGT")) +(assert (= z "cgugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0157.smt2 new file mode 100644 index 000000000..8d1a4f71c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0157.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGTTTACTTTGTTGCACACACACCCATAACTGAGGAGCTCTGGTCGCTTACCCTCGTCCTCGGAACGCTATGCGTTCCGTTGGGCTTGACTAGGAAACCGACCCTTCGCTCCGTACATCATGGTCGTAATTCGCGCCGTACACTCAGGCCAAGCACGGTCTTCTGGAGAACTGAAATCTCCTTTCCAATCGACTCGTAT")) +(assert (= z "ugggagcaggagccuug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0158.smt2 new file mode 100644 index 000000000..db3f99025 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0158.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGTGATTCTCTAACTAAACCGCCGGGCCCAAGTGTTGAGCGAGGATCCTACGGTTTAACCTACTAGTATCCTGCAATGGTCTCTCGACTACTTCAACACATATGGATATATATAGCTGGTCCCTCAGTTCTGCGACCCCAGATCACCCACGGTGCGAACCTTATCTAAGCCGGACCATCATCTAAGTGTTTACTATCTA")) +(assert (= z "uagauucacaaaugauaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0159.smt2 new file mode 100644 index 000000000..b748a3440 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0159.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTCCCGGCAGTCTTCGTAGAGCGTCCTCAATAGGGTGAAATTGATGTCTACATCAGTAATGCAGTCTGTTAAGGTGAACTCGATCCCTCACCACGAGACGAAGGACTGGCGATAGCTAGAACGGGGCCCGTTAATCCGATCGCTTCTAGGGCAGAGCAATACTTCGCTATCAAGGGCGTCGTTACGGCAGAATGTTAGA")) +(assert (= z "cucugcuuccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0160.smt2 new file mode 100644 index 000000000..0e4379029 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0160.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTGCCGCCAACCTATGACCTAATAACTATCGCAGTTTAAGAGGGGCGGGGTTCTCATCCCGGGCGATAATTGCGACTATCGTAGCCCTTTAGTCAAGTTCGATTGAAAGGCGATATGCCTCAGTGCCCCGTCGCCGACCCGCGCTGTAATTGAGCCCAAGGCTCGGACTGTGTAAGGTCGGTACCGATAATATGGCTCT")) +(assert (= z "cuccccgcccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0161.smt2 new file mode 100644 index 000000000..262f9529c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0161.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACGTTCACTGATGAGCTCATGGTACGTTCAGATAAGTAGCGCAGCACGCCCAAAAATTCTTTTCCACTTATAAGATTGCATACGATTCGAGCTAGATTTGGAATGTTAACTAATATCCAATGCATGCAGCAAGTATCTGTTCTAACGTAATAGGTAAGATAGAACGCTTGTACTTGGATGGTTTCGGCTCCTTCTACTT")) +(assert (= z "ugcaaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0162.smt2 new file mode 100644 index 000000000..653450358 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0162.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCGCAGTGAGTAAAGGGCAACTAAGTCATACGGCCAAGTAAAGTATCTTGGATCTCGCATATGTGATATTTTCCAGCAGACACAGGCGTATATAACGAGTCCGTCGGGGCCTTCGCACCCCTATATATCGAGCTGCGCAAACGGCCTAAGACTCGAGAGGCGCGGCCGAGTCATACAACTATCTACGACATGCACCTAT")) +(assert (= z "cccggaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0163.smt2 new file mode 100644 index 000000000..1947f4c2e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0163.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTTCGATAATCCGGTTGAATGACATGACTGTATGTGCGGTTCTGAACTGTGTACGACGTCTCAGCTTGCGTTTTAAAAATGACTCAAGGTCGCGTAGAGGTAGGTCAAACTCGTCGGAGGCTGCTTCTGCGCGTTATTCCGAATCGTCGGAATTCATCCACTTTAGGAACTTTTTGGATATATCGACTGTCTTGCGAA")) +(assert (= z "auuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0164.smt2 new file mode 100644 index 000000000..3e5003ffc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0164.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGTCCAATGCTCTGTGGGGCGTCCGACTGACCTGCTGAGTGAGTATCGGCCGGCTTTCTCGCGGGCTATGCCCTCAGTACTGCCGCGTTCATCCATAGTGCTAGACAGTCCGTGGGCCGCGCTCTAGAACCTCGGCAGTTTCAAACTCCACGCCCTTCTAGGATAACAACCTTTGTCCTAATTTGAGCCAAGACGTGA")) +(assert (= z "cccgauacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0165.smt2 new file mode 100644 index 000000000..236d75f3d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0165.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGCGGGTATGGATATTGTTATATAGTCACTTGACGTGGGATGTTCAGGTAACGCGAGTCAGGTCTCAGTAATCCTGCGCCAGCAATTGAGAGATCTTCCCATCGTCGCGCTCGCCATCCCCAATGGGGGCGCTGGCTACACGAGATTTTGCATTCAAACGACGAGGTTCGCAAAATTGCCCCGGTGCTTTAGAGGGGT")) +(assert (= z "gguagcagcgcgagcgguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0166.smt2 new file mode 100644 index 000000000..8211af177 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0166.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGATTTAACGCCCACATGATGAGGGTGCGCTAGCCTCGTGCTTCGTCACCGCAAATATTTCTGGGACAAAAACTGCACGAGAAGCTCCTTCCGTTCCTATGAGGATGTGTTGCTTCCCCTTTCAGAAATTCACACTATGTTAAAATGAATCCCTGTCACCGTTATTTGCCTGTCGCCACTGTTACGGTCATTCTTCCG")) +(assert (= z "uacuccuacacaacgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0167.smt2 new file mode 100644 index 000000000..cd01e7cb9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0167.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAGCGATCGCTTCGGAGACAGTAGTAGCATTGGGTGGAGTGTAGGTCCGTGGGCGGTTGATAGAGGGAGGGTAAGGTCACCTAGCTTGCCCTGAATTTGTTGGATTTAACGCGTTGTCCTTATCCTGTGGCAACTCCCGATCTCGTTCTACGTCCGAAATATGGAGATATGGCTAAGGCAGTGTCGCGAACATCCTAAA")) +(assert (= z "uugcgcaacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0168.smt2 new file mode 100644 index 000000000..86150ef19 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0168.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCCCGTCAGGCACAAAACTTATAATCCGCGCGCCTGGAGTATCCACGCAGGTCTTTACGAACTCCATCCCTACAATTCGAGGATACTTGGTCAATCGATCCATATAATGGGATTCCAGTTGATTGGATCTCCATCCATTGACCTTTGTTCCAGTCTTTTTCAATCACTGAGTTTACCATAGCAGCACTACTCAATGCTG")) +(assert (= z "ugaacca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0169.smt2 new file mode 100644 index 000000000..7a4e4aa75 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0169.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTGTGATAACGGATGAGGCGCTGTTCTGGACCTGCCCATTAGAACTACGTTTGGCCGGTAAAATAAAAAATCGAGGCTCCTCACACCCTTCACGTGGATTCCTGATAGTCTGCCGATTTTATTAGAGGCTGATTGATACTATAAACTGTGTCACGCTTATTACCTGATAAAAGGTGTGGGCGCGGATATAACACCCTT")) +(assert (= z "gacacagugcgaauaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0170.smt2 new file mode 100644 index 000000000..a76e515b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0170.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGAGGTACGAAACCTGTCACGGTAAGACACTTAGCTCAAGTACGACGTAGCGTAATGTTCCGGATCGATTTCATGTCAGGACGCGCTTAATTGGTGAAGCTCGCCTTACTTTACGTCGCTCCGTGTATGCGGTCGCGGTACGGGAAACGCTCTCGAGGCGGTAGTTCGTTTAAGTCAGGAGCGGTGTAGGCCAAACCAG")) +(assert (= z "uaaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0171.smt2 new file mode 100644 index 000000000..341fe9f91 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0171.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGACATCTATAATACTACAGGAACATTACCGAACGTTCACTGACCAAAGGCCAACGGGATAATTGGGATCGCATGCTGGGGCCCATGATCAAGCCCGACGCATGGTCCTTATAGTTGGGAATGTGTCTTGCCGGACAAGGGGCCTATAAGTAGCTCAATTGAGCGCCATAACTGGAGGGATTATTTGTGCTGGCCCGGA")) +(assert (= z "acggccuguuccccggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0172.smt2 new file mode 100644 index 000000000..d76163377 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0172.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGTTATGACCCTATGTGTCGCCGATATTTGGCGCCGTAAAAAATAGGATACAGAACTCAGCTAGGAGAAGAAAGGGCTTGCCAGCGATCCACATCTGTAACTTGGGGGCGCAGGACGACAGGCCATAATCTTTTCGTGGGAACGGTAATCACTCCGTATGGTATCTGTTAGGTGATCGCTTTAATGACGGAGCTATGCG")) +(assert (= z "ugucuugagucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0173.smt2 new file mode 100644 index 000000000..214f07784 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0173.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGTGGTCGATATGTGTCATGATCCACCCTCCGCTCGTTTTCGTCCTGGCTTCGTAAGGGTTCTAATTCCAAGATCTTTAGAATTAACAGGATTCAAATCGGGGGAACCCTCAAGGATCTGGAAATGCTACTGCACTACCGGTATCCTCACTACGGGGGATACTCAACATGCAGTATACACACGTCACCGTATGCCTCTG")) +(assert (= z "aagcagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0174.smt2 new file mode 100644 index 000000000..dca0f2d71 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0174.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGCCACAGGTTCTGCTGAAGACAAGAGGCTGGTCTGACTAAGTGGATAAATCGTAAGAAAGCCACGCCAAATGCACTGTCAGACCGTTATAGCCATTGATGCCGCGGAACGCCGGAAGAAAGCCCAGCATTAAAGTCGTACTTCCTGGACAGGCGATCGATCGTTCTGTTCCTAGCCCCGTAATCTATAAGTCCGTTT")) +(assert (= z "uaauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0175.smt2 new file mode 100644 index 000000000..d1339082f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0175.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCACGGATTTACGTCCAGGCACAGTGCGGCTCTTTGTAACCACTTATACAACCTCCCTTTGTGCCGCTCCGACCCGTTCTTGCAAGATATCCTGGAAGCATTTGACTTCCGATAAGATGTTCGTATAACTTCAGCATGGCACATTCAGACCACCGTCTTGGATGTGCCGCGACGAGAGGTATCACCTATTCCACGTCACT")) +(assert (= z "uuggagggaaacacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0176.smt2 new file mode 100644 index 000000000..a27e4d184 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0176.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCGGGTGACGCAGCTTCAAGCTGACCGCGGCTAATATAATGTCGGAGATCGGATTATGTTCACTATGGCTTCTGCCCTTGATTCATAACCTGTTTAGGTTGTAAACCGCAGGGGTATGATCTTAGAGTTACGGCCGCGCACATGCACAGCCCTCAGGCCCACAGTCTCTGTTACTCGAGACCTGTCACTCATGAGAAC")) +(assert (= z "uuuggcguccccau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0177.smt2 new file mode 100644 index 000000000..a8ab13b3d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0177.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGTCAAAGATTGTCAAGGAACCTCACTGAACTCGCAACTAACTCCGCGTTATGCTCATCCGAGACTACAGCAGAAATCAATCAACTCGAAATACAGGTAGCCCCCTTCAGACAGCTTTTCCCTGTGATGAGAGGTACCACATGAGACGCAGGGTATATGTGTATACAGTTGAGCCGTGTTCCTGAGTATATGCGGTGCA")) +(assert (= z "ggagugacuugagcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0178.smt2 new file mode 100644 index 000000000..1730f4854 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0178.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAGCAGTACCACGCCGGCGAGCCAGTACAAGGTAAGCCTTCCTCGATAGTCTGCGAATAAAAGATCGCCCAACAGAGTCTACGGTCTGTATTCCGGTGTCTATAAACATGGTCTTGATAGTGACGCAGGTCATCGCGAAGCCCAAAGTACATCTGGAGGCTCGAGCATGCTTGACCTAGACTAGCATTGTTGGCGCTGT")) +(assert (= z "guaacaaccgcgaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0179.smt2 new file mode 100644 index 000000000..a5d0b1e1a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0179.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACTACAACCCCCGAGTCATCGAATGTACCATAGGGGCAGGCTTTCTTATCACTTGCCGGTAGGGAAAGGCCGCTTAGCAGCCGCTGTTAGGGCATACTTGTCGTACGTTCCGCGGCACTTGTTCACGATAGACACTTCGTGAGGTCTTTCATTCGGGCTATGACGCAACACATCGACGTCGCGGAGGGCGGATGTCCAG")) +(assert (= z "gaaaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0180.smt2 new file mode 100644 index 000000000..485ed6f69 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0180.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGACTGTCAGAGACTGCATCTACTTGACTTCGCCCTATAGAACAAAAGTTGTGCCGATACCACGCGTAGACCGTCGTGATTGACGAGACCTTCAGACCGATCTGTAGTGTCCAATCCTGCTGCTAGTGAACGCGGTATAATGCCCCCAAGTGGCTTCGGATGCAGATGAAACGCTCAGGCGTACGGATGTAAGCTCCGCC")) +(assert (= z "ggaagucuggcuagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0181.smt2 new file mode 100644 index 000000000..29abd7f37 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0181.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTGTAAGCAACCTATGAGACTGTATGTCGCTCTCTTCACGTATGTACGGATGATTAGTACAAGTAGTTTACTGTCTAACTCTCCTATAGCCTAACTACTGTGGTCATGCGGTGCACATTTTGGGTAGCAATGACCTGGGCCGGAAGCGCCCACCCGGTCCCTAGCGTGTACAATTAGAGGCGGACATTGCGGTCGTCCG")) +(assert (= z "ugaugacaccaguacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0182.smt2 new file mode 100644 index 000000000..2f55f7d01 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0182.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTATAACTCTGCTCAGTGCCTCATTGGGCGCTTCACAGGAGCCTCTAAGTGGGTGCTTCTATCAGAAAATCAAACAACGTAAGGACGCCGGATGATTTGGGATGCGCCCTCGCCCGGGGAGGCGTTGACTAAAGCACCCCCCGAATTCTAACTGGGTCAATCCCCGCGTTAAAGGACCTATAGCTCCGATAGATGGCC")) +(assert (= z "uuuguugcauuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0183.smt2 new file mode 100644 index 000000000..a0fd7a534 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0183.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACGTCACGCGACAAAAGAAGCGTCAGCACTCCGTGAGACTAGATAGGTGGAACGCTAGGGATTTAATTCGAGGTAGACGTGAGAAAGAATACCTTCGGGCGATTCTGTTCGGGCAAGAAACTGCTGTAAGCAGTGAACACTGCATCCCTTGGTCTGGGTATATCTGAACTTTTCCTGCCCTGTTAACCCGACGAATAGC")) +(assert (= z "acaauugggcugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0184.smt2 new file mode 100644 index 000000000..46128dc08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0184.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTATATCAGCCTGGCAACAACAGGGTGTTCGGGGGGCAGTCTACTGTATTATGTGGTTGCGCAGGCGAGTATCAACACGGAGAGCGTCCCTAGGTTTTGGAACACATCACGTTTAGCAGGTAGAGATATAGGTATATGCTTTGCAGATCTCGAATAGAAGCCATCGCGCTCGATAACCTATCCGACATCATAGGGGGAC")) +(assert (= z "gcuuaucuucggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0185.smt2 new file mode 100644 index 000000000..101fc8403 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0185.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCTAAAAAGACTCCGAAGAGTTTTACGCTAGTCTATATATTGTTGCACCCCCGCTCCGGGCTACGGAGTCTATTCAACCATCAGGAGACCACGTTACAGTCGACCTACGCTTGTGCAGTAATATGCCACAGAGGGACGGTTCCGATAGACATAAAAACAGGGAAGTTTTAACGAGAATATCCGGCGTAGTCTGCGGGAC")) +(assert (= z "uguau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0186.smt2 new file mode 100644 index 000000000..e576792a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0186.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCGATAACGTCAGGTCGAGTGCCGTACAGTTTTCTAGGCCCGTCTTGATTAGAATTCAGTGGGGAGTATCAGACTATCGAGCGTTAGGGGCACGGTTATCTGCTCTCAGTCTCTCCTTTCGATGGACTACTTCTATACAAGAACAGAGCACAACCATATCTTGTTGACAACCTCCGCGTGCCAATAGCAACCTCTTTAG")) +(assert (= z "uugguauagaacaacuguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0187.smt2 new file mode 100644 index 000000000..8053c761f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0187.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTGCGCACAAATGTCGTTGTGGTTGTACTAAAGGTTAGAGAGCGTGAATCGGGGTCTTCTCCTAGTATGTTACCACAGTGACATTCCAAAGTACCGCCGCAGGTTTCGAACCATGTGATTGTAGGCTGGGGTCGGCGTCTCTCCCGCCATCATGCAAAAAGCTTTGGCCGACATCGTATATCGTCCGCAGCAAGCTATG")) +(assert (= z "cacgcguguuuaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0188.smt2 new file mode 100644 index 000000000..77ea649a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0188.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGTTATAGTGCTTTATAAACCCCGCGAAAGGGTCAGAACTAAGGCGCCAGGTTATTGAATTAGTTTCAGCCGTTTTAGGGTACCCCAAGTGGTGCGACGAGTACGAATCCTAGTGTGCATTAAGCTGGGACGGGTTCCTTGCATCGAAGAACCGGACGCTCGCAAAGGAGGAGAAGCGAGGTCGGTAAGCTTCAACGTA")) +(assert (= z "uccucuucgcuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0189.smt2 new file mode 100644 index 000000000..36887d511 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0189.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGTGGATATGGAAGAAAGCGCATCGTGACGGACACCCGGGCTAACGCAGCAAGATACTAGTTCCCCTGGAAATACAGATCCCTCGTTAACCTTCAATGTCGTTCATCTAAGAGGAAACCCTTGAAGAGGAGCTAGTACATCCTCTGCGCGGGATTTTTCGGGGTAGGCTGTACCATGGAGAACACAAGCCTTAACACTA")) +(assert (= z "ggaaguuacagcaaguagau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0190.smt2 new file mode 100644 index 000000000..f1613fee9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0190.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTAATTTATTTGTTATCCGATCCTTGTGTCGTGTTCAGACGCGGACGAGGATGATATTTAGTCGACAATGGGCCATTATGTTGTATTAAAGGGGCCCTGAGCCACTGGTATTCAGATCTTCTTCTCCGGTCCCAATCTAAGGACCCGCGTACGATTACGCGTGCCGAGTGGTTGCGACTCGTCTGGCCTATAGTATCGT")) +(assert (= z "aaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0191.smt2 new file mode 100644 index 000000000..53711c0a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0191.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAACGTGCCTGCAAATTACTCAATAGCCACGGCTATGACTGGGCGTGGGAAGAAAGCTTGGTAGTAAACCGGGTGCGAACGAATTTAAGCTTCGGAAAATCAACCGCGATCGTCCAGTAAGGGGTCACTGGCACTACCACTCCTCACCTTATCGACCAAAAAATCACAAGTATGCATGTCGGCAACTACCGCAGAAAACC")) +(assert (= z "cuuucgaaccaucau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0192.smt2 new file mode 100644 index 000000000..815a89629 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0192.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCCTAAAACGCATAGGTATGGGTAACCATGCACAGGATGTGGTTGTAATCTGCGCCTTTGCCGTTCACACTGGCTACCGCTTCCAACCCGAGTTATCGTCGCCCGACCGCGACCCTCCCAGCAGCGGTTGCAGCTTGCGGGCCATTTTAATTCGGCTTTGATGAGTCCGATTTGTCTCACATAACCAAGCCGGCGCGT")) +(assert (= z "cgcugggagggucgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0193.smt2 new file mode 100644 index 000000000..d802403c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0193.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACAGAGACTCGTCAGTTTGCAGGCAGCTCCGAGTTGAGTGGACCAGACCGACAAAATTAGTGATGTACTTTAAAGTTAATGAGGAGGTCGCCAGCTCAGAAAGTATTAGTTTCAAGGTCATTGCAGTGTGCGATGCATGAGATGAGTCCGGCTGGCACATCACACTGACACCCACCCTAGATTCGCTTGGGCAAATTGA")) +(assert (= z "guuccaguaacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0194.smt2 new file mode 100644 index 000000000..baed6407a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0194.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTGCACTCCTACATGTCACAGAGCCTTTATTACCTCATTCACTAAGTGTGTGGGGGTACACCAGCATCAACTAGCGTAGCATTAGCTAACCTACGGAACCTGACCTAAATATAGACCTCTCCTATGAACTTAGTTAATTTAAAACTGTAGCCGACCCGTTGTTCGCGGAAGTTCCATTGACAGCAAACTGATAATGAAC")) +(assert (= z "ucuggagaggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0195.smt2 new file mode 100644 index 000000000..764f859ed --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0195.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACTTTATCCTTTCGACGCGGCCTGAGCAGTACGACGGAAGCAACTTGGTCCAAAAGCTTGTACTTCTTCGACCGGCTGCCTCACTCCCCGCAGATGGGTGAGCTCGACTTCTTCAGAGCTCGGATGTGCTGGTCTCCCCCAGAAATACAATTCTCAACCAATAAAGTAAGGGTAAGGCGTTGGCCCAAGCCGCTACCTA")) +(assert (= z "agaggggguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0196.smt2 new file mode 100644 index 000000000..126b143d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0196.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCAGTCTGGAAGGTTCTCTCTCTGGCAAGTAACTTATACAATGAGAGGTCCATAGCAGGACAATTTAAATCAGCATGCCTTAAAAAAACGACGACTCTGAGCTGGCTCTTGAATCATCCTCAGTAGCAGAGCCCTTCTCAGGTAGCAAAATGCTTACCTGCATAAGTCTCACTTACTCTGAACAGTGTACAAAGGAAAC")) +(assert (= z "ggaagaguccaucguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0197.smt2 new file mode 100644 index 000000000..5065e968b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0197.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCCAATCTACCTTGTTCGACAGGGCTTACGGAACTCCCTCTTCTGTCCTGAACTGAGCGGAGGCTTCCTTCGCGATATCACCGTTCTGTCGCGTCTGTTCACGGTCTGACGTCGGCCGCACAAATTCATGGCTCTTCGTTTTTCCAGACACTGAAGCGGCGTCCGCAAGGTAAGGTGGTCTGGAGGTTGACAGTCTCTC")) +(assert (= z "uccaacugucagagag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0198.smt2 new file mode 100644 index 000000000..13db88e0f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0198.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACTCAACCAGTGTCACACTGATCAAAGCGTCGTTGGGAAGGTCAACACGGGCAAATAACCGTGGTTCACGCACGCCTGAGACCTGTCCTACGACCGTACCCGACTGCGTTGGTGAATCTATGGCGATGCAATGACAACAGAGGTTGAGCCATAATGTAAAATAAGGCTTTGAGGTCCCATAGTGGCGAATCACGCTAG")) +(assert (= z "ucuggacaggaugcuggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0199.smt2 new file mode 100644 index 000000000..7aa533611 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0199.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATGGTCTCCGATGGACACAGCCCATGCTTGCTATACACGGTGGAGGGTGTGTCACCCAGCTCCGGGAGTCGATTAGCAGATTCGTGGAACAGGCCACTCAATATTGAGCCCCTTAAATGCCTATCCCTGCAATACCGTAGTTCTCGACTCCGGAGCGACGAATCGAACGGCTGTGCTCCCGGTGGAATTCAAAGCTCAG")) +(assert (= z "ccgacacgaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0200.smt2 new file mode 100644 index 000000000..9ed76a8eb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0200.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAGGCTCGAATTGTAGACGGCTGAGCGACCTTACCTTTAAGGTTTTAGCTGGTGAAAATACTAGGGTCATACGTTGTTCTAGTGTCAGGGCGGGTATACAACCAATTCCATCCCTTAATGGCTGAGCGTACGGGGGAAGGTGCCCACGCAGTTCTCGTCATCGGACGATGAATGTGCAAGTAGGTGCATGTACACGCCC")) +(assert (= z "gcaugcccccuuccacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0201.smt2 new file mode 100644 index 000000000..017f8e0d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0201.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCCAAGGCCGAACCGGTGAGCGGGCTTACAGTAGTCACCTTAGTCAGGTCTTGTGTCCTCACCCTCAGCTGCAAAGTTCCCCTCCCGGACAGTTAATGGCCTATTTATTCCGGGGTATCAGACGTCTCTTTTTTAAGTTCTCTACGACTAAGCTTTAGAAAAAGTGACGAAAAACGTATGACTCATGGCCATTGAATAT")) +(assert (= z "gaugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0202.smt2 new file mode 100644 index 000000000..d2a9042ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0202.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTGTAAAACCCGGGCGCCACCCTACCTATGTCACATTTCGTGCGAATTAGTGCCATCCCGGCCTTTAGCCAGCCGAAGGTGAGCGCCAGGTGGTGGGCGTGTCACCAGGAGCAACTGTGCAAAGGCAATAGTATAATAACAGAGCTCGCCTTGTAAAAGCTACCCCTACCAAGTAGCGACACTTGCTGAGTGGGGACA")) +(assert (= z "acgcuuaaucacgguagggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0203.smt2 new file mode 100644 index 000000000..c6bf3534b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0203.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCGACAAAGGTTTGGGAGAAAACTGGGTCCCAAAACTTGGCCTAGTAGTTAAAATGTATTATAAAGCAAGTGTCGTGAAATAGCCACGTAACCAAGACCCGCCATACTGCTGGACGCGTTTATTACGTTGGTTTAGGAGTTGCTATGCTTGCCCGGAACCTTCGACAGTCTCTTCCTCGTAGAACGGGAGACTATTCTG")) +(assert (= z "acgac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0204.smt2 new file mode 100644 index 000000000..32000bfbc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0204.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTTCCCTCCACTGAGGGGAGTCCTGAACTGGACGGACACAGCGTTACGAAGTTGAGATCAATTCAAAAGCCGGAAAGCTCGCGCGCTGGAGCTCGAACCGATCTACAAGGAGTTACTGGAAGGCCCGGACACTACCAGTATCCGTGTTGAGGGCAGGTGGCATACAGTAGTGTTGTGATCCGGGGTAGGGCTACCCGAA")) +(assert (= z "cccgauggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0205.smt2 new file mode 100644 index 000000000..864391142 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0205.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTTGCGAACATCGGACTGGGACAAGGATCTGCCCCGCCCCACGGCCGTAACTGCCACCTTATAGTGGCGCAGATACTTGGCTAATCTGAGAGGTTCACGACCTCCTCTTTAGATTCAAACCTATGATACCAGGAACGATCTGCGATCACCTGTGCTGGACGGCGTCGGACCTCCCCCAGAAGTGGAGCTCTGGAGTAGA")) +(assert (= z "agaaaucuaaguuuggauac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0206.smt2 new file mode 100644 index 000000000..d4eb4ec00 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0206.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCATCGCCGAGCAACATCTTACGAGGTCACTTGTCCGGAACCCGTGAGGTATAGCCCGGTGCGGTTGTATCGATAATCACAACGCATTCACGCACGTGTCAGTCATCTACGGTTTCATCCCCTGGCAGGTAGCGCCCAAAGCCCGCGGTAGAAGTGGCGGTCCGCTTACTTTTTTCTAAACCGGCTGACCGATCGTAATC")) +(assert (= z "guagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0207.smt2 new file mode 100644 index 000000000..5c86c849e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0207.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCTGTCTCCGAAATGCGTGTGCATCTCCCCATCGTGTTAGTTCCTAAGACCCGGTGACAAGTAGACGCCATTGGAAACGAACGTGCTAGGACCAAGATAGTTACGTCATCTCACTACCATCCATACCCATGCAAATCAACCTGAACGAGAGTGCTTAATTCACACTTGTCGTGTTAGTCTTAGGCGACGCTGCTCTGGA")) +(assert (= z "ucaaggauucuggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0208.smt2 new file mode 100644 index 000000000..f99c2a1a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0208.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCAGTACCGGAAGTGTTGCAGGCTTCAAAGCTACACCGCCTATTTCAGCGCCTTAGGCAAAGGATGTGACTGCTAGGTAAGGGCAAGAGTAGAGTCATTACTGACGATCTCTCACGTATCGCGATATCTAGGCCCCGCGAGACCGTTGTCTTCTGTACCCATCTACTGATGGAAATTGATGTTCAGTGGCTATGGCGCT")) +(assert (= z "augacugcuagagagugca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0209.smt2 new file mode 100644 index 000000000..9471de3c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0209.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCGCCCATGAAGAAAGAAAGGCGCGCGTCCCTCGGTTGAACGTCAATCAGAACGGTAGATTGATTCCGAATCTGTTCCTATGAACTCCTTTATATGACGGTCGGCCATTGCCGCTGTCATGACGTGATTAATCTTATAATAGTAAATAGCGCTACTAATACCAGTATCGGCTCTTAAGTCTTTACAGAGCCGCACCAT")) +(assert (= z "uggucauagccgagaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0210.smt2 new file mode 100644 index 000000000..43b73b5cb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0210.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGTGTTCCTTCTGTCAATTACTTGCGCGAGTGAATCAATTCCGTAGTATGATCTACTTCAATTTGCAACAAGCTACACGTATTCAGTAGGGAATACCACACTACCGAGGACTGACGTAGTGTCAAACCTCACTGGATATCATACTTCTAACGCTAAATTGGCTACCCACCAAGGGCTCGCAAATATGGGTTGGGGGATC")) +(assert (= z "caucauacuagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0211.smt2 new file mode 100644 index 000000000..8e369709e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0211.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATATGCGACGATGGGTATGTAGCATGTGGTAACTTCGATATTAATCAGAGTGAAACCCATAAATGTAAATAATGATTACGCGCGATTAAGCGAAATTATAGAATGAGGCGCGCAATCGCGTGCAGGATGGTTAACCAACTCTGCTCTTAAATTGCTGATATCAATTCCTGTCAAGATTTTAATGACGGGTGAGGGTTCA")) +(assert (= z "gacuaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0212.smt2 new file mode 100644 index 000000000..73453604d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0212.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTCGCGGCCTGTTTAGCACTCGACGAACAAGCGTTGTCTCTACCCATGGCGTCCATGATGCAAAGGACCTATCGCCTAAGATACAGGGCGTAATGTCATCTTAGCATTGTTCACTATAACCGATTACTGTTTAGTAATCTCTGGCCAGACGCTACCACTCTGGGTGTTCTATTGGTAACTAGTGGCGCTTGATCTAAAC")) +(assert (= z "ggucugcgauggugag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0213.smt2 new file mode 100644 index 000000000..1510bc373 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0213.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTAGTCCGCCATGATACATTTCCTGAGCAGTTACTAACAGTTTGTAGCTGTTCTTGTCCAATGGAGGCCTCGACCCCGTGCGGGAAATGCCGAGCTCAGGCCTCGATGAGCGTAGCGTTACGGTTAGTTGTTCGAAGGTAGCCCAAAAGGCATGGAACACGTGCCTCTCGCTTAACTCAAGGTTAGCGAAGTACCGTA")) +(assert (= z "caacaagcuuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0214.smt2 new file mode 100644 index 000000000..2b9127a5e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0214.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGAAGAATGGTATAGCCTGTAGGGCATCCCGGCTCCAGTGTAGGATAGGGAGGAGTTCAGCTACTCAATGTCCGGCCGTGCGCAGGGCAGGGAGCACCGCTTTGCCCTTAGTTATGCCTTACGACAATTATGGGCTGATGACCCTCAATCCATCGCACCGAACTTCGAGCCTCACCTGTCCTTAGTGTGCTCGGGAAG")) +(assert (= z "cgggaaucaaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0215.smt2 new file mode 100644 index 000000000..56f8426bf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0215.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACTTAATTAGGCCCCTGCTATGGACCCACATCACTACGTATTCCGGCCCTCCCCAGCATATGTCTAAACATCCAAATACGCGCATTTGTGCGGCGTATACCTCAGGGACCATTCGAAACACAACCACAAGCTTACTCGCTCCAACCGTTAAGTATACCCTATTTTCTGAGAGGACTCACAGCAGATGACTGACACTAA")) +(assert (= z "ucgaauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0216.smt2 new file mode 100644 index 000000000..d41689dee --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0216.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGACTTGACCTGACTTACATTAACTGTCCGGTTACAATAGAAATAGGCACCAGAATACCGCGTGTCTGGCAATGCAATGGCCTTAACGAGTTACTCCTGTCGTCCAGTAGGAAAGGTAAGCTGGGCAAACCTAGCCAACCAAGATTTTACTATGGGGAGCAATCGTCTTTAGCCGGATGGTCTCACGATGCTGAAACGAC")) +(assert (= z "uugcucaaugaggac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0217.smt2 new file mode 100644 index 000000000..5987f475c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0217.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAACTAAACGTTTACCGATGGCAAAGGCTGACCCATCGTTGTCTAGACAGTTCAGCACTTAGGACCAGAACCCATCGTCAGTCCACACTATCGGTCACCATGAGTGGTGCAATTCTACAATAGAACGTTTGATGAAACGCCGTATTGGCCGGGCCCTTATGGTCCCGTGGACTCGAGGGCGGAGCTAGTTCTAACAGAG")) +(assert (= z "uggucuug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0218.smt2 new file mode 100644 index 000000000..1aceb4f67 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0218.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGGAATTCCAGAGACACCATGAGACCGCCGCTCACACTGTTTGCAGGTACACATGTTTCGGGTTCAGCATTGTGCGCATAAATATCTTTAAATACTGCAATGAGTTGTGAGCTAATCAACAGGCGCCTCGCGACCGTATTCTGTAACGATGCGTGTGCATTAGGTTGTGTTGTCTTTCCACCAGCCCGGCTCCCTTTGA")) +(assert (= z "cuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0219.smt2 new file mode 100644 index 000000000..c3a16eaf8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0219.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCGCAGTTGAATGTTGTCCGTGCCTGCATGTACGCCCAAAATGGGTTTGCTACGCGATTCGTAAGCGACCGTGAGTCGGTCCGGGTAAGTAACTGTCGCTCACATTATAGCGCACTGCTTTAGGGGGAGTGTGCAGCGAATTTGGAGCAGACTCAGATTCACAAGCCGGCGACACCCCGGATGAGTGACGTAGTAGAGG")) +(assert (= z "acgaugcgcuaagcauuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0220.smt2 new file mode 100644 index 000000000..001ff2d14 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0220.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCACGATCCAAATTAATTCCGCCGACGACAGCAGACTGCCAAATAGAAGACGAAGTTCCATTCGCGGTGACGCCTCGTCATGGTCGGAAGATCATACTTGCTGCCCCGAGTCACTTCTACTGGTGCAATCGGGTGCACTGAAACGCTCATGCCGTGATAAGATTTTACAGCGGATATTTGCTCCCGCCTAGCGAGGGCA")) +(assert (= z "uaaacgagggcggaucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0221.smt2 new file mode 100644 index 000000000..5e5b41320 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0221.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGTGCTCGGTACGGCACCTGGAAGATTCTGATGTTCTCACTTGTATAAAAACAGCAGACCTGCTCGCTAACACCAGGTCAAAGGAAGGTCATAATTCTTTCCGGCGCAAGGAGCGGGCCGAAGCCGTTACTTCAGCATCCACATTCCTGCCGATAAAGACGTATCAGAAGCCAGAATTGCCTTCACTGCACCACTAGGT")) +(assert (= z "cggcuauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0222.smt2 new file mode 100644 index 000000000..a666bbc36 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0222.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCTCGTAAGTTACAGCTATGTGATGCGAGCTGATGTGTAACTATTAGGCAGCGCTGTTGACGCAAAAACCTGGAGGTGGGACACCCCTAGCTTTTACCCTGGTAAGGCCCAGATTGTACCAAGTCGAGGCGACGGAAAGCCTGTTTTCTCTCGAAGGGTTGACGCTAGATTACACCCCGGTTCCGTGTGCGGGTTGTG")) +(assert (= z "aauccgucgcgacaacug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0223.smt2 new file mode 100644 index 000000000..382f66cbc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0223.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACCTCATGAGGCGTGTGTGTTCTTTCACATGTCTCTTTTCGTCCCCACAACGCTCTGAGTCTCGGGCCGATACTTGTCGAATAAGCCAGCCCTGAAGAGGCTGTAACCGGTATGGCCAGCTCGCATCGACAGCGGTCCTAGCAATACTGCCATCTTGCTAGGACAGTGTCAAAGATTATGATCCAGCAGATATATCGTC")) +(assert (= z "gaaaagcaggggug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0224.smt2 new file mode 100644 index 000000000..85a195099 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0224.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATATATCGAAATTTACGTCCGTCACGCCCAGCAGCTTGGCCATTAAGCCCTCCCTGCTCACCGGTTGGTAACCCGGAATTGCACGAATAATCCTAAGAGGATCTTGGACTCGCAGTATTGGCAACTCGTGGCTCCGAATTTGGAATTAAAGACCGAGAATCCAAAGGCACTAAGCATAAAAATCATTTTACGAGCTCTC")) +(assert (= z "auuucuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0225.smt2 new file mode 100644 index 000000000..64002c4a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0225.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGCCTGCTACATTCACTCACTACAAGTATCCACCGAACTTTTAGGGGTCGGAGGGTCTCAACGAGTAATTATCCCTCCCCACGTTTATGAACGACTCCGTGTGGGCACGATCCACGGGTCCACTGGAGCGAGATACCATTCTGCCGCCTTTACGGCAGACGGACTTCCGGTGCGAATCTAGGGGCACTCATCCGAATGA")) +(assert (= z "guggcuugaaaauccccagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0226.smt2 new file mode 100644 index 000000000..900204afc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0226.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGTTGTGTGGTCCCGAAAACAAACACCGAAGCGCCGGCAGTCTGAATGGCGAAGCCCCTCTCACTTCTTGCTAGTTGAGATATGTGGATCGGACGGGGATTAGTAAACACGGTCATTTAGGGCCGCCGTCTACGAGTGGCTTTTTAGGCCTGGGCCGTCTGTTCACCACACGGTGATTACTAGCATGCTCTTCACAAGT")) +(assert (= z "ccacuaauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0227.smt2 new file mode 100644 index 000000000..8735067ca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0227.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTATCCTACAGTCCGGAGCTCAGCTCTCAGGCATTTGCCTTATAGAGGACTTTCAGTTAACGTAAATTACAGGATCAGCGTGGACTTGCATTTCTTCCCGATATGGCCATCCGAAAGCTAGGTTAAAGAATCGTAAAACTTTGGTTGGGTAGTGCTCTTGGACAGTTGTTGAGCTCATACCGCTTGAGAATCGGACCGG")) +(assert (= z "uaauguccuaguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0228.smt2 new file mode 100644 index 000000000..27e840202 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0228.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGATTTCTTTGCACTGGGTACAGCAGTAGGAGTGCAAAGGCGCACCAGACAGCAGAGCGGGTCCCAGGGATTGAAAGACCGGCTGGCAAGTACTTGCGCATCCGCTGTATTGTCTGCTGGACCGTTGCCGTTGGAGTGCTATGCGTAGGCTAATCGGAGGTAAAACTAGTGACTCCTCTACCTTCAGATTACGATACACA")) +(assert (= z "agacgaccuggcaacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0229.smt2 new file mode 100644 index 000000000..5297175b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0229.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTCGGACAGGACTTTTTATCTTTGTGCTGAATCTGTGCAACTTAACGGTTCGGAGCGGAAAAATCGTCAAGCTATGAGGTACAGCTAGCTTGGGGTTGCCGGTGAGGGGAATAAGAGTGCTGTACACTCTGAGTCTACCCTGGCTCAGCGTGCTGAGGAGAAGTTCTTTTCATTAGTGCCTGAACCTAAGTTGGTCTG")) +(assert (= z "uagaaaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0230.smt2 new file mode 100644 index 000000000..560061c9b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0230.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGGTCAATCATCTATACACACGAATTGATCAGCCAACATGGTATCCTGGTTCAGGTAATCGTAAGAATGATCATCATCATCTGTCTTTAAAGCTGGGTTTACGACTCTGCTCACCAGAAGTGGTAGGGATTATTTACCGTGTGCTAGTTACCATTCTCGGGCTGTCCCGAGACACACTGTTCTAGCAATTCCCTATCAA")) +(assert (= z "cacgauca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0231.smt2 new file mode 100644 index 000000000..238ded1f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0231.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCCAGGCGTCAGTGGCGTGTATCGGTCTATAATCTTCGGAACTCCAACTTGATGAGCTCAAGGGGGTGAAGAATCCATACGCCGAATGGGTTTTGGAGTCGTCTACTGCTGGAATATATTCCCCCTGCAAAGGTCTCAGGACTGAGGCATATCGGCCAGTATTGCACAAATTGCAAGGCATTGGCCTCACCTCGCAGGG")) +(assert (= z "ccucagcagaugac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0232.smt2 new file mode 100644 index 000000000..08ab879dd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0232.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCACATTTGGGATTTGCTATTGCTCGTCAGCCAGCGGATCGCAAGATCACTACGAGCCGGTCTCGATGCTGTGGGATGATGATACGTGCCTAAGTCGCGTAGATGCGTGTTCTTGATAGATTTAACCCGGCGTGTCCTCAGCTCACCATATATCGTGGGCACAGCGTCCGCATATTCGAATGTGCCGTACAGCCAAAGAA")) +(assert (= z "acuacuaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0233.smt2 new file mode 100644 index 000000000..a1bd72806 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0233.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAGTGCAACAACATCCAGCGCGGCACCACCAGATTTGTTTTAGGGAATCGCAGCTTTCTAAATGCTGAGGATCGTGCAAACAATATTTTAGGACTTACGTCCCGTAGCTCACTGCCATCTCAGGCGTCTATGTGGCATTTAGACTTGCTACGATTCAGTCTATAGCGTGAGTGGTGTACTGATGAAGCAGGGCCCTGAA")) +(assert (= z "guagaguccgcagauacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0234.smt2 new file mode 100644 index 000000000..121b805bf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0234.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGTCCGGTTTGTGCCTTGACCTATCAACGCCAGGGGTCCAGAGGTTTATAAAGGATTAATTAGCACCCAAACGATGAGGAACAGGACGCAGACGGTTGCGGGCAGCCGCTCATTTGGCGTCTACTGAGTATATAGGTGTATGTGCTTGAGGATGAACTGCAACTGAAAGACGAGGACCCTCCCTTCCGTCCCGGCCGCT")) +(assert (= z "ggguuugcuacuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0235.smt2 new file mode 100644 index 000000000..3a2167b09 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0235.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCTCTTCTATTACGGGATCAGCACACAAGGACATGATTCGAGCTTTTACGTTCGTAAGCCCTGGTATAGTGGACATAGGAGTTATATAGGGACCGCTCCCTAATCAGGCCGAATAAACACGAAAATTAGGCTTCAGAGACGAGTGAGAGCATCTTGATCTCTCTTTAACTATAGCAGGGGGAGCGCGAAATGTCATCGC")) +(assert (= z "uagagagaaauugauauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0236.smt2 new file mode 100644 index 000000000..f45da901b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0236.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTTTGTGCTTATCCCTGCTCCGGGGAGGGATACTGGAGACCCGCTGCGAGCCACCATAACGGTCCCGCTTTAGGTCCTTAATCATAATTATCGGGCCCCAGTCCTCCACGCTCTGATCCATTTCTCGGCTATAGTGGTACTGAGTCCTAGCTTGCAAGCTACTGGACGCTAAGCCGCCTTGACAAGGTATAGACTTCG")) +(assert (= z "ggggucaggaggugcga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0237.smt2 new file mode 100644 index 000000000..86b529010 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0237.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTAAGTTGAACTAATCCCGCTGGCTGGGATGCTAGGAACATAAGCCACGAGTTGGATCAGACAGCAACTTCTGGTCATGTCAGGCTATGTAAGTTACTACCTGATCCAGAGGAGCCGCAAAAATGGACATTACCAAGCAAAGCCGATGTCTTTCAGCAACCAGAAATATACATGTGCGGCCTTCAGAAGGTAAGACGTTG")) +(assert (= z "agaccagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0238.smt2 new file mode 100644 index 000000000..105835d6c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0238.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGCTTTCGGAGAAGCGAGTTGAGTATTAAATGCTTACCTATACCAGAGGTAATCTGAATAGGGGTTTATGTGCTCCCAGAAGCCGTGTTCATTGCCGGCCGTTTTGCCTGGCGGCAACTCGTTCTGCATGGTAGCAGATCCATGCGCAAGTCTGCCACGAGCAGCTGTAAGCGAATTCATACTCTTTGGGCCGAGTCAA")) +(assert (= z "cauuagacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0239.smt2 new file mode 100644 index 000000000..5252e1a5e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0239.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCCAGTGGCGGTGATTGGCCACCCATTCTGACTCGATAAGCAACCGTTTGAGATTGGTCTAGAAGAGAGGTCCACGCCCGCCTGTATAGCGCGATACTGAAACCCGCGCCACGCAGCTCGGGGATATTTGCATAGAGACCCTTGAGTCCGCGGGTTGGACTGGTTCCCTTCAACGCTACCATGAGGCTTGGTCCCCCGG")) +(assert (= z "gcgcuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0240.smt2 new file mode 100644 index 000000000..41ad0aabd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0240.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCGAAGGGCGAGGGCATAATGGTTGCAGGGTACCTAACAAAGGCAATAAGCAGTTGCGACCACAACCAATATTGGCAATTCCCAATGCGAGATCCCCCGGGTGTGGATAGTTGTACCGGATAGCTGACCAAACAATTGGGTCGTATAAAATCTCAGTACATATACTGTCGTGGATAACTCGCACCTTTTGTTGGCGATG")) +(assert (= z "caaccgcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0241.smt2 new file mode 100644 index 000000000..25462051d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0241.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGTGAATTATGGAGCTGATTGTCAGGCCCAGGCAGATGTGGGGCAACCCTTTATAGGGAGGCGTATTCATGTGGCCGGGCGAATCTCTTAACCGAAGTACCAAGGCCCACAGAATAGCTTCGATCTTATTCGACTAGCTGGTTACTGAGCTTGACATTAACACACTTATAGGCTATTGGTCGATACCTTTACACATTC")) +(assert (= z "uggcuucauggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0242.smt2 new file mode 100644 index 000000000..4b272338b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0242.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTAGGCATTCAGACGCCGGCGTGTCACGAAGTGAGCGAGCATGATTCAACTCAAGGGCCTAACTTGGGAGATTGTTTATGCTCCTGTCGAACTCGTAAGGTTAAGTACCTCCAGCGGACTCTCGCCCTATGCAACACCATTTAAATAGTCAGATTGATCTTAGTCCCACTCGGCTGAGAGGACAAAGGGCTAGCAGATG")) +(assert (= z "gggauacguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0243.smt2 new file mode 100644 index 000000000..201a3709c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0243.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAATCATGATGCACGGTATTTCGAGTCTGTTACTTTGATCGCGACTGACATCTTCAATCGGATGGTGATTTTAAATCGCAAGAATTTCCAGAAGTACGCGAATATAATCTGGTTTCGACCGGACGAGCTCGAAGCGAAACGCCGGATCAGCAAGCGGTCGAATTTCTGAGAGAGCGCCATTCTTCCGGGACGAATAATA")) +(assert (= z "cugcuuauuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0244.smt2 new file mode 100644 index 000000000..b8caf1564 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0244.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTACTATCAAGCCGACCAATCACTCACGCACTTGTGGATTGGCAAGAACTACTTGAATAGCTCTATAATGAATACATAAAGCATGTTCGTGAATCTTGAACTTTTTGTAAAATCCGGCCTAGCGCATCGGCCCGTCCAGGGCTACAACAACTAAACTACCTAGCAGGTTGCCGATCGGTATGGGTCTGCGAAGTACTTGG")) +(assert (= z "ugaacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0245.smt2 new file mode 100644 index 000000000..ad21b3eef --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0245.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGATAAGTCCCCCAAATACTTTCTTAACAATAAATCGGCTACTATACTCCGCAGCCCATAAGTACACGTATATTGCCCATCTATTTTCGCCAGCGTATCTTGGCGCCGGACTTCTAGTGGTGCAAGCCGGCTGAGAGAGTGTCGCATGAACCTCGCAGCTCTTTTCTGCGTAATCAGAACGGCACGTTCCTATAGTCAA")) +(assert (= z "uauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0246.smt2 new file mode 100644 index 000000000..221626709 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0246.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGCAAGCATTGCGAAATTGGGGTCGTGTGTTAGAGTGTCTACCGTGATCGTGCATATTGAATCTGTCCTGCCGTATGTATGAGTCGGTGGGCTCAGAAGGGCGACAGAAGCGCCTTGATCATTATGGTAAGCATTCCCACAATCCCCATAGGAAGACCTCCGCGCTCCATCCGCTCTACCTTATAAGGTAAACGTTCA")) +(assert (= z "cacuagcacguauaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0247.smt2 new file mode 100644 index 000000000..269fea8b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0247.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGCGCAAAAGTGACTCGAACCATTTGTTTAAACCCGCTACGCATTCTTCACTGAAGATGGCGGCCTGTGCCACGGGGAACAATGCATTATCAAACAAACAGTACACCCGTTATCCGATAGGGCCTCGGAACACTGCATGCGCGGTGGCCAAATTCCTACGAGTTCAACTCGGCTAGGGTCGACCGATTTCGAGCGATAC")) +(assert (= z "ugacguacgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0248.smt2 new file mode 100644 index 000000000..d1759b09b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0248.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAATCTCCGACGTAGATTTTTAGCAGACATGCTCCCTGGCAGTAGTGTCATGGCTGGCCAAATTTTTAGCTTCCTAGCGCTGTGATCTGCAGGCCACCGCCCTGGTCGCTCCCCCTACTTCCGCCTGTAAATCTTCTTGGCTACAAGTACACGGACTGATGTTAGAAATTTAAAGGCCGCGGGCAACCTTGCGCCGACCT")) +(assert (= z "ggaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0249.smt2 new file mode 100644 index 000000000..f99c866ea --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0249.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCTGACTGTACGCGTTCGACTGGAAGGGCAGGGACTAGTCGTGCACCGGCCCTGTCCGACTCGTTCACCCCCTTTGAAGCATCCGACTTATCGATGTTGCACGTCCGGTGGACTATATTGATTAGCGTGAGGCACATGTACAAAAAATGATGACATACCAACGGTCAAAAGCTCGTTGACATTTCCAGACTCTTGCTT")) +(assert (= z "agcacguggccgggacaggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0250.smt2 new file mode 100644 index 000000000..911c4471c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0250.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACGTTTGCGACTTGATCGACCGTTCAAACCGTGGCCCCGGACTCAAAGTCTTCGCCCGTCTATTAGACCCCAACTTGAACACCTCAGAGACTCCACGATCATGTAATCGAGGGCCCAGTTCCCGCTGCAGGCACCTCATCTGCTGTGAGCTATGCGCTGGAAGGGTCTCATGTTGAGTCTTGACGTTGCCGTACTAGGA")) +(assert (= z "cgcgaccuuccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0251.smt2 new file mode 100644 index 000000000..7c6bfff0c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0251.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCTCACGCTTTTACACGGTCTGGTCAATTTCTTCGTCGCCCCCTGCATGCCAGCCTCACAGTCGTTGATACCACGTAGTATTGCCAGACCTCTAGTCAAATAATATAAGTTATTTTGAAGCATGACTTTCCGTTCGGTCATATGGCGCAACGCTTCGGCCCGTGACTAGTAGGCAAACTGTTCCATCGTAGACAAATGT")) +(assert (= z "caagccaguauaccgcguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0252.smt2 new file mode 100644 index 000000000..e61dc24c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0252.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATCATCCTGTCCAGGGAGTAGTAGTAGCGTTTCACACCGTCTGTGTAACATATGATCGGGCATGGCCAGATGATATATTCCTCTAAGAGGAGCGAGGCACTAGCCACTCTCAATGCTGACTAGAGCCAGGCGTTAGCGGTCCCGTAAAGGGTTCTCTAAGTAGAATGAAGTACACAATAATATGCCAATATCTTATGCT")) +(assert (= z "cggugagaguua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0253.smt2 new file mode 100644 index 000000000..cd151b644 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0253.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGTATCAACGACAACGCTAGTGGCCAGGCCTTACTAGGGACCGATAGTGAAGTAGTTAATGTCGAACTAAATTTTTAGGTCAACAAGAACGCCGGGAGTGTTAGTGTGTTGCGTACATAGCTGTGCTTACAGTTACGGGAAGATGGGTGGACAGGTCGATGCCGAATCAGACTACGGAGATCAACCGCGCGGAGCGACG")) +(assert (= z "cagcuugauuuaaaaaucc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0254.smt2 new file mode 100644 index 000000000..b882df0aa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0254.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCAGGCTGCAGACTCGAGTATTGTCAATGGCTCTTATGTTGAAGAGGAATGGCAGACGGACTGGACCGGGGTTAACGTTCTCGTGACACGCACAGTAGCGTTGCCGTAATTCTGAGGCAAAGTTAGCTACTTAAGCAACTGATGTATCGCTGGGCAGTGACAGAGCTCTCTTCTGTTTACTGAATGGAAAAAAATATCCC")) +(assert (= z "gagcucauaacaguuacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0255.smt2 new file mode 100644 index 000000000..27e9e8a55 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0255.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCCGTAATTTGGTATGAATCATTGGACCGTTCCATGTTGCGAGTAGATAAATTATTTTGGCCACGTCAGAGCGAGGACCCCATGCAACGCAACCGTCGTTCCGCAGCCAAGCCAAGTCTAACCCTTCAGACATAATTGGAGTATCCTGTCTGAACAAACTCTTGAATCCCACTCTGTTAAGCACGTATATATACAAACA")) +(assert (= z "ucuguauuaaccucauagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0256.smt2 new file mode 100644 index 000000000..8d96d7fcb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0256.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCGCCAGCGTCGTTGCTGCAGATGTTTAATTTTATGAGGGTTACTTCCTTCACTGGGAAACTTCCAATCCGTCATTCAGTCCCTACGATCCGTCAGCGGCCGCAGGTCGGAGACACACCAAGAGCACGATCCCCGGGACATGCAACCTGCGTTCTCATAAAACGTTTGTATAGGAGTTACTCCCAACTTACAACACCA")) +(assert (= z "gucuacaaauuaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0257.smt2 new file mode 100644 index 000000000..6ec9aa4ce --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0257.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATTGGTGTGTGCTGTTGCCCCGCACCGGTGAGCACGTTCTATACTTGTACAGGATTCTCGCACATTACTGACGTTTATCGTAAACCAACCCGTGAAACGCGCGTAGCACAATGCTGAGTCATAGAGGCTAAGGTAGATACCCACACTTCTCAAATAAGGGGCAGTCAGATTAAGCAGCGGTCCAAGCCCAAGGCCTTAC")) +(assert (= z "gggcacuuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0258.smt2 new file mode 100644 index 000000000..f2aa47a46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0258.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCAAGAGAGACGAGCAGATCACTGAACTAAAAGATGTAGGGCCGCCGCGGAGAGACGCTGTTTCATGCAATAGAACGGGCACGCCCGGGGGGGCAGAAATAAGCGCTCCAGGGCGCAATGCTCAAGGGGACTTGCCGTAATGGGCCGTTGGCCTGAAGATATATCTTGCGCGCCTACAACCGCTAGTCGGACGTTCTGG")) +(assert (= z "caagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0259.smt2 new file mode 100644 index 000000000..891f8e92f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0259.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACAGGCAGGAGTGGACCTGCATCGACGGTAAGCAAACGTACCGCATGAAGTTGGCATCCTTAAGACTAGCTAATGCTCTAACCTTGAGGCGCTTGACCTTGTTTGGAGAACTTTTCTTCCTAGCCGCAATAAATGTAAGTGGGAAGCTGGAAGAGTGCTTTTCCACGACATGTTCCAGTCCAAATCGCGGAGCGACTGG")) +(assert (= z "uuugcauggcguacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0260.smt2 new file mode 100644 index 000000000..4457928a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0260.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCCGAACTCCACGAACCTAACTCGTTCGAACATCGCGGCGCTCGCATGCACTGTGAAGATGCTAAACTGGCATGAGAGATTCTGAAAGTCCAGAGTGTAGAGCAAAATCTATTCGAGCACCGCCTTTCGTTTATTATGCAATCGCCATTCAAATACACTGCTATATTTTCCCGCTTTTTTTATAGGGACGCTTCCGCTT")) +(assert (= z "ucacau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0261.smt2 new file mode 100644 index 000000000..b33ae62e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0261.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGCATCTGGTCTATGTCTGTCTATTCAGGCTAGGTTATTAGTGGCGTTGGTCCTGAGTAAACACGGTCAGCGGCTCCACAGGTGATGTCATCCAAATCGCGCCAACCTAGCTCGAGAAGCCAAACGTGCGGGGTTTAGCACGCCGGACTGGACTAGACCATCTTCGAGTGCAGCAGTACTGCTCGTGCACGAACGCGAA")) +(assert (= z "acgcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0262.smt2 new file mode 100644 index 000000000..aee0920fe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0262.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCTGCAGTTCGGGGCCTCCGGAAATTAGATGACCCATTTTTCTTCACTATTCTAGGACGTACAATATCTCGGTCTCATAAAACACTGAACTTTCATCTGACCCCGTTCAAATCTGAAAAGTTCCTTTCTGTTCCATCCACATACGTTAGAAAGCTGGGGTGGTTACGTGCATAAAGCACCGGTTATTTCAGTGGACTA")) +(assert (= z "cggaggccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0263.smt2 new file mode 100644 index 000000000..05d6bd496 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0263.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGAGCTGTTAAGATAGTTTCCACGAGCCGAGGATTTTGATCAAGTTGATTCACAGCTGTCTTAAGTGCATCCAGGTGCAGTTCACTCACTCTTACCAACTAAGGTGCCACATTAGCGCTAGCTGGGACATGCACTTTTACGGTGCGAACCAGGATAGCACCACGATACAACCGCATACAACGGGAACTCTTGGTATAT")) +(assert (= z "agaaugguugauuccac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0264.smt2 new file mode 100644 index 000000000..e3cb80b8e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0264.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTTTGTCCCCTTGAACACGCGCGTGGCCATGTCGTACTGTCCATTATAGAGACTCCCGCAGAAGCAAGAGATTTGGTATTCCTGCTTTTGGCTCTCAAACACCTAATTCCCGAATGGTTCCCTAGCGTGTTTAGCAACCCCGGTGGCGATTGACTATATCCTTGATTGACTCAATGGGGGAGACCCCCGAATAGCTGTG")) +(assert (= z "accgguacagcaugacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0265.smt2 new file mode 100644 index 000000000..61758c042 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0265.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATTTTCTCACAATGAGGCATGCTAAGGAATCAGAGACTCTTTGCGTCGCCGCTGGGACTCCTAAGGTCCAAAGAAATCGAGCACATGCAGCGGCCCTGGCGAGAAAGACACAGCTGTAGCGGTGGAACCACGGTTGACAATGATAGGTCAAGACTCTGCTTATATACGCAGCCGGCCTGCCATGATGCAGACGACCCCC")) +(assert (= z "uauaugcgucggccgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0266.smt2 new file mode 100644 index 000000000..32a205846 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0266.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATAACAATGGAAGTAAGATTGGCTGCCAGGCTCTATCCAAACGGGTGCCGGAGTTGAGGATTAATACCTTTATGGTACGGAACGGAGCAATGTAAGTCGGCAAATAGCATTGCATGAGGAAGGGGTTTTCGAACTCATATAATTGTAGATAGATTCATGAAGCGCATCTCGGGCCCTTCATTAAATACCCGGTAGGAAG")) +(assert (= z "accaugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0267.smt2 new file mode 100644 index 000000000..5e11a8998 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0267.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGCTGCTTTCCATATGTTGTTAGTCTCATCCTGTTCTGTGCCTGTGTATTGTGCATGGACATCTTGTCAGCTCGATTTGACTAGATCATGCACTACATTCATTTTGTGACGGATTGCTGCTTGGGAGGTGCGTGGGATGTCACACTGAGGCTGGCAGCACACCACGCGTAGATGTTCGCCTGGCCAGGGCGGCAACGTC")) +(assert (= z "acgaaagguauacaacaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0268.smt2 new file mode 100644 index 000000000..59e8ef289 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0268.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGATATCTTGTTGAATTGATAAGCAAGACAAATTCGGATTGGGATATACCAACAACGCAGGAAGAATTGGTCTGAGCTAAAAACGCGTAAGGTGCTCCCGGTTTTACGCATGGCATAAGCCTTGAGGGTTTATCAAACGCAGACGCCAGAGGGCGTTGGACCAACTCTGTACAGCTTTATTCAAGCGAGGTAGTAGAACC")) +(assert (= z "cgaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0269.smt2 new file mode 100644 index 000000000..381b06d05 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0269.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCCGCACAAAGACACTAACCCCACAGCATCCTGGCTCCCTAATTGCCTTAAGTTTCTGTCTTGGAAACCCATGGGCTATTGTGGACGTACATTATTGATGCTGCGCTCGATATTGAAGGGCCCGCTAGTTGAACAACTCTTGGGCTCGGCAGCATTAGTGTTATATAAGAAATAATAGAATAACACTAGCCAACCCTTG")) +(assert (= z "cacaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0270.smt2 new file mode 100644 index 000000000..f0888328c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0270.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTTATTGCAGCTGGCGGTTATCCACGCAGGCCCACTTTTTGCTTCGACTGTTTGGCCATCTAATAGCTTCCCCATTTCGTATCAGACAGCCGCCCAAACCTGAATCCCGATCGAACAAAATTTAATTCGTGCCCCGATGTCCGCAATCTGCTTTGTATTACGTTCGCCTGGTCGATCGGGGGCATACGACTAGCAAATT")) +(assert (= z "aucguuuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0271.smt2 new file mode 100644 index 000000000..cf5424d08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0271.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATACCAGATGTTAATGGGTGCGCCGACATAATCCAAGCAAGTACGTTGGTTCCACGGATACTGTGTTGCCTTGGATTGGGAGCCGAGCTTTGAGATATGCCTGTGACGTTGCGGGCACCCGTTTCAAAAGAGGAGGGGCTGCCTGTGCCTGTCTCACACTTAAGACGTGGTCTATGAATTCTGTTAAGCCAGTGTTTTTT")) +(assert (= z "cccgug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0272.smt2 new file mode 100644 index 000000000..1e29ea1bf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0272.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGTCGGGGTTGTACGGCCCCGGGGGTCTAAGTGATTACATCTACAGTACAATGTTAGGGCGGATCCGTACACCTTGCACAGCAATCATACCCGGATTGCAAGTTATTATAGCGAAGAGGCCAGGAGTATGCGCATAACGACCTATCAACGGTCAACCCTACTCAATTGAGCTATGTAACGTCCCAGTACCACCCAATGG")) +(assert (= z "cggggccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0273.smt2 new file mode 100644 index 000000000..a0b727ff8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0273.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGCGTCCCTCCCGACTCACCTAACCACACTCGGAACCGCAGAAGGGAAGAGTCTGTGGACTGTATAACGATGCAGTAGTCTCCCGGCAGCGAGAGAGCCGTACGCATCGCTCGCACGGACACTGATGAGAAGACCGAGGGTGATTTGTTGTTCCCCGGTTACATCGGGTCCCCTAAAGGATGAGGCTTATCAATCTAGC")) +(assert (= z "ugacauauugcuacgucauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0274.smt2 new file mode 100644 index 000000000..98ce05b3b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0274.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAAGCGCATTAACCTATGTCTTGCTCCCTAGTCACTGGATCGTTCGCCTGCCATAGGCGAGCGGATGCAGCTCAGCTTCCTTGGTGTATTACCTGAGGGCGTTGCATTCTTTTGTCATCCCGATCTCGGATCATCGGGCCGTCTTTTCTCGCACGTAGTATGGTAGCAAGATCTTCTCACTCGAACTGCTAGAAATTTC")) +(assert (= z "guucuagaagagugagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0275.smt2 new file mode 100644 index 000000000..8f8619d12 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0275.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAATTACTCCTGCAAACCCTATGATGAGTCAAAAGATCCCAACGTGTGATGGGTGTGCTGCTCACCGAACTAGCCATCGTCATGGCACTGGAAATAGCGGGTTACACAGGTATGGTCCCATTTGTCCTTATAATGTGGGACTACGGGATGTGGATCCCATAAGGGCCGTTCCCCAACCTTTGCGAAACGTCTGGACCATG")) +(assert (= z "gguugcaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0276.smt2 new file mode 100644 index 000000000..71376fef0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0276.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACACGCACGTCCGGTCATACGGGCGGCGTCAGGCCACGAAACGTTGGACGGCTAATGAACTTGCCGTGGTTTTAGGTTGCTGGAATATCCTCACAACCAAACGCTTTGCGATTATATCGTCGGTCCGTTTTATTGACGCTCACATAATACTCTGCTAGGACGTTCGCGCAAGGTCCCGATTTAATTGTCCCAATGTAT")) +(assert (= z "augagacgauccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0277.smt2 new file mode 100644 index 000000000..ce34c76dd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0277.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGAATGTTTCGAGGACATAAAGCAAGAGAAGCCCGATTCAAGTACACCCCTCGCCAGACTTCGTAAATACAAAATCGTCCTCAACAAAGGAACTAGAGGCCGTGGTTTCCAGGGCCTATCCAAGGCTAAGGCACAGCACGGACGCGAAGCAGCACCAATTGGGCGCCTGTGGTCTCATGGGGAGGCGTATGGGTGAGTC")) +(assert (= z "ggcaccaaaggucccggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0278.smt2 new file mode 100644 index 000000000..99a925139 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0278.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGGCTACGTCTTACTAGTTGAAAAGCATCCTTATTATGCGGCATAATCCGGGTAAAGCTAAAATGCCCAGCGATTGTAGGTAGTGTACACTCTCGTGCGCCCTATTGGTATATCTTAGCTCCAGCCACTTCCATATCTTATATATCTCGTAATACCAATGAGTTTCCATAGTTGGGATTGGTTGAAGACCGGGCAGGGA")) +(assert (= z "cgaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0279.smt2 new file mode 100644 index 000000000..3c2ecf884 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0279.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCACGTCGCCCCGTTCGACGGTTTTTGTGGGTCCGCTTCGCTCGCCGTGTGAACCAGGGGGGCATAAGCGCTATGTTGCCGCACCGCTCGCGACTCCCGAAAGGATACCGCGTGGTCACAGCTGTAGACTAATTAAACGGATCGGGTCACTCACAAGCTGAATTTCCGTTTCGCCACGTGGTTCGCGACAACGCGTTTC")) +(assert (= z "gcagcgggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0280.smt2 new file mode 100644 index 000000000..0f59a1c94 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0280.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAACTTTCCTCCACAGCAGAGTGTAGGGGAGCATTTACACAACTTCCTGCTGTAGCGAATGGGAGTCCTGCTGACCGGGTACGTGGCCAGTGCGATGCCACTCATTGAGTGTAAACTCGTACATTCGGTGAACACTCCGCTTGCATAAGTCGCTTTCAATTGACTAGTGTCACTCTTGGAGTATTGAGTGTAAGGAATT")) +(assert (= z "uacccucagga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0281.smt2 new file mode 100644 index 000000000..dc16d19b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0281.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAGACGTGCCGCACAGAAGTCTCAGCATAAGAACGGATGAGAAATACTAGCAGTGACTTGTGAATTCTGTTCCCCCCGGCGACTGAGATGTATGTGTGCAAATCCTTCAGAGTCTTCCTTGACTACACAGCGGAGGGGACCTCCTTTGCCCCCAGCTACACTTCCGGAGAGTACCTACTAGCGCCTAAGGCAGGGGGAG")) +(assert (= z "cguuuaggaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0282.smt2 new file mode 100644 index 000000000..d78cb39a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0282.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATGCTTGCCCTGGTTCGACGCTAGCAACGGGTTGAATTGGGCCCCGAGATCATGTTTAGCGTGCTACCTTACGTACCACTTACTGTGTCGCAGCGTTGGATATATTGCTTATGCACATATATCGTGCAGACCGAATAGTAACCCTTAGTCATGGATGTGGTACATCCTCTCTCACTCTTGGTAGAAAGACGGATCTCTT")) +(assert (= z "aucauugggaaucagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0283.smt2 new file mode 100644 index 000000000..9c819841c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0283.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGGCTCACACGTTCATCTTCCCCTTTGGTAGGTGCGCAAATCCGAATGTCGGGTCCGTGAACATTGGGTAGCCTGGTCCCGATGAAGTCTCACAGAGAACATCGGTCCTCGATGACTTAAATTAAAACTATGCATGATTACTACTTACCCCAAACGTACCAGTCCGGTAGGTCAAGCACGTTAGACGACGGAAGTGGC")) +(assert (= z "ggcuua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0284.smt2 new file mode 100644 index 000000000..a2bc8af92 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0284.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGCACGATCCATAGATTACGTAAATGGACGGTCTGGGGGCAGGCCGGGCTGAGTAATTAGGATACACGATGCTCAGAGTTGCACTTGCAGACTTCGTGGGGTTGTCAATCAGAGACAGCCATTGTCTGCAGGAAAACAGAAGTCCATAAGTTGAGAAGGTGCTCGCAAGCACCACCGACGAAAATCAATAAGCCTCTAG")) +(assert (= z "ccugccaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0285.smt2 new file mode 100644 index 000000000..739c85283 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0285.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCAAGAAGATGTCAGCACCAGCCACGAGCGCGACCGGTTAGGATGGGCACTCGTCCCCCACCTTCAAGCCTGCACGACGTCCGGATTCCGGACCTCATACTGGAGTGCGGACACAGTTTTTAACGGTAAATCAAGGCCGGACAAGAACTAGTGCCGCGAACTGACTAAAATGTAACTGGTTGGTGGAGCGGCTGATGAT")) +(assert (= z "uuacauuga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0286.smt2 new file mode 100644 index 000000000..1d9027b4a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0286.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTTGAACATTGACAGTGCCGAGGTCCAGCTCGTAGTCGGTTTTGCGTGAGTGGTCTTCCCGGAGTTTAACCTTAATACAGTTCCACACTCGCGACGACGTTAAAGAGTGAGACTAATGAGAGCGGCCTCTAGAGGTTGTGAACTGGACCAGCAAGTGGGTTCGCGACTCTATGGCCCTCTAGAACTGCGTCATTGCTAG")) +(assert (= z "auuucucacucugau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0287.smt2 new file mode 100644 index 000000000..17b63d61d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0287.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCAGGTGACCACTTAAGACACCCACGTAGCCGCGAGCAGCATATCTGAAGGACCATAGCGTGAACCCGATGCCACCTCCAGTTTCACTCCGCTTGTTCGCTAGCGTCGCGTGAAATTCTTGCAGGCAGGTCTTTGTCGGTCCGAACTTTCAATAATGAGCGGTATGGTACGAGTTCCAGAAATATAGTTCGCTTCGCGT")) +(assert (= z "auucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0288.smt2 new file mode 100644 index 000000000..0a9eb1102 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0288.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGCCTGCAATGGACACTTGCACTTTCTTCTAGGAGCGCGCTTCAACCCTAATGCATCGTTGGAAGCGCCAAGAGCACCAAGTTCCGTTCAGCTAAATCCGACTAGTGCACGTTCCCAGGTCGCGTCGACTTCGTACAGGGGTGCCATGATGAATGCCGCGTTAAAACTCTTACCCGAGTATCATCGCATGTAACGTAC")) +(assert (= z "aggcaagucgauuuaggcug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0289.smt2 new file mode 100644 index 000000000..a7ed719b8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0289.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTCCTTGGTTCGATCATATCTACATCGGGATTATGGGCTGAGTATTCGAACGTGTTGTGTAGATCAAAGGGGATCCTATATACGCGCATGTGTAATGATGGCAGGAGTCAGTGCTGCTTAGTCCAATAACCCACTTGCTGCGGGATGCACCCGCAACCAGACCATTTCCCTTAGGCGCGCACAGATCTGATCAAGCTC")) +(assert (= z "ugcacaacacauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0290.smt2 new file mode 100644 index 000000000..58c349cad --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0290.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATCACCTGTAAGAGCTACCTGGAAAAGTCAACCACACATATCAACTACTCTTCCGTCTAAATTACGTATGGCGAGACAGGAAAGTTAAGAGAATGGACCTGCCTGGCCAACAAGTATTCGGGGGGACGTAGACACATCGTCGTCCAATGGTTGCGCGAAGACGATCACCTAGTGATAATAATTATGTGCAACGGACT")) +(assert (= z "uuuaguggacauuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0291.smt2 new file mode 100644 index 000000000..bae8da706 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0291.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAACTTAGGCTTAGTTGGAAGATAGATTACATGTGCCTCCTGAATCAGAAATGTTTGCGTGGCCTGTTTCCATGCAGGCGTCGTCGTAAGCTTAAACGCACGCGGCGAAAGCTATATCTATGAGATGCCGACGTGCGTCCTATTATATGCACATTCGAGTATGGTGGGTTCGCAAGAAGTTAAATGGCATACGTGTTTCA")) +(assert (= z "cuuagucuuuacaaacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0292.smt2 new file mode 100644 index 000000000..17856b088 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0292.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCAAACTTAATGGGGCGATAACGTCTGTACTTAACACAACCGGCGGTACGTGTCATCCCCGTCAGACTTTTTGACTCCATGCCTTACGATCTCCTTTGCCGACAGTTCACTTATGGCCCAGCACCGAAGCCCGTAGTAACGGCGGATTGAGTTATTAGGATGAAATATCCATTCGATGGTCTACTGGGGCGGTGCAACG")) +(assert (= z "agguaagcuaccagaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0293.smt2 new file mode 100644 index 000000000..4e7746843 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0293.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATCGGGACAACACGCTCACATGTACCTTTCCGCGGCCGAACAGTTGTGCGAGGTTCCGTTTGACACAGCGGCGTTAAACCTGCGGGTAAAGTTTCCCGGGCTGTGGAGAAGCTTGACACTCGTCTGAAACGGTGGCACAATTGCCCGACCCTTTGCCCTAGGAGGCGTCTGAGCCAGGAGAGCCACTCTGGTGATTGCG")) +(assert (= z "gucgccgcaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0294.smt2 new file mode 100644 index 000000000..400ad72de --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0294.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGTTGAAGAGGGACATATAGGACCTAGAGCCAGTGCTGACACGGGAATGGTGGAGGTTGGATAATCGAGTCTGTCGTCCGCCAGGATTAGTTGGATGCTTGGTACGTTCATGAAAGCAGGGTCCCGTGCTCTGGACATCATGTGTGGCACCACGGGAGTATTAGATCCGCTCCGGCTTACCGGTGTCCGTGAGGCCACC")) +(assert (= z "ggcgguccuaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0295.smt2 new file mode 100644 index 000000000..9b308196b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0295.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGACCGTTGTTTACGAACTGTGGGAGTTTCTCCTTGGGTCGATAGGCTGTTCATACCCGCCCTGATAGAATGGGTTCTAATGTTAACACTCAAGGGAAGGTCACAGCTGAGCCCGAAAAAAATACATATACACATGGCTGGTCCCCCGCGCGAACCATGGTACCCGCGAATTATAAGCCGAGAGTGTTTTGGGGAGTTC")) +(assert (= z "acccuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0296.smt2 new file mode 100644 index 000000000..44f652b62 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0296.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTACAGGTTTCATATGGTAGGGTCCGGGAATCCTCCTACGAATGCGCGTTCGGCTTAGTCACACCTGACCACTTTTGTAAGATTAGGCAAGTTTCGTACGGTCGACTTACAGCTAATCGCAGCCAAGTACATGTCTGTCTAGGCGCCCAAATACTGAAGTTTCGGCGACGCAGTAAATATGCATAAACCGACTCAGTATT")) +(assert (= z "aagccgcugcgucauuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0297.smt2 new file mode 100644 index 000000000..260f0bf63 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0297.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGCATGACACGGGAAGACTATGCACCTAGCTGAGCGAAATGTGCCGTCCGTCTAGCCCGACGGGACATGGTGCTGTCCGAGATCCGGTTACGCAAGAAAGTGACGGTCGGAAGTCCGGTCATCGGCGCAGAGTATCCTTCTGGGGGCCTTGTCCATTGACCCCAACCTAAAGCTGTACATATTGGCATCTTTACGCAG")) +(assert (= z "ugcgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0298.smt2 new file mode 100644 index 000000000..18b85e3e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0298.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTATTCGAGTGAGGACCACAGAGGGGCACGGGGTCTTTAGAAATCGGTGCGGTAAATAAATGGAGATAGCCCGGTTAGTGCCACGACCTCTTTAAGGAAACTACCTGAGTCTCCCATTGTGCAGGGTGCCATGGGTACCGTTCCGCCATCTAACTGTAACTATGGATACCGATAAGTTTGTCGCGGGCGTTCTTGGTA")) +(assert (= z "ugucuccccgugccccag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0299.smt2 new file mode 100644 index 000000000..3f6c49f60 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0299.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTAGTACACGAAGCGAAATCTGCCTACTATCCAAACCGCCCAATATTGTGTTCCCAAACCTAGTCTTACGTTGCTATGGTTCATCAAGACTCGAAAGGCGCAGCCCTATAAAGCAATCAAGAGTACACACGTCACCGGCGAACCAGCGTTGCCCCCGGAGTGTGACGCCGGCTGCCCGTCTACTATGATAAGCGGTGCGG")) +(assert (= z "gugcagug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0300.smt2 new file mode 100644 index 000000000..51131c964 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0300.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGGAAAACTGTATTCATTAGCTGGCGTCGAGTTGCCGTGCATTGCCTCCACAAACAGTGGAGCTGCTAATAAGACATACATGTGGCAGGGTGATTCATCAGAAGGGTTCATTGTGTTTCTTACCCTGCTGTTCCCGGGCACTCAGAGGCCTGGTACTTACCTGACGTGACCGCGGACCATGGCGAGCCCGCGTGAATAT")) +(assert (= z "gucuccggaccaugaaugga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0301.smt2 new file mode 100644 index 000000000..dd7db9079 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0301.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGTTCAGCTAGTTGGGGGTACCACTACTAGTCGAGTAAAGCTCGCGCCACGCGAACTCTACCAGGAGTAGCACCACCAGCTTGACTAAATTCAAAGATACTAAGCACCGGTAACCATTCAGCCATAAATGGCTTTTAATGCCGGCTCCTATGCCATCTCTCTTATGGTCGGCGTGCAAGGAGGATGCACGGCACCAATA")) +(assert (= z "guuccuccuacgugccgugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0302.smt2 new file mode 100644 index 000000000..ad7ba9102 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0302.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCTTAATTACCCATCTTAAGCGGTCTGATCAGGATTCTGCCCAGGGGATGGGAACGTCCATGCAAATTAGGTAGTTGGTTCTGCGGGATTTGTATGTCGTGTTCGTTCAAGCCCAATGGGCTTCACACATCACAATCGCAAAAGGTCGTAAGCTTCAGAAATCCTGTTCATCAAATTGAGCGTAGGCTCCAGATAGATG")) +(assert (= z "cgcccuaaaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0303.smt2 new file mode 100644 index 000000000..2d90734b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0303.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTAACTTCCGGTTACGTTAGATGGACGGTTTAAGATAGAGATATTACTCCGTCCTGCTGGACTATCTACGGAGTCGAGGCGCCATGCGGTCCCGTCGCAAGCACCTAATCTCACTCGTATTTCATCATCGTCTGCCACCCAGGTGCATGGCCGAATGTGGAGCGTTCACCGGGACTGTACTTCACTGCGCTACCAATGCC")) +(assert (= z "ucgcaaguggcccugacaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0304.smt2 new file mode 100644 index 000000000..2c49ce294 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0304.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTGGAACGACGGGCACATCCCGTGAAATCGACTCAGGCTGAAGTAGTCATGAGCTAGAGTTGTTCACCCCGTTTGTCCCCGTGTACGGGGTTGTTAGCTACGGACGAATATTGGAAAGAACTTTATGCCTCAGTCTAACGTATGCCATTACTGGCCGCAGGGCTGGCACTAGTCATGAACCTGGAGCGGGTTCTCTGCT")) +(assert (= z "acaaucgaugcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0305.smt2 new file mode 100644 index 000000000..9eb40dc88 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0305.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCCTTAATATAGACTGATGCTATTTCAAAATGGCAAATGCCTTAGTTGATATTATAGTGGATTGATGGATCTGTTGCAGGATATTATGATGTTCGATTAATGGGTGGGCTTTCCGCATTTCATGGCGTCCGATTCCTGGAACGGTATAACATAAAGAGGGATACGATAGAGTGGCTGATAAATGAGAATTGAACGGAA")) +(assert (= z "agacaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0306.smt2 new file mode 100644 index 000000000..baef85506 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0306.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACGACCGTGGCACATGTGTCTCGGTGAGGCACCGATAGGGTAATTTACATGATCCATGCAGCTACCAGCCATAACGTAACGTGTAACCGAGAGGTCCCATCTCTAACTATCCATGTGGAGTGTTGCTACGCACAATTCGATAGTCTTGCATGGGGCATGTGGAATCATGAGGAATCATTAGGTCACAATGGCCAAAGGGA")) +(assert (= z "uccaguguuaccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0307.smt2 new file mode 100644 index 000000000..33fe42306 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0307.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCGATACCTTTGCCTGCCCCGTTCTCCTTCTAGCTGTACCCTAGTTTGTTTGCATAGAACAAACGCTGGCCCGGGGAAGTTGGTTCTGTACTAAGTAGTCTTTCACATCGCGTTACTGGGTGAGTCAGCCCCAATGATTCACAGTATAGCAGGGACCTTGCAGGGTACTACGGTTTAGCAAGAATGCAAAAATGATCC")) +(assert (= z "acguaucuuguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0308.smt2 new file mode 100644 index 000000000..13d3568f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0308.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCAAAGACATGATCGGGCTGGTGTCAGTGCCTTGTTAGAGTCTGAAAAACGAGGTGAGTGCAGTCCCAAACTTCATCCCTAGGTACTCCAGTGGTTTTTAATGGCTCGTTGACGAACAACGAGGAGCTGCGAACCGGCTCACGCGGCTTGGGCGGGTAAGGTCGTTAGGGCTGCAACTGTTAGACCCTGTTACGAGCTA")) +(assert (= z "cuuuuugcuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0309.smt2 new file mode 100644 index 000000000..f65482aa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0309.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTATTCCTCTTTACTTTGAGCCCGGCGCTCGCGGTGATCATTCCTAGGACTCATCTCCAGGGCCAGTAAGTGGAAACCGGGATCGACTGTCGTATACTGTGGCTTCCTTCGTCCAATGTGCTCAGTAATACTTATCCCAATCCATTAAAAATGGCAGGGCTCGTCCCATTCTGTATCTTGCCTTTACAGCGTCCGTCTA")) +(assert (= z "guaaggauccugaguaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0310.smt2 new file mode 100644 index 000000000..be34abc6d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0310.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAAGGCGTCCAATAATAGTGGATGGAGAGCAACTGTCGCGCCCAAATGTGGGTAGGCATAAAAAGCTACCTTGCATTAAGATTTTATAACAACAATCCAGAAAATGTTGCAGTGTGGGACCCTAACTCCACATGAATTTTTCCATTCCGTAAATACGGGAATGTTAAACAGACTATATGGTTAGTGGCGACAGTCAAGG")) +(assert (= z "caguucc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0311.smt2 new file mode 100644 index 000000000..3a2723ed2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0311.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTAGTGGCAATCTGAGAGCCTGTCAGCCAACTCCGAGATTCTAAACGAGAGTGAGGGACAGACTAGGCTTATTTCTCCTCCCGCTTTATGGCCAGTAGGGGCGCACGAAGCCACGATTCGTCTAAGGATTTAAAATTTCCATACACGCTTTCAGAGGCGTTTAGGTAAACATGCTGCTAAAACATGTTCAACGAAATGTT")) +(assert (= z "uguacgacga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0312.smt2 new file mode 100644 index 000000000..79b3f25b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0312.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGTAAGAAGGAACGGCGTAACAGTGGTGCGTGGAAGAACCTCCTGAATTACAGTGGCGAAGAACATAAGTAGGATTTCGCGCGGACTTTTTTCAAAGACATCATTTGTCATTCCCACTGTGAATCAGCCGATTGGATAACCCTTAGTTTATTATCAGATTCAGAGCATCGGGAGAGAAGGAAGAGTGTGGGAGCCGCG")) +(assert (= z "aaauaauagucuaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0313.smt2 new file mode 100644 index 000000000..d56cecd0f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0313.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCCTCCCACCGCCCTCGGACAGCACGGCCCAGACCTCCTCACCGTGGCTCCCCTTTCGTGACTAGCTCTCCCACCATCGGGTCACTAACTCTATGTAGCAAGTTTACGAATTGTACCCCTACACTAGTAGCAGCCACGTTAAGTGACAGAGCGGAAAGATCCCGCTAGCACCTTAAAGTCGTCAATGCGTCCCTGAGCA")) +(assert (= z "cucgccuuucuaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0314.smt2 new file mode 100644 index 000000000..43685ca56 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0314.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGTTTTTTTGGAACAGAGACTGCAATTTACGCTAGATAGGTACTAGATATCGGATGCGAAAATTACAGCCTCTTCGATGCCGCTGAGTGGCGAGGAGGAACTCGCCCCTGTGTGCAAACGTGTCCGTTAACAATGCGTGCAGATGTACCCGCAGCAACTGATGCGTTCTAGCCTCCGACATAGCATACTCGCGGTTCAT")) +(assert (= z "uugucucug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0315.smt2 new file mode 100644 index 000000000..8dbfe0061 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0315.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACAAAGGGCTCATTCCGTCACCCAGGTAGGCTCTGGCAACATTCCTCAGCAAAGGCGACAGCTGCCCTCCGTGTCTTCGCCAATGGTAACATTCCTGGGGCGAACGCTGCCGTTACCATCAGTAGACGTACCAACTAGTATTCTAACTCAAAAACCCCGCGTTTTTGGGACCCCTACGCGCATCGAGCTTTTTTACCTT")) +(assert (= z "gcgguuaccauugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0316.smt2 new file mode 100644 index 000000000..907b79d3c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0316.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCTGGGTCGGACGCGCTAGGATCGTCGATAGCGAGCACTGTCGCTGCTGAAGAGCTCGCGTGGCCCGACGACCCGCGAATCGTTCACGTGAGTCATCTCACAAATGATACACCAGGTTATGGGATCGCGTAACGAAGGGAAACCTACGACCACCTTTCCCAAAAGTAGAACCGAATCACCCCGCGTGGGTCCGATAATT")) +(assert (= z "gaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0317.smt2 new file mode 100644 index 000000000..522a66ffa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0317.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGGGTGCGCCGATATTCGGTCCAGCTACGGGGACTTAAGTTTCTTGTAAGAGAGGGGACATAATTTCCCTTCCGCTGCGGGCGGCTTATACTGCCAGACCAAAAAGTATCCAATACTGCTTTAAAGGGCTTAAGTATTCTCAGTAGTTTTGCGATCAGACCGACGGTCACACCCAAGCATGGGACGCGACTCCTTACCA")) +(assert (= z "gcgacgccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0318.smt2 new file mode 100644 index 000000000..c57377b18 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0318.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGGGGCCTACAATCCATAATAAATCGCCGTGCTTGACCGAACAAGGTCGGCCGGCAAACAATGGGAGCTATCGCTTTGCCGGCAACTAAAGGAACACCAAGTCCCGACTATAGATATGTCCGTCAAGGTATAGGAATCTGGCACGGCGCTCCAATACCCCCCGTGCTGGAGAACTTAAGGGAAGACTGAGGCAGTGGTG")) +(assert (= z "auguu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0319.smt2 new file mode 100644 index 000000000..564764d2f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0319.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCTCGAGCCACCCAGACGGGGTTTCTCAAGTCGTGAACGCTCATTGCTGCGTGCGTGTAGAAACATTCACCTTGGCACCGGGCTCGCCGGTGGGTCGCAGTACGGCACAAAATTCGGGCCATTAATAGCTATGGGGCGAGGGGACTAAGGAGTCTCCGAAGCGTTTAGCTTTACTCGTATCGACCATAAAGGTTTATC")) +(assert (= z "ccgcuccccugau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0320.smt2 new file mode 100644 index 000000000..76779ab54 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0320.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACGCGGGCCTGGTCGTATGATTTTGACCATGCTTCAGTCGAAGTCCGGAGTCAATCGACCAACGTTCGTGACCTAACACGTTGCGACCCGGCACGTGTACACATTTGAGGTGCAGAGCTGAGGTGAATGCTTGATACCAAATGCGCGTAGATGAGGCCGGTCCTACTAAGGTCCGTGCGCCTGCTGTCCCGAGTAATT")) +(assert (= z "ccacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0321.smt2 new file mode 100644 index 000000000..6a63569e6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0321.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCACGAGTCAGGGTCGTGAAAAAGCCGAGCCGCCCCATAACGGCGTTTATGTACCAACATTTTAGTATCAGGGCCAAGAGACTATCTAAGCGCCCTATTCCCAGACGGCCATGCTGCCCGCACTGCTGCGGTACGTTTTCGTTCCCAATATTGGACTCCACCCTCTTTTCCAGTTTATCTGTGGGTATCCACAGGCCC")) +(assert (= z "acgggcgugacgac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0322.smt2 new file mode 100644 index 000000000..8b2bc9c62 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0322.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATTCGACGCATATTCTGATATTCGTTTCCAGTGGCACAATTCTATTAGTAGGAATGCACGTACACCATCAATGGGGTGCTATCCACTCATTAGGATCACATCTGTGTGAGTCTCCGGCGGTTGTAGGTTAGCGCACAATCGATGCCGAGCGTAGTCGACATGGACCAGCAAAACGCGGAGCATCCCAATGAATCAGCCA")) +(assert (= z "gauaggugaguaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0323.smt2 new file mode 100644 index 000000000..598c85c2d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0323.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACAGCAGACTTACAGGATTCGAAGGTGCCATGCCCCTTGCCGGTAAAATTTGGGTTTTCACGTTTGATGCGGGAGCTAAGTAAGCGTTGGAGTGCCTCCGATGTACCCGCTGACCTCCCTCTAGACAAGTGGATCTGACGTCAAGAAAACCAACGACATTCGTTCATGGGGTTCGCAGTCATACAATCGGGCCCTTTC")) +(assert (= z "gaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0324.smt2 new file mode 100644 index 000000000..e75e49399 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0324.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACTAAGCCACATTTTAGATGTGGACAGTCTACTTTTTCCTGACACCTACCTAGATTATATGTTCAGGAATAGTTGTTATCTTCGCATCCCACAGTGTTCTGCACAGTCTATCCGAGCGCGCATCTCGCCGACATGGTGTCTAAGGCAATGACAGTCTAACCACTTCGCTTAAGTCTCACCCTAGCTGCTCTCTCGTGGG")) +(assert (= z "ucgguguaaaaucua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0325.smt2 new file mode 100644 index 000000000..cf51f6bf8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0325.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATATGACAATTCGACCGCCAACTCTGGTCTGCGTGTTACCCAGGGCCGGGGTAGGAGCCTGGCTTCTGTGTTTATGAGACGGACATACTCTGTTCCTTCCCTTAACCTCCAAAGTGGGCCCCCCCTAAAAACTTCAGTGCGGTGTCGTCGTCTAAAGGCATGTCCCCTAAGTGAAATGGGAGTGAGATTGATTTGTCAT")) +(assert (= z "uggcgguugagaccagacgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0326.smt2 new file mode 100644 index 000000000..15776a790 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0326.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAGTTCAAGATAGGACAAGCGCCACCATTAATCCTCTGGCCGCAGCATATGGACAGGAAGAAATACCCGTGTAAGAGCGCTGTTCTCGGAATAACTCTAATTAGCAAATAGACCTACGTGCCCTGGTAGAAAACGTGGATGGGGACATTTGCTGTCCCTAAGGGCGAAAGCGTGATTTCCTCCATTGCTATTCAAGGGG")) +(assert (= z "guauacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0327.smt2 new file mode 100644 index 000000000..744feddc5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0327.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGGGAATTAGTCCGGGGGACAGAAATAGCCAATGCATGAACCAGTCTCCGCAGCCTCAGGCCATAGCTCGTACACGCTAATTCAATCTCCAACATTCCGATGGGCTTGCTGTATGCATTATTGTTGTAAATGAGGATTAGATTGTAGAATTATCAACTTGCAGGAGCAAGTCTCGAAACGAGGCTGAGGAGCACCTCA")) +(assert (= z "cguggagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0328.smt2 new file mode 100644 index 000000000..9099f68cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0328.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTTCGCCCAAGGTTCTTCCACTAATGCAGCTCGTTAGGGAGGACGCCCGGGAGTATCGGGGCTGTGCTACCGGGCATGTTGTTTCTGCGACATGGGATGCAGGTACTATAGGATGATCGACCTAACGGTATCTGCGCCTTCGATGAACGAGCCCCGCCTGATTAATCCACCACCATTTCATCACGATTCCGGAATTACC")) +(assert (= z "uugcucggggcggacuaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0329.smt2 new file mode 100644 index 000000000..bc45e901d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0329.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGTGGAAAGGCGTTTCTTATCTATATCCCTATATAGGGCCACTGGAGTGAATGCTGGCCCCTACCTCGCAGACTATAGCGTTTCTACAAGTGCCGTCTCAGGTAAAGTCAAGCCAGCCAGAGATCTGTCATTCACCGCAGTGCTGATCTGTTCTTATCGATATATTTTTAGATGCTATGCTCCGTTTTTATTCGGCTT")) +(assert (= z "aguggcgucacgacuag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0330.smt2 new file mode 100644 index 000000000..696719ce9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0330.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACACGTGTGTGTACACAGTCCCGTACAGTGAGACGGGATAAATAATAGGAACTACTTACCTTGCGTTCCATTCAAAGTGGCGGCAGAGTGACCACTAGAAGTGCGGAACGCAATATCCCGATGATGGGTCCCCGCGTATGAACAGCGCGTCGAAAATACAGTCAGTCTGTTCCCACCTTTCCCGTTGGAACGCTATGCAA")) +(assert (= z "ugucac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0331.smt2 new file mode 100644 index 000000000..151a8f843 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0331.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACTAAACCAATAGTTGGTTACTGCGTAGGGACTCGGAGCCGCAATTTAAAGCCGACTTTGGACGCCCTGTGTGATCCCGCCGCGCCCTGGTGGCTCAAAATTCGATGCGCGCTGTACCCAATTCCTCGCGGTGACGATCAAAATCAGCTGCTGGATGAGGTTACCTGGTTAGCACACCAGATGAAGGCTTTTCTGTCCC")) +(assert (= z "ccucggcguuaaauuucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0332.smt2 new file mode 100644 index 000000000..13c8634c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0332.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTAATGCTGCCGCGGTAATACTCCTTTTGTTCGCGCTCATAGGACATTGAGTAGTTAGTCAGAGTAAGCGAACGTTTTATACCTGTATGCGTATTGCTGGGCCCGGAGTATGGGTAGAAGTCTGACCGCGGACGTTCGTGCACAACCTGGTAGCAAACCCGTCCTAAGTAAAGTCGGTCATTTATAACAAACGTACTCGC")) +(assert (= z "caaaauauggacauac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0333.smt2 new file mode 100644 index 000000000..5973de9e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0333.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCGAGAATTCCTCCTTTCTCATCTTTTATCACTCTCTCGGCGCGGTCGACTTGTGCACCATCACGGCGCGACGAGACGCATAAGATTCGAGGATCCTAGGGACCATGGAATTTGTTTGTATAAGAGTCATGCCTAATCCGATATCAGACTCATTCTGGCGTCCGCACGCAAGAATACGGTTTAGGCTCGTATGTGATA")) +(assert (= z "uaaacaaaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0334.smt2 new file mode 100644 index 000000000..907efd976 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0334.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTATATTCGTGCAGTGGGTGAGCCCAAGGAATTACACGACTCTGGGCCTGCCCTTTATTGAGACAGTTTACTGAATATGGTCATATAAAACTTGTGGTTTACGTTCAGAAGTGCTTCAGGTATCTAGGTGGCAGTCAATGGCGCCAGAGGGCACGGACAGCTGGTATTGTCGCGAAGTCTCTGGTTCCCATCGTATTTC")) +(assert (= z "accaguauauuuugaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0335.smt2 new file mode 100644 index 000000000..cdd369f8e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0335.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAGGTCCAGTGACGAAGCGACTAATGATCCCCCTGCTTCCAGCGATTGTAAATAACACCATGGGCGATAACCCGCTATGATGATGAGACTATGACCCCTATACTGCGGGGGGAAGTCAAGCAGTCGCTGAGTGTTAGCCTGCGATTGAATAATATGCGGCCACGGCACTAACCCCGCCCCCCGGTTATAATCGCTCGTCA")) +(assert (= z "uugggcgauacuacuacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0336.smt2 new file mode 100644 index 000000000..e85b09f10 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0336.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTGCAGTCAACTAGAACGCCCTTGTTAACCTCCACCGTTTCTTCTGCAGATCGTATGTGGTGTTTCGTTTCACGTAGAGTCTATAGTGCCAGATGGTGATGCACCCTTCCAACCGGCGGTAGTACGTAAGGTAATTCTGAGGACGAGTTTCTTGGTCTTAATAGGGCATGTTCTCGCTCCCAGACCATTCTTAAAAAT")) +(assert (= z "uggag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0337.smt2 new file mode 100644 index 000000000..cecdf97a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0337.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACCTAAGCAACTCTTCGAGCGTGGGTTCATAGGCATGTACGCAGTCTGCCCTAGCATCCTCTTGACATTTGGGGCATCGCCTGCTTACGATGGTAGGTCCATTTGAACAGCTACGAAGGGCTTGCCTTTATCTGGCATTGATCGCGACCCCACAGCTACTGTATCGTCCCAGGCTACACTAGTTACGACAAGGTATCAC")) +(assert (= z "gagaagcucgcacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0338.smt2 new file mode 100644 index 000000000..b22c36e6c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0338.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGATAGGGGAATCATACGTTATACACACGCAGGCTCGCGAGTACGGCGACGAGGCATATGTAACTACGATCATCATAATGCCATCGTTGAACAAATTACAGAATTGGTCATGAACCACAGTCGGGCGCCCAATAGGGAGGTAGATGCTCGTGCTCCGCACGCGTACCCATCGGACTACCTGTTGGGTCGTGACCTGTGAC")) +(assert (= z "aguaugcaauaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0339.smt2 new file mode 100644 index 000000000..931cd4f2b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0339.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGATGTATCACACAGCTCGTCAAACATGGGGCATCGAGCAGAATCAGGCTAACCTTCCTCTGGATCCTTCACAGCAGGTTGATCTAGGAAGCTATGACTCTTTGGTGTTTAACTCGATCGGGAAATCGTACGGAACAGTTCACAAAAGGTAAAATTCGTCGTTACGTAGGTCGAATGTTGCGATTGAGGGTTGTTTGAT")) +(assert (= z "cgcuaacucccaacaaac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0340.smt2 new file mode 100644 index 000000000..88cfa6954 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0340.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGGTTTAGTTCGCTTATATTCGCGATAGTCCGGTAGTTCGACGACATCCAGTTGTGGCTGAGTTGATACTAGTGCCAACGAAGTGTTAAGTCAACTGGCGAATAGAATGGCTCGGGTAATTGAGAGCCATTTACCACTCCTGGAACACTCGGTTCCGGGAGGACATGCTCCCCGTCACATAAAGTGCCTACCAGGGGTA")) +(assert (= z "uccuguacgaggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0341.smt2 new file mode 100644 index 000000000..b428a79ec --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0341.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCTGAACGAATAATACGCGCAGGTAAGTACTCACCTAAAGGTTATGATCATAATTGGACGAGTAAAACCGTCACTAGATCTGGTGGACACCCCCAGTAGTTCGTAATGCGATAGCCAAGTATTCGACATTATTTTTCCTTTTGATACTCATTCGTTCGACATGGAATACTCTCCTAAAAGCGGCCTGAAGTCCTCGAC")) +(assert (= z "caucaagcauuacgcuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0342.smt2 new file mode 100644 index 000000000..60df2d969 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0342.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTACGAAACAATAACTCAAATCTAGGAGATTACGGAACCCAGACTAACTTATAACACTATGCCTAAGCAGGACCCGGGTGTTATCCTGGCGGTCATAACCTAAGCCGGGGGGTAACGTAGGTACTCCTACAACTCGATAAATCAACCTGGATAGCGTCTAAACCGGAATCGTCGGAAGGTATATACCTAATCCAATAGC")) +(assert (= z "ccaguauugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0343.smt2 new file mode 100644 index 000000000..17b34a00e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0343.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTCGTTAACAGGCCGGACCGAGTACGGATTACCACGGTATAATCTCTCTGGTCCACCCCTCGCATCGGAATGGCAGAGCTGAGCGGTCTTTGCCTTGCGGGGTTTCCAGGACCATTAACAGAGCAGGTCAATGTTCCTTGCGCCATCACGCGACGATATACCCTTTTAGGGTAATTTTGTTGTTCAGGACTTAGAATAT")) +(assert (= z "ucaugccuaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0344.smt2 new file mode 100644 index 000000000..02b3cd36b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0344.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGGAGCTAGACTACTCTATAACACCAGTGCAGTCCTTTAATCCGTTTGCCTCACTATACTGGGCCGAACAGGGTCCTTTACATACACAGGATCCATCTTGGTCCTCAGCAGTCACAGGTTTCATTCCAACCACGCTAGAAGAATGACACAAACCTTTGTGCAAGAGCGTGTGAGCGATGCGGTCGGTTGACTGTAACCA")) +(assert (= z "ucagug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0345.smt2 new file mode 100644 index 000000000..8301343aa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0345.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTCATCAGTGGATTAGTTCAAGCACCCGTAGCTCAACGTTGTGTATTTAGTAGGGATAGACTTACTAGTCATATCTAACTTCCGTGGTCTCCCCAATGGGTTAAGATTCGAGGCCGGATTGCCTTTGAGGCACCAAAGATCGCGCTCTTCACCGTCAAGCTCTGTACTTCATATCCCAAACCAAATTGAAGAAGGGCCT")) +(assert (= z "cgcgagaaguggcaguucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0346.smt2 new file mode 100644 index 000000000..29fdbd7cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0346.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGACGTCAACACTTGATCGTGCAGCCAGCCTGTCGGAAGCAACGTGATCAAGGTGCTTTTGGATTTGTGAAAGGCAGCGCTCACTGTGTATTTTTGAGGCCGGAGAATTACAGCAAAATGTAGAATGATGCTCGTCGAACTTTATTCAAGTCACATCTCCAGCTTTTGATTGCACAATGGTTACAACCGTGCCAACTGTA")) +(assert (= z "accaauguuggc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0347.smt2 new file mode 100644 index 000000000..4bb9302a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0347.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCCTGGGCGTGGCGGGATAGCGTACGCGCTGGGGGCCCCTACAGCCCCTTCGTGTTGGACTCCCGCCTGCATTACCGCAAGTGGCCCAAACCGCAAGTTTGGGACGAGACATAGGGTGAACGACCCTTCGAACTACAGCTGCACGCCTTACTATTCAGTGGCACGTATTTAGCACATTAGCGTTTTTCGCGCATTCGTT")) +(assert (= z "guguaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0348.smt2 new file mode 100644 index 000000000..ae8d40ab8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0348.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTGCCCTTAAACCTGACACGCTTTCAATGGAGTCAGAAAGTCTCACTGGATTGCCACTGATCTCATTCCTCCAACCTACCAGTAACTGAAAGGCAGGCTGGCCCCGGTTGAGTGTTGAGATTATCAGATTACTAAGCCTGCGTCATTTATGGGTAGTTAGGTTATGGGGTGGGAGGCTGCGTCTAACTGTATGGCTAGC")) +(assert (= z "gugacuagagua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0349.smt2 new file mode 100644 index 000000000..e314c042a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0349.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTACGCAAGTAAATCGCTCTACACATGTGATAAGGTCGACATGGAACGCCCACTTATTGCACACGCCATCCCCCCAACTGGCATAACAGTTTCGTCTGTAATGATCATAGGTGCGTTCTCATCGCAATTGGGCTGATTTTTCGGGGTTACTCCAACTGTAACACAAAGGAAGCGTAATCCTCCATCGCCGAGACCCGAG")) +(assert (= z "gcaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0350.smt2 new file mode 100644 index 000000000..f08a77f00 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0350.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGGTTGACAAATCGACGTAGAGGGTTGGCGCTAGGGTCCCACTGAGCGAGGCATGTTTGTCCACGACGGATTGCAATCACTGTTAGGCACTCCGTCGTCACGATTGCGTGCACAGAAGTCAACTGCTGATCACGGTTGATACAAGGATAATATACCGGGCGAATGAAGTGGGTCGTACTTTCAAGCTTCCGCGACGTAC")) +(assert (= z "uccuauuauaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0351.smt2 new file mode 100644 index 000000000..857ff61e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0351.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCTAGGTAGAAGGTATCCAGGTTACCTGACGGGGTGTCCAAGGAGCTTACTGTCGTGCCATCGCATGCCAGTGTTGCCATGCTCTTCTAACGGACATATCACGAGAGAGACCAATGGACGATCCAGTTAGTGTTTCGTACTGGGTCGGGCTCGGAGGACTCGCCTACGCATAGTGTAGAAACCGTTAGGACATTTGGAGG")) +(assert (= z "aaagcaugacccagcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0352.smt2 new file mode 100644 index 000000000..750f40fd7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0352.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCATCGCTCGTGGTAATGTGCAATGATTGTTGCAGAATCTAGGGTAATCTCCAATTAGCGTTCTCCCCGCAATTCGAACTAACTTTGCATTAGCGGTCCGTTCTATAGGGTGAATAGGCTTACCCCTTAGTTTGTTATGGTGTGAATACCGTCTTCGCCTGACACGTGGTTCCCGGCGCTAATCGTGCGTACTCCCCTAA")) +(assert (= z "ucccauuagagguuaauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0353.smt2 new file mode 100644 index 000000000..2655ea440 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0353.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTAAGGAGGTAGGCTCAGGAGGGTGCGTGCTGTTTCCCTCGGGGGTAAGAGGACCTATGGCAGTATCCGTGCTTAGTGATTCTCCGGACAGAGCCTATTGGGAAGTCTACTATACGTGAACCTTTATATCTCCGCGTGCCATGCCCGATTAGGGACCTCAAGCTTGGATTGATGCTGCGTCAAACGATCTGACGTTCGG")) +(assert (= z "gucauaggcacgaaucacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0354.smt2 new file mode 100644 index 000000000..d9184a72d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0354.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCAATTTCAAGGGATTCACGAATACGGATTCGACAAAAATGCATGACCTGACACCCGATCATCCAAGACGTGAGTATCCAACGGTACGGAGGTCGGGACCGGGCATTCCCCCCCAGACGGCCTGTAACGGGGTTGTGTACTACTACCTAGCGCTGAGTCCGCGCACTTAGTATGACTTCTTAGGCGCCGGACGCTATGG")) +(assert (= z "cccguaagggggggucug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0355.smt2 new file mode 100644 index 000000000..30d8e3760 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0355.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGTGATCGGCTGGGACTTTTACGAGTATGACATAACGTTCCACTGGCGCCCCGTGTTAGCTAGACCTTCGTTAACGGATCGTACTCAGTAGTAATAGGTGTCTCTAGGGCGATTATGTTACGAATTAGTCAGGATAGGGGGTGTGACTTATCTCTTGAAGGTGGCGGCCCATGGTGGAGACGTCCTATCACTGGCACTA")) +(assert (= z "guaccacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0356.smt2 new file mode 100644 index 000000000..e3c131881 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0356.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCGCGCTCTCGGTGTTGGCTTTAAATTCTTTCGGCTAAGCGGGAGTCGGGCTTCGGTAAAGAATAGCGGTATGTCGCCGTTCCCATCAGCTTGGAATAGCCGGCGGAATTCGAGCTCCGTCCCGGTACACGCTTCGGCCGATCAGCGACATGGAGTCGGATTACTTTGACAAGTTGTTACGCTTTTTGGAGATCCCTG")) +(assert (= z "caugugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0357.smt2 new file mode 100644 index 000000000..7ab4673a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0357.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACAGCTTCCTTGGGCGAGCAAGAGGACACTCTACACCTCCGATTTTTACTAGGGTTACTGGTGCCAGGGCAGCATGATCCCCCTGTTGCAAGTAATTCTTAAGTGTAACAGAGGGCGACCTCGTCTAGGTCCTAGCGCATGACAGGGTACGGGACGATCCAGCTAGTTTGAGACCGGTAATCTTATATCTGCGACAGCA")) +(assert (= z "caaacucuggccauuaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0358.smt2 new file mode 100644 index 000000000..4cb92b262 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0358.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAGAGCAATATTGTCACGGCAGGCTCCCTTCGCTTGTGTATTTAACGAACGATGCTGGTACGGTTTTGACGCGGTATACAAAAACTGGGCCAGACAGCCTCTTCATCAAAGGTAACATTTAGGTGATAAAAACTGCGCAGTCACTATCAGTTCTCGCAGATTCGTCTAGATAGCGCGGACTTTCTTGAAGCGACACTGA")) +(assert (= z "gccuga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0359.smt2 new file mode 100644 index 000000000..5d2996bd6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0359.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAGCTCCGCAAGAGTGGTCGGTGGGCCGTATTTCTGTCTATACTTACTAGCCCCGGGAGCAACCACGATCTCCACCGGATCCCGCCACCATGGAACTTCTGGAAGGGAGCTCGACGCGAGTCGCCCCCTGGGAAGGTGAAAGCGTCCCCTGGTTACTCGCCAAGTCGCCTCTTGTATGATTTCCTTGAGTGCTCACGCT")) +(assert (= z "gugcga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0360.smt2 new file mode 100644 index 000000000..cf699ec9f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0360.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTGCGCTCTCGAAGGATAAATCATCCCTAGCGGATTATTTTGCATATGATTGAGGCGCGAAAATCCGTCAAGTCAAATCCGATATAGACAAGATAGAGGGAAACGAACTTTGGTTTAACCGTTGAGGCTCATGTGATCTCCGACTGTACGGGGAGATACAAGAACAGATAGTTTTGGGAACGTCTACTGTGGACAGGCC")) +(assert (= z "gaggcugacaugccccuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0361.smt2 new file mode 100644 index 000000000..96917ac9b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0361.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTCCTGGGCCGGTGGAGTGTCGGCACAAGATCGATCAATGCACCCTCGTCAAAATCACAATTCCATGTATTTGCCGGCCAATTTCCATCTGCATTTCTTCGGCCCCTGGACGTATGAAGGGTCACCCTCTATTCTGAACTCACGGACTCGTCGCATTTGCCTGTCCAGCGGGGGGTCCGCGGCTGCACGTTGTGTCTC")) +(assert (= z "agacguaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0362.smt2 new file mode 100644 index 000000000..ab7461469 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0362.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGCCCTGGGCTGTTTCCGGGCAAGACGGTGACGATTAATTTAACGAAGTGCATTCGACCAGACTCACGCCTTGTTTATATTTGTGTGATAGGTGCTCTGGCTTAAGAGTCAGAGATTTGTGCTAACTGACGGCGTGTTGCACTTGTTCGTAGGGTCAGGAATAAACTTGCTACCTCGATGTCCCACGAGTACAAACAAC")) +(assert (= z "gcccguucugccacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0363.smt2 new file mode 100644 index 000000000..b6a16b851 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0363.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAATACGTGACAATTAGTACAGTTCCGATAGGGCTACGCTCTTCTGTTGTCAATCTAAGGATGATTTTGGTATGGGTTGTCTCACCACGGACCCTATTGATGTTGCATTAATTTTTCCTATTCAGTTGTTAGGCTAATTCAACCAGAAGTGGGCAGGCCAACACGACGCTTCTGCCGACGGCAAGTAAACCAAACTGGTG")) +(assert (= z "uugaccac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0364.smt2 new file mode 100644 index 000000000..9bd36e103 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0364.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATGATCTGTGCACCATAGCATTGACCATCGGATCCCCCGGCACGAATCGACGTGACGGCAAAAGATTATAAGCAAGCATTCTTCACATCATAGTCGGGTATGCGAGCATTGATAGTAATGACTCGTTATGTCCTTTAGTCCTCCGTATGTCTGTAACGATTGTTTTGCTCTCGTCGACCCTTATTTTTAACCAATAGCG")) +(assert (= z "cuaucauuacugagca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0365.smt2 new file mode 100644 index 000000000..1cbecf9d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0365.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTACTTAAGTTGCGGCATGCAGAAGTTTTAAGCGTGATGTACAGTGCCGACATTAAGTTGTCCCAAACTCTCTCGGCAACGTCCGCCAGACCCTGTGGCTGCGCACTCAAATCCGACTGCCCGCTCAACTGGTCCTAACAGGTGTAACCGTTTTGCTCTCTGCTACTGTATAGTCCGGTTACGCTATACTCACGATATG")) +(assert (= z "acggcuguaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0366.smt2 new file mode 100644 index 000000000..f6e231b84 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0366.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTACCCTCTGGCGCCAGCCTGCTCACTGACTAGGCATTCATTAAGTAAACCCGCGATTGGCCTTGCGGACGAGCAAGCTTAGGTTCTCGTCCCTTAGTTTTATAGTATCAGATGTAACCGTCCTGACCATCTCCGGACTGCGTATATCAACCTTTAAAGTATGGTTCGCACAGGGCCTTTACGGGGTCGTGGTAATCAC")) +(assert (= z "augccccagcaccauua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0367.smt2 new file mode 100644 index 000000000..e1eec2fce --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0367.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTTCCAGCAGTCGGACGACCGAAGATAGCGCGCCCCTCAGAAGACCCCTGGTACCCACTCCACCGGCCTAGTCGCACGAAGTCTCGTGCACTTTTCGGTGGGTAGTTGGTGACCACCAATGCGTACTCTACTTTGTAGGCAATTACAATATTTAGGTGGGCTATATTTTGCAACTCAATAGAAATCTGGATCGTACTTC")) +(assert (= z "acguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0368.smt2 new file mode 100644 index 000000000..08afb0fcb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0368.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTATATCGGTACGCTGGAATCCCTCGGAGGAGTATGTACGCGTAAGACCGCTGGTTAAATGAAAAAGTGCACGGTTGTTTCGCTTGCTCAACACAGAGTAAAGTTAGCTCTTGCCTATGCAGACAGTTGTAGGCCTGGCTGGCTAGGCTGGCTCCCATCGCCGACGCGTGCAATTTGGCGTGGTTAGTGCCCGGCCCCTG")) +(assert (= z "cgaguug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0369.smt2 new file mode 100644 index 000000000..259ac6df7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0369.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTTACTCCCGCGATTCACAGACAACCCTCCAGGGGGGACCTTATAGATTGGGAGCCGTCGAAAGGAGAGGTACTTCGCACGTTCTCGCGAGGTTGTACTGAACATAAAGCTGCGTCCTGTCAGCGGTTAAATTGGTTTGACCTCCTGCCTAGGTTTTGAACGTAGTGTCTCCCACTCGGAATGTTGCTCGCAGCCGATC")) +(assert (= z "caucacagagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0370.smt2 new file mode 100644 index 000000000..40ca4cc0e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0370.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAATGAGTGGCTCGGGCAGAATACCGTGTATGACCACTGAAGAACTAGTCTCAGAGCCAACGCGAAGTTCGAATTGTAGTCACACGATGCGAGGATGGTCGGGCCGGGAGCCTTACCGCATGATCCGGCAGTAATTACTTGAAGTATATTCTTATGGTACATCTGTTCGCTATCGGAACAGTCAGGCCAAGTTTACCGGC")) +(assert (= z "auagcc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0371.smt2 new file mode 100644 index 000000000..a035e3837 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0371.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGACCGGGCACACAGGAAGTCTCGCTGATTAATTCGGAACTCGTTAGTAATAAAATGCTAGAAGCTGTTCCGTTACCTTCGAATTAAGCCACCGCACTACCAAAGAAGTTTGTCTTATCAGCTGCGCCAGAAATAAGTCGCCGTTATGACCTGGACATAGAGTGCGTCAGTAGGGTCCCAGGGGCGGCGCTGGCTTGCGC")) +(assert (= z "guuucuucaaacag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0372.smt2 new file mode 100644 index 000000000..b6225aa76 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0372.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTTCGGACTGTATCTCGCTTTGGGTAGGCATAGTAGACGCGAGCGGGGGTAGACCACCAGCCTACATCCGGAGGAGCCAAGTGGGAAGGTTGAGCTGCACCGCACACTAATGATTCCTGCCCCCTTGGTCGGAGTATATCACTCGATCGAACGGATTATCTTACTGAAGTTAGCCCACCACTTCGGATTCGGAGCCTGTC")) +(assert (= z "uggcgugugauuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0373.smt2 new file mode 100644 index 000000000..a5df420c0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0373.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAGTCAAATTCGGCCCGCCGCTAACGACTCGATGAAGGCCAGCGTCGTCGGGCCGTAGTTGTGTCCAGCCCAGGAACCATCAATATATACGTAGACGCGTGTTGCCGATCCGGAAAGGGGCCACGTCCGCAAACTTATCCGTCGGGTACTTAGCTCGCAACATCATACTACAGGTTGGTTGTAACACACACTTCTGACG")) +(assert (= z "uuccccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0374.smt2 new file mode 100644 index 000000000..636ab0e39 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0374.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGGATACGCGTATTAGTGTGACCTTTGGGAAGACCTCCTTCACCGCACCCGCTGTACGCACTGGGCGATTGCCATCGTCTTCTCGTCGAGAATGGGAAATGATGGACTGGTGGAGTGATTTATGCTACCAAGCTTGACCCGTTGCAGCAGTCATATTCATTACCTGCCCCTCTGAAGACCAGATCGATCCCGGTAGTCA")) +(assert (= z "cgguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0375.smt2 new file mode 100644 index 000000000..b7777a7d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0375.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCAGAACCTCCTGGTTTTCCGTACGATCACACTACAATGCATCATAGAACACCCAGTCTTGAGCGGATGAAAATCAACCGCGCGCCTAGCCTCGCGCAGTCGGCGCGAAAGTCGCAACAGGTAGAAAGTCGAGACTGCATATGGACGAGAGCCGACCGAAAATCGTGCCACCAGCTGGGATAGTGGAGATCACCAGGT")) +(assert (= z "ugacguau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0376.smt2 new file mode 100644 index 000000000..9ee5031f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0376.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAATCGGTTTCACCTTCTAGCAGCGATGATGTAAGGTGCACTGCGGCCCGTTAGATACGCGCGAGAGACGGTAGAACGGCCCCAGGGGAATACAGGGATTTGGGGGAATCTCCTCCAAGGCACGCTACAAGTTTCGCACCCGGTCGATAAGGCCCCTCGGGGAAGGTCTCTCGCTACATAGCCCGTGAGGTATTATATC")) +(assert (= z "gcacu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0377.smt2 new file mode 100644 index 000000000..3d7b5bf0c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0377.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTCGAAAGGACGGATGGGGAATCTGTTTAGCTGGAATCTGATGTAGCAGGCGCACGGACCTCGGAAAAGTGTAAATCAATGAGCAGTTTTTGCTTCATTTACAAGTTCGTGACAAACACGTCCTACTCTAAAAGACCTATTATCATCACTCACACAAATCCCATATTGATACAGGGCTAACTGCCCCTCTGTCGGATAA")) +(assert (= z "guuugugcagga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0378.smt2 new file mode 100644 index 000000000..0e6a84b55 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0378.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGGGACACAATACCTGCTAATTACCGCATGGCACTAACCTTCCTAACTTACAGGTGGCAAATAAACTCATAACCTGAGAAGGGTACAGTCAGAGAATATAGGGGCACACCGACAAATATTTCATTCACACGTCCCGGTATCCAAACCCCGGATCATTCTGGTCCCTCGGGCAGTTTCACCGAGTGATGAAGAGCAGAGC")) +(assert (= z "ggaagga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0379.smt2 new file mode 100644 index 000000000..c952b7996 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0379.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATAGCCTAACTTGATCCGCAGCCACTGACCCATGAGTTAAGGAGGCAAAAATACAGGGCAGCACTCGTGCTAATGAACTCCGAATCATCCCCTCGATACTATGGAGAGGCGTTTTAATTTTTAATGTTGAGTAACAGGCCACGTCCGTGGGTAGATGTCAGATCATAATCTGGTGTTTCACGTGAAGATTGGTCTCTAC")) +(assert (= z "gauugaacuag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0380.smt2 new file mode 100644 index 000000000..6a8ca2fa1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0380.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGGATTAGATCGGGATGAGCATAAGAATGGAGTCGCGTTCTAGGTGATACATCAGGGACCACTTGTTTTAGAACGTGCAATCTCAAACACGCGTGGGCATAATCCACACGCGCGTAAAGGAGCAATGTGCTCGATTTGGAGCAGTTTGGGGAGGAGAGCGCGTTGGGTGGCAATCGACTACCATTGTCTGGCATTTTTT")) +(assert (= z "ccuaaucuagcccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0381.smt2 new file mode 100644 index 000000000..05374a120 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0381.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGGGACCGAGCTGAGGTTACTGGCTTGATTAGGGCGATGCCGGTCATGGCCGCATACCAACGTGTTAGATGTAAACAGACTCGCGGGTGTCCGCGTAAACTCTTATCTACCATACGTCACGGCGAGGGCCATTGCCAGGTACTGCTAGTGTAAGAAATTTCTTACCGCCTGGCTCCTCCAAGGCCCGGCGCGAGCTCGCG")) +(assert (= z "gcucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0382.smt2 new file mode 100644 index 000000000..e57559cbe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0382.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACCGTCATACACCGGCATTGTGGATGACTATACAAAGAGGGCCGCGCGGTTGTATGTCAAGTTTCCCCAATGGCTCACCCAATAAAGGCTAACCTCGGATATTATCATTGAACTATAAACGGGCTGACTATGAATTATTTCCTGCAGAGGCGTGGAAAGGTGATCTGCACGGACTATGAGGTATTCACTGAGAGGTCC")) +(assert (= z "gauauuugcccga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0383.smt2 new file mode 100644 index 000000000..6cf7b4340 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0383.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGCTTCCCCGAAGTTCGATCAAACCAGCCCGGCGAAATCCTACCCTTCTTTATTATCCTTAGCAACCAGCCTATAGGTTGAATCTAAGGTTGTGTTCGGCATCAGTAACAAGTTGAGAACATCAGCATCGTCGTCTTATATCATTCGAGCAGGCTCGGCTAAACCTCATTGGGCAAATGGGGCCGCTTCCAGCAACTGGT")) +(assert (= z "aguaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0384.smt2 new file mode 100644 index 000000000..c780d75c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0384.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTTCATACTAAGCAGACTGGATACCTGCCATCACTTCTGAGGCCACAGTGGCCCCCTGGAAATGCCAGAAAGTACGCTCCGGAAGGTCATTGGAAGCGACAGATTTCATACCCAGACACAGCTATACAAGGGAGAGGTCGTGAGCTCTGAGGCTTTGAGAGTCTGACTTCCCCAAAGTTGTACCTTGGTTGAAGGACT")) +(assert (= z "aguauggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0385.smt2 new file mode 100644 index 000000000..d1b790201 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0385.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTAACCCTACAAATGGATGAGGTTAAGGACACACGGAATGTGCGATACACCATGGTCAGCCCGGATATTCGGGGGACACAAGGTGTTTGCTGGGGGGTCTGGATAGCTCGTTGCTCACGACTGTTCAGCGCATCCATCAGGTTCTGCTTCTACATCCAAATACGCGCAAGAGCCTGCTTAATTACAAGACGTTGCCTTTC")) +(assert (= z "guucugcaacggaaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0386.smt2 new file mode 100644 index 000000000..cb4c38f86 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0386.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTGCTCAAACGCCTATTAATGTGCTAAGGACCCGGTTTTCGACCAAAGGCGACACGCCTAATGGCCCTCCTCGGTCCGAAATCGCACTATTCCACTGCGGCAGGAAGACGAGGCGATTAATCGAGTAGTCTGTCTTATTGGCCTATGGTACAGCGGAAAGAGGTATAATGAGGGTAGAGGAGACCTCACTGCGGCAACG")) +(assert (= z "cgccguugc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0387.smt2 new file mode 100644 index 000000000..9d1c628df --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0387.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTGTACCAAGTCCCGGGGGTTTTCAATGAAGGAGAAGCGGATTCTCAGGTCTCGAAGGAGTGGATAGTACCCACCAACCCGCACCGCTTGTGCTTTATTTAAACAACATCGGATCTGTCGAAGCTTAAATCTATGCGTGAATTCGATAGGATTGCAGCATCCCGTGATAAAGGGTCACTTATCAGTAGCCGAGTTCGTG")) +(assert (= z "cagggccccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0388.smt2 new file mode 100644 index 000000000..f8e83ee4f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0388.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCCCTAACAGAGAAACCCGTTCAGCACCAACGACGTCCTGCGTAGTTAGAAGTGAATACAAAGCGAATATATCATAGCTCTTAACTTATATTTACGTTGCATGGATGATTCTCAGTACGACTTGCTCTCAGATTGAGTCCACAAGTAACCCCTACCTTGGGGGGTGCATGGCGGTGAAGATGGACGGGTAGTGCATACAG")) +(assert (= z "ugcugaacgagagucua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0389.smt2 new file mode 100644 index 000000000..44f3fcad9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0389.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGCGGGATAAAAAAGCGGTTTCCGTTTCCACCTGGGGGCATATATTGCATCGGATCTGAAAAAGCCCGGCGTCCTTTTGGTAATGGACAACTATGTCCCCAGGCTACAACCATAGAGGCGTTGGTCACTGTCCTTAGGTGCGAGCCCCACCCGGAAACCTTCCACGGCTCTTATTACTCCCGCAGAGGGCGTTTTGGGA")) +(assert (= z "ugauacagggguccgaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0390.smt2 new file mode 100644 index 000000000..acd10c7f3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0390.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGAGTAATAGCCGCACTTTTCCAGTGGCAGGAGGGAATGCGTATTTGATGGGACAGTGAAGAGGGATGCTGGTAGACGGTCGAAATGATTGCGGGATGGGACGGCTGCGTATTTCGACTGTCTTTAGTCGATGATTGGCGGAACGACGACAACACCGTTGCGATAACGTAGAATGTCCAGGTAGTCAAAGGAGGCAAGG")) +(assert (= z "aacuacccugucacuucucc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0391.smt2 new file mode 100644 index 000000000..162509a1b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0391.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CACGGGTCCGACCTTTGCTTGTGGGCGGGTAGAGTAGTTTGTGGCATCACTACAGACAGATTCTGACAAACGGGGAGCTTGAGTCTCACATGTATATCGTAAGTTCAAAAATCTGCGCGCGAGGTAAGAAAGCACGTATGCGATGCTAATAAAGCTCGTAGCAACTCGGAGGCCGACCAATAAAATCCGCGTTGACCCAT")) +(assert (= z "aaguuuuuagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0392.smt2 new file mode 100644 index 000000000..75becfecb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0392.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAATTCAAGGACCCAGGCGTCGCACGCTCCAACTCGAATCATTATGGTTTATCGATTTAAGCACCAGCTTGGAATAGGAGGGAATCCATCAGAACCTAGGCTTTTTCGAGTTTTACAAGCGGGCCCTAAGTCGTGGTGCTGGCTTCGATGTGGTAAGATAACTCACCGAAGCCGTTGGCCTAGGTATACTTTCATCGGTA")) +(assert (= z "uagcuaaauucguggucgaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0393.smt2 new file mode 100644 index 000000000..3f08c66a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0393.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGTGCCCCTTTAACGACGAGTGAAGGACGCAGACACTCCACCCTTAGGGTCCTGTAAGCAACTTAGCCAGACCTCACCTGTTTATAGCCATTTGTTATTTTAGCAGTAGGGCCGGGCTCCGGGAGATTAGTCACGCACTGAATCAAACACTTCGCCTACTTAAATAATCCCCTAGAGCAATATCAGTGCGCTCGTTACT")) +(assert (= z "aggccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0394.smt2 new file mode 100644 index 000000000..1017ab117 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0394.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTACTTCCCAAGAGGGGCCCCTTGAGATAGATGGCCAGGAATATTATGCACTGCCGTCGATATTGCCCTAGTTCCGTTCTTCCCCGACACTGGCCCCACTTCACTCATGAACTATATCTGATTGGGCACTAGGGAGATCTCGTGATTCTCCGAATAGAATCACCTAATCCATTGATCATGATTAAAGCATTACCAGTGTT")) +(assert (= z "gucac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0395.smt2 new file mode 100644 index 000000000..ea9b7c678 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0395.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CATCTCCAGAGACGGGCAGCGAGCCATCTGACATTATGCTAGTCAGGGGGCAGGACTATCTTAGGGGTTAAGCCGCTCGACGGCTCTTTAGTCAGATACGGCGAGTGGTAGGTATGGATTACCGGCCCTGGTCGTATACACCGCCTTTAGCCACCGGTACTTCCGATTCGCGCAACATGGTATGTGATTTTACACGGCCC")) +(assert (= z "guuguaccauacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0396.smt2 new file mode 100644 index 000000000..14e5790c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0396.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTCACCAGGTCCGCAACGTTGGCTAAAGTCATATGAGTGCGCGTCATGCCTCTTCACGCGATCTCCACAACGAGAGGGCTGTTTAGCGAGATATCACGAATGCTGTTGAGCTATCGGCCGAGTAAAGCGGAGGCAGCTTTCAATTAGCGAGCTTTTGCCGAACTGGGCATGCCTGAAGTGAAAAAGTAGCAGGGCCCGC")) +(assert (= z "aacucga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0397.smt2 new file mode 100644 index 000000000..4db0c3f80 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0397.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCCGCTCCTGTAAGTAAGCTCTAGGAATTACACTTCTTTGGACACCATGTGGGTGTGCCCCAGGGCAGGGATGCCTCCGTGGCTGAATCGGTCGGCGTGTTTTCAGATTCACCATAACGGCCGTTTTACTGGTTCCCCATGACGATGAGAGTAATCCAGCTTGCGAGTTACTAATCTAAGTTACGGAGTCGTGATTGAA")) +(assert (= z "guauugccggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0398.smt2 new file mode 100644 index 000000000..0b6694b83 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0398.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATAGCAACAGGCGAGAACGATGTCGTTACCCGATTCAGGAAACGCAGGACATTCAGTTGCCCCCCCCCGGATGTAGTATATGGCCTTCCCCCGTCTGAAGCTCAAGTAGGCCAAGCGCCCCCATAGAACGCCTGGTCCGCTCTCGCGTTTCTTGTGTCGTATAGGTAGCGAGACGACGAGCGCACTTTCCGTACCCAAGT")) +(assert (= z "aucguuguccgcucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0399.smt2 new file mode 100644 index 000000000..ef63b58a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0399.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCTGTGCAGAGGCACCATGTGCTAGCCACGGTTCTTAGCGTATGTCCCTTGCCTCATACGATTCCTCATGCATTGTACGCATACGGAGGGAACGTATCCTCCCCCAGAGTGGCGCGTCGGCCAGGTTTAACCATGATCGACCCTTTTTTCGTTGTAACCGTGCTAATTCGCCTTGCAGCGTATCAAACCTTGAAACCGA")) +(assert (= z "auuaagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0400.smt2 new file mode 100644 index 000000000..19bbe4fd7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0400.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGTGTCACGAATATCTGCGCGAACTTGCAACGCGATCACACCTCACTGTCTACCCCGTCAATTAGATGGAAGAGTATGCGATGGGATAGATTATGAAGCCCGTACGCTATAGAACTGGGGGCAAGAAGAAGATCTGCCCTCGACATTTCAAAGTTCCAATGCATTTTCAATCTGCCTAGCATTGGTATGGATGGTTATC")) +(assert (= z "ucgggcaugcgaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0401.smt2 new file mode 100644 index 000000000..b3bc6c646 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0401.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACTACGAAATCGGTAGCAGCCGATGAATCCGCTATTCATGGCGTATCCTTGATTTGCAGCTCTCAGAAGAACTTGACATTTGCGCTGAGTCCCACAACGGCGCCGCGTATCCAATGGTCGTTTCTGATTCCAAGCCCTGAACCGAAGGGGACCACAGATAATGTCCGATAAACCATGCTATCAAAGAGGCCTGGGGAGG")) +(assert (= z "ggcuuccc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0402.smt2 new file mode 100644 index 000000000..3c7981ca6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0402.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGGCGTATTTGGTTCGCGACGGGGCCGGTCTCCACTCCTAATCACAGTTTAGATCGGTGGGAAGCAGTGCAGGATACTAAAGAGGCCCGTCCTCATCTCGCTCAAAGGGGATGGACATTGGACACTTGAACCTAATGTAATTCATGTCAGCTGTCCTCCCCATTGGCGAAAGTAGGGTATGGTTCTGAAGAGTGACGA")) +(assert (= z "uagagcgaguuuccccua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0403.smt2 new file mode 100644 index 000000000..13257cafe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0403.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTACAGGGTTAAACGCTCCGTGTAAGCCAAGTAGTTTTCGGCACAGGACCCTGAGGTCATGAATTCGTCCCGTCCTTCGGGTGGGTATATACAACAGCGGACATTAGCGGACAAAGGTTGTGACACGGCAGTTTTGAGGTACTGCGGCAGGGATATTTAATCTACCAGGCCCGCGCTGCGGTTGTTGTGTAAGATTCGT")) +(assert (= z "aagcag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0404.smt2 new file mode 100644 index 000000000..220751219 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0404.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTTCAGTACTGAGGAGCATGGCTACTCACATCCAAGTGTGTGCACAAAAAATGCTTCATGGACTGGGCATCCATTCGTTAACGCACACTCCTCTATCCCTTACTAGCATATTCGAAACCCATCGAATATACAGAATCGATATAGAGCTTTATCAGAGTTGCCCTAGTTAGGAATGATATGGGGGGTGCCACGTACTTAG")) +(assert (= z "ugacccguagguaagcaauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0405.smt2 new file mode 100644 index 000000000..7bfb3cf93 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0405.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTGAGCCCTTTTCAATTATAGTCCAGGGGGTGCGGTACACTACCTCGCGCGACCTAACAGGATATCTCATGTAGGCTTTGAGACCGGTATCGAAAAGTTTTTAATAAGCTGCAGCTACTGTTCCACAGATATCCTGTGTGAAGGTAGCTAGCATCGACAGCTATATCTGCATGTCCTCTCATTGCGTCTGAAGAACATC")) +(assert (= z "ccaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0406.smt2 new file mode 100644 index 000000000..8fdbf9a3c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0406.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAACTGAGACACAGAGGTGCGTACCCTAGTTACTGCAGATGGCCCACTCATTGCATATGCCGTCGAGCTCAGCGGCCTTATATACAGAATTCGTACACGCAAAGTAAGGACTTCACTGGAGTGTACCGTCAACCTGATCATGTTTATAGACTGTAAGCCTGTTTCTCTCATCTATGCTCTGCGTATACGCGTGTATGCGT")) +(assert (= z "aguacaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0407.smt2 new file mode 100644 index 000000000..3249fcef7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0407.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAATCACTTTGGTCTCATGTCGGGTCCTAGCTTAGCGTCAATTATCCATCGGTTTTAAGTCAGCGACGTATCCGTTGCTGCGGACGAGGGTGCCCACGAAGTAATCATAGTACCTATTCGGCATTCGTCGGGCTTTGACGCAGACAGCCCCTACAACCTGTGGCGGGTCTTACGAAGTTCGCTGAAGTCCGTGCAGTCCG")) +(assert (= z "uaucauggauaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0408.smt2 new file mode 100644 index 000000000..9435a201c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0408.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTCAGGTGAAAGGCTATGCAATTCTTGTATGTATTCACGAAGTCAGAGATAGACAGCTTTCTAAAACTACACAAATAGATAGTCGGGCGAGACGCAGTATGAACCTAATGACATCAGTATTAGACAGTTCCATCCGCAACGCTCTTTCATCTGTAAAAGTGCTTGCATCAGGTAAGGTTATACTATCTGACACAGTGCC")) +(assert (= z "guugcgagaaaguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0409.smt2 new file mode 100644 index 000000000..3761136fd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0409.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAACAGACATGCGGGTACTGGGTAAGACAAGTAAGGGAAGACTGCGGGGCAGTGTGCTTGTGCTTGCATGGTTCAGGCATACTGCACCCGCTAACCGGGACCCACCTCGCACTAGTAGATAAGTCTTAACGGCTCAAATCGTTGTTATAGCTCACCAGTCCGTAAACGCTCCCAACGCTCCAGCTGATTCAGACTCTCAA")) +(assert (= z "aucuauucagaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0410.smt2 new file mode 100644 index 000000000..e7952e9e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0410.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACTGTTAAAGTGCTAGGCGCTTTGATACCCCTGTGAATTTCCCCACTCTGCACGACCTTGACATCGCAATTGCTTCAAGCTGTAGAACGGGATAGCTTCCACCGAGTACAATCCTAATTTGTAATGACCGTATTCGCGAAGGCACGTATTGTCGCTAGCACAGTGGGAGACGAACTCGAAGAACGCTGCCGAAGGTGGC")) +(assert (= z "ugcauaacagcgaucguguc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0411.smt2 new file mode 100644 index 000000000..59eabb94f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0411.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCACTAGAGCCATGTTTGCCCTTGACGGTGTAAGGGAAATGGAAGCAGTATGAATGTCACACCGGAGGAAAACTTAAGTAGGGAGAGAGCGCGTAGATCAGGTCTTTTTAGATTGACTTTTAACTTCCCGGGTCTACCATAATTTCTTTAGAATACGATTTCATTTCGGTGTTTGCTTCAGGGTTCGGGAGTATTCACG")) +(assert (= z "ugaauucaucccucucucgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0412.smt2 new file mode 100644 index 000000000..6ad0371cf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0412.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCTCTTCCTGACGGCTACATAGATATGCTACTCAGGCCATACGTTTATGCACAAGGTCATAAAGCGTCAATGTGTACTAGTGGGTCGAGTTATAGCGGGCTTAGGTACTATGTTACAACGAGCGCCACGGCCGTTACACAGGTCGCGCATCCCGACTTAGTCCTCAATCGCCAGAGTCAGCGATCGCAGCTGGCCCGAGA")) +(assert (= z "gaaucaggagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0413.smt2 new file mode 100644 index 000000000..f26ad5509 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0413.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGGTTGGACTTACAAGGCTTGAACGTTGGCTATGTATTACTGAGCGTTCATTCTACTAGTCTCGAGTATGACACAGGGGAGCGGGCAAGTCGACTATTGGGGTGCGTCTTCAATACCCACTGGTGACGACGGAGTGTCCTGCTAACAACGTTGCCTAACGCTAGATCTAATGAGGTCACGCACGTTTCAGGAACCCGACT")) +(assert (= z "uguccccucgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0414.smt2 new file mode 100644 index 000000000..cf1e3b3df --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0414.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGTTCCAAACTCAAACGAGGATTCTTCCCGAGGCGTAGTCTAGGCGAATGGCTTGATATAGGGACCAGTTAATGCCTGCCGACGCGAAACTATATCCCCAAAACCTTATGTGGCTGAACGTCACTCGGTCGTGTGTTAAAGGAGCCATTCAGATGCGCTTAAAGGACTTTTGGACTTCCTTATCGAATAAGAGAGCTCA")) +(assert (= z "uaagaagggcuccgcauc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0415.smt2 new file mode 100644 index 000000000..8328c74bd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0415.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGATGTAACACTGTTCATCCCTCGTGATACTATGTAGCCGTAGCTCCTACCGGCAGGCATTTTTATACCCTTGGGGCAGAATGATTTACCGACACGCACAGACCAATCACGGCTTTGCATTCTCCGCCGATGGTATACCATCTTGGCTATCCTTAACGACCGCTGAAAATACATCACACGATATCGTGCATTCCAGGTC")) +(assert (= z "uaugauacaucggca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.smt2 new file mode 100644 index 000000000..1254a6061 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAAAATGAGAGGGTTCCTATACGATGTGTGGATGGCGCCTTGCTCAACACCATCGCTCGTACGTTCCGGGAGCGCGAATACAGCTGCAGATATCACCAAAATACACTCGTCGGTATCCCTGCGTAACATCAAGTAATCGGGGTAGGGGTAGGCAAACATATGGTCCCATTGTACATTGATCGGTGCAGTTTGTTTGTGTA")) +(assert (= z "agcaugcaaggcccucgcgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0417.smt2 new file mode 100644 index 000000000..7fc0fee28 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0417.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TATACACATAGGGCGCCTGAGTGGCTAACCCAGATATTCAAAGATCCAGCGTTTTCGGGCAATAGTGTCTGTCGTTTTCGAGGTACAGTAGGATGTGGGGCAGGGAAACATGAGCCAACCGCAGTTGCGTAGGGTTAGGCCCTAATTTGACGATGAGGAAGTGATGAAGTTGTCTGCCTGTTCTACGCTAGTGTGGACCG")) +(assert (= z "acuucaacagacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0418.smt2 new file mode 100644 index 000000000..0628ddbc5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0418.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGGTGAAGTCAAATGAACGTAGCCGGACACTTAGTACCCGATTAATTTTAGACAGTCCATGTCGAATACCTTCCATCTCTGATTACGCCGTTTTATGGCCCCGCCGTCCTATATTTAGGATGTTTTCACCCGTGTGGTCTAAACGATCGTACTACCGAAATTGTATAGAAGTGTGGCAATACCGGAGATCTGGCACTTG")) +(assert (= z "ggccucuaga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0419.smt2 new file mode 100644 index 000000000..917f6bb3f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0419.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTATTCTTTGAACCGATTTTCATGACTGGGAGCCGACAAAAGTCCTCCTATACGCCTCGGTATCAGACGTAGCGCATGGCAACCGAGGCCGAGAGCCCCGCGCCCGCCCAGACTGCCTATGGTAGCTAATGTCCAAGGGGGTAGGAATGCACTGCCGTACGAGGAGTCAGCTTTCTAAAAGTACTGTGCTATCTAATTA")) +(assert (= z "ccccauccuuacgugacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0420.smt2 new file mode 100644 index 000000000..518af26c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0420.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAATATGTAGATAAGTTCAAGTGAAAGCGCCGTCGGAGGCGGACCATATATCGGAAACATACCACATGAGTTAGGTGCGGAGATCAACTCGGACAATCTTAATTAAAACTGAGACTTTCCAGAGCCTTGCTTTCGCAGCCAATCCCTCGCACGCCTACGGACAAAAACCTTAACCGTTTTACTTACAAAAGCAAATTGAG")) +(assert (= z "aaauga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0421.smt2 new file mode 100644 index 000000000..655f9e2a7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0421.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGTTCATGTTTAGACCATGTGAGTTTCCCCTACGGTCCGACTCCAGTCTGCCATGCGGTTTTCAGCCACGTGGTGGCGATATTACTGTACCGATGTCCACTCGGCTGACCTAATCAGCATGTATCGTTAGTTTTTTGGTGACTGTGTACTCACTATAAGGTCTTCACCCGAGGGAGTGGAGATAGCACGATTTACACCGC")) +(assert (= z "uuccagaagugggcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0422.smt2 new file mode 100644 index 000000000..8aefc5598 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0422.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACTAATCCACACCTGGCCAGTACGCACGTCAATATTAATAACGTTTTCTATAATCACCAGAAGACGTTCTGGGGAGTCTTCTAACTCCTTGGAGTGGGCCTCTACGGTGGTATGGGTACTCAGATCAGTCGGGTCCATTGAGCGGTCTCGCTTTTAATTCCGACATCATGGTTCGTCGTCTCCAAGCTGTACATGGAGTT")) +(assert (= z "uagugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0423.smt2 new file mode 100644 index 000000000..13485c0b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0423.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGACTGAGGCCATGCGCTTAACGACTCGTCCAGGCGGGGAACCCCCTACTTGAGGATAGGACCGCTATCCTAGCCCCGGCAGGAAAGTGATCCGAGGTGACATATCCTGCAGGTGGCGAATGCGCACAGATTCACTACTGCAGTCGGGAAGACATCCGATACCAAAGTCCTCTCTGGCAAGGAATCAGTCGGGCGCCGG")) +(assert (= z "acuaggcuccacugua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0424.smt2 new file mode 100644 index 000000000..78bc3cdc4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0424.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACTATATGACTCGTCTCACATGCAGTAAACACGCCTTCTTATGGGGCGGAAGGTGGACCTATATTAAAATCAGGGTCAAAGCGCAACATTTATAAAAAGCCTTGTCTTCGCTACGTACGTACTTCGACGACAATGTCCTATAATCCACCAGTAAATGATAGTTGGGAAGGGGACTCTACGGGCGATTCAGATTGGGCGA")) +(assert (= z "uggauauaauuuuaguccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0425.smt2 new file mode 100644 index 000000000..30c3c7765 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0425.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTCAGAGGAACAACATTCCCTGGTTGAGCGCGGTCCCCCCTACTGAAAGCTTTCCAGGGTAGAAGCAGGCGCACACTCAAAGCCGAAGTTCCTCAAACCGTGGCCTTCAGTGCGGCTTCGTGTTATGCGAGAGAGTTCCTGGAGGCTTGCAGATCGCTCGCTGCTATGATTGATACTCGGAGTATCGCGCTGGAATAAA")) +(assert (= z "gcgacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0426.smt2 new file mode 100644 index 000000000..50ecfa774 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0426.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTCCATGCATTCTAAGGAGTTTACGACATAAAACGCTCCATTGTTAAAAGTGCAGATCATGCACGGCGATGATGAGGTTCCCAAACTTGCCTCTCTTTCAGATCCGGGTCGTCCCGGGCGGGCAGTTCATCTGAGCATCCGATAGTGAGCCTAGGCAAGGTTGTTCCATGAAAATAAGGAATTACCCGCAAATCACGTGT")) +(assert (= z "agguacguaagauuccuc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0427.smt2 new file mode 100644 index 000000000..45ac5b22c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0427.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCGGCGAGCTAGACGTCGGCATTATGCGTGGCCACCCCACCCGCGAAAAATCCAGTCATATGTTTGTTTGTAGCCAGAGAGTGTCCTGGAGCGCTACAGTCTGGTAGCGCCATCCTTAAGAATTGCTAATAGCGCTGACGTGATCCCCGTTTGAAAACTGATACATCTTCCGCACCGGCATGGTAACAATATAGCACATC")) +(assert (= z "cauuguuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0428.smt2 new file mode 100644 index 000000000..6ca36f083 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0428.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCAGGTACTAAAGCATTCATTTTTGCCCCGACTCGGATTTTTCTTGAACTTGCTTGTAGTAGGTACGTCCGATAAGTGGTCATCTAATCATGATGATGGCGAGTTCCGGTGGACGAAGCCTCGAGATTGGTGTGGTTTCCTTGGATCCCGTGTCTAGAACGGCGCCTCGCGCATATTAAAAAGGATTAAACCAATTTCT")) +(assert (= z "guaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0429.smt2 new file mode 100644 index 000000000..b41f1ade8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0429.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATATCCGCATGTTGTTGTTTACGTGCGACGGGTCCTGAGTTTTGACATGGTATTGGTATGAGAACTATTCCGTAAACCTGCTTAATCGAAACCTCCAGGCATCAGGTATCGGGCATTGATACGGACAACAGTAGCACACGTATTGACCCTCCGCCGCGTACGTCTCTGGCTCGGAGTCAGCACCGGGCCATGCCCAGAGC")) +(assert (= z "accgagccuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0430.smt2 new file mode 100644 index 000000000..07e51d424 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0430.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTCACCGAGAATCAGCCCAACGTCCCACCGGGCACTGAGAACCGACATACTCAGCGATCTGCGAGATCCAAGGTTAGTGGCCACTTATTTCTTTCGCAGGTTCCCGACAATTTCTTTGCTTGCTTGCCTGCTAGTTGGGACGGTTCGGTCGGCAAGGAGCTCTTATGCCTACGGCCACATTGTTGTTTCATACTTGCCAC")) +(assert (= z "uuccaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0431.smt2 new file mode 100644 index 000000000..7bba0f64f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0431.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGTGACCTCAGTAAACTAGTCGGTTATCATACGAGACCCAGTTCAAAGTGTGCAAAGAGGCAGTCGTCCAATTGCACTATAGAATGTATCTCTGCTTCTAACACCTTGGCGGAGCCGTTATCCCGGGCCCCGACAGAGTTAATAGTATTTCTACGGGCATTTGGCTGTCAGGCGAGTTGGGTACTATAGCAGTATCTCC")) +(assert (= z "cugggucaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0432.smt2 new file mode 100644 index 000000000..4337a5dde --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0432.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATACGCCCCGATGCGTGCCTTGCATTGTGGACACAACGACTCGACTCCGAGACGCCAAGTATACACTTTCACCGGTACTCGACAGTTGGTATAAGCCCGTTAGACCGGGGATAGCGGCGTCCAGGCATCCACCACCTTTACGGACGATGCGCATCCAAAGAAGCATCCCAAATTACAGGGACCTTATGAGCCTACGATA")) +(assert (= z "cgguucauau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0433.smt2 new file mode 100644 index 000000000..9e560c131 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0433.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTCATAACACGAGTGACCTGGTTCCCTCGATCCCCTGTTACACCCGTACCTACTCGTTGGATAGCAGGAAAACTTCAATATGGGTCGTCCTCCCGACGTGACAAAGTGGGCTGACGCCATTCCGGTGTTCGAGTACATGTCTTTTTGCGTTAGCATGTTAGCGCCGGAGCAGATGACTGCATGTAATGCGCTCTAGTACA")) +(assert (= z "gccacaagcucauguaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0434.smt2 new file mode 100644 index 000000000..9508301c9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0434.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAGGGTTAGTAAGCGTTCACGTGCGGTCCGTATTAGCGATCGACATCAGGGGAGAAACCAAATCCTGATTGCGGTAAACATTACGGGTCAAGCTCTACTGTGCGTGAGAATAAATTTGCAAGAGAAACATACACGCCAGCCACTGCGTGAAGGGTGTTAAAATCTCAAAGATAGCCCGACGTCGTGCTACTTTGTACAG")) +(assert (= z "uuuggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0435.smt2 new file mode 100644 index 000000000..ec6d56c46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0435.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTGTGTGTAGCTTGGTTATACCTGTAATTCAATTATTGCTGCCGATGTGACGTGCCAAACTACTCTTTATTTAGCTTGGAGCAGGCAGCCTCTATACGACGATCCTTTCGTCCGGAAAGTATGATAAGTCCTGGCTATAAATTGAAACCCATAGAATGCAAATCCGATCCCCATGGGAAGACCAGAATGGAAGGGGCGC")) +(assert (= z "aucuuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0436.smt2 new file mode 100644 index 000000000..357650685 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0436.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAAACAAAAGGTCACGGGCGCCTCACGGAGCGGGAAGACTACAGGCCTGGGCTCCTTACTGGCTATGGTCGGCTGAGGGAGGGCCATGGATATAAAACTCCCCTTTTTGTCTGCATTTGTGATTGTGCGTACATTGAGAAGGCTTGCTGTATAACACGCTGAACCTGGGGAAATAGAGCAGCCTTGCGGGTGCCATCGGA")) +(assert (= z "cgcau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0437.smt2 new file mode 100644 index 000000000..c652e00b9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0437.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGGGCGGCTTGATTACGGCTGTCTCGACCGATGGTTCGGAAAGCAAATTCGGATGTGGAAGTTGGGGCGGAAGAATGCTCTCACATCCCTGCCTGCATTTACTCCACGGAGTAGAGTCCGAACAGTCACCACACGCAGCTGGCACCCACTCGGGTGGCCCCTTCATAATCAGTGATTCGGTCTTTCATTAGACCCCCCA")) +(assert (= z "aguggugugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0438.smt2 new file mode 100644 index 000000000..f535350c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0438.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATCGCACAGTCTGGCAAATCGGCAAACGTTCTATGATGGAGTAATTCAACCCACAAGGTGTATTTATTAGGGTAGGATAACGCAAACCCTTGTCCTGTCAATATGCGTGTGAGCCTCAACAGGCCCGAGTAGTGAAATGGGCCCTCGACTCAAGGTTAGGGGCCTGAGTCTCCATCACGCATGGGATACGCCTGAGACA")) +(assert (= z "ccgggagcugagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0439.smt2 new file mode 100644 index 000000000..490f57ce7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0439.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTTTCGACGAGAGATACACTCCCTGCTAATACCCATTTCGAATGTTACCACGCGTATACCCGGAGGATCGAGATTTCTCGAGCTCTTCCTGTTCTCGCGGGGGACCGGTACAGTATGGGACTGGAGGGCGAGCAACCGAAGGCCTCCGTGTTGGTACGCATTGCAGTTCTATTCACCGTCAAATCGCCAAACTTCCGACC")) +(assert (= z "aauggugcgcauaugg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0440.smt2 new file mode 100644 index 000000000..8e9664cd0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0440.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAGCCTAAAGGCCTTGGAGACACGCGACTTCCCACGGTCCTCGTTGCTGAAAAGCACATTTCGCCTTGCGCTACTGGGATAACAAGCGGGGTGAATGTTTAAGAATCTCATCAACTGGTCCGCTACCACACGGATAATCCGTGTATCAGACAACCGTTATCGATTTTGCCAGTACGGATTGTCTTGGCAGTTTTGTTAAG")) +(assert (= z "ggagcaacgacuuuucgug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0441.smt2 new file mode 100644 index 000000000..dd037cde2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0441.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCCAACTGCGCCGGAGCCTGATGATCCTTACCCCTCGTAAGCTCTCTGGGTTGAGGGGGATTGCCGATTATACCACACAAGCTTCCGGGTCCTACGAGCAAGTACGAAGTAACTAGCGGTCCTGTAACTAAAGAGAAAGAAGTACTGTATCCGTCGACAATAAACGTCGTTGATTCATAAATCATCTCCAGAGCTGGGCC")) +(assert (= z "uuauuugcagc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0442.smt2 new file mode 100644 index 000000000..60c4113ce --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0442.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCATCTAGTTGCTAGAGATTTATCGAACCCTATGGCTAATCTAATTTAGTGCCAGTAGTTGTTTATGCAGCGTGATGCGGACCTCCAGAAGGTCCCCCAGGTCAGACCCACACATAGCCTACTGATGGAACCGATGGCATAGAGGCATGACGGGGTAATAATCGAGGGGTTACAAACGCGCCGCTAAGTTGGTTCTGAC")) +(assert (= z "aucggaugacuaccu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0443.smt2 new file mode 100644 index 000000000..4ee58733d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0443.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCGCTCTTCGGCACTCATATACAAGACGCCCCGGTTCACTCTATACGGTCATAAACGAATGTCCTATTGGTCGATAGCGAAGCTCGTGGCCATGGCTCTGCTAGTCCAACAAGATCGATTCGTCCGGGTCAGTAGCCCGGGAGGTTTGCCCCACATGGCCTACGTGCAGATACTGTGCAGTCAAACCTAAGAGTCTGGAC")) +(assert (= z "ucaguuuggauucu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0444.smt2 new file mode 100644 index 000000000..f8e17c88d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0444.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGTAGCACCGGACTACTCGCGGGATGAGCAATGACGAAGGGAATCCGGGGATAGCTGCCATAACAATGGGTGGGACAGTCTCGTGTTGCTGGCACGTAATGCATTGGGGTTTCAGTTCTTGGAGGCTCCCGATTTTATAACTTGCTCCCACATGGTCCGTGCCCCCAGTAGCCTTCGTTAGTCTTTCCATGCAGCCTCCG")) +(assert (= z "cauuacguaaccccaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0445.smt2 new file mode 100644 index 000000000..2bd55803d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0445.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGAGTTGCGGCACCTGCAAGTCCTCATAGCATGTAGAACTCCCAACCTCCGAAACGTCTCTTTATGCGATTTTAGATTACCGGTTTTCCGCCACCCGAGCGGCGGCGCTCAGGTGATAACAAGTGGGCAATGAGAAAATAATGGTAACCTGTGTACAAGGCGCTCGGAACTGGATTATTTAGGGGTTCACCCAATAGGAC")) +(assert (= z "guuacucuuuuauuacc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0446.smt2 new file mode 100644 index 000000000..6fbee31ff --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0446.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCCATTCGTCATTGAACACAAGCTTGTTGGATCCAGGGAGGCAGTAGAATTCGGTGTCAAGCAAGCTGATGATCCTCGGGTAAGCACCGGTTAGCGAACAGACTTTGAGGCTAGGTATCAGCACTGGAAGTTCATTGCAACTACCCTCATGTACGACGAGTCCCGAGGGACTCGTAAGGGGACCATATATAAACGTAG")) +(assert (= z "ugcuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0447.smt2 new file mode 100644 index 000000000..4618022d4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0447.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTGCACATGTGCCTAGGTTGGCGTAACGGTTATTCAGGACAAGGGGTCTACGGTTCTTCTCGCAGGGCGCGCTTCACGCAATATTCCTGTCCTCGGCAGTCTTTGTTGCTCGGTGTCAAGTTGAGGGAGGGTTGGTGGACGGCAATGCCGAAAATGGTTGCGTATCGTGGCTTACCTACGCATCGCGGTGTATGTGGCG")) +(assert (= z "caagaagagcgucccgcgc")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0448.smt2 new file mode 100644 index 000000000..f763894d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0448.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AACCAGCTTGCAGGGGCTTCTAACAAAAATCTATTCTGTTTGCGTGCTCCGTCCCAACTTCATGAGCTTTTCCGATGAGGTTTCATGAATGAGACCGGTACTTGCCAATCTCGGGAATCGCAGCTTAGACGATGCTTCGGGGTCAGGTAATAATCCTCTAAATCAGAGCGGTGGCCCGTTGGTGCAACTCGAGCGACAAC")) +(assert (= z "ccaugaacgg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0449.smt2 new file mode 100644 index 000000000..cda2287a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0449.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCTGATACGACAACACCTTACGCAAAACGTGTTAGTTGACTCGGGCGATCCAGGTCTTTCAGTATTCGAAATGAAGAACCGGAGTAATCGAACAGCCAATCACCTGATCTGTCAATGTAATGGTCTATTTACGGCCCCCTCGCAGGAATAACGGAGAGCTAGGTTCGACATAGCCACTTTCACCGTCCGTAAATTGCT")) +(assert (= z "agucauaagcuuuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0450.smt2 new file mode 100644 index 000000000..3382db613 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0450.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTTATGGCCGTTGACGCCTCGGCTCGCTGGTTCATAGCCGCAGCAACAAGAATGCGTGCTACCCCAATCATTGGCACAGGCATTGAAACGTCAAGTCCTTGCGCTTCGACATGTGCGATGCAAGCATTGGTGCATATCGCACTCTCTCCAGGTCGATCCAGAGCCCACATGCCGGGCGCCTTCGTTATGAGTAATAGAA")) +(assert (= z "agcguga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0451.smt2 new file mode 100644 index 000000000..b03d5290e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0451.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCTGCGTGTTAACCAGGGTATGCAGACTCGTACTAATTCGTTTAGGATCCTCGAATTGGGTGGAACAACGTAGATCACGTGAAAAGCTGTGGGTGCTGACTACAGTTGCCGTCCATGGATAGACCATCAATTTGAAAACAGGTGATTAGTCATAATAGATAGGACCTATAAGTTGCTGCAACCTGGTTAAGGCATGCG")) +(assert (= z "gauuaagcaaauccuagg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0452.smt2 new file mode 100644 index 000000000..db7c03678 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0452.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGGCAAACAGAATGACGCCCTATAGGCTGTCATAGCTAGTTTGCAGCCAAACCAGCCAATCGTTAATTTGACGGAAGACCAAAGGTACCTACCACAGTCACCTTTGCTTACCGCGTGTATTAAACAAGGGATTAAGTTGGAGATCTAACAAATCATGTACAAATACCTGCCGGAGGAACGCATGTCATACTACGACCTCA")) +(assert (= z "guuuaguacauguuuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0453.smt2 new file mode 100644 index 000000000..6be3615e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0453.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGTATGATTCACCACGCCTACAAGTGAGCTCGTCGGCAACCGAAAAGTGATTTACCTAATCCTCTACGTACTTATCAGTAGCACATAGCCGGACTTGCGCATCTCGGACGAGATCTGCGCCTCAGGGTTCATGGTCGAGATACAGGTACTTACTTAACGGCTCTCCGCCTAGCTTCAGCATCCTTTGAACCAGATCTATC")) +(assert (= z "gcggauguuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0454.smt2 new file mode 100644 index 000000000..0eb25b80e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0454.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCCTGATGCATCCTTGGGACGGCGTTAGGAATGTAGATACCCCATCGGTGTGTGGACGGCAGAGTTAATACAATCATCGGAATTATACGTGGCTGTATACATTCACATCAGCTTACCTCTCCATGGGGTTTTCGGCGCTACCCAAGTGCTCCAAACACCTAGACCAATTCGTAGTGCCTTGGGGAGACCCTTACAATTT")) +(assert (= z "acgagguuuguggau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0455.smt2 new file mode 100644 index 000000000..3d3b7cf1f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0455.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACACGTCCCCCTATGTGACGGGGGGTGCTTCCCACAAAACAGTATCCGATACGAGAGTTGGGTCCATTGTGCGTCAGATGAAGCTAACGGGAAACTAAATCTCAACCGCTAGACTACGGTGCAAGTAAGTGAATTTCAACGCATATCGACTTTGACATGCAGCTAGGCCATCACTGAGCGGAACTGACCAGGAGGCCAC")) +(assert (= z "guaacacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0456.smt2 new file mode 100644 index 000000000..05f5b0587 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0456.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCTCCAGATCGCATGGCACTAAGTTAATCAGCTAAACGGCTCGCACTAGGTAGTCTAGGTTAAATTCATGAGAGCCGCGAATGAGCCATAATACATAACCGAGGATATCCCCTCTTCTACACGTCCGATCCCCAGCGGGATAATCCATGTAGGACTGTCGACTGGGACTGGCGATATCTTACGACGCAAGCATATAGCT")) +(assert (= z "gcugacccug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0457.smt2 new file mode 100644 index 000000000..ff1ebc247 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0457.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCCAACCCACAGTTACAAGCGTTCCCATCGGTCTGAGTTGCAGATTGAGGCGGTAAGGCGTTGGTACATGCCAGCTAAACGGACCCTCCTGCATATTTAACCTGTTACGGTAATACTGTTCTGTGATTGCATGACATTCGAGGAGGAAGAGTGACTCTCAGACTGAGGAGGCATACAGAGGCATCACGTGAAGTTCCCGT")) +(assert (= z "guauaaauuggacaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0458.smt2 new file mode 100644 index 000000000..c6346c0e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0458.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGACTTATTATGTCCTCTCATTCTGTAATTGCGGTGGTCCAACGCACTCATACTCGGTTCTAACTCTACTGGCCTCTACGTAAATAGGGACGCCCCGGCTACTTGAAGGAGGGGTTCTCGCAACACCCGGTCCGTAAGACGTAAGCATAGCCCAGACCAGCGGCGTAGTTTACGGGGAATTGGCACGAGCCAGTCCCACC")) +(assert (= z "agagcguugugggccag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0459.smt2 new file mode 100644 index 000000000..3182ac302 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0459.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTCAGCTTGTTGTGGTTCCACAATCATCCATTGATACATAGCCAGCCATTCTGCTCACTACACTTGGCCTGCTGCGTGACAACCAGTCTGTGGGTCCATACCCCCATAGTGTGTTCGAAATTAATCCAAATCCCCCGAGCCACGTTAGTGTTCAAAGGTTTCTGCTAACAATTGAAGTATTGCCAGAGGGACCCAAGCA")) +(assert (= z "caaguuu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0460.smt2 new file mode 100644 index 000000000..a0632ac73 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0460.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACAACCATGAGAAGTATCGATTCATTTTGGATACTTGTATGCGGCAAGCCCCGAGCGCACGGTGTGAACAATCCAGTTTTTCACACTCGCCATGGGGAGCCGCAACTCTCGGGAGCCAATACTTTGTGTTGACTAGCCCTATATAGACTGGCGTATGGAATGTATTAATCAAGGACTACACCCCGTAAGTCGCTAGCATG")) +(assert (= z "cugauguggg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0461.smt2 new file mode 100644 index 000000000..682fce0b6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0461.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTGCGCACTTCCTCATTCAATGGACTTCTAAGAAAGAATGAGGAAAGAGCCGAATTACTAAAGTGACCTAACGACCTATCATTGGCTTACCCCATTATCAATTTAGGTGCATCGCGGCATCGTTTCTCACGGCGTTATGTCCGTCCGTTAGGGCGCTCCCTGGCGAAACGAAACTTAAAGGTCCGGCTACCGAGACTCAG")) +(assert (= z "aaggaguaagu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0462.smt2 new file mode 100644 index 000000000..11cf3892b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0462.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGAATTTGATGCTCAGCTTAGCAATGCCGAACGAGCTACGTAATGCACTGCGGAAATATAAACTCTCCGTTTGTTACTTGGGCGGTCGACGTCTAGTCACTTAAATTATATAGAGTGTCTATATCACGGATTTAATCAAGGCGTTAAACACCCCCCCACGAAAAGAACCGGCGGCGTAGAATACAGGTGCAAATGCCTT")) +(assert (= z "uuaug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0463.smt2 new file mode 100644 index 000000000..79d460044 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0463.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCCGCGGCGCCAATATAGGGTTTGGGTCTTATGTAAGGGCTTATAGAGAACGGTGTATCCCAATCGTCTCAGCCACTATAGGTGATTGACTAGTAATCTTAGGGGGTTCATCGTGGTACCTTCTATGGTTGGCATCCACGATGGGGCCGACTAATAACTATTTTCCTCGAAAGACCGCGAGCATTAGGAACACAGTTA")) +(assert (= z "ccacuaacug")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0464.smt2 new file mode 100644 index 000000000..229cfee74 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0464.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCGCGGCAGAACCATACAAACCCGACCTCATGAACAGAAGCGTGTCATGACTTGCAAATAGCTTGGGTTGTGGCTTGTGTGCGCTGACACACGTTAGTCGCTTGAAAGTAATGTTCATGCGTTCGCTAGGCCGATATATACTCTCAGTTGGCGGTCGAAAAAGCATGCGTGCCATATCGTCCAATGATTGGACCGCGA")) +(assert (= z "acguuuaucgaacccaacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0465.smt2 new file mode 100644 index 000000000..33008d527 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0465.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCTGCGCGCGTACTGCCACCCTGTCTCGGATCCAATGCGGGAATCACTGGGACCAATGAGCCCGCGCCCTCTTCTGCCGAAGCAGTCCCGTATGTAGTTATCACCCTCGAATGGGAAGCGCCCCTTCTCGGATCGTGCCCAAATGCCTACGGGTTTGAAACTAAAACCGACTCTTAAGAGCCATGGTATGAGTCCAAGA")) +(assert (= z "gacgcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0466.smt2 new file mode 100644 index 000000000..f61149410 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0466.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCATCGACTCCACACTTGCAATGAAGCACCTCACAGATGTCATCCGTCATTCGTTATGCGGATACATTGTACATAGACCGTGCATCCCAACTAAGGCCCACTTGTACTTCCTTGTACCGCCTAAGCTGCACGACAACGTGGGCCGGGCGACGAAGAGTGGATTGGATTTAGACCCCGCACCACGGGTATACCCCGTGTGC")) +(assert (= z "ggagugucuaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0467.smt2 new file mode 100644 index 000000000..ab010b496 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0467.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TTTAGCGCAACTAGACGTTCATATGTGGCGCCATCGCTCAGTAGAACGTAGATAATAGATTACTCCGAAACAGTTCATAACTAATGGTCCAGGACTGCAACGCGAGCGCCACGAACCACTTCAGAGGCGCTCGGAACGTAGGCCTGGGGACACAGCAATGCGCCGGTAAACGGGGGCTCTAGGTTAACCATATCATTGCA")) +(assert (= z "cuccgcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0468.smt2 new file mode 100644 index 000000000..231e6419c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0468.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCGGCGCAGGTGTGCGGTGGAAAAGCTCTTTGCTAAAAAGTCCCGCACTAGACGGCCGCGTAGAGTGGTAAGAGACAGCCCAAGATGCACCATTTGTTGTCACTAGGGTCATTACAGTCACGAATGGTAGTCCTGCCAGGACGACCTTCATACATTATCATGAGACATCTGGCGTGGAACTCACCCGATCACGGTCGATT")) +(assert (= z "accaucaggacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0469.smt2 new file mode 100644 index 000000000..e98cda3a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0469.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AAACGTCCAATGGATCCTGGCAAAACGCGCCTCGATCACCTTCACCGACAGATGGGCAAACCAGCAGGTGCAAAGACAACATATCCCTACCAGGATTAAAACGGTCAAGTGTAGTTTGCGTAGGTGTTGTTTTATTCTGGAGCGTTTACAGATGTAGACCGCATTCGCTAAAACCTCTGTCTGACGATTAGCCCAGCGCA")) +(assert (= z "aaauaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0470.smt2 new file mode 100644 index 000000000..09eab3cb0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0470.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GTGCGCTATAGGCTACATCTTACTTCCCGGGTCCTCTAAGGCGTCGTATTGTCGACTTCGCGGCAACGCAAGTACCCTCTGTGTGTAACACGTCAAGGTAGTGCACAACGGCGCGGAAAGAGTTGCCCCAAAAGGCAAAGGCAGTGACCATATCTGTCCGAAAGCTCTGGGTACATAATTCGCAAGGTCTCAAGTAACCT")) +(assert (= z "gugcaguuccaucacg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0471.smt2 new file mode 100644 index 000000000..0e5d7feac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0471.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAGTAGCTCGCGAAATTGTCTAAATATCCAATGCTCGACCAAATATAGACTGCGAGCTGGAGGAGTGATAACAGTAACTCTATGCTAAAGTCAGCAGTCGCAGCATCTTGTGGGCGAAAGATCCACTTGGCGGTAACCGAGGCCTGAGTCTGCAATGCGACCTAGACCTTTAGAAAGTTTTATTAACTGCCCGTTTTAC")) +(assert (= z "agauu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0472.smt2 new file mode 100644 index 000000000..a3404e71d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0472.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTATGTAGGTTCAGGGATTGGAAGCTAGCGTCGCCATAGAGCGATGTCCTTTGCACCAACCCTCGGCCTTAACCGATGAGAGTGATCCACCCGAACAATATTTTTGATAAGATTAATTCTAACTTTTTATGGCCCCGTAACTACTGGGAGCCCTCCCGGCAGAGGACAATGGGACGTGATGAAACGGACGCTGGGTGGTC")) +(assert (= z "uauucuaauua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0473.smt2 new file mode 100644 index 000000000..c83f6fcc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0473.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGAGATGTTAAACAAATCCTACTCATCTCGAGGGGACAGTTAGAAGTTGTATTATTTCGAGATTACAGCCTTCTAGGGACCTATGTTACGTGTGGGAACTACAGAATACGTTGTATTAGCATACGAATCTTAAGCTAGTCGATATCATGCTTGCGTTCTGACCAGGATGGAGTTAAAAGGACCCAGAAATTTAATATCCC")) +(assert (= z "ucuaaugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0474.smt2 new file mode 100644 index 000000000..e39bb7826 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0474.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACCAAGGTAAGTTGTGCCCCCGTGCGGCCAGCAAGATTCGTGAGAGGTATGATCGCAGTCGAGCTCAATCTGTACCAAGGCTATACTTCGACAGGCACATCTGCAGCGTACAATCAGTCGGGTTCCTAAGACTAACGTGGCCCGTCCCCCCCAAGGTACTATGTCTCCCGGTTATATAACTCGAACCCGTAAAGATGTGG")) +(assert (= z "augauacagagggccaau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0475.smt2 new file mode 100644 index 000000000..f6df637e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0475.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTTATTTGGTAACCGCAAGTGGTAGGGTAGGAACATTCATCCAATTGTCGACCAAACACTTTACGGGAGTTTTTGTACCATGGCCGCATCATGCAAGACACATGGCTAGTAGTGAGAAGGTCTGCCTTTCATGAGCTTAAACGCACTCCTACACCCCCACTTGCTCGAGATCGACGACACCCTGCGAGTCACACACTCG")) +(assert (= z "aucccauccuuguaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0476.smt2 new file mode 100644 index 000000000..1b617d90f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0476.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATCAGATCGGGAGAACGCCTTACTCGCACGACCGTCGATTGGGAAACGCTGACCTATGACGTCCCCTAAGTAATAAGTAAAAAGGGCTGTCGCGTTGCGACGCCTTTCAATAGCTAGTAAGGATTTGCGCTCTTCCTGCCCTGATCGTCGTTATCCCTGGGGGCCAGGCTGATAGACACGGAGTAGGGTATTTCCTATGG")) +(assert (= z "uagcccucuugcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0477.smt2 new file mode 100644 index 000000000..df6825d3f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0477.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGCCATGTGTAACAGGCGTGGATTGAGCACAGCTTACTCCGCGCCTCACCACCGCTTTATCTGACTAGAGGATGCAACGACACATGCCTTTATATAGGCATCAATAGCATAGAAAGAGCCTGGGCGAAAGTGACGCTAGAATCTGTTGAATACATCTAGTCGCAGGCGGCCTGCGGTTTTTCACTCACATGTTCTCGGC")) +(assert (= z "agacaacuuaugua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0478.smt2 new file mode 100644 index 000000000..3b9930fe1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0478.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ACCCGGGAACGGTCCCCATGGCTTGACACCGACACGCGCACCCTGTCATGCTTTAGTTTTTTGTGCAGACCCAGCAGTTAATGAGATTGCCCTTCCTCACGGCTGCATTTGAACGCATGGCCTCCTCAAGTTCCCCGCTGAGGTATCTTCTTTCACACCGAGATAACCCGTCGCATGACGGGGGAGTGCATGACTAGCCC")) +(assert (= z "aggaguucaag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0479.smt2 new file mode 100644 index 000000000..55d34c822 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0479.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATGACGATGAGTTGCGTGCGTGTACGGGGCCCCAGTTGCCTTCAAGAACCGTTTGGTCGATCATTAAAAAAAGTTTCCAGGCGCATACTAATCAACTTACCTATGGTCGATCCCTGATATGACAGGGGTCCAACATTCTCACGCCGAAGGCGTCTGGTCGCCCACTGAGAGTGTAGGACAGCAGCGTTTGCCTAAAGCAC")) +(assert (= z "uucaaaggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0480.smt2 new file mode 100644 index 000000000..391a079af --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0480.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TACAGCTGTGAAGACACAATTGTGGCGTTTTCGTGGCGGGCTCCGCGCAACCGCTCGGCTGATGACCGGGTCCGTTTTACCCCTCCTCCATGCGTCTGACTTGTTCAGGTAACCAATGGTCCTCCGACTTTCTAGCCGGTCTGCTCAGAGCGTGATGGTCTTAACTCGCCTCGAAATAGAGGTTCCTGTACACGTGGAAA")) +(assert (= z "guacgcagac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0481.smt2 new file mode 100644 index 000000000..3358ee444 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0481.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGCTCCTGCAAACTCACGGATCGCATTGGGCCATAATCAGACAAACACACCGGGGGACAGGCCGCTTCAGATCGGTTGGGAAGAATGTGTGCTACCCCTTAGCGCGCAACAGGGTCTTACAGGCTAGCACGCCTTGCCTCCATGCATTGGCATTTGTGGATGGTGCCGACGCCGGCCTAGATGCGATTGCGGGAAGGCGG")) +(assert (= z "ugccuagcguaacccg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0482.smt2 new file mode 100644 index 000000000..ca45629fb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0482.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TGCAGCTTCTGGCGTGAACATGTGACAACCCTTGCTACGGAGACCTATCGCACGTATGTAATATGACTGTGATTGGCAAGAAGGCACAGACCTGGCTTGCTTGATGTAATACCTATCTCGCGCGCCTTCTTGTGTGTGTGAACACTATGGCTTTTAGGAATGGCAAACCTACTTAAGCTGCGATCTCTCCCTGACCGCAA")) +(assert (= z "gugauaccgaaaauccuuac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0483.smt2 new file mode 100644 index 000000000..f0e3839f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0483.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGCGTTCTCGTCAGCCAGAACTCTAGAGACGGGGTAGTATACCTTAGTACTAGATTAACAAGCGGAGCTACGTACCAGCCCCAATATCGAGTAAAGTCGAGTTGTTACTAATAAAATTCATATGCCAGCTCATTACAGGAGATTTAGGCCTCGCAGGTCAGTAAGATAATAGGAACAGAGAGGTTCTATCACTATCCGAT")) +(assert (= z "caacaaugau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0484.smt2 new file mode 100644 index 000000000..9e44235ee --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0484.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTAAACTTCCCACAACCCTACACAAAAGCTTAGGCCCCTTGGATCACGCTACCAGTTGAAGCCCAATCTTCTCCTTACCCTATCCAACCACAAATCAACACCATTGAGCTCCTCCGATGTCTGCCCCTTAACTATACACGTCCCTGTAGCCTTGATGACAGAATCCCAAGGAAAAGCAATCTTTCCTTCTAGCACTCTAT")) +(assert (= z "uuggugu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0485.smt2 new file mode 100644 index 000000000..3afdd7ea2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0485.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GAAAATAGGCGGGGACTCGGGTACTTCGCGCCGTACAGCTTTATGATAGCTGGAACCCGATCAAATAGATTCGGTACATTTTTACGCACTGTCGACTCAGCACTATGCATTCGACACACCTTACATAACCTGGGTTAACAATAAGGGTCAATGAGACTCTTTGCTAATTTTCTGTGCAGCCATGGGATTGTAGGATCTAG")) +(assert (= z "uaaaaaugcgu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0486.smt2 new file mode 100644 index 000000000..823b58044 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0486.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TCAAGCGAGACCCATGCGGGGTCCAAACTAGACAGAGCTTTGTACGGGCGGCAGCAGTGACCGTCCGTTGGTCGAAAGGCCTTGATTCCGAGATGAGAGCCCTTTATATTAGTTCGATGGAAATAAACTAACCGGAGGTCGTCCCCCTTTGTCACACAGAGCATCCGAACACGGTTACGCAACGTGACATTGATAACCGG")) +(assert (= z "cgcucuggguacgcccca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0487.smt2 new file mode 100644 index 000000000..96a935716 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0487.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AGGCTGGTCATTGCCTACATATACTCGAGTTACGTGTGTCGCTTGCTAGACTAGAACGTCTGCATTCCTGTGACTACTTCAATACCTCGGAGTCCATTTCATTCCCCGAGTGCTGCTCATCGTATACTATAAAGCCACTTTAAGGCAGTAGGTGACTGTCTAATACCTAGGACAAATAGGGAGTACGCCTGTGTATAGAT")) +(assert (= z "ggagccuca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0488.smt2 new file mode 100644 index 000000000..c4c0eddae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0488.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGGATTAGTGTGCTGGCAAGTGCCAGATTCTAGCTTGTGTTTAGCTTGCCCAAACCTCTGTATCAGTAGCGTCAGTGTATATTCACCTGTCCGTCAGTGCCTGCGAACAGTCTCCAGGTAACTCGACCTGGCAATCACTGACTCTAACGCAACGCTGCGGTGTATTGCTTTCGCTCAGGCAACAACTGAAACCACCGTA")) +(assert (= z "uucacggucuaagaucg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0489.smt2 new file mode 100644 index 000000000..8aa8d2690 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0489.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CGTCGCCAGCCCCCAACCACCGGCCCCGCGCCAGCTGATAGTGCCGAAAAGTGGCCCGCGCGCAAAGTAACGCGCGGACGTCTTAAATGCCCAAACCTCTCAAAATATAAGTACAGGATTGATCGTGGGATCTGTGTGTCGGTGCTATATCCCGCCAGGATGCGAAGCCGCTAAGGGGTGGGGGTAGGCGACCCTTAGGG")) +(assert (= z "uaacuagcacccuagacaca")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0490.smt2 new file mode 100644 index 000000000..9fe1067d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0490.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "ATTCCGTCACCCTCCTGCCTTATACCTAGAGATGTCTCAACCCCGTCAAGGCGATTCTGTAATCACACTTCAAGCTACTAGTGTAGTGTGTCAAGTAAATCCTAGACCACCGCGCTGGAGCCTTCAGCGTCCTGGCAGCCGCGACGTCGTCGCCATTAGGGGAATTCTCCCGTAAAGGTTGTGCTGGGTGCGTATTCGGA")) +(assert (= z "guucgaugaucacaucacac")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0491.smt2 new file mode 100644 index 000000000..31c918420 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0491.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GGAACGGAGCACGATTCTCGAGGCTCTACCTCTGGACTGCATCACGTAGCCAGATCCATTGGCCTAGTATGCAAACGAGGATGTCGAGACCTACGGATTGTTCACCGTATACCATGTCGCGCCCGACGCTAAATAGAAAGTAACAAATTACGCGATCTGATGCTAAACTGGGCTTTGCACTGTACTGTCCTTGAGCCTCG")) +(assert (= z "cuuucauuguuuaaugcgcu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0492.smt2 new file mode 100644 index 000000000..1443a32f6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0492.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGATCCAGGCGATGAAATAGGGTCGGTAGGCTAGGTCCCGGCTTGTACCCATCCTCCGCGCTGGTTCGTAGTCTACACAGTATTTGACGTGTATTGTAACGACGATTGCCAGAAATCCCATCGCAGGACAAAGTTAGAATAGACCATGCGATTGGTACTCTGATACCGACTTTGATAAAAACGGGTCTCCTATCATTCG")) +(assert (= z "gagacuauggcugaaacuau")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0493.smt2 new file mode 100644 index 000000000..36e1849ab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0493.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GCTCAGGAACCATAACCATCTCTAGGCCCAAAGTCCGTGTTTATTTTATGATTTTACACTAGGTCTCCGATAGTACTCTAGTTGCGACATGATCAGTACTGGCGGGTCAAATGCTCCTCTTGCTAAGTGGTATGGGGACGTTCATCAAAGTGTTTCAGCCCGGGATCTATATGTAGGCGAAGAGTCCTAACCATCTACGA")) +(assert (= z "ucaggcacaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0494.smt2 new file mode 100644 index 000000000..d64b4d613 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0494.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CAGGGCCGCCGACGACCGGTTTTACTGGGAACTTGAGGGAGGTGAGATGACACTAACCTGAAGATCCTTGAATGCATGGATAGTAATCGGGTGATTCCAGATGATGAGTCCTCGTTAGAGTTGAAGGCGCCGATTGTAACTAGTACGACGGCCGACTCGTCTCGTGCCTTTTTCGAGGAAGAGCCCCAGGCAGGTAGGAA")) +(assert (= z "ggcugcuggccaaa")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0495.smt2 new file mode 100644 index 000000000..e5522f07d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0495.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CCACAGCACGGAAATCTCTCGGTGCTGACGCGATTGCCTAACCGCGGCTCCGTTTCAGGCTTTCAAGACTCTGGGGCTGGTTTAATAGGAAGCGGGGCGTGGTGCTGGGACCGATGGTCCATCAGACTGCGGCCCCTGATATACTAGGCGGACGTGCAGACCTGGGCAGGGTCGTTGGCACTTACATAGGGGTGGGGATG")) +(assert (= z "ugccuuua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0496.smt2 new file mode 100644 index 000000000..3f016d144 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0496.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "CTGGGCACGCAAGGTTGTACAGAGACGCCCTATCCCTGACACGCCCGCTGAGAATCACAACTTACCCAGTGTAGGGTGAAACGCTGGGCATACGCTGCGTATCATGGGCCCCAACGAGTTGTGATGACAAGAGGCTCTGCGAGCATAGGCATGATCGTTTACTTAACTTCATACACTCCGCACGTGCAACTAAGCATCGA")) +(assert (= z "caacacuacuguucuccga")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0497.smt2 new file mode 100644 index 000000000..8279d8402 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0497.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "TAGCGGTTGCACATCGCCGCAAAACAAGTCATAACAAGTTGGGCGCCCCCGACGGCGCGCTCCCTCTGGATTAACGATCAACACTGGTTTCAGGTGTGGATCTGGGGATTCAGTCCCTCAGTCCATTTCAGTCGGGGATTCCCAAAGCTAATCCGCTTTCGAACAGGGATGTAGCCTTTAATTGGTCATCGGAGTGCGTT")) +(assert (= z "auuaaccaguag")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0498.smt2 new file mode 100644 index 000000000..99f01d3a4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0498.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GATAAGTGTGGTCGTGGGCTATGGGATTGACGAGACACTCGTAGTGTCCTATTTTAAATTAGCTCCCCCGTTGAACTACCCTTCCATGACTTATGTGAAGCCTTAGGAGTGGGTTGACTCTGCGTATATGACAGTTTACACCTTGCGCAAGACCTACTCACATCCCTACCAACCCTTCTGATCCGTTATTGATACTTGTG")) +(assert (= z "ggaacgcg")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0499.smt2 new file mode 100644 index 000000000..b34683e28 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0499.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "AATACCCAAAACTTTCAATCCTGCTCGGTTTGTATTGTGGCAAGCTGTCATGATCATCTTGAAAAGGCTCCACCACTTGTGAGTCCGCCGATCTGGTGGTACAGACCCTATGTTGAGGACGTAGGCCTCTGTTGTGAGTATAAGGGGTCTTGCAAGTAACTACGCCCGCTTAGCGAACACGAGGGGCAGCCTGGATCACG")) +(assert (= z "cuuuuccgagguggu")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0500.smt2 new file mode 100644 index 000000000..458e4283d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0500.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status sat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete values +(assert (= x "GACCAAGACGAACAGTTGGGTCTGGGTAAGTGAGACCTCTCAACCAGGTGGGAGGTCCCTTCAAAGCGTCTCTCGCGGATATGGCTATGGTAATCTCCCGATTGTGAAGACAAACAAACTATATGCTATACTCTATCATCCCCAGGCACGCTGGAAAAGTCCCCCTTCCACACGAGAATAAATTGGTGCGTGGACTATGG")) +(assert (= z "uguuugauaua")) + +; Pattern must occur in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0001.smt2 new file mode 100644 index 000000000..fb13e2507 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0001.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTGACATCATCTGTACCATGGAGTGTGTACCGTCTGAGACCATTACAGTTTATCTGAAGTATAAAAGGTCTCCATGCAGTTGCGGCGAAACTCACTATGTTAGTGATTAATCTCTCTGCGCACGCATGACTCAATGAAAAAGTGAATCGTATCACTGGCAGCACATGAACCCTGATTCGGATAAGTAAAGGACGATAC")) +(assert (= z "gccgugaccgcuuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0002.smt2 new file mode 100644 index 000000000..20be8b43f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0002.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTATATAAAATTTGGATTACGTAGGCAACTTGCTGAAATCACCGGCCTCCTCCTGTCGCTCCATCCTCCCCTCTGGATCAGGGCCTTGACCTTGCCTTTCTACCGTAAGTACTCATGCAGGGAGTTCTACTGCCCAAGGCCCCCATCGTAATTGGTTCCGAAGCTCTGGTATAGCACCGCGCTCACCCGTACACTACATT")) +(assert (= z "gggacugauuuuuau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0003.smt2 new file mode 100644 index 000000000..c2518a773 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0003.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCTGTGGGCAGTGTGCTACCCCGCGCCATTGTAACTCAACGGATTACTGGGATGGGTGGGAGTCATCGCGCGATACCTAGTTAGACTGTTTTTTGGGGTACCCTGTGCCATTACTCATAGGCGCCCCGAATCAATGATTTGGCAACCCAAACGGATCCTTCGGCCCGGCCCCCAATCACCCGAGATATGGGCGCACGTG")) +(assert (= z "cccgugccuacgacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0004.smt2 new file mode 100644 index 000000000..f86069181 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0004.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTGAGGGCGACATCTAGGACCAAGCACGTTTGTTGCTGTGGTGAGCCTGTACACCGGAAGTAAAATTGCACGACGGTTTTACGATCGAGAATTAGAGGCCAGGCGCAAAGGGTATCGATGGTGTCTCCAGCAACTGCACGTAACGCCTCCATTTTTCAGTCCAGAGTCTAAGCTCTTTCCGATTAAGGGCTAACCCTG")) +(assert (= z "uaggaucuacauaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0005.smt2 new file mode 100644 index 000000000..c0ccddc2b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0005.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCTATATACTAGTTGTGCAGGGGAGAAATACCCATGCTTTGCGTTCACAGCTGTGGCCGCAAAACGATAAAAGCAGTAGGTATCAATTATCCGTTAAAACCTTGAGGTGTCACGCAAGCCGTGGAGAGGGCCGGCAGCTATTCCGATAGACATCATGCTGAACAATTAGGTGCCAGAGCGATTGGTGAATGGGGCGCAT")) +(assert (= z "uauaaauagaguuga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0006.smt2 new file mode 100644 index 000000000..4d01ab71a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0006.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTACTGCAAAATGTGAGCATCCGACCCGTACAGTGACGTCAAGCTGAAACAGACGTCCATGGGGAGTCCTTTTCCAGTGACCTAGTAATTCTTGGACGCGTAATATCCAGCTGCAGTTGTCGAAAGGATCTGTTGGGAGGAAAAACCAGATTTTCGTAAAAATAATCGAACCGGAGCGCGTGCTAATTGCCATTGCCTAG")) +(assert (= z "cuagggcguauuguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0007.smt2 new file mode 100644 index 000000000..570a961c3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0007.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATACCCTACGGACATGGAAGCCCTCTCGACCAGGTGAGAGTGCGCGGGTAGAGTAGCTAACGCTCGTGATTCCGCGCCACATATGCCCGGACGGGCAATGGCCCGCTGCAAGACTGAACTAGAGGCGCTTTTCGTTACGGTTTCTACCATCACTAGGTTCCAGTAAATTTCACCCCTTAATGAGCCATGACTAACTGTTT")) +(assert (= z "cugagcgugcucggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0008.smt2 new file mode 100644 index 000000000..c0c09ab97 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0008.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTAATACCCCAGGCGATATTGGGTACACATCCACGTCATACATCTGACTTATAATAGTTTCATATGGTCACCACATCATCACTCTTAGAGAAAGGACCGCTAGAATAGGTCTCACGCCTAGCTAACGTAAACAAGTCTGACGCTTTGAAAAGGTTGAAAAGCAAATCCCCTTTATCTGGCCAGAAGGTCCACTAGACG")) +(assert (= z "acaguuugucaugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0009.smt2 new file mode 100644 index 000000000..1efab9632 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0009.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTGTATTATCATGTCTAACGTCTGGCCGGCAGTAGTCTTGACTAAGTGCATCAGTTAACCGGGTTACGTAATAATGTTAATTGAGAGTAGCTGGCACTATCCCCCCTTTGGTGTTGTTATACACGGTTCGCTGTCGACGCCATTCAGATCGCGATGGCCCTCACCGAGGCCCATACCGCGCATTGCCGGCAGCTGCGGA")) +(assert (= z "augagucccugacaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0010.smt2 new file mode 100644 index 000000000..1cb745697 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0010.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAAGACGACCTAACATCCTACAACAGGCACCTGATTGGACGTAGGCAAGTGCGTAATCCCGATCTGCTGTCTGCCCCTACGAAGAAAACGGGCCTCTGCAGACAAGGCTGAACGTCAGCTATTCTGCAGAGACAAGGTCACGTGCGTAGAATGTGGCCAGAGTGTAACGGAAAGACGTGGCCATTATGATAAGTAAGCA")) +(assert (= z "uagucuugggggcca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0011.smt2 new file mode 100644 index 000000000..cb209d12b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0011.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGACCTCGAGTATTTCAGCGCCTCGGAAACCAAGTAAGGTGGGTAATTTTTTGCTTACAATCGTTAATCACTGAGTCAGTTTCTGAGGCGTAGGCGTTCGGAATATCGAAAGCATGGAACCCCGCGAGATCAACTCTTGGTTCTAAAACTTTGTCTCGGGATAGACCGAAGTAAAGGATCTAATTGTCGACAACACCTGT")) +(assert (= z "agcuagugcgggugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0012.smt2 new file mode 100644 index 000000000..0ad98c8f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0012.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGCAAGTCATGAGTTTGTACCATAACTCGACGATCTCGTTAATCTCCTCGGAAAGAGAACACGCGAAAAGCACAATCGGTGGTTGGGGCCACAAACACTAAACAAACCCCTCCATATACCTGTCATAGAGGCCTGCCCTATCATAAAGATAGTCGCAAGAGCTTCTGCAGGTTTCTTTCACAGCGATGGGCAGCCGCGA")) +(assert (= z "aggugguaaucccgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0013.smt2 new file mode 100644 index 000000000..e6bfa8f5b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0013.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTATCCGTCGGACGTACACTTTTCGTATAGAGCAACGGCTTACGAGTCTACACTATGAAATATGAATCGTCCTGGTATCCCCTATGTATGTAACCCAGGGTCGTAGCGGGGTTTCCGCCCGCGAATAAGGGTCTACGACACGGACACTCTTGCCCGGCGACTGATTCCAACTCTGGTTGACAGGCCAAAAAAGTTTGTAA")) +(assert (= z "gccaacuugccgcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0014.smt2 new file mode 100644 index 000000000..5a9fcf374 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0014.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTTGTTAAGATGGTTGACCCGGCGTCGGCCCTGTATCAAGAGTAGATAAGGATAACACCCCCGCATAGGTGGCGCTCCAAACATAGACGGGAGGCCGGGCGACGCCACAATATCGCCATGCGGAGCTCAGGCTAGGAACCGTAACCTGGGTGCTCACTACCCTCGCGTTACGAGATTCCTGCACGATTCACTGAGAGC")) +(assert (= z "uguucacagcucgga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0015.smt2 new file mode 100644 index 000000000..0ccf7169e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0015.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTATCACGAGTGTGAAGCAGTCCCAAACTGTTCTACAGTTTGCGATAACCTCCGCCTATTCTCTATCGCAAGTGACGTGGTAGGGGCCGCTGTAGAAGGACGGGGGTGACGAACTGAGACTACGATTTTTTAAGACGCTCTAAGACCGCTGAGACGCTCTGCTGACCTACCGACTTCATTAAGATACGCAGTCAACTCA")) +(assert (= z "gcucugagaggccgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0016.smt2 new file mode 100644 index 000000000..84c43cf0d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0016.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGTGGTACTCTGCGTCTCCCTTGACGTCGATGTATATCTAGTGGCCATGGTTGGTTTTCCGGTTTGGCACCTCGAAGTAGATAGGCAACATTCCAAAAGAGCGATACCACCGTTGCCGTGATTGGTTTTTTTCATCACATAAACGATAGAAGAGGTCAGACAACGCCCCAGCCGCCGTGTTTTGATTGGGCGCTTCAT")) +(assert (= z "ucaauaggguaauau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0017.smt2 new file mode 100644 index 000000000..54c9d111e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0017.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGGTTCATCTAGAAAGCCAAAACCCGCTCTCACTGCTTATCTTACTTCACAATGATAGGTGGCCGTCCGCGCGGTCGTTATCTGCATAGAGTAATCAGTAATTTTCGTGCCGTCACCGTCAGATCGTTACGATACCATTTAGGGCTTTTCGCCAGCTGAAAGCAGTTTGTGGGTCGGTATGTTTACGAATAGCTAGGAA")) +(assert (= z "cacacgauuuuagac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0018.smt2 new file mode 100644 index 000000000..3a4527bc9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0018.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAACTTTTGCCATAAAAACCCACACGAGATAGAGAGCCGTAATAATATCAATAGCGTAGAGAGCCAAATATGGCTATGCGCATTGAGTTGGAAGGATCATGATCCAGAGATGTCCTTCAAACTTCGATTCTTCCGTTACCGAACTTGCCGTTCGTTTTATAATAAGTGAAATGCTCCTGCAGGTCGGTCATGTAGCATC")) +(assert (= z "aaacagcauguuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0019.smt2 new file mode 100644 index 000000000..9a8aa41c5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0019.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTGAGAAACCGTGTTATCGTCAGTGCCACCTCTCCCCAGACTCAGACGCAGTATTCATCCACCCCTGCGCAACTGAGGTTCGCAGATGCGTCACGCAGGCAGAAAACATCCCGGCGTGGTTTTAAACGTTGTGGAGGTCCTTAGGGGTCGTCGACGGTAATTCCGTTGTTGGACCTTTTACTCAAGAGGTCCTTTTAG")) +(assert (= z "gaacuuucugccagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0020.smt2 new file mode 100644 index 000000000..e28670970 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0020.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATAAAATGGTACGTCAACAAGGCTTAAACAGGTGTTTACCATTACTGCTCATAGGTGTGTTTGGGATATGCTAGTTTGCGGGAGTACTCTCGAGGCACTGCTTCTTCAAAGCCGTGGGATTGGTGAAAGATCGCCTGAGCCACCAGGTCAGCATTTAGATTTCTGTCTAGTTGAAGCAAGCCAAGCGACTCACCTATTG")) +(assert (= z "aacaacgacgaggac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0021.smt2 new file mode 100644 index 000000000..cc5520208 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0021.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATGAGCTCGACGCCTCCTACTTATTGTAACTCGTGGTTGGGCAGGATCAAATCGGGGTTTGCCCTCAGCTACTGCGGAAGAACTCTGCATGTGAGCGCGTGTCTCCCACATGTCTGCAAAAGCTAAATCCTTTTAGGGGTATTCAGTAAGTCGCCAAACGCTGCATAACGTGTGATTTAGAATTTCCCATGCATCGTGA")) +(assert (= z "agacaucugaaucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0022.smt2 new file mode 100644 index 000000000..c6c6f217c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0022.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTGCTCCGACAGCTCATCGTTGACTCTGGGCTTCTGCAATCCACATGGGCGTCTGTGCAGTATGCTCTCGTGTTACGACTAGGACTAACCGTGGACGTTCCTGGGCTTTGTCGGTGACTGGATGCACGTATGAGGCTGTCATCTTGTCTGAATGAGTGCGTTTGTGGAGACTCAGCCACCAAAGTCCTCATGGGCACGT")) +(assert (= z "gaaguggacaugugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0023.smt2 new file mode 100644 index 000000000..aa3205166 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0023.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAAAAGCCACGCGGAAGATCTTTTAACATTGCATCTGGCAGGGTCCTGACTGTGGTTCGCAGAAACCGGATCTCGCGTCGCTTGCTCAGGCGGTCATACCGGAAGATACGTTTCCGACCACGCAAATGGTTCGGCGGTTTAACTGATCACTTGGCAAGGGCAAATCCCCCAGCTGATCTCGTAAAATGATTATATGACC")) +(assert (= z "cacuacccauucaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0024.smt2 new file mode 100644 index 000000000..fdc0954fd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0024.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTGTAAGTCTGTAGTCCGAGGACAATACCCCTTCAGTGCAACGAAATTTAGCTATAGTGCAAATAATAAGCGGTCAATAACTGGTTTAGTCTCCTCGCCCTTGTGAAACCCTCAGGAGGTCAGTCGGCACACCGCTTGTTTAGGAGCATTGAGTTTACTCTTCGCCATAGGTGGATAGGCGATCATATTAAGGAGTTAA")) +(assert (= z "uguaaguggggucac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0025.smt2 new file mode 100644 index 000000000..fa3cfb893 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0025.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGTCAGAGATTATAATCTTCTTTTTGATGACCAGCGTAGTTGGTCAAATCAGGCACTCCACGGGGGACGGTTGTACACGGGGTCCGAAGATCCATACCAGACTGGTAATGAGCTGGGCTTCTAGAAGAATCAGGCGTCTTCATCACTCTTTCTCGTAGCGCTCGGAGATATTTTAGCAAGACGTGCATGTATCAAGTAC")) +(assert (= z "cgcuugguuugcgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0026.smt2 new file mode 100644 index 000000000..6c9d0cda4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0026.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGGGGCAGACACTTTTAGGAGTCAGACACGACGTTGCGATATGGACCGCACGTAGGGCGGCTATTGTTGTACCTTATCAGCTTACAGCCCGTCTCGTGCCGATAAGCATCTTACCAATCAGCGTCAACCACATTCTCCTAATGTGGAGCGCAAGTGTCAAGGTAACTCGCCAGGTGAGCCATGAAAGGGGAATGGGCT")) +(assert (= z "gguaucgaucggcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0027.smt2 new file mode 100644 index 000000000..655ddc7f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0027.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACACTCACTATCGCTGGCATTCAAAATGCTGTTGACTTAGGAGTGTGGGGTCCACACCCGTGTGGCGAGACTCAGCGAAGCCTACAGATTTCTCCAAAAAATCAAAGGGTTACTGGTAGCGGTCCCGCAAACAGACGTCGTGACCCATCCTCGACGGGGCCCCGTCAGGTAGGTGCCAACCGACTCGGCTTTAGAGGGGT")) +(assert (= z "gagguacuucucaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0028.smt2 new file mode 100644 index 000000000..b2278d58a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0028.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGGATCCCGTGCCAATCGAGTAAGTCCCATAATCACGGCTCATACCATATTGGCCGCAGCACCGACTTAGATTATCCTGTGAGGTTCAGGCTATCCATAGAATTAGCACTCCTGCGAACTTTCCCTACCGTTGGCCTTGTACGTCCGAGATTACAGCCGACCCAGTATAAGGCAGCTTCGACGTGATTTTTCAGCTTGC")) +(assert (= z "gccugggacccagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0029.smt2 new file mode 100644 index 000000000..012abb522 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0029.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTCCGCTCTCATGTACTAGCCAGATCCTCCAAGTAAAGCAGGCGGACGCATAAGAGGTAGCGGCGGCTTCTCTGTTCGTTATAGCCTAAGCACGTCCCTTCGAAGGCCGGGCTAGCCGTACTAAGGTCTGTGAACCAATAGGACGATGCTGCATTCGGCGGCAGGTTATAATGGCAAACACGGATGTGCACCTCGAGA")) +(assert (= z "aggaguccuaauugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0030.smt2 new file mode 100644 index 000000000..141e77bdd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0030.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGAATCTTTATTACATGGCCAGTAGGATGGTGAGTTGCCCATCAGGGTAAATCGTATAAATGCTGGACGTGGTAACTCCGAGGTTTTACCCACTTCGACATTTAATGGGATATACTGCGGACGTCTAGTTATACTCCGGGGCTGGCGGTGTAATAGAGTGGGCCGGAATTTGACGTGTATAGCGGCACTCCCCAGGAG")) +(assert (= z "cacgcgaagugguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0031.smt2 new file mode 100644 index 000000000..63cccb008 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0031.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGCCAACCCGAGCACCCCCTGAAGGAGTAAAAAAGCACAGTTATTCCACTGGCCACGGGCAGTAGTAGAAACTGCAGTTAAGGTCGGACTCTTTACTATTATCTGGGGGGCCGCACGCTCCCTTTGCAAGTACTTATTGTCTCAGGATCCTAAGAAATCCCCTTCGGGCAGCAGAAAGATAGCTCAAAGACACTACTTA")) +(assert (= z "caagguccgguuguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0032.smt2 new file mode 100644 index 000000000..05c4e5a96 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0032.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTACAACTCAGGTGGATTTGTCAACATGCCCAAGCCGGTCAACAGGCGGTTCCGAGAAACGCCAGTGTGGAAAACTGTCGTGGGCGCCTCGATTGCCTCTATACTAGCCAATGGTGAATCTTCGAACATTACCCTCAACCAGTATGGAGCTTGTAGTTCAAAAAGTGTGGCGACCTAGGATTCGACGCGGCGAAAGTTT")) +(assert (= z "gugaaaauuguacac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0033.smt2 new file mode 100644 index 000000000..3399cb0d3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0033.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACACCTATATTTTAGCTAACCTATCTTCTAGTAGCTCAGTGGAGTTAACACTCAATGGACGTTCCAAATCGCAACGGTTTCGGTCTTGTTTTGCACCCCCTCAACATGTGTCGGGCTCCTCGGATCACAGTTTTTGTGATATGAACAGACTGTCCGTCATTCTCGATAATAGCACACGAAATGCCATGAACGCGCGTAT")) +(assert (= z "auccuacugucguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0034.smt2 new file mode 100644 index 000000000..e02946ec9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0034.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACAATTTATGACTGATTTACTAGATAGTTGGAGTCAGATCACTGGTGAATTTCGGGTAAAACGTGCAGACGTGGAGTGTACCTTTCTACGCAGTCTACCTCGGGACGACCGTTGCCTTTATTTAATAAGCAATGAACATAGATCCCTATATTACACCTGTTCACGGGAAGCGTCCTCTTCATACAGCACCGGACTACAC")) +(assert (= z "ggcucguacgaguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0035.smt2 new file mode 100644 index 000000000..5d9e25be9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0035.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAATAGAGCGTCTAAGCACATCACGGATGGATGGGCAGCATATTAAGGCTCAATCTGATTGCATCATGGAGCATCGCCGCTCCAAAACAATGCGGTTCTTAGAAGGTACAATGTTAGATATTTATGTGCGGTCAAAACTGCGCGACACGTTTCCGTGCTGATGATCCTCGTGTTGTATCACTTGTTATGTTAGGTCATT")) +(assert (= z "augacccugcaagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0036.smt2 new file mode 100644 index 000000000..6dbe1b9f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0036.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATATGTGGATCCCCTTGATGATCCTTAGTTTTCTCAGCAACCACTGTCATTAATTTTGTATAGGAACCTGTAAAATTAACGTGCGCCAGGAATGTGCGTCACGCACTGGTAGCCGCCCACCGAAACAGCTCATTTCCGTGTTCTAGGGGTTCCTAGCGTTTCACGTGGAATACGGCTCGCCTCCGCGACAAAGCGAATG")) +(assert (= z "gauuucgcaccaugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0037.smt2 new file mode 100644 index 000000000..4345ce286 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0037.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGACCTTCGTTAGAGTAAAATTGATAACAGACCTCGCAGGCATGTCCCGATATGCAATGCAAAGGTGGTCTGGGGCGAGATGATAACGCTAGCTGAGGTCTCCAATCCTCAACGCATAGGCATGCCACATGCGTGATACGAAAGGGCCCGCCAATCATTCCAGGGCCATCGCTGACACACTGGGCACTGCGATTTGTTA")) +(assert (= z "accuuuacggauugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0038.smt2 new file mode 100644 index 000000000..b822331cf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0038.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCGAAGCCTTATTAGGCGTGCAAAGTGATACCGAATAAAGGGTACCCCACAACATCCTAATCACGCCCAATACACTCGAGCTAGATGTTGATTGAGTTACGATCAGGACACATGCGATGGGCCACGTGGCAACCAGACTTTCGCACCGCACACCATTTTGGGTAGGATAACCGGAAACGTTATGACTAATTCCATGTAA")) +(assert (= z "aguugucuaguccag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0039.smt2 new file mode 100644 index 000000000..3e8544268 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0039.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGGTTGCGGGATTCTCGACTCGTCCCCTGTGCAGCCAGAAATGAGTAGGTTGAAGCCATATCTCCTAGAGGTTCCCCTGAGCTAGATCGGTTTCCAGTTCGGGTGCGCCTACAATTACCCTACGAGGGGCGCAAAAGATCAGATCTGGTACACCAACCGTTACTGGTGTTCCCCAACTTGCTATACAGGCAGATCGTT")) +(assert (= z "gcuauuucuuuucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0040.smt2 new file mode 100644 index 000000000..515d79ee5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0040.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGAACGATGTTACTTGGTCGGCTACGGAGGTCCCCTCAACAGCGTCAAAAAAGAGAGACGAACGGCACCCACCGGTAATGCCCCGAAAAGGGAAGATCCACGAGATCCGAATCTGGAGATAGAATCTACCAATCATCGCAGCCTTTTCTAACTAGGGCATCGATCAAGGCCAAGTGAACTCACTCGGCCGGGATTGGCA")) +(assert (= z "gggugcgaccacagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0041.smt2 new file mode 100644 index 000000000..029e4d31a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0041.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCTCTTGTTTCGCCTCGAAGTGAATAGTGGGAAAATCTTAAAGACACATACCAAGACTTATCCCTTAGGGTACGCTGTGAGATTCCCTGTTTCAAGGGTTGATTCAGCGCTCGAACAAACGAAGTCGCCACGCAGAGCATCACGAACAGGGGAATTTAGCTACGAGTCCTCAGATATTCGGATTAGATTTAACACGCAC")) +(assert (= z "uucacacuacgcaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0042.smt2 new file mode 100644 index 000000000..24a05af6c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0042.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACGTCAACCAGGCCGGTAGCGACGCTCGCGTCTTAATTGATCTGAACCAAAGTGCGGGTCCTACTATTTCGTGTGGTCCAAGTAGTAGCCTTTACGCATTCCAGTGGTTATTCCGGGCCATAAGAGGGCAGCGAGACAACCCTCAGGTTCTGGAGAGCGGAGTACAGCCTATTAGCTTACGACTATTAGCTCGCATCA")) +(assert (= z "cuuuccaucuagcaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0043.smt2 new file mode 100644 index 000000000..10d1041f5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0043.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATGTTGTCTTATACCACTCTAACTGACTGGTCCTCGTAACCCGTAGTGTTCATCCCTATGACCGCGCCGGTAAGACAAAGGGGTATTGATTCTCTTACCGCTGGTAGGTAAGCTGGCGTAACGGGACCGGCGCATGCGTAGACCTAGTATCCACTATAAGCTATTACGTCACCTGGGTTCGTGAGCGGATACATTACTA")) +(assert (= z "gaaacgccucaccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0044.smt2 new file mode 100644 index 000000000..23ae5ae8b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0044.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGCAGAGTTTAGCACAGACTCGTAGAAATTGGTGACCTAAGGCGGATGGCTTTTTTTAAACCCCCTACGAAAATTCCCAACCTGTAGTGCAAAGGCGTTCCGACCGGGTTGAGAGAAAGCTGCGCATCTCGCTGGCAGACAAGAGTTTTCGATACCACTTATTTTATCATAACTACGCGACGCTCCGTGCGAGTGGGAG")) +(assert (= z "uauugagagugucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0045.smt2 new file mode 100644 index 000000000..24532c825 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0045.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGGGTAATATATTTGACCGGTGGTCCTCGAGTACATTAAGTTAAAAGAAGATTCAAGACCACTATGCCGAGACGAGAATGCAGCTTCAATTATCAGGTCTATACATTGACCCAAATCCTCGACCGTAACCCACTAGATATGCCGAGCTTATGAATTTTACGTTCATGCTCACGCGAAGGGAGTAAAGGTATACACCTC")) +(assert (= z "aggacgaccgaaaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0046.smt2 new file mode 100644 index 000000000..137f00cbf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0046.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGGATTCAGTACATCCCCGCTGGCACATTTGCCAGCTAAGGTTAACGAACTTGCTATACTTCGTCACTATAAATGAATTCACGGGTTCTCTTTTTATCCTCAAACATTTAAAGCCAGCAACCCCGCTGCAATCAAAGTCACGATTTCTTGCGCACATATTATGGGGCAGGAATAGGGTTTGGTGTGCACAACCATAACA")) +(assert (= z "gggugcacgucuagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0047.smt2 new file mode 100644 index 000000000..66c47a2f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0047.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACAGTCTATCCAGCACGTTCCATTACTGAGGGTAGTTTCGTGAGAATTCCTGTTCACAGCGGGCACACGGAGTTAATCAACTACTCTCGCAGATGTACCCGTGCACAGGAAACTAACTTAAACATTTGTTGCTTTAGAGATACAGGCATGTTCCCTTCTCGTGCGGAAGTGACACCAACATAGGTGGCGCGGCCAACCT")) +(assert (= z "ccgacguacuaugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0048.smt2 new file mode 100644 index 000000000..2104fca1c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0048.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACTAGCACCAGCCGTCCGTCCGTCGTTCCCAAGCTAATTACGTCAGACTCGACATCACGCACAACCAGTGGTAATAGCGTCAGGGGCCAAAGTATAGCGCGCATGATTTGCCGTTGCATAATTGGAGACAAACAGTACACGTACGTATCCTTGGGACCTGACGCGAAAATAGTGTTGCGCTTGCGCCAAGAAATGTCT")) +(assert (= z "accagacucauauua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0049.smt2 new file mode 100644 index 000000000..32cff766f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0049.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACCCTCAGCTCCATCTGCCAACGCACGCGTCCATCATAGTTCCGTGTTCGCGCGTTGGATTCTTGACCGATACACTGGGGCGGGTGGTAACGTTCAACCATATCGACCACGAATACTTGGTGCAGACGTATGTATTTGACGTCATAACAACACCCTTGCGACTACCTTATGTAAAATCTTCACTAGCATTACCCACTA")) +(assert (= z "accagagcacagccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0050.smt2 new file mode 100644 index 000000000..654233e83 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0050.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCAATTAATGAGCGCCCTCTTTACCCATGGTTACATTTTTACGATGTAAACCTAACGAAGGGCATAGACGGCTACCAGAAATTTGCCTAGGGCTGAGTGATACTTAGCGAATGACTCTGTTTCATCTTGATCAAGCCGGTGGACTACAGAAGCAAGCTATCCGGGTTACTCTGTCCCGTACAGAATGCAAACTAGTAAC")) +(assert (= z "acuaaccagucgcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0051.smt2 new file mode 100644 index 000000000..a128244c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0051.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAATCACTATGGTGAACCATCCGAAGCTTGAGTTGCGCAGCAGTCTCACCTGGAGGGAAAGAGTGAAACGCTACATAGAGCCAGTTCAGTGTGCCCATATACTTGATAACTGATAGGGCCCCTCGGGTGTCTCAATCACGAGATCGCTACACCAATCCCCGAGCCCCAACCTACGACACAGACTGATGTTGCTAGTCCC")) +(assert (= z "gcuuauuaaugaucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0052.smt2 new file mode 100644 index 000000000..cc9ceaf14 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0052.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGCTGAGGAATCGCGCCCGTCCCTCCCTGAAGCAGCCTTATAGGATTGTTGTCGCCACCTAGGTGATACTGTCTTGCCAGACTTCCCCTATCTTATCGTCTAGTAGATGAAGTCTTGATACCATACACAGTAAGCGGCTAGATGTCGCCTGCCTACCTCAAATATCTCACGACACAGGTGTCTGGGTGTGATATCCGAC")) +(assert (= z "ggguaggaugcgugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0053.smt2 new file mode 100644 index 000000000..7de680d27 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0053.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTACACGGAAATACCACCGTTTTTGAATTGCAACTCCTCGCGTATGCAATCACCCTTGAATGTGTCATCAAGCACAGATAAGGCGGCATAATTCATGAAGTGCGGTATCACCACCCGTTGGTTCTAAGCAACTCGCTGAACTTAGGGCGGGGAGAGACGAAACGGGGCATTGGCTTAAACAATTCAATAATAGCTTACGC")) +(assert (= z "uguaugaggaacauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0054.smt2 new file mode 100644 index 000000000..b0c9e619d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0054.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATTGTCGATGTCCCTCAAATAATAGCGTTAACAGAAACGTAGGTGCACACACGTTCGCGCCACCCTTAAACTCGAGTATTGCTGAAGTTCGCGCAGGTGAAGCTTAGTAGTCCTGGCAATCTGGTAGGGACAATCAGACAGTTCTGGTAATTAGACGAAGAATCCGCTGCGGCGGTATGTACCACACGTCCGTCCCACA")) +(assert (= z "uaacaaugcgauacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0055.smt2 new file mode 100644 index 000000000..9d1261aba --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0055.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAAGCCTGTTTACGCTGGACGCGAGCGTTCGAGCAGCGTCATAACGGACTGGCCACGACATGGAGAGTCCCAGCCCTGGAGTGAATGATTGGCGACAACCAAATGCTTCCTGTCAACTGTGATACGGCATGCTCCGTGGCGTACCCAACAAACGCCTTAATTTTGGTTCTATAGTAGAATCGTAGTTGAATTACAGCGT")) +(assert (= z "gcuuucgcggauaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0056.smt2 new file mode 100644 index 000000000..a3351d815 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0056.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGAATTGGTGTGATAAGCGGACGCTAACCGCTGTGTCAACTTCCCGCTCGGTGTGATATTAGCTCGTGCACCACCCAGTCGGGACGCACGCAGGCTCAGTCCGAAGCCTCCCAAACTCGATCTTTCTGCGTGCACCCCTTATGGCGCAGGTCTACTGTGGTGATGTGAATGTATTAGACGCCTATGTGGCTACGTATCT")) +(assert (= z "acgcggacgugagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0057.smt2 new file mode 100644 index 000000000..565823848 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0057.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATATAGATTCCATACTCCGTAAGAACCTCTCGGCCGCGCATCATTCATCTGGGAGTACTGTAAAGCCACGGAACTTAATTCCCCCGCTTCAATCCTTGCTAAGGTGTATTCCCTATCGAAATGGGTGAAGCCGGCTTCATACGTACGTACAAAGCTTCCTATCACCGAGCTCAGACCTATTAAACTAAATGCAGAACCT")) +(assert (= z "aagagugacuacccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0058.smt2 new file mode 100644 index 000000000..71342d328 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0058.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAAGAGCTTTGGAACGACAATGAAGTTCACGAGGGTGGCAATACCTTCCGAATTGCACAAGCTGTCGCTGCCTTGGCATGGATTTCCCACTCGACTATTGCCGCCGTTAAAATCGCCAGATCGATTGAGGCAGGTAACACTCAGAATAAGATCTCCAGTCGAGAGTCCTGCAAACGACATAGCTGTAACGACAAGCTCC")) +(assert (= z "agaacaugugaugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0059.smt2 new file mode 100644 index 000000000..6935d58ab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0059.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCGTTCTCTCTTGGTTAATACCCAAACTCGCGCCGACGTAGAGCCCCGCTAGGGGGGCCACCATTCTGATCGATTGGGCTCGCGTGTGTGCTAAACCCAGTAGTTGACCCTATTTGCTGTGTATGCGTAGCTTAGGGTCGCTGTGTGTCATTCAGCAACTTCTCTGTCCCATGTCGAATATCCGCCAGGCTACCTGGGT")) +(assert (= z "gucccccgcuuauua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0060.smt2 new file mode 100644 index 000000000..81297de02 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0060.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCCTAGTGGGAAACACACGGCCCGAAAAAAGAAGCGGTCTTTATCCATACACGGTGCTTTGCGTACCCGTTTAACATTGAAGCGCTCTCGCTTGCTAAGGAGTGCCCGCCCTTGTGCGCGGGTAAGTAGTTAGGGTTTCCGTTCAGATTCAGGCACAATTACATCGCCAGCGCCGTTGATCATTGCTTGGCTGGTTTTA")) +(assert (= z "cuauaggcgcuucuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0061.smt2 new file mode 100644 index 000000000..d39522e66 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0061.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCATAATACGGTTACGTGACCCTGTAACTCCTTAGGCCTGTCTAAACTTGAATAGAGTGCGTTAAGAGCCGAGCGGCGCCATAGTCGCGAGTGCCCGTATTAAGAACTACTTTAAGCTTTTTCAACGGAACTTTTCAGCGTTAGTCCAGTCCTTTAATTCACACACTCCGTTCGAACGAAGTGGCGCTCCGGGAATAAGT")) +(assert (= z "ugggggagggcgacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0062.smt2 new file mode 100644 index 000000000..4358b0766 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0062.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGATACTTGGAGCTGGCTACGACACTCGCCACATCCATCAAGCGGCACCCGATCACGGGTTGTGAAAAAACGTACCAACCATGCTTTAAAACCTAGGCGATTGGGTCTACAGCACACCGAGTCGATGAATATCGAGCTACCAATAAAAGGGGATACGGAGACAAAGAATTAAGGCCACACAGTTGGACGCGGCTTACATA")) +(assert (= z "acggucuugacgagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0063.smt2 new file mode 100644 index 000000000..2c80ce713 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0063.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGGTAGGGAGCATGTCGGCTGATCGTCTGCGCGTCTGTACGCCGAAGAGCTACAACGACCAGGTGTCAGGTCGATGCCAAAATGTTTTATGCTAGCCACGGAGTATGATCACCGGAAAGCAACTATTTCGATGTCTTCGGTCAGACGATAAGGTCCGCTTCCGGACCGTTTTTTAACTCTAATTTCCTGAAAGTATGAG")) +(assert (= z "aggcguauaccggug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0064.smt2 new file mode 100644 index 000000000..e23233da9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0064.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGATCGATTGCGGCTGATACAGTATCATCCTTGTCGAGGAGAAGATAGTTAAGTAATATACGCTGTCGAGGTCAGAAGACGCATAAAGACGGTCTTTCAGCTAGAGGAGATAGCAGGATGCTTCAACGGATACCGCGGCTAGACTCACCTGAGAGTAAACGAGACTACTTAGTAAACAGACTGAACGTATGGAAGTCGTG")) +(assert (= z "cgcggcucgagaauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0065.smt2 new file mode 100644 index 000000000..dd088b601 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0065.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGAATATAGGCGTGGGCATAACCTGGTATCCAAGGGCATAGAGAGTGGGGAGTCAACAACGCGGGCGCAATATTGTTTAAACCACCCCCGTGACGTCAGCGTTAGTTCGGTTCTCCCGCGCGCAGGATCGTTGTCCGTCCCGTAAGGAGTTATGCATCTCTCCTGCGGGGCCCCCCACGTCCGATTTGTTCCCATTGGA")) +(assert (= z "acacuuuuugagaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0066.smt2 new file mode 100644 index 000000000..16f96022c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0066.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAGTGCGCGGCAATTATACCAATGTTTATGGGTCTCCCATATTCGAAGACTACGCATTAAAGCTCACGTTTCTTCCCAGATGTAACTCGTACCTTTGGTAGGGTCGGTTGTGTTATAATCGTGCAAAACAAAAAAGCACAAGATAAGTAACGCGGACCAACGGAATATCGCTAGCCCTTCGGTCGTGGCTTCCCTGCCA")) +(assert (= z "caugcgagcucaugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0067.smt2 new file mode 100644 index 000000000..b727644d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0067.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGCTCCTTAGTCAGTCTGTTCTTAAATAGACTTCGGCAATGATTACTCTCCGAGAGTTATTGTTGCCACTACATATCATCGGTGGCCACTTAACTGGTGTATCTGCGAGGCTTTCCACGACTTGATAAGGTAGCTGACCTAACCGTCTTTACCCTTCTAGACATGTTGGATTGTGCCCCCCGTTCCTGCTTCGGCCCGG")) +(assert (= z "cggcuagacuuguca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0068.smt2 new file mode 100644 index 000000000..68d1842a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0068.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTTACACAAAGTGGAGAAGCAAATGGTCGCTCGGACAAGCCAGGCCCGATTCCAGTTTAGTCGGGGAACAACTTTCTTAATCAGGACGTCCCGTCATAACTGCCAATGTACTCATGTACAACACTGGTACCGGAAGCCGGCGGGATGAGCGCCCTCAGGCGCGGCTGCGTTAAGCTGTGCGTAGCCTTGCGGGTAATTC")) +(assert (= z "gucuuuuauaaagua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0069.smt2 new file mode 100644 index 000000000..182f96a78 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0069.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTTGTTGCCCCCTCTCCATACCCCCCCGACGTTGTAGAGACAAAGACCCGGACCGGCACCATCCCGTAAATCGTTTTCTGGACTGCCGTTGGCCTGCGATTTCTTAGAAATTAACATGTGAAGTCGGGGTAGAGGGTGTGCCAAGTACTGGCGCGACCCACGCTCGTGCCGCCATTTCAGACTAATTAGAGTTGGGACA")) +(assert (= z "ccacggacuuccuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0070.smt2 new file mode 100644 index 000000000..5f84c11e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0070.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATCACAGACGGGGTAGTCACATGAGCCCAGCAGACGAGTGAATGTGACAATGATGCGGTCTCAACACTGGAGTTGGACGTTCTCATAAGAGGCGACACGCCGTACATGTATTGGCCCAATTTATCGAAAGAGGAACTACATTTAGAGTACGTCTTTCGGTTCTACACGCCTGAGTATTCCACGCCTTATGAGGGACGCA")) +(assert (= z "gugcucggcucguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0071.smt2 new file mode 100644 index 000000000..3d70be08e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0071.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACTACGTGTTACTCTTACGCGCACAATGCAAGGTTCCGGTCGGAGATACCCAAGTGAGGATGTATGAATCCCCATGGTGTGATCCTCCAACCACGAATAGGCCCCGGCTTTCAGGTCATACAAGAATCTCTTGGCGACCCATAAACTATCGGTTTTGCAGGACTTTAGTGATCTAATATAATCTCGATAGCCACCAGCC")) +(assert (= z "agaacccagugacug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0072.smt2 new file mode 100644 index 000000000..ec56ae94d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0072.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCACCACGTGATTTCCCACTATCCTGCTCGTTCGATGATGCCAATCGCGTTATCTCTCACTGGAGAACTACCACAGCGTGCGTGCTGCGATGCGTCTGACGATATTTAGAGACACGCGTCTCAAACAGGACCGAGAGTCACCACCATTGGATGATTTCATTTTTAGGGTCTTGGGCACCGGGGGCGATAAGTGCTACTG")) +(assert (= z "acgauggaaaugagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0073.smt2 new file mode 100644 index 000000000..d2c90353a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0073.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAAAGTCTTATAGTGTGCGCCACAAATAACCAGTGCAAGCCCATAAACGATAGACCCGTTTCAAGGACACGAGAATCTGGCGAGCGGGTTAGAATATGACTCGGGGCCTACCGAAGAGGCCTTGTAGGGCCTGTCCTGGTCTCAGGGCGCCTCCTCATTCAAGGATAGGAGGCTCGTATCGATGTCTGCGTCGGTCTCGA")) +(assert (= z "uguugauucuacguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0074.smt2 new file mode 100644 index 000000000..04568e472 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0074.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTGTAGGATGGTACGATTTAGATGCCTTGGGTGTAGGGGGGTTCAAAGGAGAACGAGCAAGGAAGTCTACAAGAGAGTCGGTCGCGCCTTTATCATTATGGACTTTGTCGCCCGTGGGCCAGCATCCTGGCTCCGGATAACCCAAACTAACGGCTTGCAGATCGATGGTTATGGCCTGCTCGTTCGTTGATCCCTCTTG")) +(assert (= z "gagcggggcuuaucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0075.smt2 new file mode 100644 index 000000000..abb614a64 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0075.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATGGCCTCTCTCTCGAGGTCCGTGCGCCTCGAATATGTTTAAAATTGTGGTTTACCCGAACGTCAATTTAAGCCGAACCCCGCTTATCAAGGGCCACTACTACGTGACGGGTAAACAAACGATCCTCGCCTGAATATGCATCGTGCCCCGTACTTGTCGCACCGCCTGACATTATGGATGTAACCGCTATACACGATGC")) +(assert (= z "aauguucccgaaaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0076.smt2 new file mode 100644 index 000000000..d49ea8de5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0076.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTGCACTAGAGGGATCCATGTCGATTTTCTCCACTCCGGCGCACGGGGCTAGGATGTCTGCAGGATGAGTGCCTAATTCGGGTGTTTTCATATTTACGGGCTACCCCGTGCGAAGGGCCTCAACAAAATCCTCGGACGGATTTACTCGGAAGACAGTGTTCCTACAGGACGCTTGGACTTTGGACTCTTAATATTGGAG")) +(assert (= z "uggacaaauacuccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0077.smt2 new file mode 100644 index 000000000..8b3b45211 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0077.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCTCTACTCCGATCTACAACGCCCACAAGAATGGTGAGTCTAACTATACTCCGGCGCCTGCCCGTCACTGCCGAGCACCGTACCCGCGCAATCCTCGATAAACCTATTGCGGGAATGTAGTCAGGGATCTCGGCTGTTACTATGATTCGATAGATCATCAGTAGTGACAAGACGGGTTCGATAACGGAGCTCCGGGTCA")) +(assert (= z "aucagaugaggggca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0078.smt2 new file mode 100644 index 000000000..e2bb42b6f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0078.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGAGCTCACGTCTTGTGGAAGACACTGCATATACGGCTCTAGCTAACCACGCGAATTCCGACATTTACAGCTCCCATATGAAAGATCACATCCCGTTCCAGAACTGGCTAGATTGTAATCATTTTATCGGGAGATGCTGGTATTCAAGCATGAGTACGTGGCATACCTCGAACGGAACTACAACTTTGAGTCACCGTT")) +(assert (= z "uaaaaaguuacgcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0079.smt2 new file mode 100644 index 000000000..cc1b645dd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0079.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCTAACCTTATGCGGTCACGATGGTAATAGAACTCGAACAAGCCTTGCGCCGCTGCGGGAGCCCATTAGTGCTCTTTACCTACGCTCGATTAGGCTTTCGGTACAGGCTTCCGGGATGTAAAAAAGACCTTTAGGTACGAAAGGGCTTAGCATCTACAGTACATTTTAGTAATCATACTGGCATGTGTAGCCGTAATGT")) +(assert (= z "cuaucucgucgcucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0080.smt2 new file mode 100644 index 000000000..4b6fb17f4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0080.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACCCAGCTTTGGGGATCGGACTTTAAATCGTAGAATCTGAAAGCGTAGCTGCCGCCGATGCTGACGGACACTTTATGCATTGGGTGCATGACGAGATTTGCCTGCTGTCGCATTAGTACACCAGTATACAGTAATACTCGAACCACATATTGAGAGAGTCGCATAGCGCCTGTTGGACCGGAAGGGTCCCCAGCCGCAA")) +(assert (= z "gaggccucccacaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0081.smt2 new file mode 100644 index 000000000..5f3033e36 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0081.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGTTTGTCCAAGGGACAGGATCAGTAGGTAACACTAAACAAAATGCGCCATTGATTTAAGCCCTTCCCATCTATACAAGGCAGACGTAAGCGTGAATTTTGAAAGATGTCCTTAATCCTACTCGCCGCCCAATGGCTCTAGCTTTCGCGTGCACCGACCCGCACTCTATTTCATTTTAACATCAGTCTACGGCGCATCC")) +(assert (= z "ucuucaugggacuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0082.smt2 new file mode 100644 index 000000000..f9d83c40f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0082.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACAGGGGACGGTTCTGGTGGCTCCTTGTGCGAAGACAAGTGTTCATCATACTCAACGGCATGTCTACATCTCCAGCTGAGATCAGAGGTGGCTAGGGAAGTCGCTACACCCGCCTCCCTTCCCGTTCTATTACAATTAGACTGAGCTGTTTGCCAACAGGCGCACTCGGGTGCTGACCTATGGATCCATTATGTAGTTA")) +(assert (= z "ccaaaaaucacuagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0083.smt2 new file mode 100644 index 000000000..0cc519dde --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0083.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACACTCAGAGCAACTACAATTAGGTACTGTCTAGTTCATCAGCCGAAGACCGATAACACCTTGAAGATAGGTAAGGTGTGTCTGAAAAGAGCTTTGATCATTTCAGGTATCTTGGTCTCGTTGTATTAGGGGACTACTATAAAATAATTGCCACCGGTCACTTACTACTTAGACACCATGTGGCTAAGAATGTTCGGGG")) +(assert (= z "aucgcaaaggccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0084.smt2 new file mode 100644 index 000000000..4370be2a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0084.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTAATACTAAATAACAAAGTTAAATGCGTGCAGCCACAAACCTTAAGTTTAGAATATATCCGGAGTTGCTCTGGACCTCACCATAAGGAGGTAAGTTAATACTGATCCGCCTGGTGAACGTCAAAACGCACTGAGCTATAACCGGAACTATGTGCCCCAGCTACCTTTGACGATGGTAGAGTGACTATCCCCCATTGTC")) +(assert (= z "gccgugcuggcugau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0085.smt2 new file mode 100644 index 000000000..696a01133 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0085.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATGAGTGTAGATAGTTTACACATAACTTTGGACAATGGTTTGGACGGAACATCACGAGAAGGGGGTTACATTGATCACTGCCTATTCGTTATGTTAGCACTGCGGGCAAAACAGCCTGCCTAGAGGACAGGGCATAAACGGAGCTTGTGCGTTCTAGGTGAATTACGCTGCCGTCTTCTAAGAAAGAGCTTGCTGGT")) +(assert (= z "gggaguugguugacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0086.smt2 new file mode 100644 index 000000000..153f59102 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0086.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGATTATGTTGTTACATCACGCTCCCAACATATTCCCTCGGCCACATCATGCATTGAGAGCTATGCTCAGCTTATACCGGGAAGCGGCAAGCTCCTCCCGAAGGGAAGGATACCCTCTTAGCCTCCGTCAATTTTTCGCTGATTCCAAGAGGTGACAGAGAACTCCGTAGCGCTTAACAGTCTGGAAGAGCTTGAAAAG")) +(assert (= z "uaauccaaucgagcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0087.smt2 new file mode 100644 index 000000000..860b1e213 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0087.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAAGCTCCAGCGGAGAGACGGGGGGGCCTACGCAAAAACCACGAGAGTTACACGCATGCATGTTTCCATTTACCCGGTGTGGTCTATCACCTTGGATTGGCGATTAAAAGTCGCTTATTTTTACGCAACTAGATTTCCATCCCTGGACGGCCAAAATGATATTATGGCAGGTGCGGCAATATGGGGCCATGCTCAGAG")) +(assert (= z "cuguaaugauacacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0088.smt2 new file mode 100644 index 000000000..351e5f5bd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0088.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCAGCGGTTGGCCCAGTGCTACGACATTGAGAGACATAACGGACGGACAAAAGTCCAACACAGCCATTCGCGTTCGGTGGGGTGAATCCCTTACAGCTGAGCAGAACTTACATCAGTCCTAAGATCGTACGTTTTCATTACCCTTTTGTGTTCCATGGGTACGGTGGTGATTGACTTCCTCGTACTGTGTGAAAATCAG")) +(assert (= z "aaaaauagccacguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0089.smt2 new file mode 100644 index 000000000..41944cca2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0089.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCCATCAGTACCAGCAAAGGAAACTACGTAGGGGGTCTGCTGGTCTAAAGTCTCGGTTATATGTAACGAGTCCGCAGGTTGGTCCAATCGCAGAGCCTCCTTTTGCGTCCTTGGGATATCGCCAAGACCCAGGTCTGTTGATAGCTATGACCAGTATCCGGTTACGAGAGCCTTTATCTGGAGGCTACAGTAATAGAA")) +(assert (= z "ggaagggccguguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0090.smt2 new file mode 100644 index 000000000..e48053b46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0090.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTTGTTAACAGCAAACATAGTCTACAACACAGCATCTATATCCGTCACCTACGCGAAGCGTCAGTGGGTCAGAAGCGACCGGACGCTGGCCCGTTCCCGTGTGGGGATCGTCTTCTACGCCGAGGAATCCACTTAACAGCACGCGGGCTCCCTCAGCACCTTTTACTACATGAAAGAGATGACGGCTAGCGTGTTGTT")) +(assert (= z "aguacucucagugac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0091.smt2 new file mode 100644 index 000000000..b9292ce14 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0091.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCAGTACCGAAATTTGATCAATGAAAAACGAGCTTGGCTAGCAAGACAGCCCACCGATTCTCGAGTCCATCCGTGACAAGCCGGGCTACAGAGGGTTGGGACCATGGTGGGACCGATCACTCCGCTCAAGGAAAAGGTAGACTAGTTGCGCTATGTCCAAGGTCGAAAACCGGGGAGTCAACACATTATCCGGTGCTA")) +(assert (= z "ggucucuggccacgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0092.smt2 new file mode 100644 index 000000000..1d4cf9408 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0092.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCGCACAGTTGCTGTTGTGTTTACATTATATCACACGCAAGATTTAGTTGATACCTCGACTAAATAGCGCGCTACCGAGGCGATCTCGAGACTCGTGAGCTCCTAATGCGATTTTGAGTCACTAGAATGCCGAAGTATAGGTGCTGAGACATCCGATAACGGTGACTAACGTCCTCATTTATTTTCAATCCTTCCGGTA")) +(assert (= z "acacauggaccacuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0093.smt2 new file mode 100644 index 000000000..14e315ad6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0093.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGCACTGAAACACAACCCCTGGGTCGGCGCGTGCCGGGCGAACGCTGGACGGCGTCGGTAGAGTCAGGTTCAACCAGATTAATTCTTGGGGCAACGGCCCGAATGAATAGAACCAAGCTAGCGTCACGGTTGCAGGTGGCCGCTGAAGAAGGCTTACGGCCGAACTTATCTTACCGTGGATCCATCAAATGCCGTCCC")) +(assert (= z "uuguuauuuagauca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0094.smt2 new file mode 100644 index 000000000..e1cf0ea72 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0094.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCGGAGAATGTGTCGAATATTCAAATCCCCGAATAGAATGAAGTAGCGTTCACGATGCGGCAACCTGTGCTCAACGTTTCCCCGGCAGCCCCCTTACGGTGTAAGATTGTCTTAGATTTGTCATGTGCGATACGGAATTGATTTTGCTCGGGTAAGCGCGCTTGTGTGCGAGTCCTAAGGTTAGGGAAAGGAGGTTTTT")) +(assert (= z "accaugugaguccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0095.smt2 new file mode 100644 index 000000000..3d2c4e093 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0095.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATCACGCTTAATTCTTATCTGAGCCTACAACGGTTCGGTTCCGTGGAGTTTTGTTTGCTAAAACCAGATACGGTCGCGTAGTTTCGCTCGGAAGCCGTCTTTCCTGCGTTGCGCTTGATGGAGAGTTGTGCGACATACCTAAGCCTGATAGAAAACTTAGGGACGAGCTTGCGCATGTGAGTCCGGGTACGCGAGCTCG")) +(assert (= z "gaccgauuacaacug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0096.smt2 new file mode 100644 index 000000000..f73030d75 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0096.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTAGCCGACTCCGTATTTAGAATCGTGATCATTGTCATAAGGCGAGATAGATATACGTAACCCCGCCAAACATTGCGGTATGCGAGGTACAAAGCACCTATGTTTTGGCATCCCGCGTTCGAGCTATCGAGAGATAAGGAGTTTCGTCGTTATCCGGAATCATACAGAGCGTACCGTCCGCAACTTAACAAGATGTTTT")) +(assert (= z "gaggcuccuauccgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0097.smt2 new file mode 100644 index 000000000..61d273eef --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0097.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTGTTTACCACAACAAGTAGGCACCAGGAGTACATTCCAGACAAGCCAAAATGGTAGTACTGGGGTTCGGGGTCCTGAGTTTCTCAACTCGTGAGGGCGTAGCGGGGGAGTTAGCTATAGCACTACCTGGGGTTCTACTACGACTGGACCCATGTAGAGGAGTCTCCCACAAAATCCCACAACTAACGAATTAGCCTCG")) +(assert (= z "ggcagcuguuuagcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0098.smt2 new file mode 100644 index 000000000..8cec5d563 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0098.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTTAAAGTCATTCGAGTTTGAAATCGCTGAACAGTGCAAGAATCCACTCCCAGTTAGTTTGCGCACGCTCCGGATCTCCATTCTACATATTATTGCGACTGATTCGTGGTAGATGGTCTCGCCAGCCTCGTACATTGCTGCCCTGAGTAGCACTAGCCGTGCCATACCATTCCATAATATCTTGGATGTCATGGCATG")) +(assert (= z "ccucguauuugggau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0099.smt2 new file mode 100644 index 000000000..3cbeb0031 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0099.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCGGCCTTATACGTAGGATATTCATGTGGATAAAAGGGGTTGCATATTATTATGTCTTGGTCTGGGCACATGGATGCGACCCGAACGATCCTTTACAAGTTCAAGACCGAAGCGGTACATTAAAGTCCCGGCCGGGGTCCAAAATTGACAAGAGGCAGCCCGCAGACATAGACTGCGCCCGGGCAACGATTGAGAGGC")) +(assert (= z "agacgguucacgcac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0100.smt2 new file mode 100644 index 000000000..27574e1de --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0100.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTTAAGGCTAAAAGCGCTATTCTAATAATATATCTTCTATATCCGAGTTCTTTCCTCATATGTCGGGCTGTTCGTGTCAGCTGGAATCAAACGAAACCAGTGTAAGTCGGAACGACTACGCCAATCATTGATAGCCCTATCTCCATTATCCTTAAATGTGTATGCATATCTCATCCCCCTCTTGATCAAGGTGGTGTAT")) +(assert (= z "ucauccaucuugcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0101.smt2 new file mode 100644 index 000000000..31fb14690 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0101.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGTGACAGACGCCTGCTGCCATAAGGCGCTATCACATGCGTGGCTAGAGGTGGGACTAGAATTTGTCTCCGTGAGTGTGGCTGGCAATCATGACTGACCTTCCGGGACGATGGAAACGTTTGACGTCCGCAGGGCAACATAGCCAACTGTTCCGCAGAACCAAGAACACCGATATAGTCTAAAATTGAAGCATGTTCGT")) +(assert (= z "uguggucaaccgggg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0102.smt2 new file mode 100644 index 000000000..052554405 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0102.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGGGTTGATGACAATTTACTAGTGCACTGGACTACCGAGAAGAAGTAGCTTTGTCAGAATTATCTCGCCAAGGAGAGGACACCCGTTAATGGCAGTTCACATCGTACAAGGTCAGTACGGCAGTACTATGTGGGCGAGGGAGAAGCTCGAAAAAGTCACTAAGCAAAGACAAGCCTGGCAGTGGTCGTCACGGTCAATT")) +(assert (= z "agggccgcgcgacau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0103.smt2 new file mode 100644 index 000000000..692d78a5f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0103.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCCCGAGGCTGCGTGTTGTCAGTATGCAGCTCCCTCAGTCCGTCATTTCAGAACTAGCCCTAAGAATTAACTTAACGGTGCCGACTGAGTCGATGGCAGGGGAATCTGACCGAGGCCGGCATACGCGATACATCGCCACGTAGAGACGTTGGCAGCGACACTTTGAGACGATTAAGATTACCGAGGATTGCTTCACCCC")) +(assert (= z "auaagugaggagagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0104.smt2 new file mode 100644 index 000000000..499551b89 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0104.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACCTAGACCGGGTAGCCAGCGTCGTGCTTCCCGTTATACGAGGTGTAGGACGAGATGTTCAGATAATATAGGAGGAGCTCCGTGTCTGAGTTAGATGACCCAGGTATTATCTTATTTCCGACACCTGGTGCGGCCGGAGGGAGCAACATGCAAACACTTAAGTCGATGTCCAAGCCGGGCAGAAGTATGTTGCATAAAG")) +(assert (= z "gucucaggacuacgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0105.smt2 new file mode 100644 index 000000000..4edca381d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0105.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGTGGAATTCTCTGTTTAATTGTACCCCACGGATGATGTAATTTGGGCTAGTATGCGTTTACGTCGTACTCGGAACGCCTGCTCCCTGCGGACGTACGAGCGGCCGGGAGGTGGCCTAAAACTCATAGGACCCGGCCACTAACATTCCAGGCCGGGGCACACCTGGCTCTTAACCAATAGGAACTTTGTATGGATTAGC")) +(assert (= z "aacauauguccgcug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0106.smt2 new file mode 100644 index 000000000..da30d600d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0106.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTTTGCACGACTCTTAAACCGGCGACGGTCCAGAATGGCTACAACATCCCAACTGGGGTATATTGAAGTAGTATTCCTCTTAAGCGATGGACAGCCCTAACGCATAGGACGGCAGCCTGACGTTAAAACTGGCTTAACAGTAGGGGCGCTATGGCATTTTTCTAAAGGCTACTGTACCGACGGCGCACTGAATTTATG")) +(assert (= z "ggccauguuacugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0107.smt2 new file mode 100644 index 000000000..92b46bbd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0107.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGAGGACATTCAGAGTGGGGCGGTAATCGGATTATGCAGGGCTTGTATAGCGAAGCCTTACGTATTCGTTTTAAGTTACTAGCCGGGGTTCGGCTTTATCGAATCAAAGACCGCGATCAAAACTTGCTGAACGGCACAGTCAAGATATGCCCCGGTCCTGTAATCAACGGATGCGATAAACAGCGAGACGACTTGGCGG")) +(assert (= z "uauaauaaaacgacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0108.smt2 new file mode 100644 index 000000000..d304aa9a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0108.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACAACCGAAGTTGATCTCCAGGGATGTGTAGATATACTGGTGGTAAAAGTCATCCTTCGGTGCGCTCAACGCGCGCATCACCTGAATTTCGGGTCGGTAAAACTCATCAGGCAGTATCCGGTGAATCAAGCGGAGAGCGTCTTCTTCTAAGATCATCCCTTCACGTACGCAAACTGTTACAACTTGAACCAGGCGTAAT")) +(assert (= z "uaggugguagaaaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0109.smt2 new file mode 100644 index 000000000..dea6ef9d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0109.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTCAGCACCTTTGTTCCGTGCTACGATTGGGGGGGCTTATTCTTATTATAGTTCACTCTACTTAACATCCGACATATAGATCGGTAGAAACGAGGGGTGACGGCCGTACCTTTACCTCCGGACCCTATGCGAGTCGCAGTTCACCTCGCTTGCTGATACCATGACACAGAACTGGTTTATAACGCTTTTCGATAGATG")) +(assert (= z "gaacaacgaucccug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0110.smt2 new file mode 100644 index 000000000..45626be1b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0110.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCACAGCAGTGATTTCAAGAAGGTGTTCCCTGGTCTGGACACCTGTTATTACTTAACTCTGTGGACTTAACGTCGGTTGGCTTTGCGCACAGACTCTGGTGTGCCCGGGGAGACCCTATCCAGGGACACTCATGAGACCAACAGACGGGCTGCTCAAACGAACACCGGCTGATAACAAGTCTCAGGTATCTGCTGACAC")) +(assert (= z "ugccacaugcugcca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0111.smt2 new file mode 100644 index 000000000..f360a7559 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0111.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTGGCCTCAGGTAAAAGCCCCATAATCTGAGTGCGCTCGCTACCAGCAGTCTTTAAGCCTACCAACATCCCGTACTGGCTTTAAGGTATGGTCTGCATGCATATGTTTAGTTGAAATAGACCTACGGATAGTTGACGTGCCGCTAAAAATGCCGCTAGTCTAGCGATGAGAGAAATGATGGCAATGGGACGGCATATA")) +(assert (= z "accuuuccaugcgga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0112.smt2 new file mode 100644 index 000000000..640aeb97f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0112.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGGGTATATTACCATCTACAGTGCTTGCATGTGCGTGCTATCTCTGCTTCCCGGCCTGTTGCGGGATTGCCTTCTAGAAAATGAGAGGGCAAGCAGCACGGGCTTGTTGGCACATTTAGGCCCGTGTTAGGGGTACCAGAGTGAACAAGTATTCGGTAATATAACCTGCGTAGGCCGATCTAACAAATGTGTGTACGGC")) +(assert (= z "ggccuguuuuucgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0113.smt2 new file mode 100644 index 000000000..146a2df40 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0113.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCTCAATATATTTACTAATCACCAGGGAGGGCGGTGGCTAAGTGCATCTCTTCTGTCGCCAAATAGGAGGTTGCTTCTTACGTCACGCGGAGCGCGTCGGCCATAGAACCAGGTGGCAAGGGCCATGGGTACTATATCGTCGTAAACTTGACCTGGTTATGTCGGATTCAATCACGGTTCTCCGTAAAACGTGGCGCA")) +(assert (= z "agugggagagacgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0114.smt2 new file mode 100644 index 000000000..1ebd3a4b7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0114.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTAGGCAACTACCCATTTCGTCGGACAAGAGCGTGCGAGTGCCTATGCGGGCAAATTACGTCCAGCCCACGGCCAACGCAAGGAGTGTGGGCTCATCGCAGAACTATCACTCGGGGACTCAACGTAGCGAAGATGCTCATCAGCAGGAGCGTTACCCTTACAAGGACCTACGACGTGATTACCCGTTTAGGCGCCTAC")) +(assert (= z "auugccgauuacuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0115.smt2 new file mode 100644 index 000000000..c5d424e46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0115.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACGAGGGGAGCAGTATCAAGTCTTCTCGGCCCGTAAGTCCTATACCGAACAAGCGTCAAAATGCGCAGCTGCGTGTATGATGAAGGACAGTGTTCCCATCATCAGTAGCTACCATGCTCAATGAAATTCCTCTTACTTAGTGTGGCGGGTGCGATGCAATGCCTTACTAGTAACACAAAACAGCTCATATCGCTGCGC")) +(assert (= z "guugcggaugagaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0116.smt2 new file mode 100644 index 000000000..62ce6bf34 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0116.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGTTGCCCCAACGTCCCTCACGGATCTGGTGGTTCAATGAGTCCGCGTGACTTCCATGCGCTCGTCACGGCCCCCTATGCTGGTGGACACGCTGTCAGGTTACGACTCCAAAGCGAAGACGCTTGCATTACTCCCCGATCTCAACCATGCCAGAGCCAGCACACGTAAAATCCCGGTCCTTTCGGCTCATAGTCATGAC")) +(assert (= z "caugucgguauucgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0117.smt2 new file mode 100644 index 000000000..7e1db0125 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0117.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGCGTGTGGTTAACGAGACGAACGAGGAACGCGCGGAGGGATTCGGTGTGGTGATGCTCAGATAAGTACCTAGGGATTAAGCGCGAACCTGCATGACTTACATCGTGTAATTAGTTCGTTCCTCTCCGTAGCTCCACTCTATACCCTCAGCCGGCGGTTCAGTACAGGCATGTCTTGTTCGTCCGTCATACTGAGGCG")) +(assert (= z "ccagggcgauacauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0118.smt2 new file mode 100644 index 000000000..5a2466e08 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0118.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCATGTGACGCGAGATTTCCCTGTCAAGATCCACTGTGTGACCTGGGCAGAGGAGTTTGGAAGGGACGATGACCTTGGATCTCCCGGTCATTCCTTTTTGTAAAACACACATAATATTACAACTACGGGGACGTTAAGTTTAAAAACAAGCACTGCATGGCCAGTAAGATGTGGTAGGCCCCATTTAAATCAAGCGCT")) +(assert (= z "acguugaggcgaauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0119.smt2 new file mode 100644 index 000000000..9295d0d54 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0119.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACAGCCGGGTCACCCGGTACCCTTGCCCCATGACAGGAAAATCTGAAAACTTTATCTTTCTTGCGAGTTACATTATCAAAACGTCGTCAGGGATCTGCATCCTAATCTGGGAGGCCTTACATGCACGATGCCCGAATCCATTTCATTAATGATACACGGAGAACGCCTGGAAAGAAAAGAGTACCGCATACATGGGCA")) +(assert (= z "agccgcuauagucaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0120.smt2 new file mode 100644 index 000000000..f56b44142 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0120.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACTAATTAAAGAGCTACGCGTACCCGTGAGAGAGTCGTAACTCAAAGATACACGGATGGTCCTCCCGGTGTTTCATGGAATGGAATAGGCGTGTGTTGTTCCGAAGATCGTGGAACGAGCATGACTACACTCTCATTCTCCATCAGTGGGAAGCACGTACATTACGTAAACATTCAACCGCTAACAGTACTTCGCCCTC")) +(assert (= z "uugaucgcagggcua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0121.smt2 new file mode 100644 index 000000000..e296a4df7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0121.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCAGCGCCTGCCGCGTTCTGAAGAGACCTGCGAATATCACATACTGGAGTTCATAAGCGGACCGTGTGACTTTCGAAGCTGATATATTATCGTGAGTTGCATACCGACGATGTACCGTAGAACTCTCGGAAACCCCGCATAAGAAAGAAACCGCGCATTCGCTAGAAAAAATACGGTTAGTGGCCTGAGGCATGGTTTCT")) +(assert (= z "gauagauccguaaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0122.smt2 new file mode 100644 index 000000000..003d9ab06 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0122.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAAGGAAGAACCGCCTGGCAGCAGGGCGGCTAAAAGGTAAACCGACCCCTATGTAGGGTTACGCCACAAGGGGCGAGTCTGTGCGTCTAAGGATGTGTTTTAAGGGACACCAAGCGACGGTCGTCGTGGGCTGTAATGTAACGGATACAAGCCGACCCATCGACTTAGGTGCGGATACGACCTCAAAGATGCCTTTAAC")) +(assert (= z "caccgccgcaaucga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0123.smt2 new file mode 100644 index 000000000..b55684c85 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0123.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACAACGGATGAATTCGGATAAGGAAGCCAAAGCCATCAAACTACGTAGATATCACATTAACTTCCCTCCAACCTTGACACTTTCGGTCAGGCCATCAGATGAACGGCTCCGCGTCACCCTTAGATGTTTTCTAGTAAATGTTATCTTCGAGCGGAGCCAAAAAGCTCTGCATATTTTCTTCGGTTATCCCGGACTTTCA")) +(assert (= z "gaccgcaaaagucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0124.smt2 new file mode 100644 index 000000000..573c9c44a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0124.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAACCTCAATGCCCTCGATGTCCCGGAATTTGAAAAGAACCGATGTAAGAAGGGACGATGCGAACTCGTGTAGTGCGCGACTTCAGTCTTGGGGCTCTGCGTCTCCAGCGGTTGACGTACCAACGCCTTCACCTAGATTTAAATGAAAAGATCCAGTGCGGAAAACCACTTCCTCCCATAAAGAACGATCGAATTTACA")) +(assert (= z "cauacuggucagacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0125.smt2 new file mode 100644 index 000000000..3314fe77c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0125.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCGCCAGGCGTACGCGATTTGGATAGAACATGACGCTCAGCCCCCGATTCGCATCTGGGACGCAGAATGTTGTGTCCTAGCTCACGTTGGGAACCCCAGGCAGACGACACCCGCAGGCATATCGCCGCGTTGTCACAATAAGGGTTGCCCCGTTAATTGTCTTTTAACCTTGCACTACCGTACATGCACTCGACAAAGG")) +(assert (= z "uauuagcgugauuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0126.smt2 new file mode 100644 index 000000000..7472286e7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0126.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATCCTCCTATTAGTAGTGTACTAAGGACCACTTTATCGTTTGCTTTGATGCGGATAACTTATGCCGCACCTAAGTCCACCACTAACTCCATGAGAGTACCATAGGCTAATCTTCACCTGAGGAGCGTTAAATGTGTGGACAACTTGCACGCAAACACAGTGGCTCTCTTACCTTGCTTACTGGCATGAATCGGAGAGCG")) +(assert (= z "cgcuucaacugaaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0127.smt2 new file mode 100644 index 000000000..170959752 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0127.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGGGCCTGGAGCGTTTGAACCCTGTAGAAGCGCTGCGTTGAGGACAACCTACTGTTTTATTTGGTGGGTAGGATCGTTGCGGGGCATATGGCCGACACACGTGACCAAGAACAAACGGACGGTGCGCAGTCCTTAAAATGTGTTAATGGGGGTTCGAACCTTATGGCGGACACGGATGTGGTGCGGTAGAGTTATTTGT")) +(assert (= z "uaaggggacgaacac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0128.smt2 new file mode 100644 index 000000000..ab67649c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0128.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTAGCCGTTACTGGTACATCGATTTCACACGCCCCGTGAAGGAGCGATGTTTCCGGCGTTCTACTGATTGCTACACGCGTCTTCTCAGAGGTTGTGAACTTGATTATAGGCATAGGCGCAGCGTCATAGACGCACGCGGGGAGAAACGCATTTATGCTGTTGTCAGTGACGGCGGTTGAACCGTGGATAAACTTTTTGG")) +(assert (= z "acgggcuagucuugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0129.smt2 new file mode 100644 index 000000000..cc89b41f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0129.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCCAATGATAGCGACACGATTATGAAAATCCTATAATTTTGATCGAACGCACAAGGGTGCCCGCTGGCTACACTTTATAATGCTATCACAAGTGAAGGTCGTAAATTATTTGAGCACACAGCAGCGTTCTTGCACGGCTTCGTTCACGAGCCCACCTCGCTAGTCGATGACATGTAATTGATGATTGCGCCCCGCAGAA")) +(assert (= z "caacuuaucugcccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0130.smt2 new file mode 100644 index 000000000..78b8ddcc8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0130.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTAACGTTAAATAACAACTATAATATTAGGATCACTGAAATTGTGGCCAATTTCTATCGAGCGTAGGGGGAATGCAAGTAATCCATTCTACATATATCGCGAAAAACCTAAACCTCACTTCGTTACCAGTGATGAACTGGGATCACTCGATAAACGGAGCGCATGCATATTGCGTACGCTCCTAGAGATTAACAGCCC")) +(assert (= z "acagacgacucagaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0131.smt2 new file mode 100644 index 000000000..dc371c37e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0131.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGATTGCGTCAGTTCTCCGCAGGTTCAGGTGGAGCTGAGAGGTTTCGAGTTTCGACCCGTTCGTAGCCCGTTCTAGACTGCTTGACTACCGTTGGAGGGTGGGTGCACGCTGATGAAACGAGCCTGTCTAAATTGACCTTAAACGGATATAACAAAAGATTCGTGTCTCTTAAAGAGGGTGATGAGAATCTACTCTTCA")) +(assert (= z "agguguguagaccuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0132.smt2 new file mode 100644 index 000000000..eacf90e35 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0132.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGACATTTTCATAGCGGTATTGCGTGTTCCAATTATAGATCGCCATCCAACTGCTATAATATCATACAGCTATTCTGGTTGGAGCAGCAATGAATAAACGCTAATTCCCGGCGAGCTATGGCGTGGCCGAAACCAAGCCGACAGGGGTAAGCCATGGGCTTAAGGCTTCAGGTAGTGTCGTCAGGAATACAACGTAATA")) +(assert (= z "aggaggucgcaacga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0133.smt2 new file mode 100644 index 000000000..e114a7249 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0133.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGTGTTTATATCTATGTGTGCGTATGCCATGATGTATCCTATAATTTGAATTCCGCCTTATCTCTCCCGTTGATAGGCGTGTCCTGCCGAAGTATTGTTCAGAACGCTCTGGGGCGAAGAAAGGTGTACGCCGCTATCTTTGAGCGTCTACGCGTGTTTCTCCATATGCGTGCGTTTCCGTTTCCAGGTCATCCGGGGT")) +(assert (= z "uuuccucgccggauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0134.smt2 new file mode 100644 index 000000000..93f522ed3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0134.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGACGGAAGATCCTCGTAAGCCCTCGCTATCGAAACGCTCTCATTGCTGCAGTTGCACAAGTAGTGGATGGAGATCTATTTACGACAGCAAGACCTTATAGCAGGTACATTTCAGTGTGCAGCTTCCATAAGTTACTGCAATGGTGTTATACGCTTGCACCGAATTGGCATGGACACCTCTCCCTAGACGATTTTGTCA")) +(assert (= z "gguacgagacuauaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0135.smt2 new file mode 100644 index 000000000..d9943a3ee --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0135.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTAAAGCCCTACGGCAAACCTCTGACCAACCCACAATACCTAGAATCTAGTCTCCCCGCGCGCTTCTTCCCATGCCTAGGTGAAAAATAATTGAGCATACCTGGTTGGCCAGCCTCATGCGGTTACGCAGTTATCTTGTTTGGCAAACGAGACCTGGTTGGATTCCGTGAACAAATCTGCTGAAACATAAGCTATTGG")) +(assert (= z "ucccggcgccaucgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0136.smt2 new file mode 100644 index 000000000..e35ba4919 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0136.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAACAAACTGGCTCCAATAGGCGCCAGACTATTAAATTAACAGCCCCGCGAGAACGGGGATTGGGAATGAAGCTTAGGCTAGTATCTGGGTGTGGGACATTCCGGCCTCAGATTCCAAAATTTATAGGTAGCCAGGTTGTGAAGTTGGGCCAGGAACGACCGACGGAGTCTGTAAGCCAATGTTCACCGTGTGATCCTAC")) +(assert (= z "ggucuaaggccgugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0137.smt2 new file mode 100644 index 000000000..4a5ada3c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0137.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCTACTTGGAAATTTACGTGGTGAGCACAAACTGTCTTAAGTATAAGAACAGTGATATCGGAATCCGTAACTAAAAGTCAGTTATCGATCGGTCCCTCGAAGTATCTCTCTGGATGGCAGCACTGGACACAACGACCGTGTGTGGGCCACCATCCGCGCCCGTCGCTGAGTTTAGCATTCTCGAGAAGCGAGTGCTTCT")) +(assert (= z "aaccgguagcgcacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0138.smt2 new file mode 100644 index 000000000..4e40c774b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0138.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTAGCCCCCGCTCGTCGTCCACGATGCCTTTCTCCTACCCCTTTCCACTGAACGCCTCCCTTAGTTGGCTGTGACATGGTGACTCGGGGAATACCCACTCTAGGAGCGTTAGACGCTGCGTCCGCGATTTGAGAGTTCATGGGCACGTGTAGACCATAATAAGTAACTAAGCCAGGCACAATATCTGCCGTCACTAGC")) +(assert (= z "cugccgauaagauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0139.smt2 new file mode 100644 index 000000000..187e29e89 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0139.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTATCTGAATTAACCTCTAAAAACTTTCATACCTTAGAGGGGTGCTAGCGTAGCACGCTGAGTGCCTGTTCGTGCTGTTGGCTTGAGCAAACAGGCGTCCACAATATCGACGAATCGGCTTTCGAAGTCGTCACATGAAACCTTGGGCATGTTGAGGTGTGGCCTTGTCCCCCGAAACAACCGTTCGCCCTGCTGATC")) +(assert (= z "uucaguugcauccua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0140.smt2 new file mode 100644 index 000000000..507c9d7e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0140.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTGAAGGCACTTTGTCATCATCGAACCATGTGAGTTACACTATAGACCAACCGATTGGTGTTCCGGCGCTGAATATCGAGTCGCGACCTGCAGTTTCCTATGTATTTGGGAACCTCTAGGTTATCGTGAAGCGGTGATCTCCTCCGTCCACGAGCATCGTATACTAATGTTTCTAAAAAGCGTGGCAGGAGGCAGTTAT")) +(assert (= z "uagggcaaugaauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0141.smt2 new file mode 100644 index 000000000..bfe90ff80 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0141.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAGCACAATAAGGTGACGTGTATATCATTCCGCTCGGTGATCTTTGCGACTGGTCACCTAATCTCCGGGAAGTCGAGATCTTCTTCTCCACCTCGTAGGTAAAATCTTGGCGATCGAAGCTCGGAACGACTGGGGCGGTCTATCATTCCCATTGGAGTTCTAAGAAGAAAGCGCTTGGTCGGTTTCATCTATTAAAAAT")) +(assert (= z "acaaagguccgcucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0142.smt2 new file mode 100644 index 000000000..3da25db8c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0142.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTTTATAATGATCAAATGGCATGATACGTCGTTGGTGCCCATCTGATAGGAGCTCCTGGGTAACCATTTGATTAGGAGATATGTTCAACGCCCGCACGCGCAGATACACATGAGAATCAGCATAAATTTAGTCCGCCGCATACAGATGCTGCCTAAGGAAGTCGTTCTTTATTGTGAAAGGCTCAAGGTGTAGCGGCT")) +(assert (= z "acauacaauaguaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0143.smt2 new file mode 100644 index 000000000..31f361f87 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0143.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGAGTCGTTCTAAGATGCCCCCTAAGCTTCCGGATAAATCGTGATGCGGTGGGCTGGCTGTCGACGTACAGAGAGGTAGAGACCATCCCCCAGAAAACAGAATGCTGTCCTCTTGTCAGTGTCCGTGCCGGGCCTGGGCTACAAGCCTTAAAAAACCGCGCGCGAGCGTACTACCCTTAGCCTCGATAGACGCTGGTCC")) +(assert (= z "ggguuuuauuuuugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0144.smt2 new file mode 100644 index 000000000..21963a89c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0144.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGCCTTATACCCATAACGATAACGTATCATGTGTTTCTTTCGATTGGAGCGCACGCAGTGCCCCAGTTAGCCCGATGTGTAGAACACAGACTATTTAGAAAAGTTACTACGGAGGCGAGCCACCCGATCTCTCGGCTGAGTCAGCGCATGAGTCAGAACACAAGTCCACCTTGTGGCTTTGAACCGTTTTGCGCGCGTT")) +(assert (= z "cuagcuaacaccaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0145.smt2 new file mode 100644 index 000000000..ad7477ebb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0145.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCTTTCGCCAGGTGTGTCAGTTGTCTCTAGGGTCACTGCGCCATGACACATTCTTCCGGATGCCATATTGGTGTTGGCTGTCGCTACTTACCCGTGACGGCTATTCGATGACCCACCTTCAGGTTCTATCCATAATTATACGACCACGGAGACGTTAAGCCATCGAACCCGACTTCCTTTGCGTCCTGTTATATCTGTG")) +(assert (= z "ucucagucuacaguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0146.smt2 new file mode 100644 index 000000000..02d098f49 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0146.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGTCCGGTCCGAAGCTGTACGCGGTAAGCTTGGACAATGAACATGACGTAGAGAGGCACACAAAGACCTTAGTTACCATATGCCAGGCGATCCAGCCGGTTCTCCTTGCCCCGTCGGGCCAACTACAAAGTTCCTTGCAAATCGAATTGGAATTGCGAGCTTATAATTCGGATTAATTAAAAAGTTTCCGCTGAAGTC")) +(assert (= z "ucuggguaaucgacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0147.smt2 new file mode 100644 index 000000000..3d66b828b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0147.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTACAACGGCCCTGGATAAATCAGGACCAGCCTCGGCCAAATGCAGTTTGGACAGGACACTTGGGTGGAACTGGTAGAGGTGCTAAATGAGCTGATCCCACCCTAAGAGGATCTAAAGCTAAGGGAGGCTAAAATCGCACTGGAAGAGGGGCGAGTATCGTTAGTCGCAGATATTCTACTGGCCGTATATCGAAGTAGA")) +(assert (= z "ggggaagaggcuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0148.smt2 new file mode 100644 index 000000000..2ae54c3d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0148.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGGCGCCACATCACCCGCGCTATAATGTCTTCAGACGTTTGGCGATGCTCATGGCGAGACTGCGATCGCCAATGAGTTATGGCCGCTCTGAGGAGCGAGCTGCCGGGATAGCGTGCCAATTGAGATTTCTGCCGGGAGCTCCGAGCAAAGATTGTCTAACGGAGGCTCATCACAGCTGATTCAAAGCCCTGATATGTAG")) +(assert (= z "cgaacaggauaccga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0149.smt2 new file mode 100644 index 000000000..4fb0cb655 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0149.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAATCCTTAATCCCTTCCCCGAGGAGCGGGACTTATAAACTCTTGGGCAGTTTAAGTCCCCAACGAGATATCGGCTAATTAAGATTGACAGACGACTATAAGGGCGACCTGGTTTCGGTAGATGACCCCTGGGGGGTTGGATGCACCGATCGATGCACATAGGCCGCTCCGTCACCGAACGCATGGGGATCTGTATCAGG")) +(assert (= z "gguccaaaauagacg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0150.smt2 new file mode 100644 index 000000000..4ef5f6b88 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0150.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATAGGTATGACGGCCGAGACTGCAACAACTTTCATAAGCCTTAGTATTCCGATATGTGGACTCTAAGGTGCCCTCACTTGACTCAAACTGAGCCAGGGGCATGGCGTCGGGGCGTCATCTCCCATCAAATGGCGTAGAAGACACGAGTGAACTCAGTGAGTCGTGCCGTTCGCCTAGTGGATAATCAAGCGCCACGAAT")) +(assert (= z "gaaacagggacaucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0151.smt2 new file mode 100644 index 000000000..6fb58f722 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0151.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTACGGCTTGCCGCCGAGCACTAAAGAGCTTGATAGCCGGATGCGACATCTATTGATGAGAGCTTATGGTAGCCTACCATCTCCCACTTACCCCCAAGCGACCTAACTGATGGTGGTTTATCGGGAGGTCGCCCTATCCATAATTCGTGGCGTCAGTAGCGCAGCATTGTATACTGCTGAAGGATATTCGTTTTCATC")) +(assert (= z "cacccuuucaaagac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0152.smt2 new file mode 100644 index 000000000..78d16c957 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0152.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCCCAACTAAGCAAGCGTCCTCTTCCGCGATGCTATTAGGACTGGCTAATAACCTGCTCTGAGGGGCGTTCGGACTCTTAATAGGCGGAATGACGCTCCTGTCCCTTTACGGGCCGTGCACGAACCAAGGCAAGCCCTGTCCGCTATAGGTGTGTGTTAAGCCGCCCTACGGCTTCGTCGTTAGTGTGCTTGTGATCG")) +(assert (= z "cuuuggcaguucuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0153.smt2 new file mode 100644 index 000000000..a360e0cf3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0153.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCACAGTCTCCTCATCAGCACATATTTATTCGAGGTGGCGCGAAACTTACGTGCATAGACCCTAATGTCCCGGCTAAACATCGCTACAGAAGACTTCTTGCCGCCCCACGGCATCCCCAAACTATGAAGCGGGCCTTATTACTGGTTATAAAGGGGAAGCTAGTTACCTGTCCCACTTATGATCGCTCGTCTTCTTAGTC")) +(assert (= z "agucuucgaucucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0154.smt2 new file mode 100644 index 000000000..737353169 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0154.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAGTCTGGTTTTCGGCAGAAGGTCTTCCAACTTATGCTCGAAAAAGTCAGATTCTTTCCAATCCAAAACCCCAATCAGCGTTGCACTCCCACGCTGGCCAATACCGTGTCCGAAAACAATCTTTTGGCGCTATTCCCCTTCAACTTCGCAGGGGAAGATCTGACGGTAGACTGACCAAGTTCCCTATACAAGGAGGGTC")) +(assert (= z "ggguacaggaagaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0155.smt2 new file mode 100644 index 000000000..d89d3db7c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0155.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCCTTGCCCCACCATATCACGTTCTCCGTTATACAAGTCTTGCTCCCGCCGAGATACGATAAGATATTCTAGGAAGTACTCTTAGGAATGAGCGATTCGTATCAAAGGGCTCGAGCCAACTGCGCGGTTCGGCGTCGAAAGTAGTAACCTCTGGAAGAAAGTAGGGGACGTTATGCCAAGAGTGCGCGAGACCGATCTC")) +(assert (= z "gucgaauacacugac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0156.smt2 new file mode 100644 index 000000000..987ee3014 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0156.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACGTTGGTTGGTCTCGTGTCTAGCCAGCGCGGTAGTTAGGTCCGGTACTCCTGTGCTGAGGAGGACGATCGCTTATCCGCAACGCTTACACCTGTTGCCGAGATTCGGCATAAATTCGAGGGGGAACTAGCTTGTTTAGCTTCGCTATCAAGAACTTTGTCGAGCCTGGCTTATTGTTAAGGATTCCCGGATTGCCTTG")) +(assert (= z "uguaguuacacccgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0157.smt2 new file mode 100644 index 000000000..247d2699d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0157.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATATGTACTGGTCTCCCCAGGTATCAGGCGTATTTCATCGAAATCAGACGTAGGCGCGTACAAACACTTGGCCTTCGGCCGCTAGCTGCAAGTGTCCAAGCCGTCCATTCGGCGGAGAAATCAGAAAAACAAAGTTAGACCTTTAGCAACCTACACCTATTGTTTCGCAACGGAGATACTCCTGTGTGTAATAGTTTTT")) +(assert (= z "cuucuuuuagucgcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0158.smt2 new file mode 100644 index 000000000..9f0fd25df --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0158.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCATATCAGTCTCTTCTTTCGGGCAGGAATCTTGATGTCGTGCTAGTCGTCTGATCTTCCAAGATACATTTCGACCATAACTACTCAACATCCCTCTCAAGAGCGGTGGTCATAGGGCGGCAGAGCTACGGCAGGTCCTTTAGATATCTGCCATTCAGCACGTTTAGTGATATGACTAATTCACACGGTGTAAATAGAGA")) +(assert (= z "agagacugcuagagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0159.smt2 new file mode 100644 index 000000000..1d4b7d769 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0159.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACCGTATGTGAATAATGGCACTCGTATTGCAGACTCTTGTCACTAGACAAGCGGTGGGCGACCTAAATTGTACCTGTAATACTGGGGACCTGGTCGTAGTACTACAGCTTTATGTTTATACCTAGTGGCTCTAGAGCCTTAGTTCAAGGTGTGGCCCCTCGAGTCAGGGTCCCTGTAACATCAATGGTCAACAACGACA")) +(assert (= z "cggucaacauacgaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0160.smt2 new file mode 100644 index 000000000..7a2013288 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0160.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCCTACTTCTGCGTCTACCTCTTAACCTCCGAGCTTGTAGTATGTTATGCGCTATCGTGACCATGATCGGCTGCAACGCCCCTCTTAGAGACTGTACTATTCTTCTGGCGGAATTCCAAATGGGCTCATGCTGGTATGTGAGGGGACAAAAGCGCAGCATTACGACCCAAAAGGACGTCCTGATCCGGGATGCTAGCTA")) +(assert (= z "accggcgaaccuuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0161.smt2 new file mode 100644 index 000000000..84e01ff99 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0161.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACACGTCTGCAGTCCGACCTAATTTTGGTCGACTAATCGCCGATCTGTTTATGTCGACCGCAGTACAAGGGGGGCAAGCGGGTTCTATACGAAAATATCTGCTACTATACTAAATCTAGAACACATAGTATATTGAACTGAATGATCGACTCCAAACAACACAGGCTGTAGAATCAGCTGATCATTCCGCGCATCATTT")) +(assert (= z "aaguuagguauauug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0162.smt2 new file mode 100644 index 000000000..13a11aaa4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0162.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCTACTACAATAAGATATGGGACTACTATTGCACCACAAGTCATACGAAGTGATGGTAGAGTTTGCGGTTGCTCGCTAGCCCAGGCCACCATTATGGTGCGGCAAGATACTTGTAGGATGATTGCTATCTCCGTCGAAGCCCCGTCACCTCTTGTACGCCCTGCGTCACTCAAGATCCCCTGGAATGACTGCTATCTT")) +(assert (= z "aguaaacaagggcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0163.smt2 new file mode 100644 index 000000000..9db0a6797 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0163.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGCTCGTTTACTTTTCCATCCCTGATACTTCTCAGTGTTATCATCGCGCACGTACAATATGATAAGAGGTCTCGAACATACACCGGTGAACCATCATGAGGAGCTCACAAAACCTGAAATTAGGAGTCACCTCATTCGGTTACAATAGCCCCCAACACTAGCGAATGTTATGGATCCAATCCCCAGTGTCGGAGCCAAC")) +(assert (= z "cgacgaauacuugca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2 new file mode 100644 index 000000000..d3a7acd2a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTAATACCGTCGGAGCAGCTAGGCCCTCCAAAATGTTAAAGTGACTGCTTAATAACCCGCGCTGCGACACGCTCATCCTTGGCACCGCGGATCCGACATGATGATTAACAGCACGCCGAGGCAGAAAACGGTCAGCCGACCAGTATCGGCTTATTGCCCCTAGGCGGGGCGGCGTACTCATAGGATTGACTAGATCCC")) +(assert (= z "aucuacccggacccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0165.smt2 new file mode 100644 index 000000000..7b4376e03 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0165.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGTGTGTCCCAACAACAAGGCGAGCCCACTTGGTAAGCCGGTTTATACACTCTGCAATTAGCCGGTTAGTAGGTTTGATTCAGGGGGTCTGTGGAATCAGTGCCAAAGGCCGTCCGGGGCTGGTGAGTCTGCAAGATGGGCCGAGGCGTCCTTCGGTAACAGCTCGCGAGCGCCACGCCGCTCGTCACACTAGCGCCCT")) +(assert (= z "acucgugagaccuca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0166.smt2 new file mode 100644 index 000000000..f519c4544 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0166.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCACAGCGTTTTATGCTGTTGAGCACGTCTAGTTTAATGGAATTAGCGTTGGGTCGCTTCCGTGGATCCCCCAAGTACTCTTAGGCATTCGTAGTGCAGGAATGACCCAAGTGCCACCCACCTAATAATGTAGTTTGCAGATAGTCGTTTATATACTTAAGGTACTTTCGTTTACCGACGGGCATACGGGTGTTGCCCCG")) +(assert (= z "caagugauauuuauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0167.smt2 new file mode 100644 index 000000000..5dae69cb8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0167.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACGAAAATCGAGGATGTCAGAGAGCGGTCCGCAAAATATCCCCCTTGTGAGCACATGTCGTGGAAATTAGATGTTGATATTTGCATTTGACAATTATAGCCTGTGTATAAGCCCCGTCAGGAGGGCGTCCCCACCCTCGGATTTCTACTCCCGTGGATCATCAGCGCGCATATTTTGTCTGCAACCGAATTCTCCCACA")) +(assert (= z "ggauuuggccgagau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0168.smt2 new file mode 100644 index 000000000..29e84c60a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0168.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCTCCGCATTCCCTCTGGGTCTCACCATCACTTCCCGTAATATGACGGTCCCCCCGCCTGAGAGATTCGCCCGCGCCATAAGGGCAGGCATAACTAACATAATAACGCCATATAGTTTGTCATATTCCTAGTCAACCTACGAGTTCTCATGCCTATTTTGCCAGTCCCCAAGCCACATGTGTATGTCGGATAACAGGAG")) +(assert (= z "acauccgccucuugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0169.smt2 new file mode 100644 index 000000000..f62e368dd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0169.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGGGTGTCTGATTCAGGCTGCCGCAATAGCTACGAGACAGCGGTCTGATCTGCATGACCGACGCCCCTCAGCGTAGACGACCTGGTATATTCCAAGGGATAACGCAACGCTTTAAAAAATTGAGGCATGCCATGACTGAGCCCTACATCATCGGTGGCTCTGTTCTTTTATGAACGGGGAAGAACATTGACATACGCAT")) +(assert (= z "auaugugguaaguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0170.smt2 new file mode 100644 index 000000000..9154380fe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0170.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGTGAGGATGTGCGTCCCCGCTTATTTATGAGTCGCGGTAGCCTCGCCGTGGCATAATGCGATTTTCTTTATGGACACTCATACCTGGGGAAGCAGATGGGACTCGGCTCGTAGATCCACGTACTGATGATCAACACGGCCTGTGCAATACCTCCAACGTGAAGGTTATGTAGCAGCCTATTTCGGTAGGAGATTTTG")) +(assert (= z "ccagcuaggauacaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0171.smt2 new file mode 100644 index 000000000..69eadb54a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0171.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATCGCTTGCTTGTTGACGAATGCTGGGAGTTCGATAAGCGAGCTAGCCATTGTAGAAAAGGAAGCCGACGCTTTGGCTAAAAACACCGGTGTCGTAGTTTCTGTGCGCAATCTCGGGTTTACACAGTACGCCTTGAGCAGAGAAGGCGTTACCATGCATCGTAGCAGAACGTCCCTTACCAGACAATCAATATCTATAG")) +(assert (= z "cgccggucacacggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0172.smt2 new file mode 100644 index 000000000..c7372209e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0172.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTCATGTGTTTAGGCATCCATTACTCTGGCGGATACAGGGTCCATATGTTGCATCGCGAAGGTCACGTAGAATGTGTGAAAATTATCTCCAATAAGTTCCGGCCCAGTGCGATTCGCAGGCGTCATGGCGACGCACGCTTGATAATCGTGGGTCACGCAGAGATGGATTTTGGACAACCAGTCGGTCTCCGGGACTCG")) +(assert (= z "guauaaacacuaagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0173.smt2 new file mode 100644 index 000000000..4eede457c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0173.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGAAGGGGGTATGACGCAGTGAGGGGCCGTGATTCTCTGTCCCAGCCAGGTGTAACCTCATAGGCCAACAACCCTCGGTAACTGCCTTGTGAGGGATGAGCGTTGCATTACATCGAAATGCGAATCGCCATGGTAATCTGCGACATTAAAATAAAACTGTCGCTTGCGATCTATCAATGGTTATACCGGGACTAACGGG")) +(assert (= z "aacaguuuaagacau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0174.smt2 new file mode 100644 index 000000000..f5b8b2b89 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0174.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCATCGCCACTAGACTCCCTGGCGACATGGAGACGATTAGCCCGTAACGGCGTGTCTCAATCGGAGATCCGGACCCCTGATAATAACCACTGACCTTGCATATATGAGATATACGTTTGAGTCTCTAAATGGAATACTAAAGAAGGTAGCGCATTAGCGGTCAGAAGCCGAGCCATTCCCACAGGTGGCACCGCGGATAT")) +(assert (= z "gcaagaguaggaagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0175.smt2 new file mode 100644 index 000000000..e4b39b7a0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0175.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAATGGCACAGGCTCCTGAGAGGAGTGATTCCAGGCGATGCTGAACGAGCTCGCACCGATATCACCGGGTCGCAATCACTTGATGACACCGCTATCCCCAACCCCCAAGTAAACCCGCGAGCGACGCTCTGAGACGTTCTCAAGAGGCGCAACTCGAGCAGTTCAAATGCAGAAAGTGCGGGAAACAACTGGCTCGAGTC")) +(assert (= z "ucuacuuggaccuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0176.smt2 new file mode 100644 index 000000000..a789dc6fc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0176.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CATGATAGATTTCAGTTGTGTGTTGCAAAGAGAAGGACCTTGAAGACACCCCATCGCCCAGCCTCTGTAAGCCGCTGCTTAGGGTATTCGTGGTTCGCCTCGCAGCAGTTAATTGTCGATACACACCCTGTGGCTTTTCATCCTACTATCATAGACTTCGTGAGAACATGTTCTAGTTGGGCAGGGGAACGTTTAAGATC")) +(assert (= z "cacaggcaagguuua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0177.smt2 new file mode 100644 index 000000000..84fc71218 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0177.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTTCTCCGTATTCGTGGAGTATTGGCAGAGCGAGTGGCCTGTTCCTTGGGTCTATAGGAATCCTAGCTGAGTCTTCGAAAACTACATAGATATCCAATATGGACGCTAATCAGCTCTTGGCTCGAAGTCTATGGATAGTATCCCACTCGAGCGTACATCATGCAAAATAATGTGTATGCGAACCGAGACATTGAAGTAG")) +(assert (= z "ucauggagcuuaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0178.smt2 new file mode 100644 index 000000000..057b292a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0178.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTACCGGGATGTTTGGGGCTAGTTAGTGTCGTTGTTGCTTGAGACGTCACTTATAGGCGTAGACCGACCCGTCATCTAAGTCGACCAAACTCCATTCCGCTTAGGAGGGGGGATATTCGGCTCTACGAATTCCTTGAAACAGACAGTGAGGGTACCGCGACGTACCCAGATGGTAATGCGTGTCGCGAGTACGGGCTAG")) +(assert (= z "caucaggguauuggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0179.smt2 new file mode 100644 index 000000000..9d9eb15fc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0179.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGACGGTCTTCCCCGAGTATAAACCCCCGTCAAGAAACCGGTCCTACTTGGTATTTGCCATTAGTTGAGCGGACGCAACAAAGGTGGGGATGCGAGATACCCATAACAGCACCGCATTTACAGGCTCCAGGAATAAACTCGGGGGTCAGGTGTGACGAACTTCCCCGTAGGCAGACTGTGGCAGGGGCGGAAACGGGTCT")) +(assert (= z "caacuuuaccugugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0180.smt2 new file mode 100644 index 000000000..9d59eabdf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0180.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGAGCTTCTTGAAGGTATGCAGCCCTTCATAGTATTAAACCCAAATCCATCCAGATAGAACATTAGTCGTTGCACAAGCTGAGGAGTGTACTAAACCATCTATTGCCCATTTCTCAGGCTGTTGGCGGCACTTCAGCCCGGTCCCACTGGCTCGAGGTATTTTGGTCATGATGGGGCTAGCAGACCCCAAGCAATACA")) +(assert (= z "gguguugcacguucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0181.smt2 new file mode 100644 index 000000000..e3d0f4684 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0181.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTTTATCACTGTTCTAGGTCCGCTTCGAAGACGCTGGGGTAGAATATTCAGCTAACCCAAGCTGCATACTAATATAAGTGCCATTGTTATGGCTATGTTAGCGTTTCTTGGACCATAGGGAGACGGATACGCCTACACAGCCATTGAGATCGAAAAGTACAGCCTAGATGCTGTGTCGCTGAAGCAACACATCCGCTCA")) +(assert (= z "uggauacugaguugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0182.smt2 new file mode 100644 index 000000000..d200cf507 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0182.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTGATTAAGGGCTGCTTTCACGCTGTGGGACCGAAGATGTTGATAGGGTACAGGGTTTAGGCATTCGAGTCCTTGGAGACGTTCGTTTGAAGCAGATTGTACAATCTGCGTTTGGCGCATAGCCTGGTAGCTAACCCACTTTGTCACAAATGACTCCGTGGTTACGTATCAAGTGAGGCCCTCCGTCCCCATTGACGA")) +(assert (= z "uaaugcgauauaagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0183.smt2 new file mode 100644 index 000000000..656a8bc8a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0183.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCGCTTGTTTTAGAATGAGATGTTTTTCGGGTGGAAGCCCTCTGCTTTTTAACTACCAGCCCTAGCATGACACGCCTCTGCGGCTTGCAACCTTCGTCTGGCTTCCCGGCTCCGACCGCCTTCCTGGAACCACTATGGGTGGTACCTAACCAGAGCTTTGACATCCCGGCGCCGAAGATTGTACGGCGCTCGTGGAAC")) +(assert (= z "gauacccgcgucuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0184.smt2 new file mode 100644 index 000000000..58abbe05d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0184.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCCGGTACATTTTGCCCCCTTGTGTACGGGGCCGATGCACTCTCATTACCCAAATCTTCGAAGGTCTCTAATAAAACTGCAATCGCCGGGTACGACAGGATAGCATGATTACCCGGGCATAAGGTCGGTTAATTGATCTCACGGGCACGAGTAAGTCATGGGCGTGTTGCTCCACTCAAGGTACAGCGCTAGAGAATA")) +(assert (= z "ugcggcuccguguua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0185.smt2 new file mode 100644 index 000000000..3ce85e357 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0185.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAGGTTCTGACCAGCGTACTACCACGCAATTGTTCAGAACCTCAAGGACAGTCCGGCCGAAGCGCGGTCGAGGAAGTGAGTAGAGGATGTGAAAATTCTAGTTCCGATATGCTCGTCAGTTAATAGATAGGACACGCAGTCCCAAGTGCCAGTTTGTCGAACTATAGGGAATAAGCCCAACAGCTTGGCGCACACCGGA")) +(assert (= z "aaccguaucucccuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0186.smt2 new file mode 100644 index 000000000..aae3ebe90 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0186.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATAGTATGGATTTGCTCGCTATGATTGCCTTGTCTCAAAAGAAACCCTCTCATATTGGCTCACGGCTTGTCATCGTGATCTTTCGCTGAAACCCCTACGATTATAGAGGTAGTGACATGCTGAAATGCTGGTGGGTGCCGTACTAAGTTTACAATAACATGCTTGCGAGATTTCGGGTTTTTTGCCCAGTACCAGCC")) +(assert (= z "cagcucgagcuaugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0187.smt2 new file mode 100644 index 000000000..89089409f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0187.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCGCGCGTACTCTTTCACCGAAGTGTGTATTTGCTTGCTTTAGTAGATTAGCTTAGGTGGCACAACGTCCCAGGGAGAAAACGGAGTATGGCAACGGCACCGAGTGTATGTGACGCTAATCACTGACACCTATCCAGGAGGAGTATCTCGTTTTTACGAGACCCGCAGCCTGTATTGGGAGCCACATATTTCTGCAGTC")) +(assert (= z "ugcacuuuucccgcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0188.smt2 new file mode 100644 index 000000000..c81f1dda7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0188.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGTAGGATTTCTGAGGTTCTGAATTACCTTTATTAGATAAATGGCGGGATCACCAGTACAGCCGAATCGATTCGAGCATCTGGCGAATAGAGATCATCGAAATGTCGGTTGAGAGGCACTCGGATTCGCACCCCATTAGGCCTAGTTAATTCCTTGTCCGCCATAGTTTAGTCTGTGGCTTGTCAGTGAGGAGCGTGCC")) +(assert (= z "uccuucuacagcgug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0189.smt2 new file mode 100644 index 000000000..beacb1c48 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0189.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTCCCAGATAGTGAGTGCACCATCTTCATCCCGAAGCTACTCAGCCGAGAGTCCCCTGGTGTATGCAGTGCTGGTATTTGGGAGGCCCGAGTACTCAATTTCTTTAGGGAGGGCAACGGGACGTTGTTGTGTGATAGGGGACGCGGTGGTTTAGTAGTGCGGTCAAAGCGAGTTAATCCCGATGGAGCGCTATCACTGA")) +(assert (= z "guaaccaacgugagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0190.smt2 new file mode 100644 index 000000000..f3c1d8169 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0190.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTTGCCCCAGACTCTAGAAGTCCAATTGTGGTGATCGAATAGCCATTCTAACTACTGGCACGGGAGAATATCTGCCGTCAGTTGGATTACGAAGCATCAAGAAAGCAACTACTGGGATGCCCAGTTCAATCAGTTACCGCATGTGGGCGAGATTCTCGGGGGGGTCATTCGTCTGCTACTGATGTAGTGTGTCATCCGC")) +(assert (= z "cgucgauacaugguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0191.smt2 new file mode 100644 index 000000000..e6bb59345 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0191.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGCGTAACCGGTCTGAACGAGTCATTAATTAGGTTAATTTTCATCTAACGGATAATAAGTGCGCAGAGTAACAAATCTGCAGATTGTTGAAACGGGGTGTCGAATACTGATCAACTATATTGGAGAATGGAGTGTAAGTGTCAGTTATAGGTCGAAAATGGTAATTCACGATAGTATTACCGTAACTACGGCCGAGGAC")) +(assert (= z "ucaaaaagaucuggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0192.smt2 new file mode 100644 index 000000000..14697edd4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0192.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCAATGGGCTAACGTCTGTTAGCAGCGGATACTATCAAGTCATCCTTTAATGGTTAAAGGTAAATAGTTAGATGTTTTACTAGGTGTAACAACCTCGCCGACTGGTGCGTGAGATTTAAGAATCGTCGGGACGAAGGCTTTCAGGCTAAAGGCCCGGATAACCTCCCTTTTCCAATCCAGGATCGGCTGCTTAGTCCAAA")) +(assert (= z "uagcccgucaccaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0193.smt2 new file mode 100644 index 000000000..e9e7fc403 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0193.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTTTTGTCTTAATGTTGTTGCGCACGCATATTATGGACGTCTTACTTTTCAGTATATTGTTCAGCCTCAGGGTGCCTGAGGACTCTTCAACATCCATTCGATAGCCTTCGTGCCAGCAACCCTGAAAGTAAACGGTATTTCTCCGGCATCGGACACAGGCGTCATAGCGTGCATTGAGAGCGTTGAACGCTTACCTTT")) +(assert (= z "auuggucuuacgauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0194.smt2 new file mode 100644 index 000000000..ca246872f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0194.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCTTAATTACCCAGCGACAACATACTAGTGTTCCGGTATCCCGGGGTTAGCGGGTTGCGGAGGGTATGCTAACCTCGCTCTCCTACATAACGTATCTGTAAGTGGGGACCTCAGGTCTTGCCACTCTTCATTCAGAGACTCCGGAATTCCCAGATGCCCTGGACCCCACAGGGGCAACACGTATGTACAGCAGATCATC")) +(assert (= z "cccaaucgaccgucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0195.smt2 new file mode 100644 index 000000000..3d797e22d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0195.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACACAATCCCGGTCCGTTAGAACCACGCTCCCTAGAAACGTGCACCCATGCCGACGCCCTTCAACGCCCAGCCCCTCCAGGCTAGATTGTGCTCTCCGCAGAGTAGTCGGTCACGTGACATTTGCAATGAAACATTAACACTGATGATGTGTGACCCTAACTCTGAGAACTCATCACTGGGCCGGAGACCCCTCTTTT")) +(assert (= z "ccuaauuucaauggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0196.smt2 new file mode 100644 index 000000000..b0e8d392c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0196.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCTAACTAATTCCGATATTGTCTATAGTGTATGGTCATATGTTCTATGGCTTCTACAACGATCCGGTGGCCCTAGACCGGATGCATCGGCGTGTATACCTTGCCGCCACTGTCTTGTGGAACCGGGCTGTCAAGGAACGGGTCAAATGAGATAAGCTCCCGTCAGCCCTTCCCGCAACCGCCAACTAGGTTCGACGCG")) +(assert (= z "aucguucuaggaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0197.smt2 new file mode 100644 index 000000000..ad1468ffa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0197.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGATTTGAACAGGCTGATTATGGTGATTCGAGAGTAGATTGTTCCGCACGTCCTCGTCCGTTGTATGCCAGCTCCACAGGTGCACTTTTAGGACGTACCGAAGGTGAGGGTTTGGCGGGAGTGACTCGGACTAACATCATCTACCGGGAACCGTTTGCCCAGAGGGTGGTGGGCTGTAGGCTCCAGTCGATGTCTACTGT")) +(assert (= z "aguccgggugggggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0198.smt2 new file mode 100644 index 000000000..88b0509f7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0198.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCAGATAGGGGACCATCGGTGCCAGAGTAGATGTGATGGCTGGAAACGCTATCGATTAGGAGTTGTTTCACGAAGTGTTTTGCCGTCCAACCTCTGCCAGATCCAACGCAGATCCTCCCCGGGTATTGCAGCGATCCAACCTAATGTTATTACTTCCTCAGACGGCGTACGAAGTACTAGGGTAGTCCCTAAGACAGGTC")) +(assert (= z "acggcuugaccuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0199.smt2 new file mode 100644 index 000000000..dc91c0718 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0199.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTGGTCTACACACTCATTAAAATAATGACAACCGTACTAAACATGTCGGCCTGCCTTTCAAGACAAAGTCAGGTTAGAAGTTACTAGTACAAAAGTGACTGGGGTAAAGTTTTCGTGTTCAGCGTTCCGGGGAGGCTTGTCATGAGGGATTAACATAAAGATAAGGACCACACAGGAGTTGCGATACGGTGGTGTCGT")) +(assert (= z "acaggcgaauggcuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0200.smt2 new file mode 100644 index 000000000..a03da1f95 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0200.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGACAGGTTGATGAACGAACGCACACCATTCGGGTGCCTTTGGCCTCTAAAGGGAGGAACATCTTTTAAAAGACATCTAACCGGCGTCGATCATCAAATCGAACTACGGATCTAAGAACTTACGGGGTCCAGGCGATGGGGCAAGAATAATCATCACTCACGATTCTCTTGAGGAGCGAATTTATGGGGATCTGGATTG")) +(assert (= z "gaguccuuaugagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0201.smt2 new file mode 100644 index 000000000..71ab13d5f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0201.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTGGTACCTTGTTGGACGTACTACCTGCGTTATACCCTCCTCCTTGGAACCCAGAGTTCCGATAGCGTAATCTTCGGATCAGACTCGGGATCTCACAAGAGGTCTTAGGCGGGCAAAACTCTTTTAGACCGGTCTTGGGACGATCTGGTATTTGCATGTAAGAACCTGTCACAGCTTCCACCAGGCTAGACTGGTAGA")) +(assert (= z "gacgcauuugaaccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0202.smt2 new file mode 100644 index 000000000..8db6ffe85 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0202.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAGAAACGCGAAGGTGGCTCGTATATTAACAGAAAATGATTTGAACAACTCGGCCTGGTGTCCGGGTTTTGTGAGAAGGTCTCGGTACCATGTGGAAAGCAATGACACGTACTGAACTTTCGCTCTCCGTGACTGCGGGGCGACCTTGGTAATCGAATAACATGCAGCAGAATAGGTTTAGCCGTCTGAATGAGATTG")) +(assert (= z "ccggcucagaaacua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0203.smt2 new file mode 100644 index 000000000..25d57a4f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0203.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGAGGTTGAGTCAATTGGCAGGATCACGGAAAGAATTCGGTTCGAGAACACGAAGGGCGATACCGAGGCAGTACGAGGAAGCCATGAGTCCGCAGTCACTACCGATTAGGTATACGGACACGTAGACGGGGGACGATTAGATCAACTTCCAGTTTCACCGGCGGGGGCGCTTCTAAACATTTGGCGTACCGTGTACTGGT")) +(assert (= z "uuaugacccaugcga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0204.smt2 new file mode 100644 index 000000000..e66f9ca96 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0204.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCTTGTGCGATGGTCCGTCGACTCGCCAGATTACCCGTACTTTGTCACGGTGCATATAAAGGCAGCTCCCTGACACATCTGCAAGCATGTATCAGGCGCCAAATCAATTTAATTAGGTCCAACAAGGTTGGAATGGACTGTCAGTCGTTGTAGGAGGGTAGTTACCTATATCCTCTACGCGAGGATTGTGCTTATAGAT")) +(assert (= z "agcgaguuaggauau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0205.smt2 new file mode 100644 index 000000000..cedfde9d0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0205.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGTTTACGCAGTCCCTTCACTAATTAAGATTTCTTTCCTGTAATTTTCTAGTTAGTACGACCGGAAGCTGCAATCTTATAACGATATCCACGATACCTGGGCAGCCGGGACAAAACCGGTCTATGGCCCAGTCGACGGCGATTTGTGCACCGCATGCAGGAGGCAAGTCCTAGCGGCGGACCGCCAGATACGACGGTG")) +(assert (= z "cacgggaccauacga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0206.smt2 new file mode 100644 index 000000000..9407546ce --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0206.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGGCACACGGTATGTCGAGAACGTCTGAAACTAGCTGGAAACAGTATTTGTGCTGCGTTTTTGCAGGATGGGGAGTCTGTAGGTAGATTGCACTCTGTAAAATGCGGGCCCCGGACCGCCGGCAGGGGTACCCGCTAACCGCTGAGCTTGGTCGGGCATACATGTCCGGTTAAAGCAGAATGCTTCCTTCCCTGTAGTC")) +(assert (= z "cucuggagucccccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0207.smt2 new file mode 100644 index 000000000..b440aef29 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0207.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGGGCACGCCCGGCCCCACTGTACGCTTGCATGGCCCGATGCGCCCCAGTGTTTAGCACCGGACTTTTTCCTTCGACGGAGCATAAATCAGCAACGATGGCTTGCACCTGGGATAGAGCAGGAGGGTTGCACGTCAGACCCGTCGGTATGCTGAAACTCATCTTGAAGCATCATAACTCCCGAATGCTCCCAGCTAACA")) +(assert (= z "cggagaucuacacau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0208.smt2 new file mode 100644 index 000000000..441013b7d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0208.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACCACAGTGAGAGCTCTCGGGCCCGCAACGAGTCATTACATTTTTTGTCCCCACCGGGACTAATGCAAAGAGGGCCGGGACACTGCATTGATTGCCACGACGAAGACTCCCTAGTTATAAATGTTTAAACCGCTCGTGTGAGTATACAGGGTATTATAAGTCCAGTGTATTTCGGATCAGGGATATATTATGAAGAAAA")) +(assert (= z "caccgacauuaguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0209.smt2 new file mode 100644 index 000000000..b83c3cd17 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0209.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTACCGCTGAAATGGGTTACAAAGTACTCTTGGTGGCTTAGATACCCTGATACAGCCAGGAATGATAAGACGTTAACAGCTACCCGGGGTTGTGTGGAAGCACGTAAGGGTCATATAAGCCAAGCCGCGCACCGCGTACCACCTGTGTGGTAACCATCGTTACCGGGCCGCTACAAGTTAAGAACGATAGTCCAGACTG")) +(assert (= z "cugacgucccguagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0210.smt2 new file mode 100644 index 000000000..677f4e665 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0210.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCGGCTGACGAACGCACGATATAAATCCAGAGTTGAAGTAATGCGCGGTCGTTAAGATATTCCGGTGCAGATGGTCTGACTCAAGCCCATGAAAGGTCCTCATGAACTTCCTGGGACACTCACTCAGGCAAGGTTTGGAGACGTGCTCGCGCCTCTTCAATCCGGGAGTGCCTGCAACTGATGTGGCCACACCCCGGC")) +(assert (= z "accguuccuccucaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0211.smt2 new file mode 100644 index 000000000..3d4f24886 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0211.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTCTCCCTTTGCCTCAAGCACTGCTGACCGGGCATTCAGAGTTGACTTTATTAATCTAAGATTGTATGTTACGCTCTTTGGCCCGGCGAGCCGTGATGAACCCAACAAGTATCTTTGCAACGCCCCTTGGATACAGAGACTGTTATATTCCCCAGGAGTCCTCTGGCCTGTCAGTCTTAAAGAAATGCTTCTTGAGTAC")) +(assert (= z "cuauacagcaccauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0212.smt2 new file mode 100644 index 000000000..e7aa33e71 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0212.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAGTCCGCAGCGAATAGCCGTCTGGGGAATCTTTTGGCTTAGACACTATCAAGCTTAGACCAGGCACCTTGCGGAAAGGTCGCCATCTCCAGCCTCGTGAGGATGAGCTTACCCATACGACGGGCTCCTTGTTAGTCGGGAGAGCTATACCGCCATCGAAATCTGCGGCCCGCTTAGACATGTGGCGCCCATCATGCTC")) +(assert (= z "aaccgcggggaccua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0213.smt2 new file mode 100644 index 000000000..e98b9f93b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0213.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTCCTCATGTTAGCGACCGGCAGGTGTAAGCTAACCCTTCCCATTTGCAATGCCATTCGCGGTGTGTGTTAACCATTGGCCTCCAGCTAAAAATCCGCGGGGGAGGCCTGCTTAGTTCTGTAGCCTATCTGGCTAAAATGAACCATGCAATCTCCGGTCTTGTTTCATCGAAACATTCTGAAACCCGTTGAATAGCGAA")) +(assert (= z "cuucccaguuuuguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0214.smt2 new file mode 100644 index 000000000..926016959 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0214.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAGGCTATGCTGAGACATTCCTTAAACGCGTTGGGCGACACTTTGGGCGCGATGGTCCGAGCATAATGTTGTCAATCATTCGCTATTTCCCGACAGTCTAGGACGGAGGCTCGATTCTGGCCAAGACCCCGCGCCATACAAGGGTAGATTAGATGAAGGGTATCGTAAGCCGTCGCAAGCTTGTTGATCAAGTTGCGCA")) +(assert (= z "gguagccuuggccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0215.smt2 new file mode 100644 index 000000000..c9043acaa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0215.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCCGGAGCGTCAGGTACCGCCCCATAACAATCTGAAGCCTATGACAAGTCCGATGAGTAAATGCCTTACGTGCCGACGGCTTACTCGACCTCCTAAGCCCACGCGGCAGTTGGGGTTCGGGCGTCTTATTCGTAAAATCTCTCGTTCAATCTGAGTGTCAGTTTGTGTCGCGGTTGATGGGTGGCAGAAAATTCATAAG")) +(assert (= z "ccaauagaucuuuuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0216.smt2 new file mode 100644 index 000000000..58e3df996 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0216.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGTTGAGGCGTGATCACATCCAGATCCGTTTGCCAAGAGCGCACTATTGCTAGCGAGTATCTCAGGACCGCATTCATTTCTCAAGCAAGTGTAAAGTGGCCATGGACTAGGTGGCATCTGGATCTTAACGCTTTAGATAACATTTGTACTGATGCTAGTTTATTTTAAGGTCTGAATTCCATTTGGGTGCTGGAAGCAC")) +(assert (= z "aacuaaucaucaagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0217.smt2 new file mode 100644 index 000000000..5cc6bc76a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0217.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGCTGCTGATAGCTGCGGAGAAAGGACATTGATTACTGGAGGGCGTATCCGATCTTAGAAAACCAAGGATCTACGGCACTGACGGTGTTGGAGCACAAACAACATTATAGTGGCGGTGGACAAAAACCAATCCTCCTAGAACCGTCCCTTGCCGATATAGTCGCTGCACTTTCGACGAATCCGCCCGCCATGTCACCCG")) +(assert (= z "cgcggcuagaccggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0218.smt2 new file mode 100644 index 000000000..e954808dd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0218.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGAGGGCTCTGCTCAAGTCCAATAGGAAGTACCTCACGTTAGGCGGACGAATGGCATGGAACACGCGCGCTTGATTTATATAATTGAGAGCCGACTCCCAAAAGAGCGAGGTGATAGCGGAAGCTTGGTAACATAACAGTTGATCATCCTTTGGTTGTTCGGAGTTATTCGGCTAGTGCGAGGAGCATGCAAACGACGA")) +(assert (= z "ggaagaccgcccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0219.smt2 new file mode 100644 index 000000000..189f11520 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0219.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTACTCAGTAGGCCTAGCCTGATTGAGTTAATTGCCTTCTTTGATTAAGAAGCGCAGGAACATCATCCCATGGGGCTTAGCGATTGGCATTTAAGAGCAGCAGTCGTCCGCTTATCGTCTTTGTCTGATCGTTGGTAGCGTACCTAGCACGCCAAGTCCCAAGCCATGTTGCATGCGGCAGGTACACTCCAGAGTAATG")) +(assert (= z "ucgccuucucuacaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0220.smt2 new file mode 100644 index 000000000..cfbca95b3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0220.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCGCTAAGGGTCGGATTTGAAATGGGAATCGGATAATGTTACCCGTTTAGAAAACCTTAGAGGCATAGTCTATATCAAGGGGTACCGAAGCTGTGAGACTAAGGGGATTGGTAGGATGGCGCCTATACGGACGTGGCGACACAAAGGGAGTTTTGTCTGGTTGCTCCTGGCGGAGCCAAGATTTACTATCACACCACG")) +(assert (= z "guuuucguucacaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0221.smt2 new file mode 100644 index 000000000..6a46740f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0221.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACGGGTCATCGTGGATTGCTACATTGGATACCATGCCGGTCCATATGAGACCGTCCGCGAGACCCAGAATCCTAGGGCTCCCTAGGATCCGGGCAAACCAAATAGACATGGCCACATAGGGACTGTTTCTCTGGCACGCTCTAACGACCCAGCACAGCTTCAGTATATTAACCTAGACAGTCATCCGCGGCATGAAAAC")) +(assert (= z "cagucuaggcuguca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0222.smt2 new file mode 100644 index 000000000..2c77ef464 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0222.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTGCCTGCAGATAGCGTTCAGTCAACGTAAACCCTCCGGCGGTCAGAGACAGCCCAGCTTCATTCCTGGATGGTTTAAGCATGACCGGGTCACGACCCATGCTAAACAGATATATTGCATCAAATGAACGTTACGGTGCTTCGTTACATTTAGGGTAGGAAGGCGTAGGTTGCTCGTGGAGTTAAATTAGTCTCCGTAG")) +(assert (= z "ucccaaauuuaaucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0223.smt2 new file mode 100644 index 000000000..2a359d5f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0223.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTGTTGGTCACGGCTTACTGATCGAGCACTGCTGGCGACGATCGACGGTTTATGTTCGCCTCGGCATACCGTCGATATCTATACGATTATTCACTCACCCCAGGTTCCCATTATCGGAAAGCGTCTAGTTGAAAGCGTGACCCCCCAGCCGGCTACTTATTCTGAATTGGTGGCCGCTAGCCGATAATTCCCCCGGTTA")) +(assert (= z "aaucguauauccagu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0224.smt2 new file mode 100644 index 000000000..4412294c1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0224.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTTGAGGCTAAGTTTTACCGTGTAATTCAGCCTTCATTGGTATAGGCACCCTAAGGCTATCGCGGAATGCACCTACCCGACTCGCGTCACTTACACTTCAGTCTATCCCTCTCCTGAATAGACGAACTCCTATAACGCCTACGAGTCATGGCTCGTGTCATGGTTTGGCGCATTTCCAATGCGTGACGAATAAACCCAC")) +(assert (= z "uauucccuguggggg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0225.smt2 new file mode 100644 index 000000000..2f228c9bc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0225.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGTTTCTTGCTGATTCTTGCCCTGTGCGGGCGCGGTTGTCTCGAAACATCTAGTCGGGGGATCCGGGTTACTTCCTAGAAGAGCCCCTTTCACTGCATAATAGCGGGTTAAGGGATTGCGAACCAGGCCGTGAACAAACAGATACATCGGGTGGCCCCGTGAACATTCTGGATAGCCCCCGCGGCAAAGTGCTCCTAGG")) +(assert (= z "gaacagaccaacaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0226.smt2 new file mode 100644 index 000000000..3081dd33e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0226.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTGACCCATAGTTATCCTACACAGGTCCACCTGAGTCGACCGGCTATCCGAGGAAAGGGAACCCGGCGAATACTTTGCTGGCAAAGGATGCCTGACCACCCGATTGGGATTGGCTTAGAATGCGTCTCGAAATATGTGGCGCCTTCCAGCTGCTCGAGGGAACACCCATATTACAAGGTCATAGTGTGAACATAACGA")) +(assert (= z "cuguugaucagcaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0227.smt2 new file mode 100644 index 000000000..5bcf2e166 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0227.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAATCAGGAAACGATGGGAAAACGGATGACCCCCCCAGCCTAAAGACAGCAGGCCTGACTAGGCATACTAACCCCGACAGCCGAGCCGGGTTAGGCCCTATTGCTGGACGGCTGCTTGCGGAGCCTGAGCCGCGAGCGATGCCCGTTATGCATATCCATACAGTATTACGGTTACAAATTTTTTTTTTTAACATCAACAA")) +(assert (= z "cggagauacuccacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0228.smt2 new file mode 100644 index 000000000..a7145d1e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0228.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGACATTATGAACTGGGTTAAAGGCTTCTTCGCATCAGATTGGTTGCGCGCGGACTCTCTCACGGCTTTAACCGTGTGCAAGCCGAGCACTGGGGAGTGAAGTATTATAAATAGGTTCGCGTGAACCTCGTCGGCACGCTTGAAGGTAAATTTGCTGCTCGTAAAGGGGTCGGGTGTAAATGGTTCCTTCGTCAGATTT")) +(assert (= z "gaacuaacgcuuccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0229.smt2 new file mode 100644 index 000000000..60abb8446 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0229.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGAATTTTGAAAAACAACGTTTTTCTCGGGTAGATTACTCATGCGGTTACGGCAGCAGAACCGCTTTTGTAGATGGTAGGGCGTGTGCACGCCCCTGTTCACAGAGACCTCCAGAAGCGCAGCTTGTTGTATCATCTAACTGGGGATTTATTGTATTTATTGTTTAGCCATGAGTTTTAAGATGCATCAAGACTGCTA")) +(assert (= z "ccaagugacaauaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0230.smt2 new file mode 100644 index 000000000..59a08ba3f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0230.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACACGTGCGTACGGAGGAGGTGAAAACCCAACGGGGGAGTTTTGTAATGACCGCTACACTCGCGGGCTAGGTTCGTCGGCAATCTAAGCGTGCAGATTAGATCGAGTAACACTAGGAACTTTATGAGAATCGATAATCCTGGATGTGTCATCGCGATCATCAGGACTATTCACTGCATATGACTCCTCGACTGCGGTCT")) +(assert (= z "acacuuacaacuaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0231.smt2 new file mode 100644 index 000000000..640c45d94 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0231.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTTAGGGCGACGGTCACTGTCGTGAGCGAGTCTATTACGCTGTCGTAAAGCCTATCATTCACAACCACTTGTATAAGTGGTTATACCCAATGATATGCTTATCTCGGGATCTTCGTTTCTAAGCTCGGGGGTTAGGCGAAAGACTGCTTCCGTCGGTTCAATACGGGTGCCCATGTTTCCCAGCCCGCAAACAACCATG")) +(assert (= z "ggggguguucgcccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0232.smt2 new file mode 100644 index 000000000..bee5e6c01 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0232.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACTGCCACGTAGCCGGGCTTCTCGGCTTCTTACGCCTGAATTTAATCCCGTTCCTCCATGTCTGAAGCAGTTTGAGCTCACGTGGTGGTTCTGGCACGCATCCCCTATGCTGCGCCAAATCACAAATACCGCGAACACTTTGTGGGACGTACGAGCACTTGTGGTCCGTCTGTACAGGGTATACAACTTCATACACCGG")) +(assert (= z "uccuauguugucugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0233.smt2 new file mode 100644 index 000000000..58d755c34 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0233.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGAACAGTATGCAGCAGGGCCGGTAACGAAAAGAGTGCACGTGTTTTGCCGGAAGGCATGCGGCGCATGCCGACCCTTATGGCTACCCTCTCGTAGTTTGAATTACGTTTTCTATTATCCATCAAGATTGTAGTTCGGAGCAACTCTGGCCGTCCTCAGGAGCAGAGCGACACATCCGTGACCTTCGAGTGACATTCG")) +(assert (= z "agaagggugggcaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0234.smt2 new file mode 100644 index 000000000..fb7fae79b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0234.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGACCCTGGAACGGTGTGTGCAGCAAAAATACACCATTAAAAACAAAAAGGCACCACGGCCTACAGAGTATTTCTAGACGTATGTTTCTGACTTTGGTCTTTTATTATAGTGTCCCTCAGCGCTCCCGTCCGCTGACCGGCGTTAAAAGAAAAGACTCCGGAGGACCCCTGAGTGCAAACTTCCAGTTCAACCGGTGGC")) +(assert (= z "ccuauaucucccugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0235.smt2 new file mode 100644 index 000000000..acb7cff17 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0235.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCGTAACAATGGATCAGGCAGAGCATACCCTTATTATTTGTGGTATTTCATCACTCAAAGAAAGTGCGCGCTCCTTTGCATTGACGTGTACATTGATCCTGTTGAGACCAGAGGGGGCACTTGAGTAGTCGCGTGTAGGCTGGGGAGTTTCCCCACAGTAGGTACATCACAGTTATCTATGCCGTGCTAACTCTTCTCA")) +(assert (= z "agccacaacaaaggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0236.smt2 new file mode 100644 index 000000000..f484dd056 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0236.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCTGTTACCACTTCTTCCAAAGGTCCGTGGCCGCTGAGTGGACTGCAGTTGTGTAGCACTGCCCAAGAGAAACCTTGCTGTGAAAGCGAGAAACCAGAGGATGTCACCTGTGCACCCATCTCACATACTTACAACCTCGCCCGCTCCTCACGACGCCTGTACGTTATGTAGTAGAGCCTAGTTCATGCGCTATCGATCAT")) +(assert (= z "uugggacguuuggag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0237.smt2 new file mode 100644 index 000000000..09d3e1685 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0237.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCATATGTACAAAGGGTTCGATCCCATATATTGACAGCCCCATCGAGCTCGGCAAGAGCTCGGGGGCACGCGTTCAGCCTGATAGGGATTCTGTAACTTCATCAGGCCCAATTCAGGATATTGTGCTCATAACGCAGTCATCCACGAACGGAGGCCCGATGCGGCCCTTAGAGTCATGGATTTACGTCTTTAGTGCAAT")) +(assert (= z "cgugaaugggugcau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0238.smt2 new file mode 100644 index 000000000..9adfb607e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0238.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTAACTAGTACCTCGGGAATGACTTCGGGGGCGCGATCCAATTTCTAACGCGAGGAGGCTCCACGAAATGTGGCCGTAATGAACTTGAGCTATCCTGTGAGTCCATTTCGAATTACACGAGAGCCCAAATGTGCCTGACTTTGTAATGACTGACGTATGTTTTTACTTACATCGCCGGGTTTGATGGCCCGTCGAAAGG")) +(assert (= z "guguacacccgugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0239.smt2 new file mode 100644 index 000000000..0eb27c0bd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0239.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCTTAAGATGAATTGCGAGTTGGTAATATACTTTATTGAAGGCACATTGTGCACTCATATATTCCGAATCCTTTACTTTCCCTTCTAAAAGCAGACTAGCTTCAAGTACCGTCCCTGTGTCCACAGTCAAGTCAGTCAGCACACGAACCTGGGCCAACAATCTACAGCCACGCGGCTTAAGTCAATCTCAATGACAAGC")) +(assert (= z "cagcgccggaacuua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0240.smt2 new file mode 100644 index 000000000..4119b1421 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0240.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGGTTAAACGCGCCCAATGCATTCAAAACAAGCTCTTATCGAAATTTGAGAGCCCAGCATCAGCCCGTGATTTCGAATGGTGCGCTTGTCAATGCTCGTCAATTCATGCAACGATAATACGGGCTGTCCGAGACGCTACGGTTCTGCGATGGGGCCACAACTCAATCATTTGGCCACAACGCTCACAATAATATAGGCA")) +(assert (= z "ugucgugggguugca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0241.smt2 new file mode 100644 index 000000000..02a3daa01 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0241.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTCGGGACGATATGGACTCTCATTGTCATTCTGTAGGACTGAAAAAATAATTATTCACGGGTCTGCATACGACAGATATAAGATGCGGTCCGCAAGGATCGGCTCTTGCCCGGCGATCCAATGTTATTTGCACGTACACCCAGCAAGCTTATGAGTGACCCCTTGCCACATGCGTAAAGTGGAGGTGACGGCGAGGCAG")) +(assert (= z "auuuaggcacuuuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0242.smt2 new file mode 100644 index 000000000..bff00d382 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0242.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTAGTCAGCGGCGCCAAGAGCATCCATTAGTGAATTCGCTAAGACCAGATGAGCATTTAGCCGTTCTGAGACGGAATCGACCTGATACGGGAAAGACGCGCCACCAGGTCGACACACATTCAATTGTACTGCGGCTCTGCGCCATATCTCCATGAAATGGAACAAGAGATACCTCTACCAATGAAGGAAGGGGTCACCC")) +(assert (= z "uacccugacaccaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0243.smt2 new file mode 100644 index 000000000..2f6d483dc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0243.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGACTCATCGCGAAAACCCGTTCCAGTAGCCAAGGTACGACGCTCATGATTAGACGTGAACTCATTGGGGATGCGCGAAAGGTCATCCCAGCCTCGATTGATACGTATATGGCATGAGGCCCTCAGGGAACTTAATAACTACGGGTGCTCGCGGCTTGACCAATGTGCTTGACCACTTCCAAACCAGGAAAATGCTGGGA")) +(assert (= z "gggacguuuuuguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0244.smt2 new file mode 100644 index 000000000..7b5ed956e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0244.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGCTGTGCACTCTCATGCCCCTCATCTTTTCGGGAGTACCCCGTGCCAATACCCATGAATGTATTTGAGTTACCATCTCATTCACATTAGAACGCCAAAAGGAGGTCGTATTGGCATATTAACTCAACGAGATATGTTCTTCCTTGGTTTGCGAGTAAACTAACTGGAACGTTTACGGCGAGCTTCTCCCCAAGAGAT")) +(assert (= z "ucaucuacggcgcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0245.smt2 new file mode 100644 index 000000000..44ba52c12 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0245.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGCATGGACAGGGAGATCTCCGTCTACATGTAAGGACGTAACCAATGAAAATAACTTCACGAACCCTACGGTGAGCTCTAGAGCTCCGTTCTGGGCGGGAATCGGGGAGCCATTAAGTGTGACCTCCCGTCGGCGGTGTCTACCAGCTGGCGAACCACCCAGGGTCGTACACAGTCAAAATGGCTACGTTTTCCGCTGG")) +(assert (= z "gcauaagucagcacg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0246.smt2 new file mode 100644 index 000000000..e6a41aa51 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0246.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCAGGGCAACCCAAACCAAAATACCAAACGAACGCTCAATCAGCATCATCTGGCTCTGCCATAGCTCGCCCCATCAGAAATCCCGGCCAGCTATCTAGACTCAGCAGTTAAACCGCGTAAAGGCGTAAATGCATACAAGATAGGCGTTAGGCAACGCTATTTTCCCAGCCCTCATCGACTCTTGATCGAAGAAGGCCGA")) +(assert (= z "agauguccacaguua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0247.smt2 new file mode 100644 index 000000000..ea7226352 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0247.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACATGAAAGAGTTATCCGTCACATTGCCGCGGTAGATAGACTCCCCGCTGCATGAGCGTAGAGTTGAGCATCGCGCACAGAGTGGCAGTCTGAGGCGGGGAGGCAGGTCACACGAAGTCGGCGACGATGAGCCCTATCTCTCCGGGACCCTAAAACGACCGCACCAGAGTCCTAGGGCCTCTAACAGGGGAAGCGATGC")) +(assert (= z "aucuuacaguuaaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0248.smt2 new file mode 100644 index 000000000..c069b4bc0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0248.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGACGGTTAGACGGGGATCCCCTATCAGTCTAGGAGCGGGGCTATAGTGCGTCCATACCACGAAATGCATGGCGCGAGAAATCCTCCAACCCCGAATTTGAGGCATATCACTACTTACCCGGCGATAAGTCCTCTATGCTGAGGCGGGGCTTGTTGGTTGTACTGAGATGAGACGGAGATTAATCAGAAAGCTAGTTAAC")) +(assert (= z "cuuaccgcguggauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0249.smt2 new file mode 100644 index 000000000..7c4bc64f0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0249.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGATCTATTACAGCATTTTAAAGTTTTCGTGACGCGTGTCACGCATGCGTGTTCGATTAAACACAAGCATACTTGCACCAGCTGGATGCCACAAGTATCAAAGAATTAATAATATTTGCATTCACCGTCGGAGGGGTCCCCAACGGAACGTCAGACGTCGCCGAGTCCACGGAGCGCTCGCGGTGACGATATTGCTACT")) +(assert (= z "augggaggagggcgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0250.smt2 new file mode 100644 index 000000000..78c477abd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0250.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCAAAGGGGCGGTTGGCAAGGTTGACGGAATTGGTTATTCACAACATCGCGTCCCCTGATTGCACAGGTGTGATGTGTGCTCATGATTCGATAGAGAGATCCGTCATCAATCTGGAACGAAAAGCGGAACGGAATGAGTGGAAAGGGTGTTTGGTGCTGATCGAATCGACCCCGAGTGGGGAGAAAGGGGAAGCAGGCA")) +(assert (= z "gcuagaucugcucgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0251.smt2 new file mode 100644 index 000000000..f75510715 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0251.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGAATGGAACAATGACATTTCGGCTTAGCCTGGGGTCAGGGTAGTGCAGCCTAGTACTACGGCCGACAGGTCCATCGTCTGCCTTTGAAAAGAGTACGATTCTCTGGAGTGAATCGGGTGCGACCAGGCGTAATTAGACTTAGCCCATGAGCCATATCGTGTGGGGGTATGACACCGATTTCTAAAACTACGCACAGT")) +(assert (= z "cacagcuaaccugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0252.smt2 new file mode 100644 index 000000000..d6c05fed6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0252.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTCAGAATTGTTCTCGCATGGAGCCATGTTTTATTTGAATGCAGGGTAGTTGTGACCTTGCTAATCCGCGCTCTGCACGACGGGAAAGAGCCGGCTGCATACACGCCAGCTGCCACCCTCCGCGATGGTGCTGTTGAGGACCCTATGAAAATTGCTCCCGCAGAGCTGGTACGTTGATGCATCCATACTAGTTCTACCA")) +(assert (= z "gaguugccugaaggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0253.smt2 new file mode 100644 index 000000000..389589259 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0253.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTGCGGGACCCTTGACCGACATAGATTAGCGCGGCACCGTCGGCCAGAGTGCTATTACATCTAGAATCGCGTATAGGCGGTTGTCTACGCCGAATCATAGCCAATAGCCTCGGACAACACGCTTGAGGAGTATTAGCAATACTTCACGTTTGTCACGGCTAGTTCGTTACGTTCGAGACTGCTTTTCATCAAATGGGAC")) +(assert (= z "cacuagugggaugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0254.smt2 new file mode 100644 index 000000000..c961f8a88 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0254.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGCTCGTCCGGTTAATACAATACGTGGGTGTGTTATATGACGGACTACAATATCTGGTAACGTCATTGTTGCGGCGTGTCAGTCACCTGGCTGGGTAGTTTGGACATGACATGGCCGTACCATATTAAACCGCTATAGCAAGGATCTCCAAGAAGTAGTTGAAGGCAATTTTTCGATCGCGAGCCGACTTGACTTGCAT")) +(assert (= z "uacuggguuaaccau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0255.smt2 new file mode 100644 index 000000000..56aa4173d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0255.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTCCGTCTAATGGCGCACTGACGGCGAAACATTGTTTAAACAGTGTTCTCGTTGGTGCTGGAACCAATATAATCCCGGTGCCAAACAGAGCGGGATGGTTGGGCAGCGGAGTATACTTAACGTTGAACGAGCGACGTGTCTGTGGTGCCTGACAAAATTGAGAACATAGTCCTGCAGGGATCACTGCCTTCCTAGCCTT")) +(assert (= z "ucguccuacaacuca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0256.smt2 new file mode 100644 index 000000000..57c95356e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0256.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTTCCCCCATGGTGATGAAGACCTGTAGGAAGTATAAGACGCTCTAACTCTGTAAATGCAGTAACGGGCACGTCCGTTGAGGGTTCTCACATGTGTTTTTTGAAAGATCTTTCAGGTTTCAAGTGCGACGATGTTATTTGACCCAATATTAAGCTAAGTTCGGTGCGTCTTGTTAGCAACTGCACGGTTGGCATACCTA")) +(assert (= z "cugucggggggucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0257.smt2 new file mode 100644 index 000000000..d897e8b68 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0257.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTAAAGGCCCTGTAGATTAGTGAAAATTTAATCCCGGCACTGTCCACCGGGGTAGTAATGGTCCTGCCCTGCTTTTAAAGCCATTGGGCTCGAAGATTGCATTAGGGGTCATTAAGTTAAAACGTTCAGTATGAGGGTTTATGCTACGCACTGCGAACAAAGCTTCAATAGAGGGCCGATTTACGGTCCATGTAAGCAGA")) +(assert (= z "acaagcucacuccgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0258.smt2 new file mode 100644 index 000000000..6d9162151 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0258.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTAAGGGTTTTACTCGGGTAAGGTTCCACCAAAAGTAAGCTGCCGGCGTGTCCAACCCAGTCAGTCCTAATGCGGGTGACACATGACGGTGCGGTCGTTAGCCTCGTACACTTGGGCCATCGAACTGCTCAACCGGTTTTGCTGCCTAGCCACGACTGTCGGCTTGGCCCAATCACACTTGTAGGAACCATGAAAAAC")) +(assert (= z "cgaaaagugaacggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0259.smt2 new file mode 100644 index 000000000..fb5ae0044 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0259.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCGTTTCCAGTCTTCCGGAAGACTGTTCAGCAAATCACTTCTGTGCGACAGTGCTATTCTTTAGCCGACGCAGAGAGTCAGCAGTGATTAAGTTGCGCTGCGACGAGGACATATTAGGTATGGATCGGTTTACCGAGCAACGCTCCCTAGAGGAACCTTCAGGGGGTTAGGACCGCGCTGGTGGATCTGTATGCCCTTT")) +(assert (= z "uaucugugcucucua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0260.smt2 new file mode 100644 index 000000000..e0974b780 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0260.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCTTCCCTTTAACCGCTCTTTCAGGCTGCGACGTGGTCATTGCTCTGAGCGCTACACGGAGTTGGAAGGTCCTTGGGAAATCATTGAACCTCGCCTTGAAACCTCTTCCGGGGGACTAACTTTCATCGCTGGTTTAAGACGTGTGACCTGCTGATGTCACAGTTATGGGCTCCGCTTCTCCCCGCTCGTTCCAACACC")) +(assert (= z "gcgauuuuaaagauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0261.smt2 new file mode 100644 index 000000000..2efe01059 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0261.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTTATTGTGGGTTTTCCACACTTATGAACGGAATAAATGAATCCCTCCCCATTTAGATAACAGCACAGGATAAACCGACGCACATAATAATGGCGCGCCACGTAGCTCAGCGTTAGAGTACTTTATCTGTGGCCAAGTAACCCCAATGATGTCCCGGACCCTAATACTAGACCCCCTCGGGGAGATCACCCAAGACCC")) +(assert (= z "cuaggcacuuuuggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0262.smt2 new file mode 100644 index 000000000..210090eae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0262.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCCATAAGGAGTTGCCAACAAAGCTGTAAGAGTAGTTCGACCAACCTTGCAATCTATTGATGTTAGTCGCAGGAACCCTAGCGACGATTAACTGACTACCCGGGTGGTTCAAGAGCCGATCCGCGCTCCTCTCGCAGCGAAAGGCAGTGAAGTGACCTCTGCTCTTAGGCCAGCCTTTTCAGCCTATGCTCTGTACGTT")) +(assert (= z "guccgggcacuguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0263.smt2 new file mode 100644 index 000000000..180bcf731 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0263.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACTTTGGACTCCCCCGACTGCGGCAACTCTGTTGGTTCTGGGGGTTTCCGTGATGCAAGGCCTTGGGCAAGTCTTCTCCGACTGGAAGCTAGCCCTGGTGACCTCGTAGAGAACCTCCGTGGTTTAAAAAAAGTGCGCGCATGTCCCGATAGAACAGGCTCGCCCGCACGTATGAAAACTCCGACCGATCTAGCTTTCG")) +(assert (= z "agcgaguuuagucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0264.smt2 new file mode 100644 index 000000000..334422195 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0264.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATAACGAAGGTTAGCATATACCGCGTATCAGAAGAATCGACCTTACGACACGGTAATGCCGTGCGCACGGAACCAGTGCTGACCACACCTCACATCGCGGACCCTGTTTCCGTGAGGTATGCACTTAGCGTAAGGACTAGTCTCAGCCGCCCTCCGATAAGTTTCTCGGATAGCGTTAATAAACAGGCATGAACCCGTGG")) +(assert (= z "accagucuaucucga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0265.smt2 new file mode 100644 index 000000000..c57063072 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0265.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AACTCGGAGGACCAGTCAGCATATTTTTTAGCTTTACAATTGCCTATTCGCTGTGGCGCCGTAAATACCCCATGCGCTAGCCGCTGAGTTTGGTTAAAGCACACGTAGCTTCGGCTGACTACTACAGTTTCTCTACTCTGGATAGCGGAGTTTATAACGCCGATGAGCTACCGCGACCGCTTGTTCACAGACGGTTTGAA")) +(assert (= z "uguggugggcuagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0266.smt2 new file mode 100644 index 000000000..21c3bc3b4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0266.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAATTCATCATGTAGTTAACGTGCTCACAAGGATAACTTGCTCGCTACCCCGCCACGGTACTTCCAGGTTCCAAAGCCCCCCGAGGGATCTGAATAGTATTGTAAACATCCACCCACTGGCTGCATCGCATGCGCAAACCATGTACACTTGTCCGCGTCTCGTATGAACCGTTCAAGCCAGCGTGTGGGAATACAAACC")) +(assert (= z "uagacuguuaucaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0267.smt2 new file mode 100644 index 000000000..ee240c41f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0267.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTCGTCATTTACGTGGATAGTGCTAGTTAACCAGTCTCCATGAGCTAAACTTAAAGAGTAGGGTGAGGATAAATCGCGCGCACGACTGTTGTTAATTGGTCTAGCTGCGAGAAGGATTAGCAACGCGAGAACCGTCCCACAGGACGCTAGAATATCTTACGATCGCGCTCTCCCAGCGTGGCACGTGGGACTATAAGAA")) +(assert (= z "aaccuaaguacccua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0268.smt2 new file mode 100644 index 000000000..e71fd993f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0268.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCTATAAACGCACCCATTCTATTCTGGCCAAGGGCTGTGAACTACCGGAATTTCTGCTCTACGCACAAGTAGTGTCTGAGAGTGAATGTTGGAACCGAAGGATCATTTGGCATCCAGGATGCGGTCGTGATATCCTCAAAGGCGGTCTTTTGACAACGAAGCCATTTATAACAATCACGCGTAAAATGCCCGATTATGA")) +(assert (= z "ucaacaugcaacggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0269.smt2 new file mode 100644 index 000000000..e0f303928 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0269.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGCTGGCGTGGAGACTCCTACTCTGACTCTAGCAACTCCGAATAGGTCAGTTACCTGACCTGACGAGCAACACCCGCGAGTCCTCTAAAAATTCCATCAGCAGATACGGGTTTACAAGTCCGCAATGTCATGAATGTACCAATCACTCCCGAACCTCTGAGTTGGCTTCGGAACTGGACTGAGTCCCCCATCTTTCCAC")) +(assert (= z "ucggaccgacaaugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0270.smt2 new file mode 100644 index 000000000..2c48fd038 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0270.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTAAGAATCTAGCACGGTTATTGATCTAGCGTCCTCCACGATGTAGCGTGTGTGCTCCCTCTATAACTAAACATACGAAAAACAGATAGCTTCCTAATTAGCGCGGATGCACGGGGAGGAATCGACAAACTATCATGCAGTTTGAGCACCCACGAGTAACTGTACGGACCACATGAGAGAATTATCCCGGGCTATGGTTA")) +(assert (= z "agaaaacagucaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0271.smt2 new file mode 100644 index 000000000..479e329d7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0271.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATAAACTCATGTCCCATCAAAATGAAGCAATATTTCGTAGCCCTTCGGGTCCTTTTGACACTCTGACACAAACTGGTTTAATCCTTGGGTCTGAAACTTGTGTCCATTTATCCTGATTTTGTGAGCACGGCCAAAGTCTTCACCGCAGTCGCCCAGACGGCTGCTGCACAGCACCAGTCGGGCTATCTGGGCACACCTTA")) +(assert (= z "gccaaauauggugcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0272.smt2 new file mode 100644 index 000000000..812f845ac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0272.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTTCGGTATTGCTGTCTTTTGTGAGGAATGGCTAAACCCTGGCGTAGTCAAACCGGTTAAGGTAGCATATCCTGGCGCCTCAGTCCCCATACATGCAGTCGGACCCATTCTAGATGCTGAACGTAGTCGCGAGATGCCCCATGGGACTGTCGTCCGAACATAGAAACTTTGGCGTCTTACCAAATGGCGTGAGCAACAG")) +(assert (= z "caugcugaccugcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0273.smt2 new file mode 100644 index 000000000..dbdd0d2a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0273.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCACCCCAGTCTCACAGTCAATTCTCTCCCGAGTATAGACCATTCGTCGCCGGCGGCTCTCTCAAAAGGCTCACCTTGTTTTCAAATTTTGTTTCCAATTGCCTCGGGCTTGACTTAAACCTTTTGAACGTCACCGGTTAACGGTACGATCGATTGTAGTAGAGTGCAGCCCACTGGCCCTAGAGGGTCGGACCCTTC")) +(assert (= z "uaucacucacgauua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0274.smt2 new file mode 100644 index 000000000..2b4d8f5f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0274.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGACTTATTAACACGCAAACTTCCATCTATGCAAAAGATCGCGATTCACGTTATGCCGAGACTAATCGACCGAGGCGGCTACTCCAGGGGAGCATCTGAGTAGCCCATGCTTTATGGATCGGGACTCTATTATACTGTGGCGCTTATCAATGTGGCCACAACAACCATAAATTCATCGTGTAAAATACTGAATTACGG")) +(assert (= z "uuccaucuacuaaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0275.smt2 new file mode 100644 index 000000000..a2d3842ed --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0275.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCATCTTATAATAAGGTGACCCGTTTGCTACTTACGCACTGTTTGGTTTCGAGACTGCGCGGTTGATGTTAGCCCATTCCGTCTCGTTGTTACTTCGGCGTAGCTCTTTTACGTATGTCTACGTATGATAGCCCGATTATTAGTGACTACAGTCAATAACGCGCGTGCGTCACGGGTTGCCGTATTCAACCTGCACGT")) +(assert (= z "cccaauaagguccgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0276.smt2 new file mode 100644 index 000000000..914346cc1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0276.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGCTCACTGGTGTTTTATCCCGTGCGTATAACCTGCGAAGCCAACGCTCCAAAATTATATTTCAACTCTAGTTGATAGTTGGAGGTTTGCGCACGACTGGATCGGTTTGAATGGTAGACGTCAGGCCGAGGTGTTGTGATACCGTCCCCCACTAGGTTCCAAATACATTATGGCAGACAGGGGGACAATATTTAAATG")) +(assert (= z "guuucccaguaaaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0277.smt2 new file mode 100644 index 000000000..0ada94a87 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0277.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGGCAGACTACTATACTCCCTAGTCGCACTAGATAAAGCCAGCCGGGCAGCGTGCGTGTTAACGATAGGGCCAATCTGGAGGGTCATACCACTATCCGACTCTGTGGTATTTAAATCCTGCGGGTGCGCCCCGTGGAAGCAATGCATTCAGATAGCAGTGACCGGGCATGCCGCCCCGTAACCGTCACTGTCGACTCGG")) +(assert (= z "ucucgcuaaugggaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0278.smt2 new file mode 100644 index 000000000..568863c4f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0278.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTCGCGCTAAAACAATAGAGAACAACGGCGTTGAGTAGCGACTCCAAGGCTCGTGTTGACGATTCAGTCCCTGATCAGGTTTGATCTTCCGTGTTTTATGTGCAATGACAGAAATTATAGCTTAATTGAACTAACCGTACAACAGTTGCACCCAATTATATGCCGGAATCCGTGACTCAAAGGATATCGTAACCGTCCG")) +(assert (= z "cauuaugcugucccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0279.smt2 new file mode 100644 index 000000000..e1067dac7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0279.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCGGGGGTCGGATTCACACTGACGGAAGGCGGACCTACCGGACTCCTGGTTTCATCAACTTCTGAAGTCACGGAGGTCTAAGCCGACGTGCTTCGGGATAGACGCAGAAGGATAAGACCCTATTAGACATAGTCGCGACGCAAAAGGCCGCGAATATTGTTTGTGACAGTACTCATCGGCTCTACAAGTGAGCTCCTGAC")) +(assert (= z "ugugaccaauucgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0280.smt2 new file mode 100644 index 000000000..eba345135 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0280.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTGACTGTAGATGTATACAGAGGCTAATTGCTTCCACTAGAGTGCACCTCGTAACCCGTGCCGATCTTTCTAAACGCCCATGACAAGAAGCGATTACGAGCAAGAGGACTTCTGCTCTCCTGAGAACTCCCGGCGACATTCGTGCATACACCTAGGTGCCATTTGCAACAGCGCCGTATATCTAAGGTGACCTGAGCG")) +(assert (= z "gugcuaauuuauaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0281.smt2 new file mode 100644 index 000000000..b0f9f0afb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0281.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGCTGCTCCCACCTAGCGGCATCTCACATCACCGCCCTAGGCTCGTTTATATCTGCGTACTCATCTTGCACTCGACACACGCCTAATGTAAGGCCATTTACGCTCTCTCTCACGATATGACCCCATCCCGATTTGTTATGAATGCGAGCAAGAGTTCCGCATTTTCCGACCGTAACCAGAAACCCGCTAAGGCGACATC")) +(assert (= z "aucugcaaucgcgua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0282.smt2 new file mode 100644 index 000000000..1d77229ab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0282.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCACCTTCCAATAGCGAATATGCGCCATCCTATAAATGTCGTCCGGCTTCTTCACGATACTCTGGTCGTTTTCTAATCTACTCGGCCTATTGCCAACGCATTCCGTCGCGCAACAGAGAACCTCGAGATGCTCAGATATCATGCAATTCGGTGCGTGGCGAGTTTACATTAGTTCTCCAGCTTTGTGGCAGGTTCAAG")) +(assert (= z "aacauguccgcuuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0283.smt2 new file mode 100644 index 000000000..de200e304 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0283.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGGTTAGCCTCCCAGGCCACACTCTACCATTAAGGTCTTCAGCTGACGCGTAGGTAGGGGCTTTGCTCGTCAAACTGTGGATCCCGTACGCCCGGCCTAACGACACTGCTGTTTGTATCGCTGCCTAATCTAATCCGTCAACTACCGCGTAAAGCAAGAGGAAAACTAAGAGCCAGTTTATCAGGCAGTACCCCCGCAC")) +(assert (= z "caccggcauugguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0284.smt2 new file mode 100644 index 000000000..dbafed098 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0284.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGTCGCGTGGTGTCAGACCAGCTTTACTTAACCAGCTCCGTGTCACTCAAACGAAATAACATTTTTGTGGGAACGGTATCTCACTCATACTGGGGCACCGTATGGCTTTATAACGGTACACTCACCGCTTCTTCGTACGGGCTCCCGCCGAATCAGTGGTGCACCATGCATAAAAACTGGGTCCCACAAGTGATCCAGT")) +(assert (= z "gucacgguacaucuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0285.smt2 new file mode 100644 index 000000000..ce0284b46 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0285.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCACCCTTCTTTGGCCAGAAAGGAGGGGATAACGTCATTACTCCAATAGTGGGAGGGATTGGATGAATTACGCGTCGGTACTTCGTACTCCTGCAAAACTTATCATACGTTACACAGTACATGTCTGCTAATATTTGGCATGCAGTATACTGATCCATGTAAGCTATACAGATGAGCGCACTGGTCCAGTCCATTCCCGA")) +(assert (= z "acaucuguuuugcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0286.smt2 new file mode 100644 index 000000000..e1953df71 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0286.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCCGCGCGCTCAAGCTCCAACCGACTGAACCTTGGTCACGGTGCCACAGATTGCGGCATGGGTTCATCTCCTCAATACAAGCCCTTACTTGCTGTCAAGGGAATTAATGACTAGGCCCTGTCCCGAAAGTCGAGTTATCAGTTTAAGACCTGATGTGCTATACTGCGCATTGGAAGGAGCCTATCTATTGTCTATAC")) +(assert (= z "accccaacuuggagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0287.smt2 new file mode 100644 index 000000000..417c21d3c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0287.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTGTATATCACCTGGAACGAAGCTGGTATTTCGTCTTCACCGTGACATGTCGGGAATATGGCTAGATGAAGGCAGTCTTACGTCGAAATGTCCAATTTCTAGCTTTGCTCAATGGCGCACGGGTGTCATGTTAGAGTCAACAAGTTGTCGACTCACTAATTAACCTATACCTCGCCTGTTTCACATGCTGAGCAATGGG")) +(assert (= z "aagagugcucacggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0288.smt2 new file mode 100644 index 000000000..83c376747 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0288.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGACGTCTCACGGGCTAAATTTCGCCTGAGTGAACATCTGTGATCCGAGCTGCCGAGAGAGTAAAAGTATGTCGTATCACTGATCACCATAGGCGTGCATACTTCCCGCCGTGCCCTTGTTATCAAATCGCGCTCACTCCGTAAGCAATCGAAGACTGTCATTGCGGCCGGATTGCTATAATTATACCAGGACACTAACG")) +(assert (= z "aguuauucccgcguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0289.smt2 new file mode 100644 index 000000000..783cf90e3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0289.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTTGCACGGTAGTCGCTGACTCTGGTTGTGGGCCGCGCTAGAGTAGACCTGTTTCGCTAGCTAGGTAGGGACTGTGTTCCCTTTGTCCTCATCTCACAGATCGGCTAATTCATTAAGCTACCGCCGTAATCTTTGTGGTCGCGGTTTCTGCTGAGCCACGTACTGCCGACGACGTATCGATGTCGATTTGGGTCCTTGT")) +(assert (= z "caaccaagugaucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0290.smt2 new file mode 100644 index 000000000..38bcf9e3b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0290.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTAACCGAGGGTGGTACGTGAGCTTTGCATTCGGTGGGTTTAGGATCCAGGTGCCAGAATTAGAGCCATGTAACGCGGCATCGGGACCTGCTCAGCCGCTAAGCCAGTTACTTGGGCCTCCATGAATGAAGCATGTCATTGGACGTAAACCGAACACTCGCGGTCGATCTACAACCTACAACTTACTCGAGATTCAGTT")) +(assert (= z "gauccgaaagggugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0291.smt2 new file mode 100644 index 000000000..57609ff43 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0291.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTCCCAGTGAGGAGGTGGATTGGTCCGCCGATCATAAGGCGTAGTCCGCGCATTCCCAGCGCTAGAATTTACTGCTACTAGAGTTTCACGGTGCGCGTGATCCATGACAGTACCAACAATTGAGATTGCGTGTAGTGTCATCCTCAATGATCAAGGCGATGTAATATATTCACGTCCGTTGCCGTAGTCCAACCGATCA")) +(assert (= z "cguauccgccguuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0292.smt2 new file mode 100644 index 000000000..36582a6fe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0292.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTACATTGGCCGTGATTCCAAAGAATAGGGGGCCCATGGCCATCAAGCTCGGGGGCGGGTCGAGTCGTAGCGAACCGCGAACCGACGCGATAATGGCGGATCGGCAGGATAGATACCGTCTTTACTCAGACCGAGCGAGCCCTGCGCACAAAATAGGTACGTACCGCTCGTGACGATTCGATAGCACGTTATCGCAGAAC")) +(assert (= z "uuaaucaagcggaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0293.smt2 new file mode 100644 index 000000000..7c4e6e7cf --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0293.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAGTGTGCAATTTGCATGCGTGCGTAAGTTCAGTTACAAACTAAGGCTAGCAATAGCCTTCAGTCCAGCCGTTTAAGGGTTGGATCGATTGACCGCACAGGGTTGTATGCTCTCGTACGGAGCCAAACAAACCCAAAAAAGATTCTAAGCCATCTGCGCTAGTCAAATTTGTAGCTCTAGTTAGTCCACCAATCTAAAC")) +(assert (= z "cuagacgucguguaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0294.smt2 new file mode 100644 index 000000000..c49670a02 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0294.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAAGTCGCACCAGATAGCTACTGGGCAGGCTTCATATCAAGAGCGTCAGCCCGAGATAACCCGTTACTTCAACCTAGAACGAGGTGCTATCAAACTGGCTTCGACAGACTCCGGATTGCGTTCTCCTTAGCTTGAACTATGAATTTGGCTGGAACCCCATTGGCAGCTCCATGAGGCCTAGCAACCAATCCATGAGGCGT")) +(assert (= z "cuuugcaugcgaucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0295.smt2 new file mode 100644 index 000000000..eec791161 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0295.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCGAGTGAGTCTGCCCTCAGTAGTCCAGGCTTATGCTCGGGAACCTGAAGATACTGACGGAAAAGTTCACCGACTTCTAGAACAGTACCAATACTCGCTACCCCCGATATGGCTATGGCTATAGAGTTCAGAGGCCTCTCAGCTTTAGTTCCAACATTGACCCCAGTTGTCACTGCTTAACAGGGGTGTGCTCCATTAC")) +(assert (= z "ggauugcggugcaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0296.smt2 new file mode 100644 index 000000000..abeee8c79 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0296.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGAGACTATTAACTCTCAATTGTACTTAATCACTTATCTTGTGTTTGTATTACGTCCGTCGTAGTTGATCCGTATCATTTACATCCGCACCAGCACAGCGTTGTCCACCAATGATATAGGAGGCGATATTCCTATATGACTGTGCCGTGCGGCCCTTTCGTTCGAAACCACCTCCGAGAGCTGTCGGACGTGAAATGTCT")) +(assert (= z "cguacggacuauuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0297.smt2 new file mode 100644 index 000000000..51c78baeb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0297.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCAGAGCCCTTGATTTCTTTTGTTTAGCCGGAATTACCCATCCGCGACTTACGCGGAACCGTAAGACGGTCCAAATCCCCCTGGTGTGTCCATTCACTAATTCATTTAGCATAGTGGTAGGCAGTATGTTTGGATGAAAGGCTTTGAGATCTCCTGCACGTATGTATCAATTGACAGGAGGCTAGAAGTTTTATAGACC")) +(assert (= z "aaguccuaucgcccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0298.smt2 new file mode 100644 index 000000000..1883ae372 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0298.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGGCTTCATGTGCCGATTATCATTCGGTGGACTCTCCATGGTAATTTGACTAGGACCGCTGTTCGTAGTAAAAATCAAGCACACGGTGCCCTGCGTCGCCCGTTCAGTATTCCACGATACGTCCGAGCGCGCTACAATTCCAACGAGTGGTTGTTCTGACAATCTCGCTAAGCGCAGTATAGCTCCGGCTGTATCCATG")) +(assert (= z "ccuauugcaacaaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0299.smt2 new file mode 100644 index 000000000..a53cae30e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0299.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCGCTTTATATATGCGTTATATGAGGGGGCGAACCATAGCAAACAGATGTGCCCCAAACGCAGCTGAACAGAAATCCGGGCATAGTACGAGACTGGGGCGCGGCCCGGGCGTAGGAACAATAAGACCGGCCCATTCCTTGAGTGTCCTCTAACGAAATACAGCGATAACACCACTGCGTCGTGACTATCTGTACTCTCC")) +(assert (= z "ugaugcugcgccgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0300.smt2 new file mode 100644 index 000000000..cca60e3d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0300.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCTCCCCCATGCTTAACCAAAAGTTCAGTATCCTTAGCGTTTTGCTACCTAGGGCAGCCTTGCTTTTCGAAAGTGATTGTCGAGGTCTCTCTTCGAAGAAGGCTCTGTACGGCTAGCTGGCAACGAGGACGTTTCGATGCATTAGCAAGGACCTTACTGATGTGCCCTGGCGGAAGGCCTTCTAACGACGAGGATTCAT")) +(assert (= z "ucgcauggccaaaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0301.smt2 new file mode 100644 index 000000000..65ab26b7f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0301.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACTACACGAATTCCTGTTGATATAGGTGTTTTGTCCTTAGGCAAATAAATACCCTGCCGAACGGCAAGTGGTCGGACGTCAGCTCAACTGTCTGAAAAACCTACTCGTGCTTTCTCTATCTACGGGCTAGTCTAAGAGTGTGCCCGTACCCGGCCACTTACAGTAGTCTCTCTTATGCGGATCCAGTAGTACATCTGAA")) +(assert (= z "aauaagauaggcccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0302.smt2 new file mode 100644 index 000000000..14ede440d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0302.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGCTCCTGATCATTATCTCGATAAGACGAGAGTAGTCCTAGCGGGCGGCTGTCTGAAGATATCTACGTACCAGATGAGAGTTGCCCATTACCTAATCTTCATGGCTCGGAGACCCTAGCCGGTGGCCCGACTTGTATCGGATCTAGGTACATTGATATAGTTGATTCAAATAATCCGTCATGCTACGTAATATGCAGCA")) +(assert (= z "cugcgguaauauuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0303.smt2 new file mode 100644 index 000000000..0d5f13b0e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0303.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCGCCCCGGTTTCAAGAACTTAACTTGAGGATACAATCCGCGCCGAGTCTCTTGCTTTATTCCTCGCGCACCGATGGCTACAACAGAGTAATTCTTATCTTCTTTAGGTTTGTGACGGCTATAACCACGTCTCTCCCCTAGGAATGTTCACTTGGTGTCTGATGCGAGCGTGAGTACGATAAGCGGTTCTATGGAGGGT")) +(assert (= z "uugaccucuguaggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0304.smt2 new file mode 100644 index 000000000..de1036d1c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0304.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGCGAGGATTCAGAGGATTGAGAGGTCCGATACGTACCATGTCGCTCAATTCGGCTAATGTTCCATATACATCGTCAAGGTTGGGTGATCATATCGGTTGATCTGCCCAGAGCGGTCCAGCGTGCGAACGCGCCAAGTAGAGGTAGAGAGCGCTACTTCTTGACATCCGAGAACGCATACACCGTAGATCTGCGCTCAC")) +(assert (= z "aucauacugacucau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0305.smt2 new file mode 100644 index 000000000..5f2bbe8c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0305.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGAGGGCAGTCTGTCATCGGATCTGCGTATAGGCGGAGGAATGGTCGCATGTTAACGCTAGGCACATCGAACGCAATGAGACTATCAAGCCAAAAGTCTAGGACCCATTCGCAGGGGGCGATTTGAAACACAAAGCGAAGAAGCGTTTAAATCGGTCCTTGCCTTGGATAGTCGATAATTCCGCTTGGTGGCAGCGCTA")) +(assert (= z "guaagagaauacuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0306.smt2 new file mode 100644 index 000000000..e4abf71f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0306.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAAGACAAGACACCGACTTAAGTTAGGGAACTTATTTATCTTGCGCCCGATCTATTGGGATTGTTCCGTGCAGAAGATTCCTCGGAGGTCGACCTATTATCTTGCGATTCAAAAAGGTACTTCGTAGAGCACGAGCAGATCTTCACATCGGTTCAACTCGAGGGAGTAGCCAAGTGCGAAGGTAATGACTTGACCACGTA")) +(assert (= z "cucuugccuggcucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0307.smt2 new file mode 100644 index 000000000..fb1aa62a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0307.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCTAGAGGCGCTAGACACCAATTCATACTAGAGATACGTTTGCTTTCAAACCGAATGGCGGTATTTTGTTCACTCCATATGACAGCACTGAGATTAATCACTAAGATACGAGGGTAGTAGTTTGCTGAGGCGTGATGAACGGACCACTTTGCATGGTACAAAGTACGGCCCAGTAACGTCCGAATCCTCGATCGTTCGC")) +(assert (= z "ucaaacguuuagcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0308.smt2 new file mode 100644 index 000000000..2fbbb3d57 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0308.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTGTAAGCATGGTTATTAGACGCTCGGATACTGCGGTGACGCTGGCATTGGTGGTGAGCTGCAGTCGGGGCCAAGATTTAGGTACGGCTCTAAGTCCAGTAAGAAAATCGTAACGGTAGCAAATCGATGGACAGCACGCGGGACACGATCATCCTAAGAGTGCGTATCTTCCTGTTCTGTCTTCTTAGCTGGGGTGCCCC")) +(assert (= z "ggacccauuucagag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0309.smt2 new file mode 100644 index 000000000..85b8eb735 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0309.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGAAGGCGTCCAACCGTCGTCGAGTCTACGATAATCAGTGACTCGATTATCAGCCATGAATAAGGGCCAGCCCAGTCCCCTAATCGTTGTCCCTTGATACGGCACCCCGCGGAATAGGAGTGTAAATGTACACAGCGGCTACCAAGGAAGTCTTTTTGTTTACGCCACTAACATCAGGCAAGGGTAGAACCCCTGGAGC")) +(assert (= z "gugggcuaggaacac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0310.smt2 new file mode 100644 index 000000000..1c67a409a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0310.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCACGATTTCAATAGGCCTGCTTGTTAAATGGTGCATTTATCGTCACAGCCTAGCAATCACATAGTATGATGTGCGGGACACGATTGCAATCGGGACGGCCTAGTTACATAACCGTCGGCGAGACCCAGACTACTTCTTGTCGTCATCTTCCTTAAGCAGTCTATGGCAGATTTGCGCCCCTCCGGTTAACGCGGTC")) +(assert (= z "gaccuugcaaauagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0311.smt2 new file mode 100644 index 000000000..e43b12b48 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0311.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATTTCGACATGGCCGACTCAAGCCGAAACACGCGCACGTTGACATTGTTTTCTTTCGCTAGTCAGCGGTCTCGGACTACAACGGACAACTTACTTCTCCATATAACATTCGCTCGATCGGAACTACACAGCGACTCGTAGAAAGAAATAAGTCCCACCTCCCGCGTGCTTGGTAGAGAACGATCAAGGCGTTTAAAATG")) +(assert (= z "agcuaagugaugauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0312.smt2 new file mode 100644 index 000000000..5d0d3ddf1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0312.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAGAAGCGTTGTTACCGACCTCATTTTCGTCTACGAAGGAACAGCCTAGATCCGAATACATTTACACTTCCGCCTTAAGATGTTCTTCGGTCGACCGGTACTCACAACAAAGGATCTCCAGTTACGGAAATGCGTGATCCTTACGTCGCAGACCCATAGTATGTCTAACGTCCTATTGCTATGAGTACTCCTTGGCTGGA")) +(assert (= z "ggacccacagcuccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0313.smt2 new file mode 100644 index 000000000..143219f58 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0313.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAGATTCACGAATCCTGCCATAGAAGAAATTGCCTAATAATCGTAGCGGTGAAGTTACAGTGGGGAACACCGGTGACTGGTAGTTGATCCAGCTACTGACTATAACGAAGTTAGCCCGGGGCCCAAAAGCACTTAAAGGGTCTCTTTCGAATACGCCTGCCCCTCATATCAAACTCTCCGATCTCGACAGTTTTTGCTC")) +(assert (= z "aggacacgucuaguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0314.smt2 new file mode 100644 index 000000000..dbc1397d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0314.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCACTCACCATAAGTCGTGCCAGACGCTGTGCTGACAGTTGAGGTTCGGTAAATAACAGGCGACCCTATAGCGTATATTCGCGCAATCGTTATGGGCAACAGCCCTATGGCCACTGGGTTTCTTCGGACAATATATCGTGGGTACGGATTTTAACAACTGATGACCACCAGCGGGGTCTACTTTCATTAGAGCGGGTCTT")) +(assert (= z "uucgauagcugggcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0315.smt2 new file mode 100644 index 000000000..ac9d4f567 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0315.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGTAAGCTCCTTCAATCGCATATCGGACCCGCGCCTAAGTATGTCCCTGCGGAATCTCAGGGTCGGTGTGCTCCGCGAGTTGCGGTTTACCGATCGGTCTTAGGCACCTTCGTCTTCTCTCCTCCGCGCCCCGAGACTTTATTCAAGCGCTGGCCTTTCCTGACCGGCTAGATATCTATTTGCCTGCGCCAAGAGAGG")) +(assert (= z "uucuaacgcuaggua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0316.smt2 new file mode 100644 index 000000000..baf207a26 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0316.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGCATTACCGGCACTAAGCTTCACACTAGTAGAGTGAACTCCTGGCTGCTGTCAGGGCCGCATTAAAGCTTCTGGCTTCGCCTTGTCATTAGGGAACTCGCCCGCGCTGACGGCCTTTATGTGGGATTTTGTGGCAATGACTACACGGAACACTGGTGTACTCTATATACCACGATCGGGCCGGACGAGTCTCCAAAGGC")) +(assert (= z "uguauaugauaggug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0317.smt2 new file mode 100644 index 000000000..e6f3bcaa6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0317.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTTGCATTCTTTATCCCGTTTCAGGAATAACAGTGTTCTTACCAGTATTATGTATTGGAACATTAGGTGCGACAATCCGTCCATCAGGTTTCACAAAGTGGACTGCCAATTTAACGGTTGTCGTGTGTGAGTAAGATACCAAACCGGAATCACCAACAGACTACCGTCTCTCACCCGTACTCAGCCTTCTCGTGACTGG")) +(assert (= z "auacuacaacaugug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0318.smt2 new file mode 100644 index 000000000..f17123d45 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0318.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATAGGGGGCTATAATCGCCCAAAATCTTACCAGGGCCAAGAGAACTGCTTCACCGAAGGCGGTAGGCCAATGGGCGCAGGATTCGCATCCACGTACGGACGTCAATTGGCTGAAAGGGCCAACTACCGCTCATTGAGCGTTATCATTTTCCCTAACCATTACGAATTGTGGGGGATATGATGATCGAGCGGTCCATG")) +(assert (= z "acggaacuucucgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0319.smt2 new file mode 100644 index 000000000..4550008f1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0319.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAGTCAGTGCTTTGGAATTATGTACAGCGTTTCTTTAGACTGAACTGGACCCTTAGGTCTATGGTGTGGCTGAGTCTGACCGCATTGTCGCTCCCCCTGAGTGGAACTTGTTTACAATCATGCTTCACCGTAGGTGAGAGAGACGTATGGAGGGTACCAGAGAAGGTTGGGAGGCACCGGTCCGCGGGATGACGTAGG")) +(assert (= z "caaguaucgguucug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0320.smt2 new file mode 100644 index 000000000..95dfa5a7e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0320.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGTTGAAGGTCTTAACCTGATGTGTGGCTAAGCAAGGGCTTGTACAGGATCGCGGAAAAGCGGAACAAGCGCTCAGCGTGACACGCGCTATTTGCGCTCTTGTAAGGAATTTGGCGCAAACGTTCCGTTTACATAATATGCCAGGCCACTCTCCGCTAAGCGTAACCCTACGTGTAATAAAGCAATGTCTCTTTGCGAC")) +(assert (= z "ggguucguuaacaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0321.smt2 new file mode 100644 index 000000000..5e965c29b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0321.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTCTAAAACCGTGATGAGCCACGTTCCAACTCCAAGTGATAATTGCAATATGACTGGGGACAGAAGCCAAAAGATGCGCTTGGGCACTCCCAATAACCTGCAACGTCTTGGAATCGGAGCCCCGGTCATACATTCAAGTGTTTAATGCTACGCCGCACGGATGGATACTGGGGAGTGAAGCTACAGTGAACTCATAAGT")) +(assert (= z "guuaaugccccccca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.smt2 new file mode 100644 index 000000000..b3232fd28 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCGGCTAGTGTGTTATTATTTTACTGTCGCAGTAGACGGCACTGGTGTGGGTCAGACGTGTAAAGGTGGGCCGCCGGCAGGCTTGTTATGGGTGCCAATTTCCTCTGCCGACTCTATCTTAAATCCCATTTACAGGTGCCACATGTATAAAATAGGAATCAATCGCAGTGCGTTAGGGAAGGTACGCGTGCTAAAATCC")) +(assert (= z "uccgaugagauagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0323.smt2 new file mode 100644 index 000000000..b4a8ce694 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0323.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACGGTATGCGGGTCTGCTTTGGTGTTTTTCTGTGTCTGGATCTCTTGCACGACTAAGGTGTAGTTTCCCTAGCTTAAAGCGGTTACGCAAAAGCTCTTGCCGACTCCCGCTCTGACCAGCATCAATTCATATAGCTGCTTAATGGCGCTGATAAGACACGTACAGCAATAAGCCTAGCAACAGACGCGACAAAGTCTAT")) +(assert (= z "gacucuuggagucuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0324.smt2 new file mode 100644 index 000000000..bbd1bd41d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0324.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTCCTAGGTGGGTGCAATCACATTGAGGTCTGTAAAGCAAAATGCTTTTTATCGGGAATGATTTCTAATTTTTACTAGAGAAATGCCCATCCGTGGGCACCGACAATGACTGTAAGGGATGCGCATCTAAGAGACGGACAAATGTATGTTGGCTAAAACTTCCGACCTTTGCTCGTCGAATTTTGAGCATTACGGTAT")) +(assert (= z "accggccaauagaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0325.smt2 new file mode 100644 index 000000000..da105fced --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0325.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGCTTGCCCCGAAGCGTGTTATCGAGGATGCGAGTCACAGTACTAACCCTCACGAGTTTGTCCCTAGATAATGGGAAGTCACTGCCACAAACCACCGATGAACCCCAGCTCTCTCACATTCCACGCCATGTTTGGGCGCACATATTCACGTCCTGAACACAAAAAATTCAATTCGCAAGCGATAGAGTTCGTCAGTCTG")) +(assert (= z "gcucaguuguugugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0326.smt2 new file mode 100644 index 000000000..dc430e8b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0326.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAATACCAATTGTAGATGCGGTTGTGCTAGCCTAGGAACTTAAATACACAAGATCACATCGTCGAGAAAAACGAACCGGTGATAGTTAGGTCGACCCGGGTCAGTGAAGTCTAAGCGGCTCGGCCACATGCGGCCCCAGGAGTAATAGTTGCGGAGCACTGGTTTGGGACCCTTGGGACATAACTGTGCTTTCAATTAA")) +(assert (= z "gcuccagaauuagag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0327.smt2 new file mode 100644 index 000000000..d5af1ad73 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0327.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAAATAAAAGGCATAATCTACTTGTCTGCTATGGATATTGCCCATAATTTGCATTGAGTGCATTGGCCTTAAGAACCCCCCTGTCCCACGCGTTGCGTGTATTCAAGGGTTCCTTACAGCAGTGACTTCCGAAAATGGCACGTTACCGGCCGCAGTTGGTATTAAGCACATTTGGCCCTGCTTGCCTACGACATGGAGG")) +(assert (= z "cauugcugggucgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0328.smt2 new file mode 100644 index 000000000..2a2a824dd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0328.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGTCCCGGGCACGCTATATCACTGAGTGATAAGACCCAGGCCCAATAACCAAAGATGGGGCGTCACCTCTGTCGCAATACGTCGGTGAGTGTCCCCCTTGCAATAGTTATTGCTGTAGTTATCACTGAGCAGTCGGAAAGCCGAGCTCGTCCGAGGATGCCAGTGGGCAGCGCTCGTAGAGATCCCATAACGCCAAGG")) +(assert (= z "guauccguacugcgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0329.smt2 new file mode 100644 index 000000000..9b936a976 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0329.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCTAGATGGTGATTCTGCTGACGATGGTACTGCTCCGCTTCGGATTCATAAAGCTACCAACGGCTCGGTTGGATTTGTGCGGCCTGTAAAGGAGTTAAACGTATGTTGCTTCGGGCTCCATCCATTGGATGCAAGTAGGCGGTTCTTGGGCAAGGAGTCGCGGACCATTATCGGACAGAGTGGAAGAAGATATGTCCC")) +(assert (= z "ucucgcgccugucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0330.smt2 new file mode 100644 index 000000000..06d3302a2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0330.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAACTATGGACGGGAATCAGTATTCGATCTGTCCACAACGAACTCTTGTATGGTTCACGGGTAGTAATCCGCGGCGTTGGGTTGGGGCGTTCACGAGCCCCTGCGCGATTCGACGTAAATACATTACTTGAGAGCAGCACCATGGCGCGTTCGCCGAAATAGGAGGCGGGCCATGACAGTATGAGCAGCGCCTACCAAC")) +(assert (= z "cucguggaccacgcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0331.smt2 new file mode 100644 index 000000000..ae75484d5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0331.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTATAGCCCAAAGTCCATGGCGTAGATATACTTTACTTCAAAGTTCCCTCAACCCAGTTAGCGATACTACCGTGTGATGTACGTATACGCATGTACAAATTGACTGCCGTTCCTTTCGCGACCGGTGGATGCACGGCAGTGTAATGATTAGCAAGGCCCTTCGAGAGCCATCTGCAGGACGTGGGCATAGTAGCGCTC")) +(assert (= z "uaacccugguuccaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0332.smt2 new file mode 100644 index 000000000..dfa3c3108 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0332.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTATGAGCTAGCCTTCCTCGGCAAGTATACTCGCCCTCTAAAACCCAGATATGAGCTCGGATACACTCGATAGACGGATATTGTGTAGAGACCAGTCCTTACTTATCTCATAACGCTGCCCGCATCCTCTGCCAGAAGAGCTTTTACGACCTCAAAGCTCTGTCTCTGCTTATTAGCTCAATCGGTCGTACGGAGATAA")) +(assert (= z "ucuaucguugagaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0333.smt2 new file mode 100644 index 000000000..7bfaf7929 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0333.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTCTCTGCTCGAATCTATCCAACACCGTGCGAGCGTTTCGAAGCGATAGGTCTACGGCAGTGCAACTTAGTGTTTGAGAATAGCGGCCTTTAAGAGGAGACCCCATGATACCCGTAAGTCCACGACTTACGGGTTGACGGTTACTGATTTCAACATTGTGGCGGCGATCGTCGGGGGGCGGCCATTGGCATCTTAAACG")) +(assert (= z "acucgugguccaugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0334.smt2 new file mode 100644 index 000000000..8faab1e4b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0334.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGGCGATTAAGAGAACTCAAGGATAGGGCATTCGTATATGGCTCGCTAAGGCTTTGCGTCTCCGACCTGGTTTGTTAAGAAGCAGTTATACGAATGATCTAATATAGCTATACTTATCACACAGGTGCACCTGCGGGTAATTTTCTTGTCGCGGCCACACACGAGGGTGGCAAGATTGTATATGTTCTCTCAAAATCCG")) +(assert (= z "cuacugaugaccagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0335.smt2 new file mode 100644 index 000000000..993ca1836 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0335.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTATTCTAAGTTCGGCGCCATATGTAGGCACTGAGGACCAGCGTCTAGTTGCGAATGCACGCTGTTATTAGAAGTACTGTAGGACGCGGCTCACAGGGTCGGATTCTTTCAGAGCCGGGTCCACTACGCCTCTGAGGCAACGTTACCGGAACAATTTGCAGGCTATTGCGTCATTGGCCATCATATCATATAGCACAGA")) +(assert (= z "acagggggaacuccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0336.smt2 new file mode 100644 index 000000000..57d6a30c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0336.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTTACGCTAAAGCAAATAAATAGGGTCATGGGGGTTCACGGGTGGAACCGGACAGATGAGTAGGTGTTAAGCTAGCAGCTCAGGGAGAGATCGAGGTGTACTTCTCTTGATTCCTATTCGGCAATCCGGACTACCCACCACTAATCCATTCGTACCCGCGTAACAACGTCAGCGCCACTCGAACCCAGGTACATTCACA")) +(assert (= z "ccaacuaacuguccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0337.smt2 new file mode 100644 index 000000000..245dff301 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0337.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGAGTCTGTGTGCGTCTCGAGTCGTACTTGCGTGGACCGTTTGCAAGGAAAAGGGAATGTGTAGCGCGGCTAACAACTATGAGTAGTGTTCAGACTGCTCACTTGCGCAGCCCGGGCCCCTGGGGTCTGCATGCGGCGGGATAGTCAATGCATAAGGTATTCCGGTATCCGGGTGTGTCCTAAACCTAGTTTCATCCGG")) +(assert (= z "cgcgucacuuuggcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0338.smt2 new file mode 100644 index 000000000..4442ca8a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0338.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGCGCCCGCGCTTCAACTCGTCGGTTACTAGCCACAGGGTAAGACTCTGCAAACTTTGGCAGCAGCCCCTCCGCCCATCACCGCGAAACACCATCAAAATCATAACGATGATGAAATCTATCGTACCGAGCTAATCTTAGCGTGGCAGAGGCCCCCGATAGCACTAATTGCATTTATTGCTCCATGACACGCTACTTAC")) +(assert (= z "augguccgcguugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0339.smt2 new file mode 100644 index 000000000..e29e180ae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0339.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCTTGATTACCGAGTTGTCTATTCCGTCGTCGTTAGACGCCAGGTTGAACATATTGACGTAGATCGTACACTCTCTATTGCGCGGCGTCTCCAGAGATATCCACGGCAAAAACGACCAGCGACGAGATCAACAAACATTCTTCTTAGTGCAAGCATGGTGGCTGCGAGGGGGTGAGTAGTAAAATCCCCGTTGTTATG")) +(assert (= z "gacaaccgggaugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0340.smt2 new file mode 100644 index 000000000..231cc5a1f --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0340.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGGAGCGCCATTCTTTCCAGTAGGACCGATGCGGCGACGTCACACCCCGAACGATTAGGACTTAAGATTGCGCGTCCATCTGCATTTTAAGTAAAATCCCTCCTGATGGCCCTTCGTCTCACTCGAAGAAACCACGCTTAACACCGAGCAAAGGCGGGGAGCCCAAATGGGTTGCCGGGATCGTACTGCCCAACCAGA")) +(assert (= z "accauacccgacaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0341.smt2 new file mode 100644 index 000000000..c18ba4f0c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0341.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGCAAAGAGGAGTTCTCTCTGAGTAACGACACCTAAGCTGACACCTGACCCCGCACAATTGACAAGTATTGAATTAGTATTAAGGAAAGACTGCCCTGCTCCGATACAGGGGGCACCTAGGACGCAGGTTCGTTGTTAGGCTTTCCGCGAAAGAGCTGCAGTAAAACCCCAACCTATCTCTAACTTCAGTTTCCGCTATT")) +(assert (= z "ucccgcggggggaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0342.smt2 new file mode 100644 index 000000000..94c10a974 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0342.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTCGGGCCCTATAAGATTGTAGAGCGGCCCTGGAACTATAGTCCGCAAATTCAGCGAGCCTTAGGTAGAACCGCGCACGGCTCTAGTGACAGGTGGCAGCCTGCGTTTCTCCCATTATTGATAACCCCTCACATGTTAATCGTTCAATAATCAATGGGATAGATGCATCCGGTTGCTAATGGGGCTCCACGACCTATGC")) +(assert (= z "auaacguucuaaucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0343.smt2 new file mode 100644 index 000000000..8a92cd16b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0343.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGAGCGTCGTCACGGCGTAATTGAGTTGGCTGTTACTTAGCACTATCCAGATAAATTCCCCCAACCGCCTTGGGTGGCGATATCGAGACGCGATTAAGCACGGTATTTACAGTAGTCAACTGTTACCACCGCTTCATCGACCCTACTGGGCTTTGCTCCCGTTTGGAATGCTATTACGCGTATCAAGCTTTTTTGCATC")) +(assert (= z "cguauguagcacguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0344.smt2 new file mode 100644 index 000000000..e4d3b5476 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0344.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAATGGTATAGGAAGCTTTCTTACAGCTATGGGGTTATAATCCGCGTGGTATCTGATCCGGCTCTGCCCACTGCTCTTATTGGATTGTTGCCTATTTAGTTACGACATGTACGTCACAGGTCTACGGGCCCTAGTAGCGGACAGCGCGTTCTAGCAGACTTAACGACATAGGCCCAAGGCCCGTAACCTCTGCGCCCTGG")) +(assert (= z "agggcucaguuucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0345.smt2 new file mode 100644 index 000000000..192bbe6ce --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0345.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACCGGCTCGGGTGGCGTACACGGGAAAAAGTCCTCTGTAACGATAATGGGAAGGTACACCATGGCTCGGAGCCGCTCTAGCTACGGGACCACGGGCTCTTTTCCGAAACTGTGAACCTTGGATTTCTCAATGAGAAGAGAAGCGCATGAGTTCGCCCTCGTATGAACGTTATTCGCGCCAGGTCCTTGCAGGCATAAAG")) +(assert (= z "augccaugggacugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0346.smt2 new file mode 100644 index 000000000..06b162666 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0346.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGCTACTCTTCTCGCAGCTGAACTGGAGTCATCTTCCGCCTTGGAAAGTCCCCGATTCAACGCGAAAATAAACTTCTTTTGTGAGGAGCGATCTGCCCAATAATAACGTGCATAGCCTCTTAGGGTAATAATATATGTGTCATCGGACCTATGCCGGGGTTCCTGACCTCCCCATACATACGGTAATAGATATTATCA")) +(assert (= z "ucacucaugacgucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0347.smt2 new file mode 100644 index 000000000..2a32aad3b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0347.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCTGGTCTGTCTTCTAGGAACCGGCTTTACGGAATGATAGTATTGGAGCGGTTACGGTTCTGAGATTGCTGCGTGCGAGAAACAAGTCATTTATAGCTAGTCCGACTGTGTAGTTTCCTGGGGATTAGCCTGTAGCTTTGGCGCTTTCATCGTCCTATCGGAGACGTACGGGTTCATCAATTGCAAAAAGTATATCAGC")) +(assert (= z "auagcaaacauguac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0348.smt2 new file mode 100644 index 000000000..0a6c59eca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0348.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGCCAGTGAAGACGACCTAAAACGTATGCTCACAGCTTGAATACTAAGCCGTTGAGTTTTCGTCATACTAGGCCTCTGTTGTCTGTGTTGGGACATCCGCCGGTTAAGATTTGCGTTAGGTGTAACCCGCATACCGGTTAGACCTCATTCCGTATATGGAGCTGCCCTCGCGATATAAGACGGTAGAGTATCTAAAAGT")) +(assert (= z "ugagcgccauuguca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0349.smt2 new file mode 100644 index 000000000..577e72bac --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0349.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAGCGAAACTTCCGTCAAAATGTACCCTATCAGTTATGTTTACTAAGAACACCCTGAAGGCAAATACCGCGTTCGGGCCTGAAGGGATAAAAGGACGGAACTTGCACTTTCTACGTGTACGTTCCTTGCTCACAAGTGCCGACATAATGAGTTTTAACGCGGCAAGCGCGGCCACATGGCTGAAGGGATCGGCTACATTT")) +(assert (= z "uccccuugucgggag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0350.smt2 new file mode 100644 index 000000000..cf9a3a480 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0350.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCCAGTTTTCGTGGACAGTTCCCACAACAGATAAGTGTGTCCTGGTACCCGAGATTTAACTGATTGAGAGCTCGAAGTCCATCGGTACGTGAGATTGTATGCTAGTCCTAGCAAAGCGGACCTACATCTTCTCACTGATTCGTACCTGCGTGTAGCCTCTTCTTCGCCATCATTATTTTAAGGAGGGCGTGGGACAGTC")) +(assert (= z "aaaggaccuagucgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0351.smt2 new file mode 100644 index 000000000..fd1513375 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0351.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTTGGGACGCGCGTTCCTGCACATCAGGCGTCTGATACAGATTACTTCCGGAGAGGCTGAATGACTCTAGGCAAATGTCCATCGATAATCGAGAAGGAACCAGCCGGAAGGGCGGTAATGACCAGAATCTCGTCTTTGAGCCCCAATAGCATTAGATGAAGGGTTCGGAGTGTGACTTTTCCTGAACTACCTAGGACGC")) +(assert (= z "gagcgacacaguguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0352.smt2 new file mode 100644 index 000000000..3357e8e3c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0352.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTATCCGTGTTCGCAGCGGAATTTTAGTGCATACCCGTGCATGTCGGAACAGAATCGATTTGTCGTAGAAGTCGCTTCGGTGCAAGCGCCGTTATGGTTTAGGGTTGGAATGTCTAAAGCATGTCATATTCCACACACACCGTCTCTAATTCGTTCAGCGGACCCTAGGTCATCAATGCCTCGTTGGCTTAGACCGGGC")) +(assert (= z "uggcccauucacacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0353.smt2 new file mode 100644 index 000000000..89d553163 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0353.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACCAAGGTGAGCGTATATACAAGCTCTTAGTTATGTTCTTTTACGCTGGGACTTAATGCCAAAATAACTCGTGGCACTAAGTATAAGACCGCGATTTCAGCATCCTCACCCCGTGTTGCCCCTGCTTTCAGAAGATGGATGCTCGGCAGGACCTGGCGCGTTTATCCCGTTGCCCTGGCAAGTGATGGGTAACGGTGGG")) +(assert (= z "cguggagcggauccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0354.smt2 new file mode 100644 index 000000000..d76f3a8e0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0354.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGATGCAGATCTGCTCAATTCCTGGCGACCTTTGCAAACGGTATTCCTTACAGTTCAAAAATAGACCGAAATCATTAGGACAGCCCTGTTGGGGATTGGCTTTCCTAACACACGCGTAATAGGAATCCTTCATACGGCCTCAAGCGAATGCTCGGTTTAGATGCGTGTAGTTACATTTTGCCTGTAACAATCTTAGCCGT")) +(assert (= z "accacaacgagcgau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0355.smt2 new file mode 100644 index 000000000..9110039b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0355.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGCTCGAGGTTACGAATGCTCGCGAACGTGTTGGGGCTGCTCCATAGCCCTCTCCCCGTGTCCATTCGCCAGCGGTACTCACTTTGTGAACAATCATGATCACAAGCCTCGCACAGATGTTCGGATCGGGTCGCGCCGCCATGAAAGCCTAGGGAGTCGAAGAGCACCTGAATCCCTCACCCTCATAGCCATACGTTTT")) +(assert (= z "ggaguggacgaguga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0356.smt2 new file mode 100644 index 000000000..1b2a2c4dc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0356.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTATGAAGTAAATTGGTGTCGCAAGGCTCAGCTAACATCATGGATTGGACGTCCGGCGTGGTCGGTAATAAGCTTACAATCTATGAGATTGTGGACCACGTCAAGTTAGCTGTGATCCTGCATAAAAAGCTTCCCTTCAGGATATGGCCCTTCAGCCCTAGTTATGCCACAACCCGGGTGTAACCATCGCTGAAATTCG")) +(assert (= z "ucacguagcuuccuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0357.smt2 new file mode 100644 index 000000000..cb65dabe2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0357.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACGCGGTTACTAGTTGATCAAAGCGGTTAAACATCCTCATCACGTGCCCGTGCCTCGAGTAGAACGAAATTCTCTGCCGAGCAGCTGATCTCTTCTCAGTCCATCAATGAGCGACAAGCAAACTCCACCTGCGAAATTTAAGCACGTAGTCATATATTCAAAGCACATGTGACTTGACTATCTTTGGCTGGAATACGCGA")) +(assert (= z "uuggcaugcuuuuga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0358.smt2 new file mode 100644 index 000000000..4a821fcb0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0358.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCGAAGTGGCTACAAAACTGTGCACTGCAGACCCAACCAATTTAAGCAGCGACGTCCCGTCGCTATTGGGCCCTATACCACAAACGGACCGCACATTGCTTGAAGTGCCGTCCTGCGAGGTTCTGAACACTGTCAGATTGGGTATGGCCAGGTGAATATAATGGACTAGCTCGAACGTCTGGTGTCCTTAGGGCTCCAC")) +(assert (= z "aucgcgagaggacug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0359.smt2 new file mode 100644 index 000000000..d6d993321 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0359.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGATGTCAGTGGGAGTTTCGGCCTTAAACCCTTTTTGGACTACACATTCTTACTGCGTACAGATTGGATTCTAGGGCAATAAATACCGGGAAATATAGTGTTGGAAAGGGAGTTACGCGATCGTTTAATCTTGAACGCGCACTGAAGCTCACTCATGTCGTCTCGCCATAGTGGGTTGTCTGCCTCCGGTTGGACACGT")) +(assert (= z "auggccaucaucuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0360.smt2 new file mode 100644 index 000000000..333cadaeb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0360.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTAACGACAATATCCTAAAGTGGGACTGACCAGCTTAGGACCACCTTGTTCGCGGCAAAAATCATATGTGAATCAATGTCGCGACGATCAGTACTAGCGTATTCGTGATTACTACAACGGATTAAATTGACCGTATGCATTTCAGACTTCTCTCTCGCTAGTGGCCTCATCAGCGTAAGATAATCAAAGCATCATTCCCT")) +(assert (= z "gaaauaugccgucug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0361.smt2 new file mode 100644 index 000000000..ea7e90cd8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0361.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCGGATCGACCTGCTGTCGGTACTCTCACGAGTGTACAACGTTTCGCCAGCGTCTCCCCATACTCATCGAGATAATCTCCGAACAGGACACATCGCTTTCAATCCGCAAGAAATTCTCTTAGTGTGGTGGTCACCTACAGGGATGTGCTAAGGGGGGGGGACGAGGTATTCCTTGCTTGGCCTAGTACATAGAGTACTC")) +(assert (= z "cgugucacucguagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0362.smt2 new file mode 100644 index 000000000..c2c130747 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0362.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCAAAAGGATGATGATGGCGAGAGAGAGTTTACGTCTGAGCCGAAGAGCATATGAGGATGGTTTGCGGGTGGGTTGGGAAAGCTCCAGTAGAATGCAATTACCGGCTATCCACGCGCATAGACACCAGTGAACGGACGCTATATTGTGGAGCATCAAGAATTTTTGGTCGCGCCTTAAACAGTTGAACCTCCGAGCGG")) +(assert (= z "gcauugauccucgug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0363.smt2 new file mode 100644 index 000000000..15a430bfe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0363.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGTCCACGATATTGCAAGACGAGGGATACTTTACGCATAGCTTCTTACACACGGGAGAAACCGGACTAATTACACTTGTAACAGTAAAGTAGTACATTCCGCTTGTAGGCTGGAAAGGGTATACCACCTCCGAGTAGCGTTGGGCTATGCACGGATCGTAGTTGTATTCTTTCATCGTCCCAAGAACAAAGATAGGAGA")) +(assert (= z "auguggauagagacg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0364.smt2 new file mode 100644 index 000000000..cf08d15ef --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0364.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCTTATTACTTATACACACGGACCCAGGTATGGCGAGTTAATCTACGTCATTGCTTTTGCCCATACTAACATGAGTGTTAGAAGCCATCTCCCCTTCAAGTTTACACTATCCGCAGTGAATCATTTATCACCAGACGCCAGCCATCGCCGGCAAAACTAAAAAGACATGCGATCGTACCGGGAGGGTTTTCGACCGCGCT")) +(assert (= z "uaaccgcguugucgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0365.smt2 new file mode 100644 index 000000000..370f4f1e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0365.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAGTACTGGGGAATGGTGATTATTTTACATCTCTGAAATTTAGCACGGCTCCAGCGCGATGCGTTGATCAAACGCCCAGATCCGGGGTGCGTGCGTGAGCGGCTTATAACGATCAAGTTAGGTGTTTGGTTCTTATCGATATGCTACGCGACCTTTCCTGATGCCACAAGCTAGACTGGCCGTGGTCCTATAAGTAGGT")) +(assert (= z "agaugcggucuaucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0366.smt2 new file mode 100644 index 000000000..16ba14d23 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0366.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGGTAGGACAAAACCTCTGTCGAACACTCGAGGTTGGTTCGCCGATCGGTGCCGTCTACAACGTGAGAGGCCTGATCTTAATTTTCGGCTGTGGACTATGTGAGGTCAGAACTCCCTTTAATCTGCGATATAGGCGTCTGTATAGGCCTTTATACATCTACCCAACCAGGTTGCAGCGTGGCAAACCCAAGTAGAGCAA")) +(assert (= z "ccaacagcaaucgug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0367.smt2 new file mode 100644 index 000000000..cfa2e62e4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0367.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCAATGCCCATGTCACCCTCGTAGAACCACATGTTTAAGGGGAGTTTCTCCTTATCGGGCGCGAATGACTGGACGTTTAGGTCTAACAGCAGTCTCTGATAAAGCCAAACTGCTAACAGTACCGTTGTACTCCTCAGACATCGACGCAAGATATTTCCACAGGACATGGCTGGCGTATTCTCACCGATACTAGTATATT")) +(assert (= z "acgggcaugguguau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0368.smt2 new file mode 100644 index 000000000..a3e9077d9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0368.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACACCTTGGGATCGGGCAGCCGGCTAGATTGACAGCATAAGCATGCTAGGCTCGCCTCGAAGCATATGGGTAAGTAGCCCTTGCACTCCCTGACGCTTAACAATGATTTAACTGCACAGCCTGTCATCCGACGTGAGGATGAACATTGAGTTCGTAAGTCAAGTAGGTGGGCAGTCCTCGGACAGCGGCGGTCGAGGCTA")) +(assert (= z "cgcgugauguuuugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0369.smt2 new file mode 100644 index 000000000..0680fd58e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0369.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAATACTAGTTGAGGACCAGCTTAATCAGAAGCAGGCTGTCGCTGTTCGGGTATAAACTGTCTTCCAGCTCCCAGTAAGATCTATCTCGCTATACAGAAGTCTACAACCAATCATTACGGCGTGTCAAACCTTAGAAGCTCTACAGAGGAGTCATCGTAGGCAAAATGAACTTACAAGGTCCGACCACTGGATAGCGGG")) +(assert (= z "ugacuccaaccaacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0370.smt2 new file mode 100644 index 000000000..84f8eb0bd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0370.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGAGGCTTGATATAGACTTATCAATGGGACAACGTTAATCGTTTTGAGCGACGTTAGACCTGTTTTGTCCGGCTTCATTCTAAATTAACGAAATGCTGAACATACAAGCCTTCCAGCAAGCGATTTAGATTCTAACCCACGAAAGTCCTGTGCGATGACTTGCGCGTGAAGTTGTATGTAGTATTCGTCGTGCACTTCA")) +(assert (= z "cgauuaucauccauu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0371.smt2 new file mode 100644 index 000000000..20ef269b0 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0371.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGCATCGTAGTCAAAACACTGTTACGGTGCTTCGGAAATCCGATGCTCTCCGTCGAACAACATAATGTGGCAGTCAAAGCCCGGTTGAACTAGCCGCCATTGCTCTGTCCACCGGTCCGTGCCACGGCTAATGTCGCGAGTGGGCGCGCTTGGTGACAATAACGTCGTACCGGCAAGCCCCACGAGCTCGCTAGATGT")) +(assert (= z "cgggauucuuaagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0372.smt2 new file mode 100644 index 000000000..eb9ab66cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0372.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGTGGCCATTAGCGAGAGATTTTACGGGTCGTATAGTACTCGCCTGGTAAGTGTAGTGCTCTAGGTTGTCACTGAAGACGTGTACACGACTCTTCATGTCCTCCACCAAAGGTAGTTCCTCGTGATACAAATCTAACAACCAGAAGCCGCTATGCATCAAGAGGCTAAGGTGCCGAGCGTATTAGACTTTAGCACTGCG")) +(assert (= z "agccgauuuguaaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0373.smt2 new file mode 100644 index 000000000..17f83a4c6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0373.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAACGGGCATCTGCTATTTGTTCGAGTTTAGGCCAACCCTGGACCAAGGCCACTCCTCCATCCGATGGGCGGTCCCGAACGCAACCGAGCGGATCACGCTGGCGTCTGTTATGACTGGATAAGGCGTAAGACGGCGTGCGCAGCCGTGGGAAAGTTTTACACACCCGTCATGCGGATTAGCAAACCGGACGCTAAGACT")) +(assert (= z "caacccugcacccug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0374.smt2 new file mode 100644 index 000000000..d80ae4dd2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0374.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATTATACACATCAGTACTCCACTATGCACGGAAGGCGGCAGGACATGGCTGGGACAACAGGCAAATCGAGGTTACGCTTTTTGTATAAGGTACATCTACGATGGCAGCTAAATGCTGCTGACGTCCGTCGAATTTTACGGGACAAGGCCACCAATTCACCTTAGCGGCCTCTGTGAGTACAAAACCAATACCATTATTC")) +(assert (= z "gaguugguaccggau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0375.smt2 new file mode 100644 index 000000000..aa6d5efad --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0375.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAATGCGCAAAAGCCCTAATCGAGTACGCTTCCCGGCCCTGTGTATACAGGCTGTAGTACGCTCTAAAACTCGATCCTAACAGGTTGCCGCCTTGACGTCGTATAGATATTCGACGCGATGGGCAAAAAGGCTCGAGCGCTCTTCTCCTGGAATAGTTTGGCGAGAGTAAGTAGCAAGCCAGTTACTCCGGGGACGGCG")) +(assert (= z "cuucguccgguggaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0376.smt2 new file mode 100644 index 000000000..ba4cf3242 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0376.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACAGCAATAGCAATAGCCCCGCGTGTCATAGTCCGTTGGATCACCGGCGGGGAAGCGCCTTCATTCTACAATGAGGACTCGGAAGTCCGATCAACGATCAGGGGCACCTTCGGGACATGCCTGGTTGGACTACAGAGGTAAATACGGGGGAAGGCAGCCTCTGCCATCACTCGTCCGAGTACGACTGATTTCTTCATAAG")) +(assert (= z "uacaaccguuuauca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0377.smt2 new file mode 100644 index 000000000..3a21b21ae --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0377.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCTATGATACGAAGCCTACGGATAGTGCATCATCCACTAGTACGAGCGAACGCATGTCGTCTCCCTTCCTGTACGGCCTATAGTTCTCCTCATGTTTCACGTAGTAAGTACATTAAGTCCCACCGTCGCTTGACATATTCTCCGGCTAGTATACCAATCGGCGGACACCTGATCCTCCGAATAAGTTATCTCAACTTG")) +(assert (= z "cuaccaaggcuaggu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0378.smt2 new file mode 100644 index 000000000..1b6796549 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0378.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCGGATATAAGATGGCGCCGTGTGTCGGTCTCCCTGAACTGGGGTCATAGATCCCTGGGCGATCCCCCCCAAAACAATTACTTTCGCATGTCCTTATTAGCTATGACCGCGATGCAATATGAGGCACGAAACTGTCGTACATGACCATGGTGTATTCAACGGAGCTATAATCTTGGTGTCCGATGAGGAAGAGTGCTCA")) +(assert (= z "cugccgauauguaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0379.smt2 new file mode 100644 index 000000000..ea0020175 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0379.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGATATATACAAACTTCGTGAGAAGGTTGCCCCGATGACGCATCTCCCGTTACAAACTGCATGGAGAAAAATAAATAGGAATTATTGATTTCTCATGCTTCCCAACTTCTTCAAAGCGCACATTATACTGCACTAGAGAACTTTCTACTAACTGTAGAGTTACAACATGGTAGCGGGTCATGGTCGGACCAGTGCGGCG")) +(assert (= z "ccugucgguacugua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0380.smt2 new file mode 100644 index 000000000..b7497b000 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0380.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTAGGTACATCTAAGTCAACACCTGTCCGATCACCTATTACGCCACCGGAGCAGTTTGGCTCCCTGTTCTTATGACTATGGAAGACGGCTCCCGCGCAAGTGGCCAAGAACCCTATTGTCCACATAACTCCAAACCCAACTGTACGTGGGAAAAATTGGAAGAGCGGACAAGGACTAGTTTTGTTCGTCCCCCGTAGCA")) +(assert (= z "gugcgaaaagaauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0381.smt2 new file mode 100644 index 000000000..3126861c8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0381.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCAAAATCCTAATTCGGCCTACACTACGGGAACAACCCCTTGTAACTTGATTACCCAATGTTGTATACCTATGTTGACCCAATCACGCGTTCGTATCCTACCCTCCGGCTCGAAAAATTACACTGGCCTCACAAGAGTTTGCGTGAGGATCGGGTATAATATCTGCCTTTGTGAAGCTATCTTATGGGTAGACGTTGG")) +(assert (= z "aaggguuugaauugg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0382.smt2 new file mode 100644 index 000000000..dfd7bc553 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0382.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGGGAACACTGGACCTGTTTAGTTACACGTGGGAGGAGTCGAGTGGGAACCTCTCTAGACACGGTCTTACAATATTTCGTCTCGCTATATAACGTTTCTCAAGGCTTCTGCTTGTGCTGAAAAGACGGTAAAACTAGCGTAAGATGGTAATAATACGATCTCCAACGGAGTGTCCTCGTAATACGTGAAACTGGCTTATC")) +(assert (= z "cuuugguacaguuug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0383.smt2 new file mode 100644 index 000000000..440814b5a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0383.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGCAAAAAACTCAGCCACTCTTCCATATATAAAATTCTGCGTCGATGCCTTAGTCTCCCCGTGGTACCGTTAACCTTGCCTGCCGTCGTAGGCAGCCTGTTGAGGGTCTTCTAGTGGTACGTAGTCGGAACGGCGCCCTCTTGGTCAATACCCGCGTCGAAGATTATGAAATACAGTTATCTAGTGCCTGAAGACTTT")) +(assert (= z "cuguggauccagacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0384.smt2 new file mode 100644 index 000000000..c6552d760 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0384.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAAGCCCTCATCTCTGGTTGTCTCGCGGATACCTGTCACGCGATAAAGCATATGACTATCACCTGTACTATATTATGGGAGGTTCCGTCTGGAGCATAACCCCCCGATGGCCCGTCGAGTCAAGGGCACGTGGAGAAATGATCCCTATACGCACCTCGGGACTCTGTTTCCTCAACCGAACGCATGTAGGGTGGCTTAC")) +(assert (= z "uauugaaccuccgaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0385.smt2 new file mode 100644 index 000000000..0fd29e316 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0385.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACAATCCCGGTGCAATCAATAACGTCATCCAAATAGCTCCTGTCGACAGTAGATTCCCTAATTTGTGGTGGTGCGACCGGTTTCATCGGATACAAAAACATTCGCCGTGAGGCGAGCCAGTGGCTATACCCGTAGTGGTCAGGAAATCATATTAAGCATTGAATCTTCTGCAGCCCCGGAGCAGAACTGTGGTTGCTAC")) +(assert (= z "accguagaauagcac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0386.smt2 new file mode 100644 index 000000000..0b9b186d6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0386.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAATCGAATCATAACCTCTCCGAGATCCGATCTGTGCTGTATGGGAGCATATGACGGGAAGTTGGTCGTATTTAGTGCGTCATTCAGAAATTGGCACGAATTCGAGACGGTTTGCAAAGCTTTCTCTTCAGGCTTAAAAGATTTATGTCGTCGTCCACGAATCTTTCGACACTGACCTCTACTTAAAAACCGAGAGCGT")) +(assert (= z "gaaacguaggcaacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0387.smt2 new file mode 100644 index 000000000..e3f4a091c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0387.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCCGAACTTGCATACCGAACCTAGCACGGTGGTAAGCCGACCCTGAGGTCGTACATGACGTTTGTTACTCTCCAGACGCAGTGGCAGCTCCGGAAAACCATCGCGTTTACCTGCGAATTATCTGGAAGAATTCCACATGAGACTCTTATTATCCCGGTATCGCTAATTCTGCTCGTCACTCTGGCCTGATGAATTGCCT")) +(assert (= z "agaguggaugagccu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0388.smt2 new file mode 100644 index 000000000..9957e04a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0388.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGCCCTGGGGATCGAATTAAAGTCGTTCCCTAAATACGGAACGTGGACTCTAACCCATTTCATCGCGTCGAAATCGGTGGCCTGCTGATGCCCCCCGGTTGCGTGAGCTAATATGCAAATGTCGTGGGTTCCTGTGAAGGTCAAAGCTGGTTTACGGGGAGACTACCAGAGGCAGGACAGTAGAAGAACGGAAACTAGAT")) +(assert (= z "gaaagccauguguag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0389.smt2 new file mode 100644 index 000000000..5894eb1cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0389.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCGAGACACCCCGGACTCCTCATGAAGCTGCATATTAATGAAATGTATCTTCCCAATTCCCTAGGCTGACGAGGACGAATGCGGGGCATCTATGAGCTTGCATTGTCAACCTTAGGTTTACCAAGAGGGGTATGGGCCAACTTACTGCACAGTCTAGTAACTTGAAGGCAGATTGTTAGCTGGGGGCTGGAGTGACTCGC")) +(assert (= z "auuggucacgacaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0390.smt2 new file mode 100644 index 000000000..9af2403ea --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0390.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTAGTCCTATTCGGCCGCGCCGACTGTGACTCGCCCCGATGGTGTGATTATAGGTGGGAGGTCATCACCATAATCGTCCTTGCTTTAACGTGGCAGTGTCACTCATATAGGGGTTTCAAACGTCAATAAGATAGGGAGATGATCCCACGCCACCTATAAATGACTTCCGTAAACAGAGTCCTGCGACCCCCGATGCGG")) +(assert (= z "ugauaaccagcauuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0391.smt2 new file mode 100644 index 000000000..205802fcb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0391.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCGACTTCTCTCGAAGCTCAGTGGAGCCCGCTCACTTAGAATAAAGATTCGTCAGGTCCTAATACATTGGTATCGAGTCTTAAGGTTGGATGTGGGAGCTGGTGGCTGCATGCGTTTGACGTACATTTAGTGCACATTCATGTGGCCAGTATCCCGCTGTCACCCAAAGTGTAGTCTTGTCAAAGTGGTTTCGTTGAGC")) +(assert (= z "cauaaacaagacaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0392.smt2 new file mode 100644 index 000000000..f9d1eb3a9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0392.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAGTAGGGCACGGCAGATATCTCGCTCCCGCCCTGAGAGCCAGAGCTAAACGAACAGCGATCTTGTGTTATTGTACGACTAAATTTGGTGAATTTTACGAGTCTGGAGCGCTAGGTTAGTATATGGTACAGAAGAGCAGACTCCCCTAATTACACTCTAATCGCGATGTCGTAGCAAATATGCATGCATCTTCCCCATGC")) +(assert (= z "aucgauacggcuguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0393.smt2 new file mode 100644 index 000000000..104693791 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0393.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTGTGGGGCTGTTGCCCGCACCGTGACACCGTGTACCAGCAATTACACATAGGAGAACGGAGCCTTCCCGCATTATCGACCCCCAAATCCCTGTCGCACCACCGCGAAGTATGTCCGTATGCAAAGGACGGACTCAGTGTTGCGAAGTCGCCACATGAGTCTGATGAGACACTGCAGCGAAAGTCAGCTACTCTACAA")) +(assert (= z "uccgugggccccauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0394.smt2 new file mode 100644 index 000000000..a01a11999 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0394.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCATCCACACCGCTAGGCACCATTCCAATAGTTGCCCCAAACTCTGGCAATGACAATCTAGGCCCGTTCTACTAGCACGTCTTGTCACGCGTCGTGTGTGTCTTGGGAGATGATCGTGATAGTATATATGTTCGCGTGTTACGACGTCAGGGCGCTAACGCCCAGTCTCAAGAGACCGTCTCCTGGATGAGCTGAGCCTT")) +(assert (= z "gagcauucuccuugu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0395.smt2 new file mode 100644 index 000000000..643804187 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0395.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCACTCGGACGGAACCGTGAATATGCTGTTTCATCCGTAAATCGAGAGCCGGTACTCATCTCAGTTAGCTGTGTTCAGACGTTGGCAGCGGACTCCACCGTCTTCCTACAGTCTTTGACCCATCGCGCAATTGCTAGGCGAACTCTACTCATAAACGAGCGCGCTGATAATGGGACTATCGTTCGCAATCAACGTACAAC")) +(assert (= z "gccgcuggaaagcag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0396.smt2 new file mode 100644 index 000000000..0048346e8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0396.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAAGTGTTAATGTATAGCCGAGCCAAGACGCGAGAACCCTTTAGTAGAACATGCGGGTTTCGAAAACGAAATCTCTAAGTTATAAGGCGAGCGAGCAAATATTAGGAGGGAATTCACCGATACAAGACCTTATCCTTCCTACACCAATCACGTTCGAGTCTTATTTATGACTCTAGGGGTGACAAGCATAATGAGACGCA")) +(assert (= z "aucagguugcggcca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0397.smt2 new file mode 100644 index 000000000..c1e795b6b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0397.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCCAGTTGATGTTGGTACCTAGACTAGTGTAGTATTCTGAAGACTAACTCATAGATATAATTGTCCCAGAACGTGGGCTCAAGTTACTCGCCAACATGTCGATATGTATGGGTAACTTCCGGATAAACAACCTACCTCGCATTTCCCTCCTCGTTCCGCCTAAGAACTTGAGCTTATGTATCACGCGCTAAATGCTCCAT")) +(assert (= z "gguggcucgggcuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0398.smt2 new file mode 100644 index 000000000..03f5c865a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0398.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTACACAACTAGTAACAAGCAATAACCATAACCTACCTTGTGTTCGCTTCATCAACTAGAAACCATACACAACCGATAGACCCGGTCAAAATACCCAGCGACAAGACCGGCCATGATTACAAGACTTCCCACTGTTGCACTTTTAGACGCTCCTCACTTATTAGGCGGACCTTTTCTCGTTTCCAGTCTATAGTTTTTG")) +(assert (= z "cuacaggcagggacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0399.smt2 new file mode 100644 index 000000000..2e82d0650 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0399.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCATCCAGGCAGGCTGGGATTACGTCCTCATAGAAAAGCTCACATTTGTACCTAGTGAAGTACAATAGAGGCTTCGCTACGATGGACCCGACTTCGCAAGTGTATTAAGGCTACTGACACCTTTAGTCAACGCCTGCGTGTTGCCTAATTTGAACCCACGACTTTAACCGGTTTTGGCCTCGTCTAGACAGCCGACGGAG")) +(assert (= z "gaucugaguucugaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0400.smt2 new file mode 100644 index 000000000..4b4b06d6b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0400.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGAGATGGGCTCTTCTGGCATCTAGCAAATCATCGCGGAGATACAACTAGAATCCGTTCTTCCAGATCCTCTCTAGGCAGCGCGTGGCGTTTTCCTTGCCTGAGATTACATGCGTCCAGTGATATACCCATGTGGTCTCCAATGTTCCTATAAATTGATTTCAACCCTCATGCCACACCGTGAGCACCCCTTCGCACTAT")) +(assert (= z "ucagguugcgaucac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0401.smt2 new file mode 100644 index 000000000..c37eca36a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0401.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGGAGACCGTCAGGACTAGCAGCGACTCGCCGGAATTCTGGTTCTTTTCGTCATTCTCAAGAGCAATTGCTTACGTCATCAACGGAATTCCGAGTGCGGCTCTTTAGGGGCTATGCCCTAGCTAATAAGGCAATGTCAGCCTAATGTGAAGACGTACCCTGCAATCGTCGACCCTTCTGTTTCGTTTCAACTGTAGAGA")) +(assert (= z "auccaagaauaacuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0402.smt2 new file mode 100644 index 000000000..10b494b26 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0402.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCATTCGTTCTCGTAGACCTGGGTACTGAACATCTCATGCCTCCCGATCGTAACCCGATCGTCCTCTAACTTTGATGAGTTGAATATTAGTTGAATGCCAGTAACTAATCGGATTAGCAGCAGGGGTTTTCACACCTAACGGCTACACTTTATACGAGCGTGACAATGCAACCGAAATTTGCTAATGATTACCAGTCACA")) +(assert (= z "accuuucaccugaag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0403.smt2 new file mode 100644 index 000000000..5b7e131a5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0403.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCATCAGTTCTATGTGTGTCCGACTATCCGCTGATTAACTCACGGCGCTGCGAGCTTGTACGGGCCAGCACTTCCCTTAAGGTCGGTCCTACCGCACGTAAGTCCTTTGAAATAACGAACGTTGAGCGGGCACATTGAAGGCCGGAGTTATTTTATTCATCAGATGTAGTCGCAGAGCATCCCTTCTTAAACGATAGAC")) +(assert (= z "auauucaugugagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0404.smt2 new file mode 100644 index 000000000..3a388b8dc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0404.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCCGTCAATTGCAGACCTGCATGAGTCTTCAAGCGAGCTCAGTTGCGTATTTCCACTGAACGTCGAGATCCGATTGGCAGGAGTTAAGGAGGGTCCGTATAGTTCGGTGGAACTGGAGTCGGCTTTAATAGTTGAATCAGTGGCGTTATAAATGCCATGGGAATCGTCTTAACCTATCTTAATGCGTAAGCCCGTTCGA")) +(assert (= z "uuucuucuaugggau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0405.smt2 new file mode 100644 index 000000000..3f062abd1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0405.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTATTCAGCCTCTGAGTAGGTTTCGATGTTTCGCCGCCTAAAGAACACCCGCCATCGGGGATAGGCCTTGCCAATATAAGTTGCTGGGGCGTTCGGCTGCGTCCATCCAACCCTCCTCCTTTCCTGAATGTGTCGTGATCCCCAGACTAGATTAGTACCAGAGATTTCAGTAGGGAACACCGGACAATATAGTTTAAAAA")) +(assert (= z "gcaauguaagaagag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0406.smt2 new file mode 100644 index 000000000..013feb397 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0406.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATCATAATTATTGATCAAAGGTCGCATGTTGATCAATATTTAGCGCTGCGCAATTCCGAACCGCCGACCTGTCGAGACCCCCCGCGCCAGACACTCATCAGAATCGTATTTGCACACAGAAGCAATCTCTCATGAAATCCGTACACGTTGAAGTTTCTCAGCTCCGATCTTTCGGCCAAAATGTCCTTTGGGCAACACA")) +(assert (= z "cucuaggaucaagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0407.smt2 new file mode 100644 index 000000000..f49ed4caa --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0407.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCAGATGTCCGAGGAATTGAAATATGATTGGGCGGTCGTGAGTTCTCCTGCTAACTTGGGGCAACTACGTATCGTACTAAGCCGAGTTCAATACATTCTGACCTTCCGCATCGGCCGAATACAAGCTGGCTTGTAATAAAGTGTTCGCTTTAGGTTATGTTCACGTCCGAAACTGAGAGATCTATGCGGTGGAAACTTAG")) +(assert (= z "ccgaauaguucgcgc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0408.smt2 new file mode 100644 index 000000000..2b6a8cf24 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0408.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCCTCTGGTCACCCGGAAAGCTAAAGGGCGGCGTGCCGAGTCGATCGGGCCATACATACGTTCTGTCCACGAAGTCCGTAAGCGGATCACCGAACCATGCATAGGCTTCTATCTTTAGTCCGGAACGTAGTGATAGGGCTCCTCAGGGCCGGTGACTGGGTACTTACTTTATAAACGCTTATCACGAGTCACTGTCAT")) +(assert (= z "agucgcgagcauccc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0409.smt2 new file mode 100644 index 000000000..fb8c115cd --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0409.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGATCCCCTGAACGGGCCGGAAAGGCCAGGTTTGCTGAGAGTAGTATTATCCGCCAATCCGCCTCTAGCGGTATGGTCCAGTAAAAGAGAACCTGTCGACTGGAACGTACGTCGCGTCCACGACTCTCTGGCTAGCCGGCTAGACTCATAAGTGGCGGTCTCCCCAGAATAATCTGTGAGTACGGTTTGCGTCTCCAAAC")) +(assert (= z "ucacgugugcccuua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0410.smt2 new file mode 100644 index 000000000..8d822009a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0410.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACCCAACAACGCCAGCGGGGTCCTAGGCCGGGTCGTCTAGAGAAAGCAAGGAGTCAACATGACCGGCGGTTAAATTCAGGACTGAATTCAATCGAATCTGATTTGTTTTTGTTTCACGGTTATCAGTTTCATATCAGCCGGTACATGAGGGATGATGGTAGCTCGTTCTATTCGGACCTTCCATGACTGAGCTTGGAAG")) +(assert (= z "gggcguuuucccaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0411.smt2 new file mode 100644 index 000000000..d7b648667 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0411.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CAACAGACCGCAGGCCAAGTGACTATACTGTGGCCCGCGAGGATAACTAGGTCCTGCGGAATGGGAAACCTAATCGACAGAAAGAGTTCGGTAGGCAGGGACATTTCGCCTCGATGCGTTGCAGACACGTGCCCGTTCCAGGCCAACGCAGTGCAATAGCGTAGCCAGTACAAAATATCTTTCGTGTCGAAGTTTTCTTG")) +(assert (= z "aacucaacucuuauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0412.smt2 new file mode 100644 index 000000000..441941574 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0412.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCCATACATATCGCGGGTCAGATAGGATACTCACATTTATGACCAATCTAACGTATAGCGAATTGGAGGAAAGGGTGCGGGGTTAGTCCATCAAATGAAGAGTGCAATCCTGTAGTGGGCCTATTTGCTTAGTGGTGTATTAATATCCCCCATTGGCCACGGTTATGTAAACCTAAGCTCGTCTATCAGGTGTGGAGTA")) +(assert (= z "ggcuuggcagcaggg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0413.smt2 new file mode 100644 index 000000000..d04b3be16 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0413.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGTCTAGACAACATGTGGCACCCGTGAACTTCTACCTCTAGCTATACGATAGCTGAGCAGGATCCCTGTGACGACTAAATTTATCCGTTTTAAAATACCGTTAGAACGAAGCTGATTCATGGACGGCTACCCGCCTTGAAGCAGCCATTCGACATTCTTTCGCTCTCCACGTGCTGCTTTAGGTTTCCCTGGAGAATGT")) +(assert (= z "cugccagaaggcucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0414.smt2 new file mode 100644 index 000000000..694d228b2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0414.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTATGTCGTGATGGATCCGAAGTCACTCTGCCGTCTAGTTGGTAACATCGGTGTAGACTTCACAGCTACACTCCGAGGGCTTAGTTGCGTCGTTATCGTTAGACGATTGGAGGTAAGGTGCAGAGGAAGGAGTGCATCTAATTGCGGATCTGCGGTACCAGGAGGCAAATACTAATTAGGGATATCTATTCGAGTTGGCA")) +(assert (= z "gacaagucaacuugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0415.smt2 new file mode 100644 index 000000000..4afb5dfb8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0415.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCTGGATAACCTAGTTTTAGGAACTCCGGGTCAGACTCCAGTCCACGAGGTGGTATTGACAAGCCGTGTAACTGTCTTCCCCGCCCGAATCTTACTTTAGTATAACACATTAACGGAGATGGCAGTCCCAGTCGTTACTTAGGCATGAAGGTAGACACTCACACAGCTACATTACCCGATTTAAGACCACAAAAAACCAC")) +(assert (= z "uaguggcuacugagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0416.smt2 new file mode 100644 index 000000000..4f0816aca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0416.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCCAGGGGGTAACCAACACAGTGCCTCTGATGGTCCCCGGTTTACGATGCCCTCAGTTCCGTGACATGGGCTTCGGGACGCTGTCGCCACAAGCCCTAAGGATACAACTATCGATGTTAACTAACGAGTTTGCTAGCGTGCTCAATTTCGCCTTACTGGACCGATCCAATGGCCGACCTAAGCGTGAACAAGGCCAGTT")) +(assert (= z "cggagcauuguaacu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0417.smt2 new file mode 100644 index 000000000..37b77c93c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0417.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCACAACGGCGTAAGAATCGGAACCAATGCCTGTTTGTGCACTTGCGTACCGCGAGATTTGCGCCGGTAGCGACACTTGACGGACTGATACTAATATATCTCGTTCCGCTGTGCCCTCTGCAACCGCCCCTCACGAAGTCCCTGATACGGTTGGCTATAGACAACTCTCATACTAGTATGAGCTGCATACAGAGAAAGC")) +(assert (= z "uaugacguucguuau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0418.smt2 new file mode 100644 index 000000000..df2a92966 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0418.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGACACAGAGATGGCACCCCTATGATAAGAACTCCCACAGAGACTGCCAGGCATCCTTGCCTACACAGCCCCAGATGTTGGACTCACTCCAGATAAAGAATCATAATTGCTGTTTAAACACAATATGGCGGCGTTAAGTAAGCAGGAAAGAGTATAAAGCGAACCGCCGGCTGTTTAAAAGGTCTAGCTACAAACTCGT")) +(assert (= z "augcgucccacguga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0419.smt2 new file mode 100644 index 000000000..113f6cb84 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0419.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGATTCAGTGCACGAGGGAACTTTGATACATTAGAGCGTTCTACCAGTACGCACATGTTCCTAATTCCCTCATTCGGATTGACATCATACCAGGAGTGATGTGTTATCGCCGAGATGGAGGCTAGAACAGGTCGGTTGTGACAAATATTGATAGGCAACTATCCCTTCCCGATGAACACAATGGGGATGATCCATCCTA")) +(assert (= z "ucaaggaaacgaagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0420.smt2 new file mode 100644 index 000000000..b60251f5e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0420.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTTATTCCAAAGTCTGCCGCCAGGAAGCCGGAGCTTGCACTGTTAAGTTTGGTCCGGCAGAGGACCACTCCCGGTAATGATCAGTCTGCGCCGGGCTAGCACATATGGGCAATATCTCACCGAGTGAGTTGACCTTGCTTTGACCTCGCTGGAGGTACACGACCACTTGCAAGTATGAGCCACTAAGGTCAAGGGAATT")) +(assert (= z "ucuaaccucaugucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0421.smt2 new file mode 100644 index 000000000..afb65fe0c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0421.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGGAACTAGACGGCCTGAAAACTCGTATAGCGACAACTCCCTTTCTTGGTAAATCGCTCCTTACTTGCCACTGGGATTGCCTCGATGTAATCGCGACCTACTGCTATCTTGTCGTGTTAAAACATTCAATTGTTGCCACGAAAGGCGTTCCCCGATATGCCCATCTCACTCCACAATGATGGGCCTGATCGTGAGCTCC")) +(assert (= z "cguggagugaucuag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0422.smt2 new file mode 100644 index 000000000..37834e099 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0422.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCAGCCGAACCTCTCCTTGGATGTGTATCGCTAGATATTTTGTTTATTGCCCTAGTGCCTTAACCTGTACTAAAGGCGCCTAGCAGAAAAGTTACGACACATACATACTCGCATTTTGTCTATGGCCAGTTCGGTAGTTGACCTCGGTCCGATTGGCTTTGTTCAATTAAATGTTTGACTGATCCGTGAGGAACTCG")) +(assert (= z "cauuugccgggaaug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0423.smt2 new file mode 100644 index 000000000..becb35698 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0423.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATAACTGTTGAGTTCTCGGGGTCAGTGTGTAGTCCGTTAGCATTAAGGTCCAATACCGGATCTTTATTCCTCGGCTATGTCCTGCGGAGGGTTCGGATACAGGGCTTATGTCGCTCTCGAACTTGCTCGGCAGTCACGGCATAGTGATAAGTGTGGGGACCTCTTAATGCTGGAGTCGCCTGGTTCTGCTGGTTTTACT")) +(assert (= z "auguacgucaauaua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0424.smt2 new file mode 100644 index 000000000..b91016369 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0424.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTTTTCCACCGAGACTCGCCCATTCCACTTGAGGTTCTAGCCTTTTTTATCTTGAGGTGGTGACCTGTAACTATTAAGATGTCGAATGGCATCTCGATTGGTAAAGCTGCTTCCATCATCCTGTCCAATGTAGAGCACGGTGAGAGCTCATGCAAAAGCTCAGCTATTGGTGAGGGTACGTCGGGCTAGGCATTAGTAA")) +(assert (= z "gcucguucugccuaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0425.smt2 new file mode 100644 index 000000000..74f85dfe2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0425.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATAAGATCTCCCGCCTAGGTGACCCAAGACTTGTCAATCCGTCCTTAGGAGTGTCATAACTATCGGTTGGACCCCTATAGCTCGAAAGTAGATCGGTCGGCGTCGGGCCCATTGAGGGTAGAGGGTCCCTCAGTGTCTCAACCCTGGCTACGGAGGCAACCACATGCATCCCTAATACATTGCGGATATGTTTACACCC")) +(assert (= z "uagacccgaacucac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0426.smt2 new file mode 100644 index 000000000..b6293cd9a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0426.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCCCGCAACACAACACATTTTGGCGCGGGAAGAGCGGGTAAGCTTACCTTGTGATCGCGACTATTCGTAGATGCGGCCGATCTCGGGATAGATCGGTGAGTTCTGATTATATGCGTGGTTCAGTAGGACCACGTGTCACCTTTGTGTTGCCTGACTCGCGGAAAAAGTGGGGCTACTGTGCAACACCGGTGTGGCGGA")) +(assert (= z "gucuucagcuccaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0427.smt2 new file mode 100644 index 000000000..4b5399a1e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0427.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTTCGTGCCTGATGTAAGGCACGCCGATTGACACTGCGAGTTGGCTACACTGAGTTGCTCGCGGACGAGTTATATGGCGGGCCAGCCGCATCTTATACATGAGCTTTAACGGGAGTGTCCGAAGTCAATTCCTACCAACCGCACTCCTATTGCCACGATGACATTAACCAACTAGAGCGGCGATAGTCGACCCGCCAGAC")) +(assert (= z "gcucucugaucauac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0428.smt2 new file mode 100644 index 000000000..9e3cd0c4c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0428.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGGTGCTCACTGCTCAGAGCTTATTTCATTCTGAATTTGACAGCCTCGCCATAGCGTGCCAATTGGATAGGCCTTCGGACAGTCGCAGGCAAGATGGAAGTACTCCATCATAGTCCTTACTAGTGAGCCAGTGAAGTAATGGCGGTCCGTGGTGGATCGGGCCAATGATCCAAAAACAGGACAATGGCATTAAGCTCTA")) +(assert (= z "gcccucccaggacca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0429.smt2 new file mode 100644 index 000000000..b34540cc7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0429.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGCTCTATAGATTTCGATCGCGGGGGAGCCTTTAATCCTGAACTACGGAGGTGATGACATTGAGCGGTAATGAGAACCATGCGGTGACGGGCTCCCTATTACACCGAGTGGCTTAAGTTCGTGACCCTAGGGCGAGGCGAAGTCGACATTGGAAAAACTTGGACTGGTGGAACGACAGCATAAAAGAAATATACGTGTCC")) +(assert (= z "aaagguugagcucag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0430.smt2 new file mode 100644 index 000000000..c5943df2b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0430.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCACAGCTCGAGCCTCCGAGACTCGTTCCCGTGTGTGATACAGAGGTATTTAGGTTTCCAACGGTTAATCAATTATGTCCGCTATATACTAGTCACACGGACAGGAGGCACCACTTACGCAGATTTGGCCTGTGCCATCTCTTTCGAGTAGTGTACGCGTGTTGGCCCGCTGGGATCGTCGTACATGTCACCGCAAGATC")) +(assert (= z "agacugguaguucgg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0431.smt2 new file mode 100644 index 000000000..fc9957470 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0431.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCAAACGAATGGTCGAAGAACAGAATTATCACGAGAGAACTCTTACATTTTGCACTTACGGCTCCAAAAACAGTTCCACGGGGCCGAACGGAGGCAAGAAACGTCCGCCTCATCTCGTGCCTAACTTGGGCTGCGTACCTGAAGGACGAAAATTATGTTTCGCGGTACGTACGGACACTGTTGTGTGATGTCCTAATGGC")) +(assert (= z "uacuugguccggaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0432.smt2 new file mode 100644 index 000000000..184dc8502 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0432.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGGTGTTTCAGGCTTATTGGTTAAGCGATTTGAGGGACATTCGTATTCGTCCTCCTATAACTTTCGATCTCGAACTTTCGGAGGCACGGATTCGATGATGAACCGGCCACGCTTGTGCCCATGCTTGTGTAGCTACTGAGCTCATCGTACAACGCCCGGGACTTGACTTCATGACACTTGCTTAAATACTCAGCCCAGT")) +(assert (= z "ugguugggccaacag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0433.smt2 new file mode 100644 index 000000000..942cfced9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0433.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTGTACCCAACAGCGTGGTCTCACTCTCCGCTTCGAAAGGCAAGGTTGTGGATCCGGTGTCCATCAGGTGTATACTCCGCATCATATGCCGACGGATGGGAATGGGGGCCCAGTCCCACAGTGAGGGAGAGTTACTAAGGGACAGTGTGTTGATACGGCAACCTATATCGCAGATAAAGCGATAATTTTCAAGCCTAAGC")) +(assert (= z "uuaccgaucugcucg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0434.smt2 new file mode 100644 index 000000000..cf0458e8d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0434.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCATAGCACCCGCGCACCACTGTTCAGTTCTCGATACACGCCCTGCCTATGTCCGCAGACGTGCTCTATGTACGGGGCGGTCTAAAAACCGTCTCCCACAAAGCTCTCGTACAATGGCGCACGTAACGACCAACACTACATATGAAACGTGACCGTGTCACATTTTGAGCTGCTTCGTACAGCATGCTTCCGATGTTA")) +(assert (= z "gaagcauagucgacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0435.smt2 new file mode 100644 index 000000000..72605a4a6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0435.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATGTGGACCGCGTAATACAAGGAATGCTACCGCGGGAAGTGACTGGTCGTATTATTACTGGTACTATAACGGAACCAAAGCCAAATAGCTACTACTTCTACCTTCGCCGCCTGTGGTTCTTTATGGTCGTCAGGCGTGATGGATCTACGCACCTTACGCTGGTTTCTGAAGCACAATGCTTGGCGGCGCGACTGGTGGT")) +(assert (= z "uaccuuuacuccgau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0436.smt2 new file mode 100644 index 000000000..5d8e6d6bb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0436.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GATCCATGGTGTCTAGGGGCCGACGTAAATACTCGACGCTTCTGCGCACTCAGGCGAGTATGAGCCCGCTGCTTCAAAATGATCGCCATGAGCCTACTCGAGTCTCACAAGGAGAGGTGATGGGCGATTCTACAGGGTGCGGGCTGGGCGAATCCCTCAGCCATGCCGTGGGCGTGCTAATGGAACACATCTGTCAAAAC")) +(assert (= z "gauguuccgcauauc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0437.smt2 new file mode 100644 index 000000000..0fa4a81c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0437.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGGCAAATCAGGGGTATCGAGTGCGGGGGGGCGGAGCCAGCGATGCGCTAGACTGACACGCTAAGGAAAGTTGCTAGGTAGTATCAGGAGTCTCCGAGCACAGTAGCGCCCGCGGGAGTTTGGGAGAGAGAATTTCCATCCAGCGAAGGGGGAAGTCAGCACGGTTCAACTACGAAATGGTCGGTGTTAAATTAGAGCT")) +(assert (= z "ccucauggccgaguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0438.smt2 new file mode 100644 index 000000000..d0480e27a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0438.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTTCCGGGCCGCTTAACCGCACTGACCCCTATTCACAGCGGCTCCTCCCTCTCGCCATGCGGTGAGGTCCGTCCAAGATCATGTTTTACGATGTTATTTCTGTACGGGCCTTGCCATCACGGGAAGCAATAAACATCCGCTCGCTATCTTGCTTACTACCGCTGCGAGGACATGTTACGCAGCTCTAGCTAGTGATCTCT")) +(assert (= z "aacgaccuccugaaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0439.smt2 new file mode 100644 index 000000000..f882a6ab1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0439.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTTCTGTACACGTTTCATGATAGGGTTCGTTTATAAGGTTGCTATCTGTACACTCGTGGATTTTGAAGTGTGGCCAAGGCGATAACCCAGTTCGGTCTGTAATGCACCTGAAGCGTAACCACATCAGGCATCAACAATTAGCCCGTCGTTGGAAAAGGATTGTGAATAAGGCAAGCAAAAAGTTATAAGCAACACATTG")) +(assert (= z "uugggaaaccugcgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0440.smt2 new file mode 100644 index 000000000..548eac804 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0440.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TACGCAGTCCACGTATGAATGACGGCTCCAAGGATACCCTAGGACCGCATACGTACTGGTCACGTTTTGAAACGGTAACGCTAACGGGTCATAACCTAAAGCGCAATGGAGATGCATCGAAAGAGTCCATCTTTCAAGTCACTCTACGTATGGCCCCGAACCCCATGTATTGATGTTTCCTTATCTGGACAGAACAAGCA")) +(assert (= z "ugguaaguucggaga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0441.smt2 new file mode 100644 index 000000000..65b0d597c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0441.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATGCGCTAAGCTGGACGGCACAGTCAATTGTAGTAATTGAGGGATATAGCGAAGTGTAAGGTTGGTGTTGCACCGATCGTGGTCGAGTGACCGTGCCACGGTATGCTAATGCAAAGACCAGTGGTAGGTCAGAGCTGTTCAAGCCGACATTAATCGACCGGTCAGTGTCATAGCCCGGCTCTATCTCAGTGGTTCCCGC")) +(assert (= z "gccuaaacuuaugcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0442.smt2 new file mode 100644 index 000000000..47e7f23d8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0442.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGAGGTGAACCAATAGGGCTTGCCTAAGTCTGTCCATCGCAGGCCGTAGAACGGCAAAGGGCACAAATGAACTCCTTAGACTCTCCGTCCCTATGGTTTACCGCGACATGCCAAGCTAGCCCCCGAAGTGAAGGGGTCCAAGTCTTGGCTCGACGGAACATGGCCGAGAGGAGACTTTTCCACTCGCGGATAACTGCTC")) +(assert (= z "cagguggcgaaccaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0443.smt2 new file mode 100644 index 000000000..b215fe9f2 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0443.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAATCGCCAGGGGCTCGTGGGACCACTTCTGTTTGGCAATCACAATAAATTACTTAGACCTTTAGATTCTCCGATGGCTGAAGCAGTGTCCGCAGATGGATTCCCACGGGCGCCGGGTAATAGATTTTTAACTTCACCACACGGTATCTTGAGGCGTACAAGACATCCACGACTCGTACGTCCCGGAATCCAATTGCGTG")) +(assert (= z "cguaauuaccaggca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0444.smt2 new file mode 100644 index 000000000..1ce1d2081 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0444.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGATATTACAGGAGGTTGTGACTTAGGAAGCCTCCGGTTAGGTCCGGGGTTGCTTTCTGCATAAATGTGAAAAGGTCCATAAGGTACAATAGTGATAGGAGTGGGTTTCCCGACCAAATAGTTTCTCACAGAGCCTCGGCTTTATTCAAACCCACACACTCTGACCGGTAACCCCGACATTTTAAAAACCCCGCAGTGC")) +(assert (= z "ucaguacagucaaca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0445.smt2 new file mode 100644 index 000000000..869ea572d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0445.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAATCCGTTTCATATTCTCTCAGTAAGCTAATTTTGGGCTCCTACCTGTCACGTCGTCTAGGTTGGCTATCGGCCTGCATCCTCTGCGTGAGAGTTAGCGGAGGCTATCTGGCTAGATAATCGAGGACTGACACCACGAGGGTCATCCCAGTTGCCAAGCTTACTCGCTGTGCGATGAATGTTTGTAGCAGAAAAAGAAT")) +(assert (= z "acgcauuuuaucacc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0446.smt2 new file mode 100644 index 000000000..b33d7debe --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0446.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACGGCAATGAGGTATGACATTATGCCCATTGTGACTGTGCTATCCGATAGATCTCGCTGGCAGGGTCAGCTAGACGATCTGTGAGAATTACAATTCTTTCGAAGATCGATCCAGTCATTCCATGGGGGCATTCACAGTATCCTCCATGAGCTTCCAGTAGGGCCATGTGCATGTCCTCTCTAACTTTATCGGAGACTAG")) +(assert (= z "cacacccgguuacgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0447.smt2 new file mode 100644 index 000000000..38ebbf52d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0447.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATCTAACGGCGGCCTACCCATCCCGAAACGACTTAGACAACCAGGGTCAAGTAATGTCGACGACGCATAGACTAAATGAGCGCCGTGTAGTCTTAGTCGATACTGGACTGGGTAACCGGACCCGCCAGCCATATCATCTGATTCTGTGAGGTACCTCCCTTGAATCTGCCCTCGTCTCTACAGTGCAATGTGATGAGGTA")) +(assert (= z "cgguacagaucguac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0448.smt2 new file mode 100644 index 000000000..e5a32bdf6 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0448.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGTCAGTTGATTGTGTAGCCTCGCCCTCTTTATCCCCATTCGAACGTGTACGGAAGGCCAGCCGACCCTCAGTGGCTTAAGTATTGTCTAGACGTGCAAGGCGGTTTTATCTTTCATGTATTCCTGTGACTCTCAGAAATCTTAACCGGGACAATTGATTGTGCACCATTACTTTGAAGGTTCCTAATTCGAAAGAGTTA")) +(assert (= z "cauaaauuccguaau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0449.smt2 new file mode 100644 index 000000000..578745e94 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0449.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTAAATGTATTCCGCGCGAACCAGAGCATTACCGTAACTTAAGTGTGGTTTAGTGGCACTACACGTCAGTCGGCAGGACTAGTTCCTATTTACCCTTTGGGCTAGGCACAGCGGTAATTTAATTAGTGGAGGACTCGTACGCATGACGCATGGCTGAGGCGTAACGTGCCTCAAACCGACTGATCAAAATACTTTCGCCG")) +(assert (= z "gcuuuuuacaauucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0450.smt2 new file mode 100644 index 000000000..4e35913cc --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0450.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GAAATGGGTCCGGCCATAGATTTAAGGCGTTCGCAAGCTGCCTCAGATCGGCTAGCATTTTCTCGAAATCCCGCGCCAGTAAGGATACCATTAGTAATGGCGGAACGAACAAGGTGCGTACCAGCGTTGACGCGAAGTAATACCCCTCCAATGCATACCAGTTTTACTTTACTGCTGGATTCACGGGCTCCTTGCCTTTC")) +(assert (= z "agcuuggccgccuuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0451.smt2 new file mode 100644 index 000000000..a0113583a --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0451.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGATACCAAACTACAGACATCTATTCCTAAGCAATCCTGGGTCAAACTCTTATCCTTGACCTTGACGGACTAGGATGCTCGGTAGACTCGGGGCCGTCCTCGTATCAACATACTTCGGTTGTCCGACATCGGGCATTAAGCAGCTCAGTGTATGGCCGATACGGGGCTATAAACAAGGCTCAATAAAAAATCACAATTAA")) +(assert (= z "ggacucugcaauguc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0452.smt2 new file mode 100644 index 000000000..87faff253 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0452.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGAGGGAGACGTGCCTAATGTAAGTATCCATGTAGAACCGATGCTACCTTGTCGTCTACGAATACGTTCCCCTGCCCTGGAACTAATCAGGGCAGCGTCACGTCCCATCAATATGTTCGACAGGCGACTAGGGGTCGACCCCTTTGTTCTATCTGGCTTGGGCCGTTAGTATGTCGGCGGGACGCTTAAGGTTGGAATG")) +(assert (= z "gguucugcauggcac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0453.smt2 new file mode 100644 index 000000000..ac7c5a7f8 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0453.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCGTAGCCATCTGAGCGAATAAGAAGTTCAATCGTACAGTTGGCGCCGTACCACATGTTTCGGAGCAGGTAACGACAGGGCACTCCTCTTGCCAGGGGAAATAAGCGATGAAGGAGGACGTAAGCTCCACCGTGTATCTAGAGGCACGTGGCCGTGCAGCGCGCCGTCGTGCCGGCCCATCCTAGTAAGGCGTATAGTA")) +(assert (= z "ugcgcgccgaaccgu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0454.smt2 new file mode 100644 index 000000000..34af7418b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0454.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTAAGCAATGGGGTCTCTAGACTCCGGAGGCCGTCTTCATCGCCCTTAATCGTACCTCCAACTTAGGTCTTTGCAGGGCGGGTCGGTAGTGACCACTATGTCCCCGGTCAATCATTGCGGTCAGCAAGTCCAAGGGGTTTGCCCGCCAGTAGTAGTAAAGGTATACAGTCGTGGACCGCATCGCTTTCTTGCTGCCCGCC")) +(assert (= z "uccgcaguuuuggug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0455.smt2 new file mode 100644 index 000000000..42d1b5854 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0455.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CCGTTAGCATTCGCGGTTAACACACACGGCTACCACCTTCCATCAATAGACTCGGGGACAATGGAGAGGCCCCACCATCGGAGGGTTAACTTAACTTCCTGAAGGGGTCCTATCGAGCACGCAAGAGCAATCAACCGTGTTCTGCCGCGACGGAGTGAATGGTCACTGAGGTGAAGGAACCGCATGATTGTTAGATTCAT")) +(assert (= z "cucgcugccccauga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0456.smt2 new file mode 100644 index 000000000..7b39f0234 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0456.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTGGGTATGAGTACGGGGCCAGTGTACCAATACGTTGTAAAGACACCAGCATACATGCGAGCTTGTTTGGGAGCTAGTGCGGAGGTAGAATGCCCTAACGCTATTTGCACTCTTGATCTACGGCAAACAGCAAATCGGTGCTGTATGAAAAAGTTTCTAAGGCACGTATCTTGGATTAAGAACCCACAAACTAATTCTG")) +(assert (= z "auagguagggcacga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0457.smt2 new file mode 100644 index 000000000..54eb2e693 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0457.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGTCCATAAATATGACATACTCAGGAGTCAGAGCCAACCGGGAAACCTGAGCCCTTAGCTAATTAGGTGGTTCACTGGGTGTATGCCGTGACGAGTCGTGACGCGTACAGGCGTTGCGAGTGACGAGGTCACAGCAAATCGGGTGTTGAGACTGCACGGTCTTTGGTTGATGGCCAGGCCTTCAGCCAAGATGAGGGAG")) +(assert (= z "agccucgugguucag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0458.smt2 new file mode 100644 index 000000000..6288e54db --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0458.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCACTTACCAGCGCTTTAAGTCCACGAAGTTCGTACAACCCTCAGGCTCCGCGACCAACTAGACGCCAAGTCAATCGAATGGTGGCCACCTTGTGATGGAAGCGTACCCCTTGCAGGAACGGTTTCAGCCCGATAGACCGGCCAGCCTCGTATGTTGACTCTCACATGGATTGATCTTCATATACGGCGACCCATTGTC")) +(assert (= z "cuaugguaguaagga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0459.smt2 new file mode 100644 index 000000000..141dd1b7d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0459.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGGCGTTGGTTGAGGCCCATCGACATGATCCTTCTCTACCCTGCACCATAACTCACCACGCAAGAATTTTATGCCTGCCCAGAGAGCCTCTGAACGTGCTTAGTAGGATCCTTCTCTCGTAGAATGTATATAATCTAAGTGAGAATCGGTGTATACCTACCAGTCTAATGGAGCAGGACTTCACAGAAGACCAAACTCA")) +(assert (= z "cggccacacuagcaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0460.smt2 new file mode 100644 index 000000000..9c6b81666 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0460.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCTCTGGTAACAGATATGATACCCAATCAAGTCGAAGGTCCGCACAGTGTCTCCTGGACGTCTAAGCAAGACCTAAGCACAGACCTTCCGACATACTGGAAATTCTAGGCGAGATGCCAAATCCACGGAATCGGCGAAGCATATAGAAGACACCCGCTAATAGCTATCAGAGATATTGCTATCCCCTTAGTAGCACGTA")) +(assert (= z "auaauuauaagagcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0461.smt2 new file mode 100644 index 000000000..f1f390c9e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0461.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGATACCATGGACTAATCACGGCTTCCTGATGCTATCCCTATAAACTGGTGATTCTGCGGTCCCCCAATGGTCTCCTTAATTGTACCCGGCGTTGCCTGTAGATATCCGTTACTGAGCACCGAGGGAGAGCAATGGTACTGGACCCGGTAGACGTAAAGATTTTGATTCGGTCTGTGCGATGTCGGGCGTTGATTACAGC")) +(assert (= z "auuauuugguuucga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0462.smt2 new file mode 100644 index 000000000..b85978a83 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0462.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGAATTTGAGCAAACTCCTCCTGCCCCAGCGTCATGCCTAATTCCCCTCTTTGGAGGCTTAAGGGGAGATCAAGCTTAATTTAGGTGCAACCTGGTATGCCATTTTACGGTCCCAGGAGAAGTCGTACTGTAGTTCGGGTTTATGGCACTATAAGTAATAACCCTACCGGGTCGAGGTGGCTGCAGCGCCTTACACATCG")) +(assert (= z "ccggugggggacucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0463.smt2 new file mode 100644 index 000000000..978191c67 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0463.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGACGAATGAGCTTCGATGAGATCATGACTGCCGCCTGGGACATTTACATCTCGCTCCACCTTAGAACGCGAGCGCATCTGTATTTGCAGGGAGGAGAACACAGCTTCGTTATTAGGAAGCTTCTTGGCTCGTTAAACGGGACTCGCGCACACAGTATCACAATATTACACTATTGTTATAGTTACCGGCCGGTGCTACG")) +(assert (= z "auauucggcccucaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0464.smt2 new file mode 100644 index 000000000..a9ebecc5b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0464.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACCAGTGACAGAGAAGAACGCTTACGCTGATAAGTAAGGTTCCACCATCTTGTAACCACAAATGACTGTCGTCATGACTACTATTTGCATGCTTGAGCGCTCAATAGACTCACAAGGACACACGGTTAATGATAAGGCGGCCGCCCGCGCCTGCATTAAGGCGTAAGACCCCCAGTCAGCTCCATGGTCTAACCGTAATG")) +(assert (= z "ccaugucgaaucucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0465.smt2 new file mode 100644 index 000000000..16574f2c7 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0465.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTACATTCCCTCAACCGCGGGAGGTATCCTCTTGTAGAAGAAGACAGCAAACCGGCACACCCAAGTTTTGGCCCGCGGTGCAGCTGATCGCATGGCTTACTTCTTAGGGCATCCTCTGTCTAATACCATAACTTGCTGGCGACGCCCGCCCAAATCATCTAAGGCACCTCACGTTCCGCGGCGCTATAGGTTATCGGGAC")) +(assert (= z "cuggacauauccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0466.smt2 new file mode 100644 index 000000000..78e20dc1e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0466.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTGTCTCTCTTACCGTCATCGTCGCCTGTTGCCCGGCCAGGCTCACCGGTAGCAGCGACAACGAATCAGAAGCACTTAAAGACTATATGATATAGGTGTCATAAACCCTATTCCACGGTTCGACAGGGCAGCTGCGGAGCGGTGTCTGACGTGTGATTTCGAGAAAAACATAACTACAGTGTGACCCCGGAATGATGAT")) +(assert (= z "cggguagcuugcugc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0467.smt2 new file mode 100644 index 000000000..fe1b0f9b1 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0467.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATGTCGTCCTTTAGTAATGCCCTATCTATCCGGCCCCTATCTTAATGGATTCGATTTGAAAGCATGAGCGCTCAGCTTCTTACCTTGCACAGGACTCGTCTGTATTGTAGCAACCCAGAATTTGCATCCCGACGGTAGAACAACTTCGAATATGTCCATGCTCTTTATTGTGGGGGCTGCGTATGTGCTTATTAGGAACG")) +(assert (= z "gagucaaauggugca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0468.smt2 new file mode 100644 index 000000000..ddcbd8543 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0468.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACGATACTTATCCGGGCAGTACTCTACCACGTTTCCCTTGCATAGGAATATATCGAAGTCCGTATGACCGACGTTCCGTATACAGAGCCGTAGATTCCACGATCCGTCCTTGAGTCTTCCCTGATTGGCCGTCTAGTTTTTGCCTGGTGAAGCCGCGGTGCTGACGCCGAGGGACCAAATTACTTCGAGCTCTGTGCTC")) +(assert (= z "gcaguaguuccggcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0469.smt2 new file mode 100644 index 000000000..484a70573 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0469.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGGTCTACACCTCCCCGATGTATAATAGCGCTGAAAATCTCCATATCGGTTCGCTTGGGAAGCAACATTCGCCGCCCAAAAACAATTAGACTCCAGCCGTAGGAGCTAGTCCCATTCTCATTTCCTGCACTACAATGTCTGCATTACGCATTGGAGCAACTACGGAGGCACTTGTAGTGTTGTCTTTGACTCCTCGCTGG")) +(assert (= z "gaguggcuucccgca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0470.smt2 new file mode 100644 index 000000000..529484747 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0470.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CACTCCCAACGTACGGTGGGAAGGTCAAGCTGCCACTACACTCACGGTGTAAGCGTATCTAGGGAGTTCAAAGGGCATTCCGAGCTCGAAAAGGCAATCGATTGTAGTGTTCGCAGATATACCATAGGACTCCACGGAAGAGATAATGTTGGTTTCGACGTATTCCCGAAAAGATGCGCTTTCACGTGATGCAGGCATTA")) +(assert (= z "ugccggagcggaagg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0471.smt2 new file mode 100644 index 000000000..d26232d0c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0471.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATATACGTAAGCCACAAGTGAAGCGGGCCCAAGCTCGCCTTCCGTAAGGTATCTGATGGCGTCTCTAAATCCCCTATACCGCCACTTTCTTGGGGTCCTTCCTACTTCCCCCCAAATTACACCATTTAGTAGGCTCTTACCAAGCTATGACCGTCTGCCGCGGGCTGCCTCATTTTCTCCATACTGAGGACGCACACTA")) +(assert (= z "gcucgcuugaauuac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0472.smt2 new file mode 100644 index 000000000..da1387b74 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0472.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AATCAACAACATCCATGTTGTAGGGGCAAAGGTTACGTGGATCTAACAACCAAAAACAATCTGCAAGCCTCTCCAGGCGTCTAAATTTAGATTCCGATTACGTGAACGGGTGGGCTTCAGACTTTGCTATCACTCATAGCACAGACGTTATATGGTTAAGATGCTACATATGAGCGGGTCGTTTGCTCCTGGGACCCCTT")) +(assert (= z "guaccuugacgauuu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0473.smt2 new file mode 100644 index 000000000..bf49f889b --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0473.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGAACCTGATCCTAATTTTTGCTGGGTCTATGAACACTGCCCGACCAACCCTTCAAAACGCCATCTAACCAGAGGTATCGGGTTATAAAAGAGTTCCGCTCGTTACGAGGCAATGTGGTCCGGACACCTCATGAGGACCGAACCGCATGCCTAACTCTAAAAGGAGGCGGAACCCGCAAAGTAGACTACCCCAAGTGC")) +(assert (= z "aagaaacuguaugag")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0474.smt2 new file mode 100644 index 000000000..6ed809b71 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0474.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCACTCGAAGTAGCATTCTCGTGATGAGGGATCTGTTACGAGGCTGTCATGATCTCCGAATCCTGTCCGCTAGGCACGTAAGCCATGACCAGGGACCAGCACTAAGGTTGACCCGCGGTATCTACTGATCCTAAACAGAATCTCTGGAATGCGCGGTCCCCATGCCCACCCCCATACGTACCGAGTGTACCTAGAGCAG")) +(assert (= z "aguccgauuguugcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0475.smt2 new file mode 100644 index 000000000..b223846e9 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0475.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TGTGACAGAGTTATGTGGTCTCTCGCAACGCCGCGACTGAGCCATGGTTCGTTTCTTACAGGTGCCCTGTGAATTGTGCGGAGATTCGTCTATCGCCACACTACATGGGTAAAGTATGCACCGTTTTTCACAAGTCATCCCTTTTCTTTTCCATAGCGTGAAAGAGGGAGCGACCCGACTATATATGCTTATCCGTACTC")) +(assert (= z "auccucacacaauaa")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0476.smt2 new file mode 100644 index 000000000..0f04bd342 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0476.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GGTCGATCGAAGCACCAAAAGGTTTCCCGCGCTAAATCCTTAAATACCGGTCTTAGCAAAGGCACGCCCCGCGCTGATATCTCTATCGCATAACCTCTTGCGCCAAGTGATACCACGGCACCATCGCAGGTTGAAGGATACTCATAAGGACAATTCTTCCATATGCCGGCATTCATACATCACGGGCCCCGTCAGATATA")) +(assert (= z "uugcaauauucagua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0477.smt2 new file mode 100644 index 000000000..38a5d2a6e --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0477.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TAAGCCATTACTCCCAAACATGGCGTCGAGGGTCACCAAGCCGTCGACCAGAGTACGATACCAGCCGTCACCACCGCGCCGCTGAGTGCTTATACGCTTCTAATGGCACCACCCTGCGCTTGGAGGCGGATTTCTTGTCGTTCATGACACCGAGAAGGGGGTTCAGGCTCTAAGTCAGAACGGAGGAAATCATAAAGCCA")) +(assert (= z "aaauccucugacccg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0478.smt2 new file mode 100644 index 000000000..a6faf0258 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0478.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GACGGACTAATCAAAGCCACCCAGCACTTTTGAACAGCGCCAAGGTAGGAGGGCCGCCAATGTTATTGTATAAGAATATGTAACGGGCTCTACGGGGTACCGCCTTAGGCCGATTATAGGACACATATCTGGGTTCGTTTCCTGCGGTGGATTATATTCACGCTCAACGGAGGTTTCGGATTTACACTTGGCTGCTAAAT")) +(assert (= z "ccguugugucaggac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0479.smt2 new file mode 100644 index 000000000..b455b231d --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0479.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACATTCCCCGCAGAGAACCATATTCCTGCACCCGCCGCCCAGTCAGTGAAAGCATAAACTCAGTTCTGTACCAACCCAAAAGGCCGAGGTGTGGCTTAATCATCACGATGTTCCGATTGATCCCGAAGGGCAACTTCTTTTTATGGCTGAAAATCGCTCTCTTTCATACACACCACAAACATACCACGGCTCCAAAGATA")) +(assert (= z "ccacccgaaguuuga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0480.smt2 new file mode 100644 index 000000000..e0f0d58ca --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0480.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTGCCTCCTTTACCTTGTTGACGCAGTTCTGGTAATAGACGATAAGCGTGAGCCACGGGGGCGTAGGCCGGCAATCACTAGAGTCTCACATAGATTTTTGTCCGACAACGTACAAGCTCGATGCCGCTATAGACACTGAGTAGCAAATGAATACGTGCTATACGGTTTGCTCATGTCATGAACTACGGGGCATACTATCT")) +(assert (= z "cucuaagcuaugucc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0481.smt2 new file mode 100644 index 000000000..d4993132c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0481.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCGGAGTTGACCCTACAGCCCTGATACAGTGTGGTACCAAGGTTTTTTGCAGATCTCAACATCCACACCACATCCGCATATGTTGACATCATGGTAGCCCAGACTGATATCGCTATACGCCCTGGACAAAAGGGACGATTCTGGCATTTCGTGAAATTCGCATAGCGGATTCTGGGGGGCAAGCATGCGATGTGGCAAC")) +(assert (= z "acgcuggacuuggac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0482.smt2 new file mode 100644 index 000000000..7cb3d5c98 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0482.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTAGTTCATGGGGTGAGGCTTAGAAGTAATGACCATGGCCTCTTAAATGTTCATGCGGCGCAGAGGGCATCACACCAGGATGAGCCGCTCGACTCTCCTGCGCGGTACCCACAGCCGACGGAGGAATAGAATGACACGCCCATGACGCCTCACCGGTCCACGTACGGAGTAGTAATGGCAACTTGGCTCGACCCTTCGT")) +(assert (= z "cgucugaauccgaac")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0483.smt2 new file mode 100644 index 000000000..32b3fbeb3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0483.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGGACAGCACCGAAAAGTTCCTACGAGAGACATGACCTCATTCTATGTCCGCGACGAACGCGTGTCATAGAGTAGTTGAAGCAGGTGCGGAAACTTCGCACGTGCCTTCCAAGCTGTGGAGGTTTCAGATATGACAATATGTTTTAGGCAGGGTATGAGAATTGGAACACCAACATCTCCGTCCCACTCCCGGGTCGGCG")) +(assert (= z "uuuuaugucaaagcg")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0484.smt2 new file mode 100644 index 000000000..0f13325fb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0484.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTCCCCCTAACTGTAGATTGTATTGAAACTATACTCGCTGATACAGCCTGGGTCTAGGAATCAAAATGACCTCATTCACGTTTGAGCGGATCTAAGGTATTCCACTGACCCCAACGTTGTCCCCGCTATTTAGTCCCGCCAAGACTGATGTTGGGTCGATACCTACTTCAGCGGGATTGGCCGACATTTCAGAACCAGCA")) +(assert (= z "auagcgcaugauguu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0485.smt2 new file mode 100644 index 000000000..201e4e3a3 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0485.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ACTGAGTCACCAACACTCCACTTGACTAAAACCCCCATCGCGACATCAACTAAACAGGGACTCACTCGATAGCGGCTGCAGCTACTTACTTATACACCTTACCTTAGATCATCTCGGTTGTGAGAAGTAATCTGTTTTGACCTATAGCACATGTACCATCTTGTGGCGCACGGTAGCGAGATAATTTTCTGATACCCGAG")) +(assert (= z "cguccucccaagggc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0486.smt2 new file mode 100644 index 000000000..ba06f1863 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0486.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCGCATTGCCGTTGATAGTATTCTCATCGTCACCAATCCAAAAAGGGTAGCTTCATCAGGCATAAAAATCGTAAGCTCTAGGTAAACGTCATTCAACCGTCGAAGAGCCCATCGAAATCAATTGGTACAAAACTTAAGCTTGGCAACATTAGGTGCACACAGTTCTTAAGCAACTGTGCTGCACGTGCCAGAGAGAACT")) +(assert (= z "cuuccacuugccucu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0487.smt2 new file mode 100644 index 000000000..c140e2671 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0487.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AGTATGCTTGTGCATATCGGTTCTAATTTTCCCCATCGAGGGGGTAGAGGGCGTAAATAGGGCTTCCAGCATGCACATGATAGAACCTTGGAACCTTCACAACTTTCCACATGGTTGCGGGGTCAAGGAGGCCTGCATGACGCGCTCCAACCTCCTGTTCCCAGAGCCTCTGCGGATATCCGGCTTTCTAGCGATTCCGA")) +(assert (= z "aucagaugggagcug")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0488.smt2 new file mode 100644 index 000000000..baf7a6c58 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0488.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TATTATCTTTTCTGATCCATAGGCAATTATATACCACATGCAAGCCCGTTCGGGAAGGCGGAGAACCGAAAGTCAATTCGACCGCAACTATAAGTTACGTAGTTGTATGGCGATGTAGGGGAGATAACCTCCCGTGCGAGGTTTCGCTATCTGACGCACTGAAAGGAGAAAGAAAGGATTGATGCCGACAACAGTTGACC")) +(assert (= z "gaugcgccaguacua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0489.smt2 new file mode 100644 index 000000000..fd3248eab --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0489.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "ATTATCATGTGACAGTGGATTCCAGTACGCAAGAATTTCGGGTCCTAGCGCAATAGCCCCATTGCCATGCACCGGTTGGAATTTATTTCGGCAAGCAGTATACGACTTGGGATCTGCAATGTCGTTTATCCTTACTGGCGTAGAGGTTCTTAGAAGAATCACTATGGACCTTATGCGTGGTTAATGGATCACGTTAGAGT")) +(assert (= z "ccaccccgaacucca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0490.smt2 new file mode 100644 index 000000000..06da552bb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0490.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTTTTGCACAGTGCCTGGCGCGTGATTCAGTACTAGCCAGACGGGAATCCGAGGGACCGTGTCGACAAGAGGTCACTTTTTATGTCCTTGTGGGCCGGGGCCGTACGGGCTTGTGGTAGAACTCGAGGAGTTGCTTTGTGGAAATCTAGCTGCTTCACCACATTCTAGATGCGGTGGGACTTGACGGTATGATAGAGTTG")) +(assert (= z "uauguucccaucgua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0491.smt2 new file mode 100644 index 000000000..9fbe6bae4 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0491.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAGTCTCATACTAGAGGAAGAGATATGTTCGATTTTCCCGTTCTCCATATCCCCGGACGCTGAGCTTGAGGGGATGTAAACGACAACATTCCGCATCAATATGGATCCCGACTCGCAAAGACAAGGTGCCAACCGGCCACTGCCTTACACGTTCCTTTAAGCCACAGTTCATACGAGCCAATAACTCTTGTGGATAGGG")) +(assert (= z "aaucagacuugggca")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0492.smt2 new file mode 100644 index 000000000..b1f832725 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0492.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCAAGCGCCGTGTTACGGAATTACTTTCTGTGCCAGATGTACAGGAAAACCGAGTACGCTTGGCCTTAATTCGCGTATGTATCCTTCGTGCTACAAACCCGATCCTCAAGGACAGTACGGCGGAGCTCGCGGCAGATTCTCATCAATGTTCTTAATGTTACATTCCAACATGGAGGAGCCACGGACTTATTACATACTG")) +(assert (= z "uaaauccuaccucau")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0493.smt2 new file mode 100644 index 000000000..c7e0e7f05 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0493.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGAAGCACTTGTCCGGCTAGCATGGGATCTATATCGCAATCACCTGTTCATTTGTTAAGGTCGCGCTTAGGGTACACGTAACATGCGGGGCTCGTATGAGGGGGCACGAGGGTGACATAATGCGAGTTGCAGCACTAAGATATGACGTAACGTTTTTAAGGTTGATGTATACATGCTTGCGGCCCCAATGACCGATCCTA")) +(assert (= z "gaaccgauuuuugcc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0494.smt2 new file mode 100644 index 000000000..1a26406e5 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0494.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GCCAACAGTGTAGGGGTCGTAGGGACATGACATGTCCCGATAATTCACATCCACAAGGTCAAGTTCCCGCGAGACGTATGATGTAGCCGTCGCCACTATGGCCCTAAGCCGAAACATGATGACAAGGACCACGAGCCAGGATGCGTGGCCCAGAAGGTAGAACGATAATGGCGTACGCTACAAACTCTTGGGATCCGCGA")) +(assert (= z "ugucaucacuccgcu")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0495.smt2 new file mode 100644 index 000000000..830bfbd91 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0495.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "AAGTCATCCCGTGCGAGATAACGTATTAACCCCCCTCAGAAAAGACGCTGCATCTGATTTCCGGGCTCTTTTTATGTCCGACAAAAGGGGAATATGGTCAGCCCAGATATCCGATGCAGGGATTCAATTCCTGCAAGAAGTTCTCCGTAGCCCCTTGCATTGATCGCGTAACACAAGTAACTTAGTGGGGTTGAGACGGC")) +(assert (= z "gauuauucauguagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0496.smt2 new file mode 100644 index 000000000..f177432cb --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0496.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CTCTGACAAGTCTGCATTAGTCTAAGGAGTGATAACATAACCAAGACGCGGAGGACACTAGTGTGATCAATTATCAAGCGCGTTGGGCCGTGGGTAGGGGAGATGGAGATCCTGAGTCGGACTTGTATCTGCGGTGCGGCCCCCCCGTGTGCCGGATCATTATGTAGCGAGTGTACCGGGTGCGGAGGAGCTGACTTCCT")) +(assert (= z "gccagagccgaucuc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0497.smt2 new file mode 100644 index 000000000..e053ca375 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0497.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "CGGCTCTCACGGACATCTGACCTCGGGAACCGATTTGTTCGACCATGTGGTTAGAAGTTGAGTAGCAGGCCGTTAGAGCTGTATTATGGCAAATCAAGGTTTTATAGTGGTCAAATCACCATATGAACACTGGTGCAAGGTATGAGCATTGATAGATAGGCCGACAGGGATGCCCGGTCCGGCCTATAATTCATACAAGG")) +(assert (= z "uuaccaccguccagc")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0498.smt2 new file mode 100644 index 000000000..de3de7c20 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0498.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TCCCCATACCCCGTCGGAGATGCGTTATGAGTTCTGTTCTAAACCAGCGGCGAAGCGCCCTTTTCGGTGATACACTTGCGCCATCGAATTGCCTCGCCCTGTCATAATATGTAATAGCCAGGCCCTTATCCTACGTATCGGTTTCCCATACGATTCCCAAGCAGGAGGGCTCCACAGCAAGTCACTGATTCGACCCAAAC")) +(assert (= z "cagcuuuugucguua")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0499.smt2 new file mode 100644 index 000000000..41fbf8f7c --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0499.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "GTAACCAGCATATACCTTGTCAAGATGAGCCTAGTGCGACATCACTGGGCAGGACGATCGCTCTTGAGTCTCCGGGCTTGATGTAGCCGAGAATGATAGTCCTAAGGAATAAATTGTGTTATGTCTCTAGAGATTGTCGACGGTAGCCAGCTAAGTCAGCGTGATCCAAGAAGGAGCCTGTACAAACCTGCTTATTCGCT")) +(assert (= z "caaugaggaugugga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit) diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0500.smt2 new file mode 100644 index 000000000..da985e974 --- /dev/null +++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0500.smt2 @@ -0,0 +1,39 @@ +(set-info :smt-lib-version 2.6) +(set-logic QF_S) +(set-info :source | +Generated by: Oliver Markgraf +Generated on: 2025-04-03 +Application: Evaluation of Regular Constraint Propagation Techniques +Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha +Time limit: 60.0 +This example models a reverse transcription process inspired by bioinformatics. +Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. +In addition, the RNA string is required to contain a specific pattern. +|) +(set-info :license "https://creativecommons.org/licenses/by/4.0/") +(set-info :category "industrial") +(set-info :status unsat) + +(declare-const y String) +(declare-const y1 String) +(declare-const y2 String) +(declare-const y3 String) +(declare-const x String) +(declare-const z String) + +; Reverse translation: RNA to DNA +(assert (= y1 (str.replace_all y "u" "A"))) +(assert (= y2 (str.replace_all y1 "a" "T"))) +(assert (= y3 (str.replace_all y2 "g" "C"))) +(assert (= x (str.replace_all y3 "c" "G"))) + +; Concrete DNA and RNA strings +(assert (= x "TTCGTGGCTCCAATCGATACACGACGCACTTATGATCAAACATTTACATATGAAGTGAGTGGATGGAAAGTCGGCAGAGGCCCAGTTGCGCTACACCATCGGCGTTGAAGACCGACGTAGAAGGTAGCGGCGCGGTGAAGCAACTATAGACTGTCAGTTATAGGAAAAGCGGTGGCGAAGAAACGCCATACCGTTATGCC")) +(assert (= z "gagugcuuaagugga")) + +; Pattern must be contained in y +(assert (str.contains y z)) + +(check-sat) +(get-value (y)) +(exit)